./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/array-memsafety/lis-alloca-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/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_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-memsafety/lis-alloca-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/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 32bit --witnessprinter.graph.data.programhash 319f31ab0b5c801309acd19f3e336c9a25177d3201cf5ea4438ad6227d5f71cf --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-28 23:56:12,964 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-28 23:56:13,040 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Termination-32bit-Automizer_Default.epf [2023-11-28 23:56:13,045 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-28 23:56:13,045 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-28 23:56:13,073 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-28 23:56:13,073 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-28 23:56:13,074 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-28 23:56:13,075 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-28 23:56:13,076 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-28 23:56:13,077 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-28 23:56:13,077 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-28 23:56:13,078 INFO L153 SettingsManager]: * Use SBE=true [2023-11-28 23:56:13,079 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-11-28 23:56:13,080 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-11-28 23:56:13,080 INFO L153 SettingsManager]: * Use old map elimination=false [2023-11-28 23:56:13,081 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2023-11-28 23:56:13,082 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2023-11-28 23:56:13,082 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-11-28 23:56:13,083 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-28 23:56:13,084 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-11-28 23:56:13,085 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-28 23:56:13,085 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-28 23:56:13,086 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-28 23:56:13,087 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-28 23:56:13,087 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-11-28 23:56:13,088 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-11-28 23:56:13,088 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-11-28 23:56:13,089 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-28 23:56:13,089 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-28 23:56:13,090 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-28 23:56:13,090 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-11-28 23:56:13,091 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-28 23:56:13,091 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-28 23:56:13,092 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-28 23:56:13,092 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-28 23:56:13,092 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-28 23:56:13,093 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-11-28 23:56:13,093 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_2467ede4-cde7-4eba-a7b0-fa61188312ae/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_2467ede4-cde7-4eba-a7b0-fa61188312ae/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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 319f31ab0b5c801309acd19f3e336c9a25177d3201cf5ea4438ad6227d5f71cf [2023-11-28 23:56:13,332 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-28 23:56:13,358 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-28 23:56:13,361 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-28 23:56:13,363 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-28 23:56:13,363 INFO L274 PluginConnector]: CDTParser initialized [2023-11-28 23:56:13,365 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/array-memsafety/lis-alloca-1.i [2023-11-28 23:56:16,484 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-28 23:56:16,722 INFO L384 CDTParser]: Found 1 translation units. [2023-11-28 23:56:16,723 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/sv-benchmarks/c/array-memsafety/lis-alloca-1.i [2023-11-28 23:56:16,739 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/data/4bd175fdb/2cbd23cfbde042e6b4b825008b8f1902/FLAGeb427864e [2023-11-28 23:56:16,754 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/data/4bd175fdb/2cbd23cfbde042e6b4b825008b8f1902 [2023-11-28 23:56:16,757 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-28 23:56:16,759 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-28 23:56:16,760 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-28 23:56:16,760 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-28 23:56:16,765 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-28 23:56:16,766 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:56:16" (1/1) ... [2023-11-28 23:56:16,767 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5004a5b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:56:16, skipping insertion in model container [2023-11-28 23:56:16,768 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:56:16" (1/1) ... [2023-11-28 23:56:16,820 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-28 23:56:17,099 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-28 23:56:17,113 INFO L202 MainTranslator]: Completed pre-run [2023-11-28 23:56:17,157 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-28 23:56:17,190 INFO L206 MainTranslator]: Completed translation [2023-11-28 23:56:17,190 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:56:17 WrapperNode [2023-11-28 23:56:17,191 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-28 23:56:17,192 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-28 23:56:17,192 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-28 23:56:17,192 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-28 23:56:17,202 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:56:17" (1/1) ... [2023-11-28 23:56:17,217 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:56:17" (1/1) ... [2023-11-28 23:56:17,244 INFO L138 Inliner]: procedures = 116, calls = 24, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 115 [2023-11-28 23:56:17,244 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-28 23:56:17,245 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-28 23:56:17,245 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-28 23:56:17,245 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-28 23:56:17,258 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:56:17" (1/1) ... [2023-11-28 23:56:17,258 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:56:17" (1/1) ... [2023-11-28 23:56:17,262 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:56:17" (1/1) ... [2023-11-28 23:56:17,278 INFO L175 MemorySlicer]: Split 12 memory accesses to 3 slices as follows [2, 7, 3]. 58 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0, 0]. The 5 writes are split as follows [2, 2, 1]. [2023-11-28 23:56:17,278 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:56:17" (1/1) ... [2023-11-28 23:56:17,278 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:56:17" (1/1) ... [2023-11-28 23:56:17,286 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:56:17" (1/1) ... [2023-11-28 23:56:17,290 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:56:17" (1/1) ... [2023-11-28 23:56:17,292 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:56:17" (1/1) ... [2023-11-28 23:56:17,293 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:56:17" (1/1) ... [2023-11-28 23:56:17,297 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-28 23:56:17,298 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-28 23:56:17,298 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-28 23:56:17,298 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-28 23:56:17,299 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:56:17" (1/1) ... [2023-11-28 23:56:17,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-28 23:56:17,315 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 23:56:17,327 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-28 23:56:17,337 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2023-11-28 23:56:17,365 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-28 23:56:17,366 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-28 23:56:17,366 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-11-28 23:56:17,366 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-28 23:56:17,366 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-28 23:56:17,366 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-28 23:56:17,366 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-28 23:56:17,367 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-28 23:56:17,367 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-28 23:56:17,367 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-28 23:56:17,474 INFO L241 CfgBuilder]: Building ICFG [2023-11-28 23:56:17,476 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-28 23:56:17,667 INFO L282 CfgBuilder]: Performing block encoding [2023-11-28 23:56:17,677 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-28 23:56:17,678 INFO L309 CfgBuilder]: Removed 5 assume(true) statements. [2023-11-28 23:56:17,680 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:56:17 BoogieIcfgContainer [2023-11-28 23:56:17,680 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-28 23:56:17,681 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-11-28 23:56:17,681 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-11-28 23:56:17,686 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-11-28 23:56:17,687 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-28 23:56:17,687 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 11:56:16" (1/3) ... [2023-11-28 23:56:17,688 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1a7ae4aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:56:17, skipping insertion in model container [2023-11-28 23:56:17,689 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-28 23:56:17,689 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:56:17" (2/3) ... [2023-11-28 23:56:17,689 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1a7ae4aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:56:17, skipping insertion in model container [2023-11-28 23:56:17,689 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-28 23:56:17,690 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:56:17" (3/3) ... [2023-11-28 23:56:17,691 INFO L332 chiAutomizerObserver]: Analyzing ICFG lis-alloca-1.i [2023-11-28 23:56:17,742 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2023-11-28 23:56:17,742 INFO L304 stractBuchiCegarLoop]: Hoare is false [2023-11-28 23:56:17,743 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-11-28 23:56:17,743 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-11-28 23:56:17,743 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-11-28 23:56:17,743 INFO L308 stractBuchiCegarLoop]: Difference is false [2023-11-28 23:56:17,743 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-11-28 23:56:17,744 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2023-11-28 23:56:17,747 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 25 states, 24 states have (on average 1.5833333333333333) internal successors, (38), 24 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-28 23:56:17,763 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 13 [2023-11-28 23:56:17,763 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-28 23:56:17,763 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-28 23:56:17,769 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2023-11-28 23:56:17,769 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-28 23:56:17,769 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-11-28 23:56:17,769 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 25 states, 24 states have (on average 1.5833333333333333) internal successors, (38), 24 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-28 23:56:17,772 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 13 [2023-11-28 23:56:17,772 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-28 23:56:17,773 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-28 23:56:17,773 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2023-11-28 23:56:17,773 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-28 23:56:17,782 INFO L748 eck$LassoCheckResult]: Stem: 23#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 9#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet19#1, main_#t~post18#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet16#1;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 11#L530true assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 6#L530-2true call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0; 3#L535-3true [2023-11-28 23:56:17,782 INFO L750 eck$LassoCheckResult]: Loop: 3#L535-3true assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet19#1;call write~int#2(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 15#L535-2true main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 3#L535-3true [2023-11-28 23:56:17,788 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:56:17,789 INFO L85 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2023-11-28 23:56:17,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:56:17,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118996591] [2023-11-28 23:56:17,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:56:17,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:56:17,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-28 23:56:17,927 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-28 23:56:17,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-28 23:56:17,958 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-28 23:56:17,971 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:56:17,971 INFO L85 PathProgramCache]: Analyzing trace with hash 1507, now seen corresponding path program 1 times [2023-11-28 23:56:17,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:56:17,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783952740] [2023-11-28 23:56:17,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:56:17,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:56:17,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-28 23:56:17,984 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-28 23:56:17,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-28 23:56:17,993 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-28 23:56:17,995 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:56:17,995 INFO L85 PathProgramCache]: Analyzing trace with hash 889568455, now seen corresponding path program 1 times [2023-11-28 23:56:17,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:56:17,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828400847] [2023-11-28 23:56:17,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:56:17,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:56:18,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-28 23:56:18,022 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-28 23:56:18,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-28 23:56:18,041 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-28 23:56:18,349 INFO L210 LassoAnalysis]: Preferences: [2023-11-28 23:56:18,350 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-28 23:56:18,350 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-28 23:56:18,350 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-28 23:56:18,350 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-11-28 23:56:18,350 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-28 23:56:18,351 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-28 23:56:18,351 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-28 23:56:18,351 INFO L133 ssoRankerPreferences]: Filename of dumped script: lis-alloca-1.i_Iteration1_Lasso [2023-11-28 23:56:18,351 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-28 23:56:18,351 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-28 23:56:18,369 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-28 23:56:18,378 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-28 23:56:18,384 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-28 23:56:18,387 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-28 23:56:18,391 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-28 23:56:18,573 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-28 23:56:18,577 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-28 23:56:18,580 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-28 23:56:18,584 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-28 23:56:18,589 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-28 23:56:18,945 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-28 23:56:18,948 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-11-28 23:56:18,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-28 23:56:18,950 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 23:56:18,951 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-28 23:56:18,956 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2023-11-28 23:56:18,957 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-28 23:56:18,968 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-28 23:56:18,968 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-28 23:56:18,968 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-28 23:56:18,968 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-28 23:56:18,969 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-28 23:56:18,970 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-28 23:56:18,971 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-28 23:56:18,977 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-28 23:56:18,981 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2023-11-28 23:56:18,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-28 23:56:18,982 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 23:56:18,983 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-28 23:56:18,985 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2023-11-28 23:56:18,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-28 23:56:18,996 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-28 23:56:18,997 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-28 23:56:18,997 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-28 23:56:18,997 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-28 23:56:19,000 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-28 23:56:19,001 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-28 23:56:19,005 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-28 23:56:19,009 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2023-11-28 23:56:19,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-28 23:56:19,011 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 23:56:19,012 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-28 23:56:19,016 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2023-11-28 23:56:19,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-28 23:56:19,030 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-28 23:56:19,031 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-28 23:56:19,031 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-28 23:56:19,031 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-28 23:56:19,031 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-28 23:56:19,032 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-28 23:56:19,032 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-28 23:56:19,034 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-28 23:56:19,037 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2023-11-28 23:56:19,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-28 23:56:19,038 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 23:56:19,040 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-28 23:56:19,042 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2023-11-28 23:56:19,043 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-28 23:56:19,056 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-28 23:56:19,056 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-28 23:56:19,057 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-28 23:56:19,057 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-28 23:56:19,061 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-28 23:56:19,061 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-28 23:56:19,066 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-28 23:56:19,075 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2023-11-28 23:56:19,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-28 23:56:19,078 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 23:56:19,080 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-28 23:56:19,082 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2023-11-28 23:56:19,083 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-28 23:56:19,096 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-28 23:56:19,096 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-28 23:56:19,097 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-28 23:56:19,097 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-28 23:56:19,103 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-28 23:56:19,103 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-28 23:56:19,112 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-28 23:56:19,116 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2023-11-28 23:56:19,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-28 23:56:19,117 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 23:56:19,118 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-28 23:56:19,120 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2023-11-28 23:56:19,126 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-28 23:56:19,139 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-28 23:56:19,139 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-28 23:56:19,139 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-28 23:56:19,140 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-28 23:56:19,143 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-28 23:56:19,144 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-28 23:56:19,149 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-28 23:56:19,153 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2023-11-28 23:56:19,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-28 23:56:19,154 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 23:56:19,155 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-28 23:56:19,157 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2023-11-28 23:56:19,158 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-28 23:56:19,171 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-28 23:56:19,171 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-28 23:56:19,171 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-28 23:56:19,172 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-28 23:56:19,189 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-28 23:56:19,189 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-28 23:56:19,208 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-11-28 23:56:19,256 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2023-11-28 23:56:19,256 INFO L444 ModelExtractionUtils]: 1 out of 19 variables were initially zero. Simplification set additionally 15 variables to zero. [2023-11-28 23:56:19,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-28 23:56:19,258 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 23:56:19,292 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-28 23:56:19,294 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2023-11-28 23:56:19,300 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-11-28 23:56:19,314 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-11-28 23:56:19,315 INFO L513 LassoAnalysis]: Proved termination. [2023-11-28 23:56:19,315 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-28 23:56:19,319 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2023-11-28 23:56:19,331 INFO L156 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2023-11-28 23:56:19,355 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:56:19,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:56:19,370 INFO L262 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-28 23:56:19,372 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:56:19,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:56:19,390 INFO L262 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-28 23:56:19,391 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:56:19,406 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-28 23:56:19,435 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-28 23:56:19,438 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 25 states, 24 states have (on average 1.5833333333333333) internal successors, (38), 24 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) 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-28 23:56:19,475 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2023-11-28 23:56:19,498 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 25 states, 24 states have (on average 1.5833333333333333) internal successors, (38), 24 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). 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 47 states and 74 transitions. Complement of second has 8 states. [2023-11-28 23:56:19,500 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-28 23:56:19,503 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-28 23:56:19,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 38 transitions. [2023-11-28 23:56:19,505 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 38 transitions. Stem has 4 letters. Loop has 2 letters. [2023-11-28 23:56:19,506 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-28 23:56:19,506 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 38 transitions. Stem has 6 letters. Loop has 2 letters. [2023-11-28 23:56:19,506 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-28 23:56:19,506 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 38 transitions. Stem has 4 letters. Loop has 4 letters. [2023-11-28 23:56:19,506 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-28 23:56:19,507 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 74 transitions. [2023-11-28 23:56:19,510 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2023-11-28 23:56:19,513 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 21 states and 33 transitions. [2023-11-28 23:56:19,514 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2023-11-28 23:56:19,514 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2023-11-28 23:56:19,515 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 33 transitions. [2023-11-28 23:56:19,515 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:56:19,515 INFO L218 hiAutomatonCegarLoop]: Abstraction has 21 states and 33 transitions. [2023-11-28 23:56:19,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 33 transitions. [2023-11-28 23:56:19,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2023-11-28 23:56:19,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 20 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:56:19,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 33 transitions. [2023-11-28 23:56:19,540 INFO L240 hiAutomatonCegarLoop]: Abstraction has 21 states and 33 transitions. [2023-11-28 23:56:19,540 INFO L428 stractBuchiCegarLoop]: Abstraction has 21 states and 33 transitions. [2023-11-28 23:56:19,540 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-11-28 23:56:19,540 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 33 transitions. [2023-11-28 23:56:19,541 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2023-11-28 23:56:19,542 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-28 23:56:19,542 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-28 23:56:19,542 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2023-11-28 23:56:19,542 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-28 23:56:19,543 INFO L748 eck$LassoCheckResult]: Stem: 148#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 140#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet19#1, main_#t~post18#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet16#1;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 141#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 136#L530-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0; 129#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 131#L535-4 havoc main_~i~1#1;assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0; 143#L517-3 [2023-11-28 23:56:19,543 INFO L750 eck$LassoCheckResult]: Loop: 143#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#1(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#0(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 142#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 143#L517-3 [2023-11-28 23:56:19,543 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:56:19,544 INFO L85 PathProgramCache]: Analyzing trace with hash 889568397, now seen corresponding path program 1 times [2023-11-28 23:56:19,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:56:19,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708020767] [2023-11-28 23:56:19,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:56:19,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:56:19,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:56:19,653 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-28 23:56:19,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:56:19,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708020767] [2023-11-28 23:56:19,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708020767] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:56:19,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:56:19,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-28 23:56:19,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505173622] [2023-11-28 23:56:19,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:56:19,658 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-28 23:56:19,658 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:56:19,658 INFO L85 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 1 times [2023-11-28 23:56:19,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:56:19,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574899494] [2023-11-28 23:56:19,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:56:19,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:56:19,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-28 23:56:19,668 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-28 23:56:19,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-28 23:56:19,676 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-28 23:56:19,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:56:19,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-28 23:56:19,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-28 23:56:19,786 INFO L87 Difference]: Start difference. First operand 21 states and 33 transitions. cyclomatic complexity: 16 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-28 23:56:19,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 23:56:19,816 INFO L93 Difference]: Finished difference Result 22 states and 30 transitions. [2023-11-28 23:56:19,817 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 30 transitions. [2023-11-28 23:56:19,818 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2023-11-28 23:56:19,819 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 22 states and 30 transitions. [2023-11-28 23:56:19,819 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2023-11-28 23:56:19,819 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2023-11-28 23:56:19,820 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 30 transitions. [2023-11-28 23:56:19,820 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:56:19,820 INFO L218 hiAutomatonCegarLoop]: Abstraction has 22 states and 30 transitions. [2023-11-28 23:56:19,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 30 transitions. [2023-11-28 23:56:19,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2023-11-28 23:56:19,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.380952380952381) internal successors, (29), 20 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:56:19,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 29 transitions. [2023-11-28 23:56:19,823 INFO L240 hiAutomatonCegarLoop]: Abstraction has 21 states and 29 transitions. [2023-11-28 23:56:19,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-28 23:56:19,825 INFO L428 stractBuchiCegarLoop]: Abstraction has 21 states and 29 transitions. [2023-11-28 23:56:19,825 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-11-28 23:56:19,826 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 29 transitions. [2023-11-28 23:56:19,826 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2023-11-28 23:56:19,827 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-28 23:56:19,827 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-28 23:56:19,827 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:56:19,827 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-28 23:56:19,828 INFO L748 eck$LassoCheckResult]: Stem: 198#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 190#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet19#1, main_#t~post18#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet16#1;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 191#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 186#L530-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0; 179#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet19#1;call write~int#2(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 180#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 181#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 182#L535-4 havoc main_~i~1#1;assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0; 193#L517-3 [2023-11-28 23:56:19,828 INFO L750 eck$LassoCheckResult]: Loop: 193#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#1(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#0(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 192#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 193#L517-3 [2023-11-28 23:56:19,828 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:56:19,829 INFO L85 PathProgramCache]: Analyzing trace with hash 176793839, now seen corresponding path program 1 times [2023-11-28 23:56:19,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:56:19,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935920535] [2023-11-28 23:56:19,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:56:19,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:56:19,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-28 23:56:19,854 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-28 23:56:19,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-28 23:56:19,878 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-28 23:56:19,879 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:56:19,879 INFO L85 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 2 times [2023-11-28 23:56:19,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:56:19,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727971667] [2023-11-28 23:56:19,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:56:19,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:56:19,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-28 23:56:19,888 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-28 23:56:19,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-28 23:56:19,896 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-28 23:56:19,897 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:56:19,897 INFO L85 PathProgramCache]: Analyzing trace with hash -1899811567, now seen corresponding path program 1 times [2023-11-28 23:56:19,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:56:19,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158452427] [2023-11-28 23:56:19,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:56:19,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:56:19,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-28 23:56:19,931 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-28 23:56:19,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-28 23:56:19,955 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-28 23:56:20,637 INFO L210 LassoAnalysis]: Preferences: [2023-11-28 23:56:20,638 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-28 23:56:20,638 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-28 23:56:20,638 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-28 23:56:20,638 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-11-28 23:56:20,638 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-28 23:56:20,638 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-28 23:56:20,638 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-28 23:56:20,638 INFO L133 ssoRankerPreferences]: Filename of dumped script: lis-alloca-1.i_Iteration3_Lasso [2023-11-28 23:56:20,638 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-28 23:56:20,638 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-28 23:56:20,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-28 23:56:20,646 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-28 23:56:20,648 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-28 23:56:20,650 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-28 23:56:20,654 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-28 23:56:20,656 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-28 23:56:20,658 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-28 23:56:20,662 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-28 23:56:20,665 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-28 23:56:20,667 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-28 23:56:20,669 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-28 23:56:20,671 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-28 23:56:20,673 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-28 23:56:20,675 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-28 23:56:20,678 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-28 23:56:20,681 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-28 23:56:21,020 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-28 23:56:21,023 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-28 23:56:21,025 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-28 23:56:21,027 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-28 23:56:21,030 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-28 23:56:21,035 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-28 23:56:21,039 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-28 23:56:21,042 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-28 23:56:21,045 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-28 23:56:21,048 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-28 23:56:21,051 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-28 23:56:21,053 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-28 23:56:21,056 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-28 23:56:21,059 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-28 23:56:21,061 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-28 23:56:21,069 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-28 23:56:21,073 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-28 23:56:21,420 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-28 23:56:21,420 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-11-28 23:56:21,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-28 23:56:21,420 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 23:56:21,421 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-28 23:56:21,425 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2023-11-28 23:56:21,425 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-28 23:56:21,438 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-28 23:56:21,438 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-28 23:56:21,438 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-28 23:56:21,438 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-28 23:56:21,438 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-28 23:56:21,439 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-28 23:56:21,439 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-28 23:56:21,441 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-28 23:56:21,444 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2023-11-28 23:56:21,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-28 23:56:21,444 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 23:56:21,445 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-28 23:56:21,449 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2023-11-28 23:56:21,451 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-28 23:56:21,463 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-28 23:56:21,463 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-28 23:56:21,464 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-28 23:56:21,464 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-28 23:56:21,464 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-28 23:56:21,464 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-28 23:56:21,465 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-28 23:56:21,470 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-28 23:56:21,474 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2023-11-28 23:56:21,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-28 23:56:21,474 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 23:56:21,475 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-28 23:56:21,476 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2023-11-28 23:56:21,478 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-28 23:56:21,488 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-28 23:56:21,488 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-28 23:56:21,488 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-28 23:56:21,488 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-28 23:56:21,488 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-28 23:56:21,489 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-28 23:56:21,489 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-28 23:56:21,490 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-28 23:56:21,493 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2023-11-28 23:56:21,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-28 23:56:21,493 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 23:56:21,494 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-28 23:56:21,496 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2023-11-28 23:56:21,497 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-28 23:56:21,506 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-28 23:56:21,506 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-28 23:56:21,507 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-28 23:56:21,507 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-28 23:56:21,508 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-28 23:56:21,509 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-28 23:56:21,513 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-28 23:56:21,516 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2023-11-28 23:56:21,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-28 23:56:21,517 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 23:56:21,518 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-28 23:56:21,519 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2023-11-28 23:56:21,520 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-28 23:56:21,532 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-28 23:56:21,533 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-28 23:56:21,533 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-28 23:56:21,533 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-28 23:56:21,533 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-28 23:56:21,534 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-28 23:56:21,534 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-28 23:56:21,535 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-28 23:56:21,538 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2023-11-28 23:56:21,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-28 23:56:21,539 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 23:56:21,540 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-28 23:56:21,543 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2023-11-28 23:56:21,543 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-28 23:56:21,555 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-28 23:56:21,556 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-28 23:56:21,556 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-28 23:56:21,556 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-28 23:56:21,556 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-28 23:56:21,556 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-28 23:56:21,556 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-28 23:56:21,558 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-28 23:56:21,561 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2023-11-28 23:56:21,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-28 23:56:21,562 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 23:56:21,563 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-28 23:56:21,567 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2023-11-28 23:56:21,567 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-28 23:56:21,580 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-28 23:56:21,580 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-28 23:56:21,580 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-28 23:56:21,580 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-28 23:56:21,582 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-28 23:56:21,582 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-28 23:56:21,586 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-28 23:56:21,589 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2023-11-28 23:56:21,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-28 23:56:21,590 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 23:56:21,591 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-28 23:56:21,593 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2023-11-28 23:56:21,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-28 23:56:21,607 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-28 23:56:21,607 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-28 23:56:21,607 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-28 23:56:21,607 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-28 23:56:21,610 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-28 23:56:21,610 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-28 23:56:21,614 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-28 23:56:21,618 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2023-11-28 23:56:21,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-28 23:56:21,618 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 23:56:21,619 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-28 23:56:21,621 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2023-11-28 23:56:21,622 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-28 23:56:21,634 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-28 23:56:21,635 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-28 23:56:21,635 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-28 23:56:21,635 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-28 23:56:21,637 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-28 23:56:21,637 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-28 23:56:21,641 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-28 23:56:21,644 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2023-11-28 23:56:21,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-28 23:56:21,644 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 23:56:21,645 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-28 23:56:21,648 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2023-11-28 23:56:21,655 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-28 23:56:21,666 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-28 23:56:21,666 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-28 23:56:21,666 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-28 23:56:21,666 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-28 23:56:21,667 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-28 23:56:21,667 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-28 23:56:21,667 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-28 23:56:21,668 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-28 23:56:21,671 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2023-11-28 23:56:21,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-28 23:56:21,672 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 23:56:21,673 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-28 23:56:21,675 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2023-11-28 23:56:21,676 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-28 23:56:21,687 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-28 23:56:21,687 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-28 23:56:21,687 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-28 23:56:21,687 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-28 23:56:21,687 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-28 23:56:21,688 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-28 23:56:21,688 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-28 23:56:21,694 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-28 23:56:21,697 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2023-11-28 23:56:21,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-28 23:56:21,698 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 23:56:21,699 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-28 23:56:21,705 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2023-11-28 23:56:21,706 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-28 23:56:21,717 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-28 23:56:21,717 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-28 23:56:21,717 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-28 23:56:21,717 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-28 23:56:21,717 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-28 23:56:21,718 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-28 23:56:21,718 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-28 23:56:21,719 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-28 23:56:21,723 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2023-11-28 23:56:21,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-28 23:56:21,723 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 23:56:21,724 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-28 23:56:21,727 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2023-11-28 23:56:21,728 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-28 23:56:21,738 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-28 23:56:21,738 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-28 23:56:21,738 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-28 23:56:21,738 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-28 23:56:21,738 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-28 23:56:21,739 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-28 23:56:21,739 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-28 23:56:21,740 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-28 23:56:21,743 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2023-11-28 23:56:21,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-28 23:56:21,744 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 23:56:21,745 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-28 23:56:21,746 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2023-11-28 23:56:21,747 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-28 23:56:21,757 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-28 23:56:21,758 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-28 23:56:21,758 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-28 23:56:21,758 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-28 23:56:21,759 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-28 23:56:21,759 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-28 23:56:21,763 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-28 23:56:21,766 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2023-11-28 23:56:21,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-28 23:56:21,766 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 23:56:21,767 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-28 23:56:21,774 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2023-11-28 23:56:21,774 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-28 23:56:21,785 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-28 23:56:21,785 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-28 23:56:21,785 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-28 23:56:21,785 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-28 23:56:21,785 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-28 23:56:21,786 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-28 23:56:21,786 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-28 23:56:21,787 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-28 23:56:21,789 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2023-11-28 23:56:21,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-28 23:56:21,790 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 23:56:21,791 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-28 23:56:21,794 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2023-11-28 23:56:21,795 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-28 23:56:21,806 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-28 23:56:21,806 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-28 23:56:21,806 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-28 23:56:21,807 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-28 23:56:21,807 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-28 23:56:21,807 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-28 23:56:21,807 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-28 23:56:21,808 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-28 23:56:21,811 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2023-11-28 23:56:21,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-28 23:56:21,812 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 23:56:21,813 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-28 23:56:21,815 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2023-11-28 23:56:21,815 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-28 23:56:21,826 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-28 23:56:21,826 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-28 23:56:21,826 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-28 23:56:21,826 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-28 23:56:21,829 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-28 23:56:21,829 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-28 23:56:21,836 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-28 23:56:21,839 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2023-11-28 23:56:21,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-28 23:56:21,839 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 23:56:21,840 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-28 23:56:21,847 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2023-11-28 23:56:21,848 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-28 23:56:21,859 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-28 23:56:21,859 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-28 23:56:21,859 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-28 23:56:21,859 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-28 23:56:21,859 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-28 23:56:21,860 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-28 23:56:21,860 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-28 23:56:21,862 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-28 23:56:21,864 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2023-11-28 23:56:21,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-28 23:56:21,865 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 23:56:21,866 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-28 23:56:21,868 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2023-11-28 23:56:21,869 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-28 23:56:21,879 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-28 23:56:21,879 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-28 23:56:21,880 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-28 23:56:21,880 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-28 23:56:21,880 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-28 23:56:21,880 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-28 23:56:21,880 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-28 23:56:21,882 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-28 23:56:21,887 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2023-11-28 23:56:21,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-28 23:56:21,888 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 23:56:21,889 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-28 23:56:21,891 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2023-11-28 23:56:21,892 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-28 23:56:21,903 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-28 23:56:21,903 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-28 23:56:21,903 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-28 23:56:21,903 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-28 23:56:21,905 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-28 23:56:21,905 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-28 23:56:21,909 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-28 23:56:21,912 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2023-11-28 23:56:21,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-28 23:56:21,912 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 23:56:21,913 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-28 23:56:21,916 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2023-11-28 23:56:21,917 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-28 23:56:21,928 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-28 23:56:21,928 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-28 23:56:21,928 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-28 23:56:21,928 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-28 23:56:21,934 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-28 23:56:21,934 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-28 23:56:21,947 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-28 23:56:21,950 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2023-11-28 23:56:21,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-28 23:56:21,950 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 23:56:21,951 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-28 23:56:21,953 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2023-11-28 23:56:21,954 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-28 23:56:21,964 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-28 23:56:21,965 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-28 23:56:21,965 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-28 23:56:21,965 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-28 23:56:21,966 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-28 23:56:21,966 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-28 23:56:21,970 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-28 23:56:21,973 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2023-11-28 23:56:21,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-28 23:56:21,974 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 23:56:21,974 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-28 23:56:21,976 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2023-11-28 23:56:21,977 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-28 23:56:21,987 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-28 23:56:21,987 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-28 23:56:21,987 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-28 23:56:21,987 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-28 23:56:21,990 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-28 23:56:21,990 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-28 23:56:22,000 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-28 23:56:22,003 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2023-11-28 23:56:22,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-28 23:56:22,003 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 23:56:22,004 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-28 23:56:22,006 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2023-11-28 23:56:22,007 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-28 23:56:22,017 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-28 23:56:22,017 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-28 23:56:22,017 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-28 23:56:22,017 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-28 23:56:22,018 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-28 23:56:22,019 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-28 23:56:22,022 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-28 23:56:22,025 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2023-11-28 23:56:22,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-28 23:56:22,025 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 23:56:22,026 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-28 23:56:22,028 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2023-11-28 23:56:22,028 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-28 23:56:22,039 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-28 23:56:22,039 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-28 23:56:22,039 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-28 23:56:22,039 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-28 23:56:22,046 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-28 23:56:22,046 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-28 23:56:22,062 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-11-28 23:56:22,136 INFO L443 ModelExtractionUtils]: Simplification made 30 calls to the SMT solver. [2023-11-28 23:56:22,136 INFO L444 ModelExtractionUtils]: 1 out of 28 variables were initially zero. Simplification set additionally 22 variables to zero. [2023-11-28 23:56:22,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-28 23:56:22,137 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 23:56:22,137 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-28 23:56:22,140 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2023-11-28 23:56:22,140 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-11-28 23:56:22,151 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2023-11-28 23:56:22,151 INFO L513 LassoAnalysis]: Proved termination. [2023-11-28 23:56:22,151 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_lis_~prev~0#1.base)_1, ULTIMATE.start_lis_~i~0#1) = 1*v_rep(select #length ULTIMATE.start_lis_~prev~0#1.base)_1 - 2*ULTIMATE.start_lis_~i~0#1 Supporting invariants [-2*ULTIMATE.start_lis_~N#1 + 1*v_rep(select #length ULTIMATE.start_lis_~prev~0#1.base)_1 >= 0] [2023-11-28 23:56:22,154 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2023-11-28 23:56:22,216 INFO L156 tatePredicateManager]: 15 out of 16 supporting invariants were superfluous and have been removed [2023-11-28 23:56:22,227 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2023-11-28 23:56:22,229 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #length[~prev~0!base] could not be translated [2023-11-28 23:56:22,254 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:56:22,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:56:22,284 INFO L262 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 20 conjunts are in the unsatisfiable core [2023-11-28 23:56:22,289 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:56:22,341 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-28 23:56:22,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:56:22,495 INFO L262 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-28 23:56:22,496 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:56:22,520 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-28 23:56:22,520 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.5 stem predicates 2 loop predicates [2023-11-28 23:56:22,521 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 29 transitions. cyclomatic complexity: 12 Second operand has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 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-28 23:56:22,762 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 29 transitions. cyclomatic complexity: 12. Second operand has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 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 24 states and 35 transitions. Complement of second has 11 states. [2023-11-28 23:56:22,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 5 stem states 2 non-accepting loop states 1 accepting loop states [2023-11-28 23:56:22,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 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-28 23:56:22,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 13 transitions. [2023-11-28 23:56:22,765 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 13 transitions. Stem has 8 letters. Loop has 2 letters. [2023-11-28 23:56:22,765 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-28 23:56:22,765 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 13 transitions. Stem has 10 letters. Loop has 2 letters. [2023-11-28 23:56:22,765 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-28 23:56:22,766 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 13 transitions. Stem has 8 letters. Loop has 4 letters. [2023-11-28 23:56:22,766 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-28 23:56:22,766 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 35 transitions. [2023-11-28 23:56:22,767 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2023-11-28 23:56:22,768 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 22 states and 31 transitions. [2023-11-28 23:56:22,768 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2023-11-28 23:56:22,768 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2023-11-28 23:56:22,768 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 31 transitions. [2023-11-28 23:56:22,769 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:56:22,769 INFO L218 hiAutomatonCegarLoop]: Abstraction has 22 states and 31 transitions. [2023-11-28 23:56:22,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 31 transitions. [2023-11-28 23:56:22,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2023-11-28 23:56:22,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 21 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:56:22,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2023-11-28 23:56:22,772 INFO L240 hiAutomatonCegarLoop]: Abstraction has 22 states and 31 transitions. [2023-11-28 23:56:22,772 INFO L428 stractBuchiCegarLoop]: Abstraction has 22 states and 31 transitions. [2023-11-28 23:56:22,772 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-11-28 23:56:22,772 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 31 transitions. [2023-11-28 23:56:22,774 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2023-11-28 23:56:22,774 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-28 23:56:22,774 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-28 23:56:22,774 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:56:22,774 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2023-11-28 23:56:22,775 INFO L748 eck$LassoCheckResult]: Stem: 381#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 372#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet19#1, main_#t~post18#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet16#1;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 373#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 368#L530-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0; 361#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet19#1;call write~int#2(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 362#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 363#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 364#L535-4 havoc main_~i~1#1;assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0; 380#L517-3 assume !(lis_~i~0#1 < lis_~N#1); 382#L517-4 lis_~i~0#1 := 1; 371#L519-3 [2023-11-28 23:56:22,775 INFO L750 eck$LassoCheckResult]: Loop: 371#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 365#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 366#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 371#L519-3 [2023-11-28 23:56:22,775 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:56:22,775 INFO L85 PathProgramCache]: Analyzing trace with hash -1899811625, now seen corresponding path program 1 times [2023-11-28 23:56:22,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:56:22,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114572342] [2023-11-28 23:56:22,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:56:22,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:56:22,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:56:22,867 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-28 23:56:22,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:56:22,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114572342] [2023-11-28 23:56:22,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114572342] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:56:22,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:56:22,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-28 23:56:22,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536550075] [2023-11-28 23:56:22,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:56:22,869 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-28 23:56:22,869 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:56:22,869 INFO L85 PathProgramCache]: Analyzing trace with hash 74687, now seen corresponding path program 1 times [2023-11-28 23:56:22,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:56:22,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079619407] [2023-11-28 23:56:22,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:56:22,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:56:22,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-28 23:56:22,873 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-28 23:56:22,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-28 23:56:22,876 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-28 23:56:22,897 INFO L210 LassoAnalysis]: Preferences: [2023-11-28 23:56:22,897 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-28 23:56:22,897 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-28 23:56:22,898 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-28 23:56:22,898 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-11-28 23:56:22,898 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-28 23:56:22,898 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-28 23:56:22,898 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-28 23:56:22,898 INFO L133 ssoRankerPreferences]: Filename of dumped script: lis-alloca-1.i_Iteration4_Loop [2023-11-28 23:56:22,898 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-28 23:56:22,898 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-28 23:56:22,899 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-28 23:56:22,901 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-28 23:56:22,904 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-28 23:56:22,906 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-28 23:56:22,912 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-28 23:56:22,915 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-28 23:56:22,959 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-28 23:56:22,960 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-11-28 23:56:22,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-28 23:56:22,961 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 23:56:22,962 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-28 23:56:22,964 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2023-11-28 23:56:22,965 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-28 23:56:22,965 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-28 23:56:22,978 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-28 23:56:22,978 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_lis_#t~post5#1=0} Honda state: {ULTIMATE.start_lis_#t~post5#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-11-28 23:56:22,980 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2023-11-28 23:56:22,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-28 23:56:22,981 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 23:56:22,981 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-28 23:56:22,982 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2023-11-28 23:56:22,983 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-28 23:56:22,983 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-28 23:56:23,000 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-28 23:56:23,001 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~P_PID_3=1} Honda state: {v_rep~unnamed0~0~P_PID_3=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-11-28 23:56:23,003 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2023-11-28 23:56:23,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-28 23:56:23,003 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 23:56:23,004 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-28 23:56:23,005 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2023-11-28 23:56:23,006 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-28 23:56:23,006 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-28 23:56:23,023 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-28 23:56:23,024 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~P_PGID_3=2} Honda state: {v_rep~unnamed0~0~P_PGID_3=2} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-11-28 23:56:23,026 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2023-11-28 23:56:23,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-28 23:56:23,026 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 23:56:23,027 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-28 23:56:23,028 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2023-11-28 23:56:23,029 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-28 23:56:23,029 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-28 23:56:23,042 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Ended with exit code 0 [2023-11-28 23:56:23,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-28 23:56:23,043 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 23:56:23,043 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-28 23:56:23,044 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2023-11-28 23:56:23,045 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-11-28 23:56:23,046 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-28 23:56:23,068 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-11-28 23:56:23,070 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Ended with exit code 0 [2023-11-28 23:56:23,071 INFO L210 LassoAnalysis]: Preferences: [2023-11-28 23:56:23,071 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-28 23:56:23,071 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-28 23:56:23,071 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-28 23:56:23,071 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-11-28 23:56:23,071 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-28 23:56:23,071 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-28 23:56:23,071 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-28 23:56:23,071 INFO L133 ssoRankerPreferences]: Filename of dumped script: lis-alloca-1.i_Iteration4_Loop [2023-11-28 23:56:23,071 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-28 23:56:23,071 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-28 23:56:23,072 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-28 23:56:23,074 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-28 23:56:23,076 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-28 23:56:23,080 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-28 23:56:23,087 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-28 23:56:23,090 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-28 23:56:23,141 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-28 23:56:23,141 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-11-28 23:56:23,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-28 23:56:23,142 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 23:56:23,143 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-28 23:56:23,143 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2023-11-28 23:56:23,145 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-28 23:56:23,155 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-28 23:56:23,155 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-28 23:56:23,155 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-28 23:56:23,155 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-28 23:56:23,155 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-28 23:56:23,155 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-28 23:56:23,155 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-28 23:56:23,157 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-28 23:56:23,159 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2023-11-28 23:56:23,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-28 23:56:23,160 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 23:56:23,160 INFO L229 MonitoredProcess]: Starting monitored process 42 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-28 23:56:23,161 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2023-11-28 23:56:23,163 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-28 23:56:23,172 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-28 23:56:23,173 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-28 23:56:23,173 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-28 23:56:23,173 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-28 23:56:23,174 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-28 23:56:23,174 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-28 23:56:23,178 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-28 23:56:23,180 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2023-11-28 23:56:23,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-28 23:56:23,180 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 23:56:23,181 INFO L229 MonitoredProcess]: Starting monitored process 43 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-28 23:56:23,182 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2023-11-28 23:56:23,183 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-28 23:56:23,196 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-28 23:56:23,196 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-28 23:56:23,196 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-28 23:56:23,196 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-28 23:56:23,197 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-28 23:56:23,197 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-28 23:56:23,201 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-28 23:56:23,203 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2023-11-28 23:56:23,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-28 23:56:23,204 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 23:56:23,205 INFO L229 MonitoredProcess]: Starting monitored process 44 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-28 23:56:23,205 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2023-11-28 23:56:23,207 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-28 23:56:23,217 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-28 23:56:23,217 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-28 23:56:23,217 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-28 23:56:23,217 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-28 23:56:23,217 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-28 23:56:23,218 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-28 23:56:23,218 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-28 23:56:23,220 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-11-28 23:56:23,222 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-11-28 23:56:23,222 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-11-28 23:56:23,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-28 23:56:23,222 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 23:56:23,223 INFO L229 MonitoredProcess]: Starting monitored process 45 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-28 23:56:23,224 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2023-11-28 23:56:23,225 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-11-28 23:56:23,225 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-11-28 23:56:23,225 INFO L513 LassoAnalysis]: Proved termination. [2023-11-28 23:56:23,225 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_lis_~i~0#1) = -2*ULTIMATE.start_lis_~i~0#1 + 1 Supporting invariants [] [2023-11-28 23:56:23,227 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2023-11-28 23:56:23,228 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-11-28 23:56:23,237 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:56:23,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:56:23,258 INFO L262 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-28 23:56:23,259 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:56:23,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:56:23,277 WARN L260 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-28 23:56:23,277 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:56:23,301 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-28 23:56:23,301 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2023-11-28 23:56:23,301 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 31 transitions. cyclomatic complexity: 13 Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:56:23,364 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 31 transitions. cyclomatic complexity: 13. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 43 states and 67 transitions. Complement of second has 9 states. [2023-11-28 23:56:23,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2023-11-28 23:56:23,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:56:23,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2023-11-28 23:56:23,366 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 10 letters. Loop has 3 letters. [2023-11-28 23:56:23,366 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-28 23:56:23,366 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 13 letters. Loop has 3 letters. [2023-11-28 23:56:23,366 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-28 23:56:23,366 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 10 letters. Loop has 6 letters. [2023-11-28 23:56:23,367 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-28 23:56:23,367 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 67 transitions. [2023-11-28 23:56:23,368 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2023-11-28 23:56:23,369 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 41 states and 62 transitions. [2023-11-28 23:56:23,369 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2023-11-28 23:56:23,369 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2023-11-28 23:56:23,369 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 62 transitions. [2023-11-28 23:56:23,369 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-28 23:56:23,370 INFO L218 hiAutomatonCegarLoop]: Abstraction has 41 states and 62 transitions. [2023-11-28 23:56:23,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 62 transitions. [2023-11-28 23:56:23,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 33. [2023-11-28 23:56:23,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 1.5151515151515151) internal successors, (50), 32 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-28 23:56:23,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 50 transitions. [2023-11-28 23:56:23,373 INFO L240 hiAutomatonCegarLoop]: Abstraction has 33 states and 50 transitions. [2023-11-28 23:56:23,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:56:23,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-28 23:56:23,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-28 23:56:23,374 INFO L87 Difference]: Start difference. First operand 33 states and 50 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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-28 23:56:23,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 23:56:23,410 INFO L93 Difference]: Finished difference Result 34 states and 50 transitions. [2023-11-28 23:56:23,410 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 50 transitions. [2023-11-28 23:56:23,411 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2023-11-28 23:56:23,411 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 34 states and 50 transitions. [2023-11-28 23:56:23,411 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2023-11-28 23:56:23,411 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2023-11-28 23:56:23,411 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 50 transitions. [2023-11-28 23:56:23,411 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-28 23:56:23,412 INFO L218 hiAutomatonCegarLoop]: Abstraction has 34 states and 50 transitions. [2023-11-28 23:56:23,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 50 transitions. [2023-11-28 23:56:23,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2023-11-28 23:56:23,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 1.4848484848484849) internal successors, (49), 32 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:56:23,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 49 transitions. [2023-11-28 23:56:23,414 INFO L240 hiAutomatonCegarLoop]: Abstraction has 33 states and 49 transitions. [2023-11-28 23:56:23,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-28 23:56:23,414 INFO L428 stractBuchiCegarLoop]: Abstraction has 33 states and 49 transitions. [2023-11-28 23:56:23,415 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2023-11-28 23:56:23,415 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 49 transitions. [2023-11-28 23:56:23,415 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2023-11-28 23:56:23,415 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-28 23:56:23,415 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-28 23:56:23,416 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:56:23,416 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:56:23,416 INFO L748 eck$LassoCheckResult]: Stem: 590#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 579#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet19#1, main_#t~post18#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet16#1;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 580#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 571#L530-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0; 562#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet19#1;call write~int#2(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 563#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 564#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 565#L535-4 havoc main_~i~1#1;assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0; 589#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#1(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#0(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 581#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 582#L517-3 assume !(lis_~i~0#1 < lis_~N#1); 591#L517-4 lis_~i~0#1 := 1; 592#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 566#L520-3 [2023-11-28 23:56:23,416 INFO L750 eck$LassoCheckResult]: Loop: 566#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 567#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 572#L521-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 573#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 585#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 576#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 577#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 566#L520-3 [2023-11-28 23:56:23,417 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:56:23,417 INFO L85 PathProgramCache]: Analyzing trace with hash 1792663252, now seen corresponding path program 1 times [2023-11-28 23:56:23,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:56:23,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554474786] [2023-11-28 23:56:23,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:56:23,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:56:23,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:56:23,502 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-28 23:56:23,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:56:23,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554474786] [2023-11-28 23:56:23,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554474786] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 23:56:23,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1756014389] [2023-11-28 23:56:23,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:56:23,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-28 23:56:23,503 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 23:56:23,504 INFO L229 MonitoredProcess]: Starting monitored process 46 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-28 23:56:23,507 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Waiting until timeout for monitored process [2023-11-28 23:56:23,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:56:23,578 INFO L262 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-28 23:56:23,580 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:56:23,624 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-28 23:56:23,624 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 23:56:23,679 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-28 23:56:23,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1756014389] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-28 23:56:23,679 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-28 23:56:23,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 10 [2023-11-28 23:56:23,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737100884] [2023-11-28 23:56:23,679 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-28 23:56:23,680 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-28 23:56:23,680 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:56:23,680 INFO L85 PathProgramCache]: Analyzing trace with hash -1094746892, now seen corresponding path program 1 times [2023-11-28 23:56:23,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:56:23,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926390968] [2023-11-28 23:56:23,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:56:23,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:56:23,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-28 23:56:23,695 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-28 23:56:23,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-28 23:56:23,708 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-28 23:56:23,806 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0 [2023-11-28 23:56:23,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:56:23,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-28 23:56:23,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2023-11-28 23:56:23,977 INFO L87 Difference]: Start difference. First operand 33 states and 49 transitions. cyclomatic complexity: 21 Second operand has 11 states, 10 states have (on average 2.5) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:56:24,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 23:56:24,176 INFO L93 Difference]: Finished difference Result 81 states and 109 transitions. [2023-11-28 23:56:24,176 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 81 states and 109 transitions. [2023-11-28 23:56:24,178 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2023-11-28 23:56:24,179 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 81 states to 58 states and 81 transitions. [2023-11-28 23:56:24,179 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2023-11-28 23:56:24,180 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2023-11-28 23:56:24,180 INFO L73 IsDeterministic]: Start isDeterministic. Operand 58 states and 81 transitions. [2023-11-28 23:56:24,180 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-28 23:56:24,180 INFO L218 hiAutomatonCegarLoop]: Abstraction has 58 states and 81 transitions. [2023-11-28 23:56:24,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states and 81 transitions. [2023-11-28 23:56:24,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 37. [2023-11-28 23:56:24,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 36 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:56:24,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 51 transitions. [2023-11-28 23:56:24,184 INFO L240 hiAutomatonCegarLoop]: Abstraction has 37 states and 51 transitions. [2023-11-28 23:56:24,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-28 23:56:24,185 INFO L428 stractBuchiCegarLoop]: Abstraction has 37 states and 51 transitions. [2023-11-28 23:56:24,185 INFO L335 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2023-11-28 23:56:24,185 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 51 transitions. [2023-11-28 23:56:24,186 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2023-11-28 23:56:24,186 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-28 23:56:24,186 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-28 23:56:24,187 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:56:24,187 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:56:24,187 INFO L748 eck$LassoCheckResult]: Stem: 804#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 792#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet19#1, main_#t~post18#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet16#1;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 793#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 783#L530-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0; 774#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet19#1;call write~int#2(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 775#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 776#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet19#1;call write~int#2(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 777#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 791#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 802#L535-4 havoc main_~i~1#1;assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0; 803#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#1(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#0(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 794#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 795#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#1(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#0(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 807#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 808#L517-3 assume !(lis_~i~0#1 < lis_~N#1); 805#L517-4 lis_~i~0#1 := 1; 796#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 778#L520-3 [2023-11-28 23:56:24,187 INFO L750 eck$LassoCheckResult]: Loop: 778#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 779#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 784#L521-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 785#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 798#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 788#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 789#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 778#L520-3 [2023-11-28 23:56:24,187 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:56:24,187 INFO L85 PathProgramCache]: Analyzing trace with hash 37388752, now seen corresponding path program 2 times [2023-11-28 23:56:24,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:56:24,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333570093] [2023-11-28 23:56:24,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:56:24,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:56:24,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-28 23:56:24,214 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-28 23:56:24,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-28 23:56:24,237 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-28 23:56:24,238 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:56:24,238 INFO L85 PathProgramCache]: Analyzing trace with hash -1094746892, now seen corresponding path program 2 times [2023-11-28 23:56:24,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:56:24,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656067780] [2023-11-28 23:56:24,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:56:24,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:56:24,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-28 23:56:24,246 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-28 23:56:24,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-28 23:56:24,253 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-28 23:56:24,254 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:56:24,254 INFO L85 PathProgramCache]: Analyzing trace with hash 502604869, now seen corresponding path program 1 times [2023-11-28 23:56:24,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:56:24,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583746055] [2023-11-28 23:56:24,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:56:24,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:56:24,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:56:24,456 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-28 23:56:24,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:56:24,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583746055] [2023-11-28 23:56:24,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583746055] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 23:56:24,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1979876501] [2023-11-28 23:56:24,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:56:24,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-28 23:56:24,457 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 23:56:24,458 INFO L229 MonitoredProcess]: Starting monitored process 47 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-28 23:56:24,461 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Waiting until timeout for monitored process [2023-11-28 23:56:24,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:56:24,577 INFO L262 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-28 23:56:24,579 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:56:24,676 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-28 23:56:24,676 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 23:56:24,767 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-28 23:56:24,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1979876501] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-28 23:56:24,768 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-28 23:56:24,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 12 [2023-11-28 23:56:24,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197166162] [2023-11-28 23:56:24,769 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-28 23:56:25,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:56:25,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-28 23:56:25,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2023-11-28 23:56:25,008 INFO L87 Difference]: Start difference. First operand 37 states and 51 transitions. cyclomatic complexity: 19 Second operand has 13 states, 12 states have (on average 3.5) internal successors, (42), 13 states have internal predecessors, (42), 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-28 23:56:25,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 23:56:25,184 INFO L93 Difference]: Finished difference Result 68 states and 92 transitions. [2023-11-28 23:56:25,184 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 92 transitions. [2023-11-28 23:56:25,185 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 17 [2023-11-28 23:56:25,187 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 62 states and 83 transitions. [2023-11-28 23:56:25,187 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2023-11-28 23:56:25,187 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2023-11-28 23:56:25,188 INFO L73 IsDeterministic]: Start isDeterministic. Operand 62 states and 83 transitions. [2023-11-28 23:56:25,188 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-28 23:56:25,188 INFO L218 hiAutomatonCegarLoop]: Abstraction has 62 states and 83 transitions. [2023-11-28 23:56:25,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states and 83 transitions. [2023-11-28 23:56:25,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 55. [2023-11-28 23:56:25,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 55 states have (on average 1.3636363636363635) internal successors, (75), 54 states have internal predecessors, (75), 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-28 23:56:25,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 75 transitions. [2023-11-28 23:56:25,195 INFO L240 hiAutomatonCegarLoop]: Abstraction has 55 states and 75 transitions. [2023-11-28 23:56:25,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-28 23:56:25,196 INFO L428 stractBuchiCegarLoop]: Abstraction has 55 states and 75 transitions. [2023-11-28 23:56:25,196 INFO L335 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2023-11-28 23:56:25,197 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 55 states and 75 transitions. [2023-11-28 23:56:25,197 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2023-11-28 23:56:25,198 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-28 23:56:25,198 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-28 23:56:25,199 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:56:25,199 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2023-11-28 23:56:25,199 INFO L748 eck$LassoCheckResult]: Stem: 1076#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1061#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet19#1, main_#t~post18#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet16#1;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 1062#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 1054#L530-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0; 1045#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet19#1;call write~int#2(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 1046#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 1047#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet19#1;call write~int#2(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 1048#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 1093#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 1074#L535-4 havoc main_~i~1#1;assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0; 1075#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#1(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#0(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 1089#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 1088#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#1(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#0(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 1087#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 1086#L517-3 assume !(lis_~i~0#1 < lis_~N#1); 1085#L517-4 lis_~i~0#1 := 1; 1082#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 1083#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 1095#L521 [2023-11-28 23:56:25,199 INFO L750 eck$LassoCheckResult]: Loop: 1095#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 1099#L521-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 1098#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 1094#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 1095#L521 [2023-11-28 23:56:25,200 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:56:25,200 INFO L85 PathProgramCache]: Analyzing trace with hash 1159051365, now seen corresponding path program 1 times [2023-11-28 23:56:25,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:56:25,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572907520] [2023-11-28 23:56:25,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:56:25,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:56:25,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-28 23:56:25,230 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-28 23:56:25,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-28 23:56:25,254 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-28 23:56:25,255 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:56:25,255 INFO L85 PathProgramCache]: Analyzing trace with hash 2655420, now seen corresponding path program 1 times [2023-11-28 23:56:25,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:56:25,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152805908] [2023-11-28 23:56:25,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:56:25,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:56:25,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-28 23:56:25,263 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-28 23:56:25,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-28 23:56:25,268 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-28 23:56:25,269 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:56:25,269 INFO L85 PathProgramCache]: Analyzing trace with hash -651990240, now seen corresponding path program 1 times [2023-11-28 23:56:25,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:56:25,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579075338] [2023-11-28 23:56:25,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:56:25,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:56:25,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:56:25,404 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-28 23:56:25,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:56:25,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579075338] [2023-11-28 23:56:25,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579075338] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 23:56:25,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1071118897] [2023-11-28 23:56:25,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:56:25,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-28 23:56:25,405 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 23:56:25,409 INFO L229 MonitoredProcess]: Starting monitored process 48 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-28 23:56:25,411 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Waiting until timeout for monitored process [2023-11-28 23:56:25,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:56:25,509 INFO L262 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-28 23:56:25,510 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:56:25,557 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-28 23:56:25,557 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 23:56:25,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1071118897] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:56:25,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-28 23:56:25,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2023-11-28 23:56:25,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823987095] [2023-11-28 23:56:25,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:56:25,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:56:25,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-28 23:56:25,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2023-11-28 23:56:25,791 INFO L87 Difference]: Start difference. First operand 55 states and 75 transitions. cyclomatic complexity: 27 Second operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 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-28 23:56:25,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 23:56:25,864 INFO L93 Difference]: Finished difference Result 72 states and 97 transitions. [2023-11-28 23:56:25,864 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 72 states and 97 transitions. [2023-11-28 23:56:25,865 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2023-11-28 23:56:25,865 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 72 states to 72 states and 97 transitions. [2023-11-28 23:56:25,866 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2023-11-28 23:56:25,866 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2023-11-28 23:56:25,866 INFO L73 IsDeterministic]: Start isDeterministic. Operand 72 states and 97 transitions. [2023-11-28 23:56:25,866 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-28 23:56:25,866 INFO L218 hiAutomatonCegarLoop]: Abstraction has 72 states and 97 transitions. [2023-11-28 23:56:25,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states and 97 transitions. [2023-11-28 23:56:25,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 64. [2023-11-28 23:56:25,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 64 states have (on average 1.375) internal successors, (88), 63 states have internal predecessors, (88), 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-28 23:56:25,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 88 transitions. [2023-11-28 23:56:25,873 INFO L240 hiAutomatonCegarLoop]: Abstraction has 64 states and 88 transitions. [2023-11-28 23:56:25,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-28 23:56:25,874 INFO L428 stractBuchiCegarLoop]: Abstraction has 64 states and 88 transitions. [2023-11-28 23:56:25,875 INFO L335 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2023-11-28 23:56:25,875 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 64 states and 88 transitions. [2023-11-28 23:56:25,876 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2023-11-28 23:56:25,876 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-28 23:56:25,876 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-28 23:56:25,877 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:56:25,877 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2023-11-28 23:56:25,877 INFO L748 eck$LassoCheckResult]: Stem: 1283#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1265#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet19#1, main_#t~post18#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet16#1;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 1266#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 1256#L530-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0; 1248#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet19#1;call write~int#2(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 1249#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 1250#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet19#1;call write~int#2(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 1251#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 1303#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 1281#L535-4 havoc main_~i~1#1;assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0; 1282#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#1(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#0(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 1267#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 1268#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#1(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#0(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 1286#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 1299#L517-3 assume !(lis_~i~0#1 < lis_~N#1); 1284#L517-4 lis_~i~0#1 := 1; 1269#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 1270#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 1309#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 1289#L519-3 assume !(lis_~i~0#1 < lis_~N#1); 1285#L519-4 lis_~i~0#1 := 0; 1278#L523-3 [2023-11-28 23:56:25,877 INFO L750 eck$LassoCheckResult]: Loop: 1278#L523-3 assume !!(lis_~i~0#1 < lis_~N#1);call lis_#t~mem14#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4); 1279#L524 assume lis_~max~0#1 < lis_#t~mem14#1;havoc lis_#t~mem14#1;call lis_#t~mem15#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);lis_~max~0#1 := lis_#t~mem15#1;havoc lis_#t~mem15#1; 1280#L523-2 lis_#t~post13#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post13#1;havoc lis_#t~post13#1; 1278#L523-3 [2023-11-28 23:56:25,878 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:56:25,878 INFO L85 PathProgramCache]: Analyzing trace with hash 2057131266, now seen corresponding path program 1 times [2023-11-28 23:56:25,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:56:25,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483829489] [2023-11-28 23:56:25,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:56:25,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:56:25,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:56:25,955 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-28 23:56:25,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:56:25,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483829489] [2023-11-28 23:56:25,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483829489] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:56:25,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:56:25,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-28 23:56:25,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580974423] [2023-11-28 23:56:25,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:56:25,956 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-28 23:56:25,957 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:56:25,957 INFO L85 PathProgramCache]: Analyzing trace with hash 111317, now seen corresponding path program 1 times [2023-11-28 23:56:25,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:56:25,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86646987] [2023-11-28 23:56:25,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:56:25,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:56:25,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-28 23:56:25,962 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-28 23:56:25,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-28 23:56:25,967 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-28 23:56:26,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:56:26,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-28 23:56:26,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-28 23:56:26,026 INFO L87 Difference]: Start difference. First operand 64 states and 88 transitions. cyclomatic complexity: 30 Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:56:26,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 23:56:26,069 INFO L93 Difference]: Finished difference Result 67 states and 89 transitions. [2023-11-28 23:56:26,069 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 67 states and 89 transitions. [2023-11-28 23:56:26,070 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2023-11-28 23:56:26,070 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 67 states to 66 states and 88 transitions. [2023-11-28 23:56:26,071 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2023-11-28 23:56:26,071 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2023-11-28 23:56:26,071 INFO L73 IsDeterministic]: Start isDeterministic. Operand 66 states and 88 transitions. [2023-11-28 23:56:26,072 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-28 23:56:26,072 INFO L218 hiAutomatonCegarLoop]: Abstraction has 66 states and 88 transitions. [2023-11-28 23:56:26,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states and 88 transitions. [2023-11-28 23:56:26,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2023-11-28 23:56:26,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 64 states have (on average 1.34375) internal successors, (86), 63 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-28 23:56:26,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 86 transitions. [2023-11-28 23:56:26,078 INFO L240 hiAutomatonCegarLoop]: Abstraction has 64 states and 86 transitions. [2023-11-28 23:56:26,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-28 23:56:26,079 INFO L428 stractBuchiCegarLoop]: Abstraction has 64 states and 86 transitions. [2023-11-28 23:56:26,079 INFO L335 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2023-11-28 23:56:26,080 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 64 states and 86 transitions. [2023-11-28 23:56:26,080 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2023-11-28 23:56:26,080 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-28 23:56:26,080 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-28 23:56:26,082 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:56:26,082 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:56:26,082 INFO L748 eck$LassoCheckResult]: Stem: 1417#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1401#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet19#1, main_#t~post18#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet16#1;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 1402#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 1394#L530-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0; 1386#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet19#1;call write~int#2(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 1387#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 1388#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet19#1;call write~int#2(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 1389#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 1442#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet19#1;call write~int#2(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 1441#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 1440#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 1439#L535-4 havoc main_~i~1#1;assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0; 1438#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#1(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#0(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 1403#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 1404#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#1(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#0(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 1421#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 1434#L517-3 assume !(lis_~i~0#1 < lis_~N#1); 1433#L517-4 lis_~i~0#1 := 1; 1430#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 1431#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 1449#L521 assume !lis_#t~short11#1; 1448#L521-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int#1(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int#0(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 1447#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 1390#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 1391#L519-2 [2023-11-28 23:56:26,082 INFO L750 eck$LassoCheckResult]: Loop: 1391#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 1399#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 1423#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 1445#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 1444#L521-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 1408#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 1409#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 1391#L519-2 [2023-11-28 23:56:26,083 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:56:26,083 INFO L85 PathProgramCache]: Analyzing trace with hash -1034472260, now seen corresponding path program 1 times [2023-11-28 23:56:26,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:56:26,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623284085] [2023-11-28 23:56:26,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:56:26,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:56:26,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:56:26,126 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-11-28 23:56:26,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:56:26,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623284085] [2023-11-28 23:56:26,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623284085] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:56:26,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:56:26,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-28 23:56:26,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799856035] [2023-11-28 23:56:26,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:56:26,127 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-28 23:56:26,128 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:56:26,128 INFO L85 PathProgramCache]: Analyzing trace with hash 782548870, now seen corresponding path program 3 times [2023-11-28 23:56:26,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:56:26,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432649064] [2023-11-28 23:56:26,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:56:26,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:56:26,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-28 23:56:26,134 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-28 23:56:26,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-28 23:56:26,140 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-28 23:56:26,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:56:26,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 23:56:26,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 23:56:26,363 INFO L87 Difference]: Start difference. First operand 64 states and 86 transitions. cyclomatic complexity: 28 Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 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-28 23:56:26,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 23:56:26,378 INFO L93 Difference]: Finished difference Result 69 states and 91 transitions. [2023-11-28 23:56:26,378 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 91 transitions. [2023-11-28 23:56:26,379 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2023-11-28 23:56:26,379 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 69 states and 91 transitions. [2023-11-28 23:56:26,379 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39 [2023-11-28 23:56:26,380 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39 [2023-11-28 23:56:26,380 INFO L73 IsDeterministic]: Start isDeterministic. Operand 69 states and 91 transitions. [2023-11-28 23:56:26,380 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-28 23:56:26,380 INFO L218 hiAutomatonCegarLoop]: Abstraction has 69 states and 91 transitions. [2023-11-28 23:56:26,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states and 91 transitions. [2023-11-28 23:56:26,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2023-11-28 23:56:26,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 69 states have (on average 1.318840579710145) internal successors, (91), 68 states have internal predecessors, (91), 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-28 23:56:26,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 91 transitions. [2023-11-28 23:56:26,386 INFO L240 hiAutomatonCegarLoop]: Abstraction has 69 states and 91 transitions. [2023-11-28 23:56:26,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 23:56:26,387 INFO L428 stractBuchiCegarLoop]: Abstraction has 69 states and 91 transitions. [2023-11-28 23:56:26,387 INFO L335 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2023-11-28 23:56:26,388 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 69 states and 91 transitions. [2023-11-28 23:56:26,388 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2023-11-28 23:56:26,389 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-28 23:56:26,389 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-28 23:56:26,390 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:56:26,390 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:56:26,390 INFO L748 eck$LassoCheckResult]: Stem: 1560#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1541#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet19#1, main_#t~post18#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet16#1;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 1542#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 1533#L530-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0; 1525#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet19#1;call write~int#2(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 1526#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 1527#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet19#1;call write~int#2(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 1528#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 1583#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet19#1;call write~int#2(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 1582#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 1581#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 1580#L535-4 havoc main_~i~1#1;assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0; 1578#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#1(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#0(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 1577#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 1576#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#1(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#0(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 1575#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 1574#L517-3 assume !(lis_~i~0#1 < lis_~N#1); 1573#L517-4 lis_~i~0#1 := 1; 1571#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 1529#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 1530#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 1550#L521-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int#1(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int#0(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 1591#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 1584#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 1538#L519-2 [2023-11-28 23:56:26,390 INFO L750 eck$LassoCheckResult]: Loop: 1538#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 1539#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 1566#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 1586#L521 assume !lis_#t~short11#1; 1589#L521-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 1587#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 1585#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 1538#L519-2 [2023-11-28 23:56:26,391 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:56:26,391 INFO L85 PathProgramCache]: Analyzing trace with hash -1034531842, now seen corresponding path program 1 times [2023-11-28 23:56:26,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:56:26,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742480838] [2023-11-28 23:56:26,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:56:26,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:56:26,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:56:26,556 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-28 23:56:26,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:56:26,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742480838] [2023-11-28 23:56:26,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742480838] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 23:56:26,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2056346064] [2023-11-28 23:56:26,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:56:26,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-28 23:56:26,557 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 23:56:26,559 INFO L229 MonitoredProcess]: Starting monitored process 49 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-28 23:56:26,566 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Waiting until timeout for monitored process [2023-11-28 23:56:26,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:56:26,677 INFO L262 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-28 23:56:26,679 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:56:26,803 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-28 23:56:26,804 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 23:56:26,930 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-28 23:56:26,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2056346064] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-28 23:56:26,931 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-28 23:56:26,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2023-11-28 23:56:26,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422055204] [2023-11-28 23:56:26,932 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-28 23:56:26,932 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-28 23:56:26,933 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:56:26,933 INFO L85 PathProgramCache]: Analyzing trace with hash 782608452, now seen corresponding path program 1 times [2023-11-28 23:56:26,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:56:26,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909508499] [2023-11-28 23:56:26,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:56:26,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:56:26,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-28 23:56:26,939 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-28 23:56:26,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-28 23:56:26,943 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-28 23:56:27,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:56:27,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-28 23:56:27,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2023-11-28 23:56:27,064 INFO L87 Difference]: Start difference. First operand 69 states and 91 transitions. cyclomatic complexity: 28 Second operand has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 14 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-28 23:56:27,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 23:56:27,304 INFO L93 Difference]: Finished difference Result 76 states and 99 transitions. [2023-11-28 23:56:27,304 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 76 states and 99 transitions. [2023-11-28 23:56:27,305 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2023-11-28 23:56:27,306 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 76 states to 76 states and 99 transitions. [2023-11-28 23:56:27,306 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 43 [2023-11-28 23:56:27,306 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 43 [2023-11-28 23:56:27,306 INFO L73 IsDeterministic]: Start isDeterministic. Operand 76 states and 99 transitions. [2023-11-28 23:56:27,306 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-28 23:56:27,306 INFO L218 hiAutomatonCegarLoop]: Abstraction has 76 states and 99 transitions. [2023-11-28 23:56:27,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states and 99 transitions. [2023-11-28 23:56:27,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 71. [2023-11-28 23:56:27,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 71 states have (on average 1.3098591549295775) internal successors, (93), 70 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-28 23:56:27,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 93 transitions. [2023-11-28 23:56:27,312 INFO L240 hiAutomatonCegarLoop]: Abstraction has 71 states and 93 transitions. [2023-11-28 23:56:27,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-28 23:56:27,314 INFO L428 stractBuchiCegarLoop]: Abstraction has 71 states and 93 transitions. [2023-11-28 23:56:27,315 INFO L335 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2023-11-28 23:56:27,315 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 71 states and 93 transitions. [2023-11-28 23:56:27,316 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2023-11-28 23:56:27,316 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-28 23:56:27,316 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-28 23:56:27,317 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:56:27,317 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2023-11-28 23:56:27,317 INFO L748 eck$LassoCheckResult]: Stem: 1871#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1852#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet19#1, main_#t~post18#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet16#1;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 1853#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 1843#L530-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0; 1835#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet19#1;call write~int#2(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 1836#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 1837#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet19#1;call write~int#2(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 1838#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 1888#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 1890#L535-4 havoc main_~i~1#1;assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0; 1874#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#1(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#0(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 1875#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 1894#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#1(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#0(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 1893#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 1892#L517-3 assume !(lis_~i~0#1 < lis_~N#1); 1872#L517-4 lis_~i~0#1 := 1; 1856#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 1857#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 1901#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 1900#L521-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int#1(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int#0(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 1898#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 1877#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 1878#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 1896#L519-3 assume !(lis_~i~0#1 < lis_~N#1); 1873#L519-4 lis_~i~0#1 := 0; 1866#L523-3 [2023-11-28 23:56:27,318 INFO L750 eck$LassoCheckResult]: Loop: 1866#L523-3 assume !!(lis_~i~0#1 < lis_~N#1);call lis_#t~mem14#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4); 1867#L524 assume lis_~max~0#1 < lis_#t~mem14#1;havoc lis_#t~mem14#1;call lis_#t~mem15#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);lis_~max~0#1 := lis_#t~mem15#1;havoc lis_#t~mem15#1; 1868#L523-2 lis_#t~post13#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post13#1;havoc lis_#t~post13#1; 1866#L523-3 [2023-11-28 23:56:27,318 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:56:27,318 INFO L85 PathProgramCache]: Analyzing trace with hash -1656376535, now seen corresponding path program 1 times [2023-11-28 23:56:27,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:56:27,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921481764] [2023-11-28 23:56:27,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:56:27,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:56:27,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-28 23:56:27,352 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-28 23:56:27,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-28 23:56:27,383 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-28 23:56:27,383 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:56:27,384 INFO L85 PathProgramCache]: Analyzing trace with hash 111317, now seen corresponding path program 2 times [2023-11-28 23:56:27,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:56:27,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513634460] [2023-11-28 23:56:27,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:56:27,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:56:27,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-28 23:56:27,389 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-28 23:56:27,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-28 23:56:27,392 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-28 23:56:27,393 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:56:27,393 INFO L85 PathProgramCache]: Analyzing trace with hash -234008915, now seen corresponding path program 1 times [2023-11-28 23:56:27,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:56:27,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200429483] [2023-11-28 23:56:27,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:56:27,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:56:27,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-28 23:56:27,442 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-28 23:56:27,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-28 23:56:27,476 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-28 23:56:34,088 WARN L293 SmtUtils]: Spent 6.55s on a formula simplification. DAG size of input: 259 DAG size of output: 189 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2023-11-28 23:56:35,040 INFO L210 LassoAnalysis]: Preferences: [2023-11-28 23:56:35,040 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-28 23:56:35,040 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-28 23:56:35,040 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-28 23:56:35,040 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-11-28 23:56:35,040 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-28 23:56:35,040 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-28 23:56:35,040 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-28 23:56:35,040 INFO L133 ssoRankerPreferences]: Filename of dumped script: lis-alloca-1.i_Iteration11_Lasso [2023-11-28 23:56:35,040 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-28 23:56:35,040 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-28 23:56:35,043 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-28 23:56:35,045 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-28 23:56:35,047 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-28 23:56:35,049 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-28 23:56:35,051 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-28 23:56:35,052 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-28 23:56:35,054 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-28 23:56:35,057 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-28 23:56:35,058 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-28 23:56:35,061 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-28 23:56:35,063 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-28 23:56:35,064 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-28 23:56:35,066 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-28 23:56:35,068 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-28 23:56:35,069 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-28 23:56:35,070 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-28 23:56:35,072 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-28 23:56:35,073 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-28 23:56:35,075 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-28 23:56:35,876 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-28 23:56:35,877 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-28 23:56:35,879 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-28 23:56:35,880 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-28 23:56:35,882 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-28 23:56:35,884 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-28 23:56:35,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-28 23:56:35,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-28 23:56:35,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-28 23:56:35,889 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-28 23:56:36,383 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-28 23:56:36,383 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-11-28 23:56:36,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-28 23:56:36,384 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 23:56:36,385 INFO L229 MonitoredProcess]: Starting monitored process 50 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-28 23:56:36,386 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2023-11-28 23:56:36,387 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-28 23:56:36,397 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-28 23:56:36,397 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-28 23:56:36,397 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-28 23:56:36,398 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-28 23:56:36,398 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-28 23:56:36,398 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-28 23:56:36,398 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-28 23:56:36,399 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-28 23:56:36,401 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Forceful destruction successful, exit code 0 [2023-11-28 23:56:36,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-28 23:56:36,402 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 23:56:36,403 INFO L229 MonitoredProcess]: Starting monitored process 51 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-28 23:56:36,403 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2023-11-28 23:56:36,405 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-28 23:56:36,415 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-28 23:56:36,415 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-28 23:56:36,415 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-28 23:56:36,415 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-28 23:56:36,415 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-28 23:56:36,415 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-28 23:56:36,415 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-28 23:56:36,417 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-28 23:56:36,419 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Forceful destruction successful, exit code 0 [2023-11-28 23:56:36,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-28 23:56:36,419 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 23:56:36,420 INFO L229 MonitoredProcess]: Starting monitored process 52 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-28 23:56:36,421 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2023-11-28 23:56:36,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-28 23:56:36,434 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-28 23:56:36,434 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-28 23:56:36,434 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-28 23:56:36,434 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-28 23:56:36,434 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-28 23:56:36,435 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-28 23:56:36,435 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-28 23:56:36,436 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-28 23:56:36,438 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Ended with exit code 0 [2023-11-28 23:56:36,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-28 23:56:36,438 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 23:56:36,439 INFO L229 MonitoredProcess]: Starting monitored process 53 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-28 23:56:36,440 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2023-11-28 23:56:36,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-28 23:56:36,453 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-28 23:56:36,453 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-28 23:56:36,453 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-28 23:56:36,453 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-28 23:56:36,453 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-28 23:56:36,454 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-28 23:56:36,454 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-28 23:56:36,455 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-28 23:56:36,458 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Ended with exit code 0 [2023-11-28 23:56:36,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-28 23:56:36,458 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 23:56:36,459 INFO L229 MonitoredProcess]: Starting monitored process 54 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-28 23:56:36,461 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2023-11-28 23:56:36,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-28 23:56:36,474 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-28 23:56:36,474 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-28 23:56:36,475 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-28 23:56:36,475 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-28 23:56:36,475 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-28 23:56:36,475 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-28 23:56:36,475 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-28 23:56:36,477 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-28 23:56:36,479 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Forceful destruction successful, exit code 0 [2023-11-28 23:56:36,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-28 23:56:36,480 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 23:56:36,481 INFO L229 MonitoredProcess]: Starting monitored process 55 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-28 23:56:36,482 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2023-11-28 23:56:36,483 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-28 23:56:36,496 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-28 23:56:36,496 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-28 23:56:36,496 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-28 23:56:36,496 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-28 23:56:36,496 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-28 23:56:36,497 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-28 23:56:36,497 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-28 23:56:36,498 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-28 23:56:36,501 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Ended with exit code 0 [2023-11-28 23:56:36,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-28 23:56:36,501 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 23:56:36,502 INFO L229 MonitoredProcess]: Starting monitored process 56 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-28 23:56:36,503 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2023-11-28 23:56:36,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-28 23:56:36,518 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-28 23:56:36,518 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-28 23:56:36,518 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-28 23:56:36,518 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-28 23:56:36,519 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-28 23:56:36,519 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-28 23:56:36,524 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-28 23:56:36,527 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Forceful destruction successful, exit code 0 [2023-11-28 23:56:36,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-28 23:56:36,528 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 23:56:36,529 INFO L229 MonitoredProcess]: Starting monitored process 57 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-28 23:56:36,530 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2023-11-28 23:56:36,531 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-28 23:56:36,546 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-28 23:56:36,546 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-28 23:56:36,547 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-28 23:56:36,547 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-28 23:56:36,547 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-28 23:56:36,547 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-28 23:56:36,547 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-28 23:56:36,549 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-28 23:56:36,552 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Ended with exit code 0 [2023-11-28 23:56:36,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-28 23:56:36,553 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 23:56:36,553 INFO L229 MonitoredProcess]: Starting monitored process 58 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-28 23:56:36,554 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2023-11-28 23:56:36,556 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-28 23:56:36,569 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-28 23:56:36,569 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-28 23:56:36,569 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-28 23:56:36,569 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-28 23:56:36,570 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-28 23:56:36,570 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-28 23:56:36,575 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-28 23:56:36,577 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Forceful destruction successful, exit code 0 [2023-11-28 23:56:36,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-28 23:56:36,578 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 23:56:36,579 INFO L229 MonitoredProcess]: Starting monitored process 59 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-28 23:56:36,580 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2023-11-28 23:56:36,582 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-28 23:56:36,594 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-28 23:56:36,594 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-28 23:56:36,594 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-28 23:56:36,594 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-28 23:56:36,595 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-28 23:56:36,595 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-28 23:56:36,595 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-28 23:56:36,597 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-28 23:56:36,599 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Forceful destruction successful, exit code 0 [2023-11-28 23:56:36,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-28 23:56:36,600 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 23:56:36,600 INFO L229 MonitoredProcess]: Starting monitored process 60 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-28 23:56:36,601 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2023-11-28 23:56:36,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-28 23:56:36,616 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-28 23:56:36,616 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-28 23:56:36,616 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-28 23:56:36,616 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-28 23:56:36,616 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-28 23:56:36,617 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-28 23:56:36,617 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-28 23:56:36,618 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-28 23:56:36,621 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Ended with exit code 0 [2023-11-28 23:56:36,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-28 23:56:36,621 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 23:56:36,622 INFO L229 MonitoredProcess]: Starting monitored process 61 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-28 23:56:36,624 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2023-11-28 23:56:36,625 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-28 23:56:36,638 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-28 23:56:36,638 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-28 23:56:36,638 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-28 23:56:36,638 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-28 23:56:36,638 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-28 23:56:36,639 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-28 23:56:36,639 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-28 23:56:36,640 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-28 23:56:36,643 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Forceful destruction successful, exit code 0 [2023-11-28 23:56:36,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-28 23:56:36,644 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 23:56:36,645 INFO L229 MonitoredProcess]: Starting monitored process 62 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-28 23:56:36,645 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2023-11-28 23:56:36,647 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-28 23:56:36,660 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-28 23:56:36,660 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-28 23:56:36,660 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-28 23:56:36,660 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-28 23:56:36,660 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-28 23:56:36,661 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-28 23:56:36,661 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-28 23:56:36,662 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-28 23:56:36,665 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Forceful destruction successful, exit code 0 [2023-11-28 23:56:36,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-28 23:56:36,665 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 23:56:36,666 INFO L229 MonitoredProcess]: Starting monitored process 63 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-28 23:56:36,667 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2023-11-28 23:56:36,669 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-28 23:56:36,681 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-28 23:56:36,681 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-28 23:56:36,681 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-28 23:56:36,681 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-28 23:56:36,681 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-28 23:56:36,682 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-28 23:56:36,682 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-28 23:56:36,683 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-28 23:56:36,686 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Forceful destruction successful, exit code 0 [2023-11-28 23:56:36,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-28 23:56:36,687 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 23:56:36,688 INFO L229 MonitoredProcess]: Starting monitored process 64 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-28 23:56:36,688 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Waiting until timeout for monitored process [2023-11-28 23:56:36,690 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-28 23:56:36,702 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-28 23:56:36,702 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-28 23:56:36,702 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-28 23:56:36,702 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-28 23:56:36,702 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-28 23:56:36,703 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-28 23:56:36,703 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-28 23:56:36,704 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-28 23:56:36,706 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Ended with exit code 0 [2023-11-28 23:56:36,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-28 23:56:36,707 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 23:56:36,708 INFO L229 MonitoredProcess]: Starting monitored process 65 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-28 23:56:36,708 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Waiting until timeout for monitored process [2023-11-28 23:56:36,710 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-28 23:56:36,722 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-28 23:56:36,722 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-28 23:56:36,722 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-28 23:56:36,722 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-28 23:56:36,722 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-28 23:56:36,723 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-28 23:56:36,723 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-28 23:56:36,725 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-28 23:56:36,727 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Ended with exit code 0 [2023-11-28 23:56:36,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-28 23:56:36,727 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 23:56:36,728 INFO L229 MonitoredProcess]: Starting monitored process 66 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-28 23:56:36,729 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Waiting until timeout for monitored process [2023-11-28 23:56:36,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-28 23:56:36,742 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-28 23:56:36,743 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-28 23:56:36,743 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-28 23:56:36,743 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-28 23:56:36,743 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-28 23:56:36,743 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-28 23:56:36,743 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-28 23:56:36,745 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-28 23:56:36,748 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Ended with exit code 0 [2023-11-28 23:56:36,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-28 23:56:36,748 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 23:56:36,749 INFO L229 MonitoredProcess]: Starting monitored process 67 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-28 23:56:36,750 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Waiting until timeout for monitored process [2023-11-28 23:56:36,752 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-28 23:56:36,763 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-28 23:56:36,763 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-28 23:56:36,763 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-28 23:56:36,764 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-28 23:56:36,765 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-28 23:56:36,765 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-28 23:56:36,768 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-28 23:56:36,771 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Ended with exit code 0 [2023-11-28 23:56:36,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-28 23:56:36,771 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 23:56:36,772 INFO L229 MonitoredProcess]: Starting monitored process 68 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-28 23:56:36,772 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Waiting until timeout for monitored process [2023-11-28 23:56:36,774 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-28 23:56:36,784 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-28 23:56:36,784 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-28 23:56:36,784 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-28 23:56:36,784 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-28 23:56:36,786 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-28 23:56:36,786 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-28 23:56:36,791 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-28 23:56:36,793 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Ended with exit code 0 [2023-11-28 23:56:36,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-28 23:56:36,795 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 23:56:36,795 INFO L229 MonitoredProcess]: Starting monitored process 69 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-28 23:56:36,796 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Waiting until timeout for monitored process [2023-11-28 23:56:36,798 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-28 23:56:36,808 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-28 23:56:36,808 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-28 23:56:36,808 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-28 23:56:36,808 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-28 23:56:36,813 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-28 23:56:36,813 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-28 23:56:36,824 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-28 23:56:36,827 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Ended with exit code 0 [2023-11-28 23:56:36,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-28 23:56:36,827 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 23:56:36,828 INFO L229 MonitoredProcess]: Starting monitored process 70 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-28 23:56:36,829 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Waiting until timeout for monitored process [2023-11-28 23:56:36,830 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-28 23:56:36,840 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-28 23:56:36,840 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-28 23:56:36,840 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-28 23:56:36,840 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-28 23:56:36,842 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-28 23:56:36,842 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-28 23:56:36,849 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-28 23:56:36,851 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Ended with exit code 0 [2023-11-28 23:56:36,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-28 23:56:36,851 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 23:56:36,852 INFO L229 MonitoredProcess]: Starting monitored process 71 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-28 23:56:36,853 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Waiting until timeout for monitored process [2023-11-28 23:56:36,854 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-28 23:56:36,864 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-28 23:56:36,864 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-28 23:56:36,864 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-28 23:56:36,864 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-28 23:56:36,865 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-28 23:56:36,865 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-28 23:56:36,883 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-28 23:56:36,885 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Forceful destruction successful, exit code 0 [2023-11-28 23:56:36,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-28 23:56:36,885 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 23:56:36,886 INFO L229 MonitoredProcess]: Starting monitored process 72 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-28 23:56:36,887 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Waiting until timeout for monitored process [2023-11-28 23:56:36,888 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-28 23:56:36,898 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-28 23:56:36,899 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-28 23:56:36,899 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-28 23:56:36,899 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-28 23:56:36,900 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-28 23:56:36,900 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-28 23:56:36,904 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-28 23:56:36,907 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Ended with exit code 0 [2023-11-28 23:56:36,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-28 23:56:36,907 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 23:56:36,908 INFO L229 MonitoredProcess]: Starting monitored process 73 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-28 23:56:36,909 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Waiting until timeout for monitored process [2023-11-28 23:56:36,910 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-28 23:56:36,921 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-28 23:56:36,922 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-28 23:56:36,922 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-28 23:56:36,922 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-28 23:56:36,930 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-28 23:56:36,930 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-28 23:56:36,957 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-11-28 23:56:36,989 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2023-11-28 23:56:36,989 INFO L444 ModelExtractionUtils]: 7 out of 37 variables were initially zero. Simplification set additionally 27 variables to zero. [2023-11-28 23:56:36,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-28 23:56:36,990 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 23:56:36,991 INFO L229 MonitoredProcess]: Starting monitored process 74 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-28 23:56:36,992 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Waiting until timeout for monitored process [2023-11-28 23:56:36,993 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-11-28 23:56:37,005 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-11-28 23:56:37,005 INFO L513 LassoAnalysis]: Proved termination. [2023-11-28 23:56:37,005 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_lis_~i~0#1) = -2*ULTIMATE.start_lis_~i~0#1 + 3 Supporting invariants [] [2023-11-28 23:56:37,009 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Ended with exit code 0 [2023-11-28 23:56:37,145 INFO L156 tatePredicateManager]: 25 out of 28 supporting invariants were superfluous and have been removed [2023-11-28 23:56:37,175 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:56:37,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:56:37,210 INFO L262 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 21 conjunts are in the unsatisfiable core [2023-11-28 23:56:37,211 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:56:37,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:56:37,417 INFO L262 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-28 23:56:37,417 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:56:37,455 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-28 23:56:37,456 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.9 stem predicates 2 loop predicates [2023-11-28 23:56:37,456 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 71 states and 93 transitions. cyclomatic complexity: 28 Second operand has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 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-28 23:56:37,715 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 71 states and 93 transitions. cyclomatic complexity: 28. Second operand has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 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 81 states and 107 transitions. Complement of second has 14 states. [2023-11-28 23:56:37,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 9 stem states 1 non-accepting loop states 2 accepting loop states [2023-11-28 23:56:37,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 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-28 23:56:37,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 50 transitions. [2023-11-28 23:56:37,717 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 50 transitions. Stem has 25 letters. Loop has 3 letters. [2023-11-28 23:56:37,717 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-28 23:56:37,717 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 50 transitions. Stem has 28 letters. Loop has 3 letters. [2023-11-28 23:56:37,717 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-28 23:56:37,717 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 50 transitions. Stem has 25 letters. Loop has 6 letters. [2023-11-28 23:56:37,718 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-28 23:56:37,718 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 81 states and 107 transitions. [2023-11-28 23:56:37,718 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2023-11-28 23:56:37,720 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 81 states to 58 states and 77 transitions. [2023-11-28 23:56:37,720 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2023-11-28 23:56:37,720 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2023-11-28 23:56:37,720 INFO L73 IsDeterministic]: Start isDeterministic. Operand 58 states and 77 transitions. [2023-11-28 23:56:37,720 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-28 23:56:37,720 INFO L218 hiAutomatonCegarLoop]: Abstraction has 58 states and 77 transitions. [2023-11-28 23:56:37,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states and 77 transitions. [2023-11-28 23:56:37,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 55. [2023-11-28 23:56:37,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 55 states have (on average 1.3272727272727274) internal successors, (73), 54 states have internal predecessors, (73), 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-28 23:56:37,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 73 transitions. [2023-11-28 23:56:37,724 INFO L240 hiAutomatonCegarLoop]: Abstraction has 55 states and 73 transitions. [2023-11-28 23:56:37,724 INFO L428 stractBuchiCegarLoop]: Abstraction has 55 states and 73 transitions. [2023-11-28 23:56:37,724 INFO L335 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2023-11-28 23:56:37,724 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 55 states and 73 transitions. [2023-11-28 23:56:37,725 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2023-11-28 23:56:37,725 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-28 23:56:37,725 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-28 23:56:37,726 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:56:37,726 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:56:37,726 INFO L748 eck$LassoCheckResult]: Stem: 2272#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2256#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet19#1, main_#t~post18#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet16#1;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 2257#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 2247#L530-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0; 2239#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet19#1;call write~int#2(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 2240#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 2284#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet19#1;call write~int#2(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 2255#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 2241#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet19#1;call write~int#2(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 2242#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 2276#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 2270#L535-4 havoc main_~i~1#1;assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0; 2271#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#1(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#0(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 2258#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 2259#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#1(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#0(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 2275#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 2282#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#1(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#0(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 2278#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 2277#L517-3 assume !(lis_~i~0#1 < lis_~N#1); 2273#L517-4 lis_~i~0#1 := 1; 2260#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 2243#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 2244#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 2264#L521-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int#1(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int#0(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 2249#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 2263#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 2252#L519-2 [2023-11-28 23:56:37,727 INFO L750 eck$LassoCheckResult]: Loop: 2252#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 2253#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 2280#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 2286#L521 assume !lis_#t~short11#1; 2292#L521-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 2289#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 2285#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 2252#L519-2 [2023-11-28 23:56:37,727 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:56:37,727 INFO L85 PathProgramCache]: Analyzing trace with hash 1035299872, now seen corresponding path program 2 times [2023-11-28 23:56:37,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:56:37,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472858544] [2023-11-28 23:56:37,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:56:37,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:56:37,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-28 23:56:37,768 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-28 23:56:37,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-28 23:56:37,803 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-28 23:56:37,804 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:56:37,804 INFO L85 PathProgramCache]: Analyzing trace with hash 782608452, now seen corresponding path program 2 times [2023-11-28 23:56:37,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:56:37,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591195169] [2023-11-28 23:56:37,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:56:37,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:56:37,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-28 23:56:37,808 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-28 23:56:37,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-28 23:56:37,812 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-28 23:56:37,813 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:56:37,813 INFO L85 PathProgramCache]: Analyzing trace with hash -1635570875, now seen corresponding path program 1 times [2023-11-28 23:56:37,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:56:37,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19834086] [2023-11-28 23:56:37,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:56:37,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:56:37,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:56:37,949 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-11-28 23:56:37,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:56:37,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19834086] [2023-11-28 23:56:37,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19834086] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 23:56:37,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [239210573] [2023-11-28 23:56:37,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:56:37,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-28 23:56:37,950 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 23:56:37,951 INFO L229 MonitoredProcess]: Starting monitored process 75 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-28 23:56:37,954 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (75)] Waiting until timeout for monitored process [2023-11-28 23:56:38,073 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Ended with exit code 0 [2023-11-28 23:56:38,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:56:38,093 INFO L262 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-28 23:56:38,094 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:56:38,140 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-11-28 23:56:38,140 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 23:56:38,175 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-11-28 23:56:38,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [239210573] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-28 23:56:38,175 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-28 23:56:38,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2023-11-28 23:56:38,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412944587] [2023-11-28 23:56:38,175 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-28 23:56:38,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:56:38,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-28 23:56:38,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2023-11-28 23:56:38,242 INFO L87 Difference]: Start difference. First operand 55 states and 73 transitions. cyclomatic complexity: 23 Second operand has 10 states, 9 states have (on average 4.888888888888889) internal successors, (44), 10 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-28 23:56:38,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 23:56:38,333 INFO L93 Difference]: Finished difference Result 73 states and 96 transitions. [2023-11-28 23:56:38,333 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 73 states and 96 transitions. [2023-11-28 23:56:38,334 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2023-11-28 23:56:38,334 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 73 states to 49 states and 62 transitions. [2023-11-28 23:56:38,335 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2023-11-28 23:56:38,335 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2023-11-28 23:56:38,335 INFO L73 IsDeterministic]: Start isDeterministic. Operand 49 states and 62 transitions. [2023-11-28 23:56:38,335 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:56:38,335 INFO L218 hiAutomatonCegarLoop]: Abstraction has 49 states and 62 transitions. [2023-11-28 23:56:38,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states and 62 transitions. [2023-11-28 23:56:38,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 44. [2023-11-28 23:56:38,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 44 states have (on average 1.25) internal successors, (55), 43 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-28 23:56:38,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 55 transitions. [2023-11-28 23:56:38,337 INFO L240 hiAutomatonCegarLoop]: Abstraction has 44 states and 55 transitions. [2023-11-28 23:56:38,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-28 23:56:38,339 INFO L428 stractBuchiCegarLoop]: Abstraction has 44 states and 55 transitions. [2023-11-28 23:56:38,339 INFO L335 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2023-11-28 23:56:38,339 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 55 transitions. [2023-11-28 23:56:38,339 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16 [2023-11-28 23:56:38,339 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-28 23:56:38,340 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-28 23:56:38,340 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:56:38,340 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 1, 1, 1, 1, 1] [2023-11-28 23:56:38,341 INFO L748 eck$LassoCheckResult]: Stem: 2602#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2589#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet19#1, main_#t~post18#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet16#1;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 2590#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 2584#L530-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0; 2578#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet19#1;call write~int#2(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 2579#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 2580#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet19#1;call write~int#2(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 2581#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 2611#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet19#1;call write~int#2(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 2609#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 2608#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 2600#L535-4 havoc main_~i~1#1;assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0; 2601#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#1(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#0(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 2591#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 2592#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#1(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#0(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 2605#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 2610#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#1(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#0(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 2607#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 2606#L517-3 assume !(lis_~i~0#1 < lis_~N#1); 2603#L517-4 lis_~i~0#1 := 1; 2594#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 2595#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 2621#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 2619#L521-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int#1(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int#0(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 2618#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 2613#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 2587#L519-2 [2023-11-28 23:56:38,341 INFO L750 eck$LassoCheckResult]: Loop: 2587#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 2588#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 2612#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 2617#L521 assume !lis_#t~short11#1; 2615#L521-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 2593#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 2582#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 2583#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 2596#L521-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 2586#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 2614#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 2587#L519-2 [2023-11-28 23:56:38,341 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:56:38,341 INFO L85 PathProgramCache]: Analyzing trace with hash 1035299872, now seen corresponding path program 3 times [2023-11-28 23:56:38,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:56:38,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313363684] [2023-11-28 23:56:38,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:56:38,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:56:38,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-28 23:56:38,377 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-28 23:56:38,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-28 23:56:38,407 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-28 23:56:38,408 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:56:38,408 INFO L85 PathProgramCache]: Analyzing trace with hash -1752792449, now seen corresponding path program 1 times [2023-11-28 23:56:38,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:56:38,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770494417] [2023-11-28 23:56:38,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:56:38,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:56:38,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-28 23:56:38,415 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-28 23:56:38,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-28 23:56:38,421 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-28 23:56:38,421 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:56:38,422 INFO L85 PathProgramCache]: Analyzing trace with hash 116956416, now seen corresponding path program 2 times [2023-11-28 23:56:38,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:56:38,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390071807] [2023-11-28 23:56:38,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:56:38,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:56:38,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:56:39,471 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 10 proven. 18 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-28 23:56:39,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:56:39,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390071807] [2023-11-28 23:56:39,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390071807] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 23:56:39,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [563036564] [2023-11-28 23:56:39,472 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-28 23:56:39,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-28 23:56:39,472 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 23:56:39,473 INFO L229 MonitoredProcess]: Starting monitored process 76 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-28 23:56:39,479 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (76)] Waiting until timeout for monitored process [2023-11-28 23:56:39,609 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-28 23:56:39,609 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-28 23:56:39,611 INFO L262 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 32 conjunts are in the unsatisfiable core [2023-11-28 23:56:39,617 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:56:39,656 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-28 23:56:39,716 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-11-28 23:56:39,922 INFO L349 Elim1Store]: treesize reduction 24, result has 47.8 percent of original size [2023-11-28 23:56:39,922 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 43 treesize of output 47 [2023-11-28 23:56:40,279 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 23:56:40,280 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 35 [2023-11-28 23:56:40,323 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 6 proven. 23 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-28 23:56:40,323 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 23:56:40,878 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 97 treesize of output 89 [2023-11-28 23:56:40,918 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2023-11-28 23:56:40,918 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 343 treesize of output 274 [2023-11-28 23:56:41,254 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 7 proven. 22 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-28 23:56:41,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [563036564] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-28 23:56:41,255 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-28 23:56:41,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14, 14] total 40 [2023-11-28 23:56:41,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540702629] [2023-11-28 23:56:41,256 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-28 23:56:41,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:56:41,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2023-11-28 23:56:41,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=1390, Unknown=0, NotChecked=0, Total=1560 [2023-11-28 23:56:41,509 INFO L87 Difference]: Start difference. First operand 44 states and 55 transitions. cyclomatic complexity: 15 Second operand has 40 states, 40 states have (on average 2.1) internal successors, (84), 40 states have internal predecessors, (84), 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-28 23:56:53,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 23:56:53,383 INFO L93 Difference]: Finished difference Result 340 states and 448 transitions. [2023-11-28 23:56:53,383 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 340 states and 448 transitions. [2023-11-28 23:56:53,384 INFO L131 ngComponentsAnalysis]: Automaton has 17 accepting balls. 161 [2023-11-28 23:56:53,386 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 340 states to 340 states and 448 transitions. [2023-11-28 23:56:53,386 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 327 [2023-11-28 23:56:53,387 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 327 [2023-11-28 23:56:53,387 INFO L73 IsDeterministic]: Start isDeterministic. Operand 340 states and 448 transitions. [2023-11-28 23:56:53,388 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:56:53,388 INFO L218 hiAutomatonCegarLoop]: Abstraction has 340 states and 448 transitions. [2023-11-28 23:56:53,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states and 448 transitions. [2023-11-28 23:56:53,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 118. [2023-11-28 23:56:53,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 118 states have (on average 1.3305084745762712) internal successors, (157), 117 states have internal predecessors, (157), 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-28 23:56:53,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 157 transitions. [2023-11-28 23:56:53,392 INFO L240 hiAutomatonCegarLoop]: Abstraction has 118 states and 157 transitions. [2023-11-28 23:56:53,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 161 states. [2023-11-28 23:56:53,394 INFO L428 stractBuchiCegarLoop]: Abstraction has 118 states and 157 transitions. [2023-11-28 23:56:53,394 INFO L335 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2023-11-28 23:56:53,394 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 118 states and 157 transitions. [2023-11-28 23:56:53,395 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 40 [2023-11-28 23:56:53,395 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-28 23:56:53,395 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-28 23:56:53,396 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:56:53,396 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2023-11-28 23:56:53,396 INFO L748 eck$LassoCheckResult]: Stem: 3560#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 3547#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet19#1, main_#t~post18#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet16#1;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 3548#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 3541#L530-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0; 3535#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet19#1;call write~int#2(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 3536#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 3537#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet19#1;call write~int#2(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 3538#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 3546#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet19#1;call write~int#2(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 3565#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 3564#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 3558#L535-4 havoc main_~i~1#1;assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0; 3559#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#1(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#0(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 3549#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 3550#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#1(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#0(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 3563#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 3568#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#1(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#0(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 3567#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 3566#L517-3 assume !(lis_~i~0#1 < lis_~N#1); 3561#L517-4 lis_~i~0#1 := 1; 3552#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 3553#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 3593#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 3594#L521-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 3605#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 3601#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 3602#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 3597#L519-3 assume !(lis_~i~0#1 < lis_~N#1); 3562#L519-4 lis_~i~0#1 := 0; 3554#L523-3 [2023-11-28 23:56:53,396 INFO L750 eck$LassoCheckResult]: Loop: 3554#L523-3 assume !!(lis_~i~0#1 < lis_~N#1);call lis_#t~mem14#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4); 3555#L524 assume lis_~max~0#1 < lis_#t~mem14#1;havoc lis_#t~mem14#1;call lis_#t~mem15#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);lis_~max~0#1 := lis_#t~mem15#1;havoc lis_#t~mem15#1; 3557#L523-2 lis_#t~post13#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post13#1;havoc lis_#t~post13#1; 3554#L523-3 [2023-11-28 23:56:53,396 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:56:53,396 INFO L85 PathProgramCache]: Analyzing trace with hash 515661155, now seen corresponding path program 1 times [2023-11-28 23:56:53,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:56:53,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15267937] [2023-11-28 23:56:53,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:56:53,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:56:53,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:56:53,516 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-28 23:56:53,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:56:53,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15267937] [2023-11-28 23:56:53,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15267937] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 23:56:53,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [494655769] [2023-11-28 23:56:53,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:56:53,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-28 23:56:53,517 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 23:56:53,519 INFO L229 MonitoredProcess]: Starting monitored process 77 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-28 23:56:53,524 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (77)] Waiting until timeout for monitored process [2023-11-28 23:56:53,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:56:53,633 INFO L262 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-28 23:56:53,635 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:56:53,708 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-28 23:56:53,708 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 23:56:53,777 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-28 23:56:53,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [494655769] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-28 23:56:53,777 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-28 23:56:53,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13 [2023-11-28 23:56:53,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886577876] [2023-11-28 23:56:53,778 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-28 23:56:53,778 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-28 23:56:53,778 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:56:53,778 INFO L85 PathProgramCache]: Analyzing trace with hash 111317, now seen corresponding path program 3 times [2023-11-28 23:56:53,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:56:53,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079880790] [2023-11-28 23:56:53,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:56:53,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:56:53,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-28 23:56:53,782 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-28 23:56:53,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-28 23:56:53,785 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-28 23:56:53,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:56:53,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-28 23:56:53,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2023-11-28 23:56:53,833 INFO L87 Difference]: Start difference. First operand 118 states and 157 transitions. cyclomatic complexity: 46 Second operand has 13 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 13 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:56:53,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 23:56:53,990 INFO L93 Difference]: Finished difference Result 138 states and 182 transitions. [2023-11-28 23:56:53,990 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 138 states and 182 transitions. [2023-11-28 23:56:53,991 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 50 [2023-11-28 23:56:53,992 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 138 states to 138 states and 182 transitions. [2023-11-28 23:56:53,992 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 126 [2023-11-28 23:56:53,992 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 126 [2023-11-28 23:56:53,993 INFO L73 IsDeterministic]: Start isDeterministic. Operand 138 states and 182 transitions. [2023-11-28 23:56:53,993 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:56:53,993 INFO L218 hiAutomatonCegarLoop]: Abstraction has 138 states and 182 transitions. [2023-11-28 23:56:53,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states and 182 transitions. [2023-11-28 23:56:53,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 118. [2023-11-28 23:56:53,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 118 states have (on average 1.305084745762712) internal successors, (154), 117 states have internal predecessors, (154), 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-28 23:56:53,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 154 transitions. [2023-11-28 23:56:53,997 INFO L240 hiAutomatonCegarLoop]: Abstraction has 118 states and 154 transitions. [2023-11-28 23:56:53,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-28 23:56:53,998 INFO L428 stractBuchiCegarLoop]: Abstraction has 118 states and 154 transitions. [2023-11-28 23:56:53,998 INFO L335 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2023-11-28 23:56:53,998 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 118 states and 154 transitions. [2023-11-28 23:56:53,998 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 40 [2023-11-28 23:56:53,999 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-28 23:56:53,999 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-28 23:56:53,999 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:56:54,000 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 1, 1, 1, 1, 1] [2023-11-28 23:56:54,000 INFO L748 eck$LassoCheckResult]: Stem: 4012#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 3998#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet19#1, main_#t~post18#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet16#1;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 3999#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 3993#L530-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0; 3987#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet19#1;call write~int#2(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 3988#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 3989#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet19#1;call write~int#2(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 3990#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 4023#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet19#1;call write~int#2(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 4018#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 4017#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 4010#L535-4 havoc main_~i~1#1;assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0; 4011#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#1(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#0(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 4000#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 4001#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#1(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#0(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 4016#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 4024#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#1(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#0(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 4020#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 4019#L517-3 assume !(lis_~i~0#1 < lis_~N#1); 4013#L517-4 lis_~i~0#1 := 1; 4014#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 4036#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 4035#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 4033#L521-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int#1(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int#0(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 4029#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 4030#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 3996#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 3997#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 4063#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 4064#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 4073#L521-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int#1(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int#0(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 4074#L520-2 [2023-11-28 23:56:54,000 INFO L750 eck$LassoCheckResult]: Loop: 4074#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 4104#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 4039#L521 assume !lis_#t~short11#1; 4042#L521-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 4043#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 4037#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 4038#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 4021#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 4022#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 4004#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 4005#L521-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 4074#L520-2 [2023-11-28 23:56:54,000 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:56:54,001 INFO L85 PathProgramCache]: Analyzing trace with hash -1856448556, now seen corresponding path program 1 times [2023-11-28 23:56:54,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:56:54,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546434860] [2023-11-28 23:56:54,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:56:54,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:56:54,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-28 23:56:54,037 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-28 23:56:54,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-28 23:56:54,073 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-28 23:56:54,074 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:56:54,074 INFO L85 PathProgramCache]: Analyzing trace with hash -1946508565, now seen corresponding path program 2 times [2023-11-28 23:56:54,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:56:54,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422151526] [2023-11-28 23:56:54,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:56:54,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:56:54,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-28 23:56:54,081 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-28 23:56:54,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-28 23:56:54,087 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-28 23:56:54,088 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:56:54,088 INFO L85 PathProgramCache]: Analyzing trace with hash -1125074632, now seen corresponding path program 3 times [2023-11-28 23:56:54,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:56:54,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663607537] [2023-11-28 23:56:54,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:56:54,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:56:54,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:56:54,307 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 12 proven. 24 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-28 23:56:54,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:56:54,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663607537] [2023-11-28 23:56:54,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663607537] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 23:56:54,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1399042730] [2023-11-28 23:56:54,307 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-28 23:56:54,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-28 23:56:54,308 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 23:56:54,311 INFO L229 MonitoredProcess]: Starting monitored process 78 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-28 23:56:54,312 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (78)] Waiting until timeout for monitored process [2023-11-28 23:56:54,583 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-11-28 23:56:54,583 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-28 23:56:54,585 INFO L262 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-28 23:56:54,586 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:56:54,721 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 11 proven. 26 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-28 23:56:54,721 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 23:56:54,825 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 11 proven. 26 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-28 23:56:54,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1399042730] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-28 23:56:54,825 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-28 23:56:54,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 12] total 20 [2023-11-28 23:56:54,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394569863] [2023-11-28 23:56:54,825 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-28 23:56:55,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:56:55,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-11-28 23:56:55,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2023-11-28 23:56:55,087 INFO L87 Difference]: Start difference. First operand 118 states and 154 transitions. cyclomatic complexity: 43 Second operand has 20 states, 20 states have (on average 3.75) internal successors, (75), 20 states have internal predecessors, (75), 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-28 23:56:55,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 23:56:55,306 INFO L93 Difference]: Finished difference Result 215 states and 281 transitions. [2023-11-28 23:56:55,306 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 215 states and 281 transitions. [2023-11-28 23:56:55,307 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 61 [2023-11-28 23:56:55,309 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 215 states to 215 states and 281 transitions. [2023-11-28 23:56:55,309 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 194 [2023-11-28 23:56:55,309 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 194 [2023-11-28 23:56:55,309 INFO L73 IsDeterministic]: Start isDeterministic. Operand 215 states and 281 transitions. [2023-11-28 23:56:55,309 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:56:55,309 INFO L218 hiAutomatonCegarLoop]: Abstraction has 215 states and 281 transitions. [2023-11-28 23:56:55,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states and 281 transitions. [2023-11-28 23:56:55,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 187. [2023-11-28 23:56:55,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 187 states have (on average 1.2941176470588236) internal successors, (242), 186 states have internal predecessors, (242), 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-28 23:56:55,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 242 transitions. [2023-11-28 23:56:55,314 INFO L240 hiAutomatonCegarLoop]: Abstraction has 187 states and 242 transitions. [2023-11-28 23:56:55,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-28 23:56:55,316 INFO L428 stractBuchiCegarLoop]: Abstraction has 187 states and 242 transitions. [2023-11-28 23:56:55,316 INFO L335 stractBuchiCegarLoop]: ======== Iteration 16 ============ [2023-11-28 23:56:55,316 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 187 states and 242 transitions. [2023-11-28 23:56:55,317 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 49 [2023-11-28 23:56:55,317 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-28 23:56:55,317 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-28 23:56:55,317 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:56:55,318 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 1, 1, 1] [2023-11-28 23:56:55,318 INFO L748 eck$LassoCheckResult]: Stem: 4635#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 4623#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet19#1, main_#t~post18#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet16#1;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 4624#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 4617#L530-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0; 4611#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet19#1;call write~int#2(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 4612#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 4649#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet19#1;call write~int#2(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 4652#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 4613#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet19#1;call write~int#2(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 4614#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 4620#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet19#1;call write~int#2(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 4644#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 4643#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 4645#L535-4 havoc main_~i~1#1;assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0; 4639#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#1(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#0(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 4640#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 4641#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#1(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#0(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 4642#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 4654#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#1(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#0(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 4648#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 4646#L517-3 assume !(lis_~i~0#1 < lis_~N#1); 4647#L517-4 lis_~i~0#1 := 1; 4672#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 4673#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 4667#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 4668#L521-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int#1(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int#0(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 4704#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 4705#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 4700#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 4701#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 4696#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 4697#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 4764#L521-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int#1(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int#0(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 4710#L520-2 [2023-11-28 23:56:55,318 INFO L750 eck$LassoCheckResult]: Loop: 4710#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 4759#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 4746#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 4752#L521-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 4750#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 4745#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 4743#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 4741#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 4738#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 4736#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 4709#L521-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 4710#L520-2 [2023-11-28 23:56:55,318 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:56:55,318 INFO L85 PathProgramCache]: Analyzing trace with hash -217563726, now seen corresponding path program 2 times [2023-11-28 23:56:55,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:56:55,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994908477] [2023-11-28 23:56:55,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:56:55,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:56:55,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:56:55,514 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 4 proven. 21 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-28 23:56:55,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:56:55,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994908477] [2023-11-28 23:56:55,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994908477] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 23:56:55,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1701638754] [2023-11-28 23:56:55,515 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-28 23:56:55,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-28 23:56:55,515 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 23:56:55,518 INFO L229 MonitoredProcess]: Starting monitored process 79 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-28 23:56:55,519 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (79)] Waiting until timeout for monitored process [2023-11-28 23:56:55,655 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-28 23:56:55,655 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-28 23:56:55,657 INFO L262 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-28 23:56:55,658 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:56:55,744 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-28 23:56:55,744 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 23:56:55,823 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-28 23:56:55,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1701638754] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-28 23:56:55,823 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-28 23:56:55,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2023-11-28 23:56:55,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935419168] [2023-11-28 23:56:55,823 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-28 23:56:55,824 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-28 23:56:55,824 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:56:55,824 INFO L85 PathProgramCache]: Analyzing trace with hash 1668400361, now seen corresponding path program 4 times [2023-11-28 23:56:55,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:56:55,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535606771] [2023-11-28 23:56:55,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:56:55,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:56:55,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-28 23:56:55,831 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-28 23:56:55,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-28 23:56:55,839 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-28 23:56:56,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:56:56,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-28 23:56:56,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2023-11-28 23:56:56,211 INFO L87 Difference]: Start difference. First operand 187 states and 242 transitions. cyclomatic complexity: 65 Second operand has 17 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 17 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-28 23:56:56,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 23:56:56,430 INFO L93 Difference]: Finished difference Result 194 states and 250 transitions. [2023-11-28 23:56:56,431 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 194 states and 250 transitions. [2023-11-28 23:56:56,432 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 52 [2023-11-28 23:56:56,434 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 194 states to 194 states and 250 transitions. [2023-11-28 23:56:56,434 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 171 [2023-11-28 23:56:56,434 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 171 [2023-11-28 23:56:56,434 INFO L73 IsDeterministic]: Start isDeterministic. Operand 194 states and 250 transitions. [2023-11-28 23:56:56,434 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:56:56,434 INFO L218 hiAutomatonCegarLoop]: Abstraction has 194 states and 250 transitions. [2023-11-28 23:56:56,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states and 250 transitions. [2023-11-28 23:56:56,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 189. [2023-11-28 23:56:56,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 189 states have (on average 1.291005291005291) internal successors, (244), 188 states have internal predecessors, (244), 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-28 23:56:56,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 244 transitions. [2023-11-28 23:56:56,440 INFO L240 hiAutomatonCegarLoop]: Abstraction has 189 states and 244 transitions. [2023-11-28 23:56:56,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-28 23:56:56,441 INFO L428 stractBuchiCegarLoop]: Abstraction has 189 states and 244 transitions. [2023-11-28 23:56:56,441 INFO L335 stractBuchiCegarLoop]: ======== Iteration 17 ============ [2023-11-28 23:56:56,441 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 189 states and 244 transitions. [2023-11-28 23:56:56,442 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 49 [2023-11-28 23:56:56,442 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-28 23:56:56,442 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-28 23:56:56,442 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:56:56,442 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2023-11-28 23:56:56,443 INFO L748 eck$LassoCheckResult]: Stem: 5242#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 5229#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet19#1, main_#t~post18#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet16#1;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 5230#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 5222#L530-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0; 5216#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet19#1;call write~int#2(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 5217#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 5254#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet19#1;call write~int#2(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 5257#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 5218#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet19#1;call write~int#2(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 5219#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 5249#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 5250#L535-4 havoc main_~i~1#1;assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0; 5246#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#1(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#0(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 5231#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 5232#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#1(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#0(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 5260#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 5261#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#1(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#0(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 5255#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 5256#L517-3 assume !(lis_~i~0#1 < lis_~N#1); 5243#L517-4 lis_~i~0#1 := 1; 5244#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 5279#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 5280#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 5273#L521-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 5274#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 5404#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 5403#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 5402#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 5401#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 5400#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 5386#L521-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 5224#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 5396#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 5269#L521 [2023-11-28 23:56:56,443 INFO L750 eck$LassoCheckResult]: Loop: 5269#L521 assume !lis_#t~short11#1; 5236#L521-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 5285#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 5267#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 5269#L521 [2023-11-28 23:56:56,443 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:56:56,443 INFO L85 PathProgramCache]: Analyzing trace with hash -2028657465, now seen corresponding path program 2 times [2023-11-28 23:56:56,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:56:56,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155540224] [2023-11-28 23:56:56,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:56:56,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:56:56,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:56:57,416 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-28 23:56:57,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:56:57,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155540224] [2023-11-28 23:56:57,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155540224] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 23:56:57,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [728442825] [2023-11-28 23:56:57,417 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-28 23:56:57,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-28 23:56:57,417 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 23:56:57,418 INFO L229 MonitoredProcess]: Starting monitored process 80 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-28 23:56:57,431 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (80)] Waiting until timeout for monitored process [2023-11-28 23:56:57,557 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-28 23:56:57,557 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-28 23:56:57,559 INFO L262 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 25 conjunts are in the unsatisfiable core [2023-11-28 23:56:57,561 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:56:57,585 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-28 23:56:57,631 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-11-28 23:56:57,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:56:57,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:56:57,677 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 23:56:57,677 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2023-11-28 23:57:44,053 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-11-28 23:57:44,053 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 23:57:44,339 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 59 treesize of output 55 [2023-11-28 23:57:44,345 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 23:57:44,345 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 428 treesize of output 380 [2023-11-28 23:57:44,425 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-11-28 23:57:44,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [728442825] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-28 23:57:44,426 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-28 23:57:44,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 11, 11] total 33 [2023-11-28 23:57:44,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495595625] [2023-11-28 23:57:44,426 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-28 23:57:44,426 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-28 23:57:44,427 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:57:44,427 INFO L85 PathProgramCache]: Analyzing trace with hash 2715002, now seen corresponding path program 1 times [2023-11-28 23:57:44,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:57:44,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565415232] [2023-11-28 23:57:44,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:57:44,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:57:44,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-28 23:57:44,431 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-28 23:57:44,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-28 23:57:44,435 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-28 23:57:44,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:57:44,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-11-28 23:57:44,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=870, Unknown=3, NotChecked=0, Total=1056 [2023-11-28 23:57:44,564 INFO L87 Difference]: Start difference. First operand 189 states and 244 transitions. cyclomatic complexity: 65 Second operand has 33 states, 33 states have (on average 1.8181818181818181) internal successors, (60), 33 states have internal predecessors, (60), 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-28 23:58:16,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 23:58:16,630 INFO L93 Difference]: Finished difference Result 224 states and 292 transitions. [2023-11-28 23:58:16,630 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 224 states and 292 transitions. [2023-11-28 23:58:16,632 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 77 [2023-11-28 23:58:16,634 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 224 states to 224 states and 292 transitions. [2023-11-28 23:58:16,634 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 202 [2023-11-28 23:58:16,634 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 202 [2023-11-28 23:58:16,634 INFO L73 IsDeterministic]: Start isDeterministic. Operand 224 states and 292 transitions. [2023-11-28 23:58:16,635 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:58:16,635 INFO L218 hiAutomatonCegarLoop]: Abstraction has 224 states and 292 transitions. [2023-11-28 23:58:16,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states and 292 transitions. [2023-11-28 23:58:16,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 169. [2023-11-28 23:58:16,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 169 states have (on average 1.2840236686390532) internal successors, (217), 168 states have internal predecessors, (217), 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-28 23:58:16,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 217 transitions. [2023-11-28 23:58:16,640 INFO L240 hiAutomatonCegarLoop]: Abstraction has 169 states and 217 transitions. [2023-11-28 23:58:16,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-28 23:58:16,641 INFO L428 stractBuchiCegarLoop]: Abstraction has 169 states and 217 transitions. [2023-11-28 23:58:16,641 INFO L335 stractBuchiCegarLoop]: ======== Iteration 18 ============ [2023-11-28 23:58:16,641 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 169 states and 217 transitions. [2023-11-28 23:58:16,642 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 49 [2023-11-28 23:58:16,642 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-28 23:58:16,642 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-28 23:58:16,643 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:58:16,643 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2023-11-28 23:58:16,643 INFO L748 eck$LassoCheckResult]: Stem: 5913#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 5902#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet19#1, main_#t~post18#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet16#1;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 5903#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 5897#L530-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0; 5891#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet19#1;call write~int#2(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 5892#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 5893#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet19#1;call write~int#2(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 5894#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 5929#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet19#1;call write~int#2(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 5930#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 5920#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 5922#L535-4 havoc main_~i~1#1;assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0; 5917#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#1(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#0(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 5918#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 5934#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#1(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#0(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 5935#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 5931#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#1(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#0(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 5925#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 5923#L517-3 assume !(lis_~i~0#1 < lis_~N#1); 5924#L517-4 lis_~i~0#1 := 1; 5952#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 5953#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 5947#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 5948#L521-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int#1(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int#0(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 5995#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 5993#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 5991#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 5989#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 5987#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 5983#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 5976#L521-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int#1(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int#0(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 5978#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 5970#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 5966#L521 [2023-11-28 23:58:16,643 INFO L750 eck$LassoCheckResult]: Loop: 5966#L521 assume !lis_#t~short11#1; 5968#L521-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 5965#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 5969#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 5966#L521 [2023-11-28 23:58:16,643 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:58:16,643 INFO L85 PathProgramCache]: Analyzing trace with hash -1635632377, now seen corresponding path program 3 times [2023-11-28 23:58:16,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:58:16,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290853807] [2023-11-28 23:58:16,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:58:16,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:58:16,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-28 23:58:16,686 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-28 23:58:16,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-28 23:58:16,720 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-28 23:58:16,721 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:58:16,721 INFO L85 PathProgramCache]: Analyzing trace with hash 2715002, now seen corresponding path program 2 times [2023-11-28 23:58:16,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:58:16,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354426937] [2023-11-28 23:58:16,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:58:16,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:58:16,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-28 23:58:16,726 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-28 23:58:16,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-28 23:58:16,729 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-28 23:58:16,730 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:58:16,730 INFO L85 PathProgramCache]: Analyzing trace with hash -848644736, now seen corresponding path program 4 times [2023-11-28 23:58:16,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:58:16,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34012806] [2023-11-28 23:58:16,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:58:16,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:58:16,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:58:16,966 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 1 proven. 26 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-11-28 23:58:16,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:58:16,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34012806] [2023-11-28 23:58:16,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34012806] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 23:58:16,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [654619604] [2023-11-28 23:58:16,967 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-28 23:58:16,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-28 23:58:16,967 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 23:58:16,971 INFO L229 MonitoredProcess]: Starting monitored process 81 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-28 23:58:16,971 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (81)] Waiting until timeout for monitored process [2023-11-28 23:58:17,129 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-28 23:58:17,129 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-28 23:58:17,131 INFO L262 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-28 23:58:17,132 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:58:17,235 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 6 proven. 13 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-11-28 23:58:17,235 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 23:58:17,303 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 6 proven. 13 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-11-28 23:58:17,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [654619604] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-28 23:58:17,304 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-28 23:58:17,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6, 6] total 16 [2023-11-28 23:58:17,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970083429] [2023-11-28 23:58:17,304 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-28 23:58:17,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:58:17,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-28 23:58:17,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2023-11-28 23:58:17,425 INFO L87 Difference]: Start difference. First operand 169 states and 217 transitions. cyclomatic complexity: 58 Second operand has 17 states, 16 states have (on average 4.0) internal successors, (64), 17 states have internal predecessors, (64), 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-28 23:58:17,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 23:58:17,756 INFO L93 Difference]: Finished difference Result 190 states and 233 transitions. [2023-11-28 23:58:17,756 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 190 states and 233 transitions. [2023-11-28 23:58:17,758 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 35 [2023-11-28 23:58:17,759 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 190 states to 190 states and 233 transitions. [2023-11-28 23:58:17,759 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 167 [2023-11-28 23:58:17,760 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 167 [2023-11-28 23:58:17,760 INFO L73 IsDeterministic]: Start isDeterministic. Operand 190 states and 233 transitions. [2023-11-28 23:58:17,760 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:58:17,761 INFO L218 hiAutomatonCegarLoop]: Abstraction has 190 states and 233 transitions. [2023-11-28 23:58:17,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states and 233 transitions. [2023-11-28 23:58:17,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 148. [2023-11-28 23:58:17,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 148 states have (on average 1.2364864864864864) internal successors, (183), 147 states have internal predecessors, (183), 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-28 23:58:17,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 183 transitions. [2023-11-28 23:58:17,766 INFO L240 hiAutomatonCegarLoop]: Abstraction has 148 states and 183 transitions. [2023-11-28 23:58:17,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-11-28 23:58:17,767 INFO L428 stractBuchiCegarLoop]: Abstraction has 148 states and 183 transitions. [2023-11-28 23:58:17,767 INFO L335 stractBuchiCegarLoop]: ======== Iteration 19 ============ [2023-11-28 23:58:17,768 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 148 states and 183 transitions. [2023-11-28 23:58:17,768 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 32 [2023-11-28 23:58:17,768 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-28 23:58:17,768 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-28 23:58:17,769 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:58:17,769 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2023-11-28 23:58:17,769 INFO L748 eck$LassoCheckResult]: Stem: 6543#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 6528#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet19#1, main_#t~post18#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet16#1;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 6529#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 6521#L530-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0; 6515#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet19#1;call write~int#2(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 6516#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 6553#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet19#1;call write~int#2(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 6554#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 6517#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet19#1;call write~int#2(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 6518#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 6559#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 6558#L535-4 havoc main_~i~1#1;assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0; 6547#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#1(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#0(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 6530#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 6531#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#1(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#0(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 6556#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 6555#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#1(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#0(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 6551#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 6550#L517-3 assume !(lis_~i~0#1 < lis_~N#1); 6544#L517-4 lis_~i~0#1 := 1; 6545#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 6572#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 6570#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 6571#L521-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int#1(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int#0(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 6564#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 6565#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 6524#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 6525#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 6592#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 6593#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 6618#L521-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 6581#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 6580#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 6577#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 6578#L521-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int#1(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int#0(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 6608#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 6607#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 6606#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 6552#L519-3 assume !(lis_~i~0#1 < lis_~N#1); 6546#L519-4 lis_~i~0#1 := 0; 6538#L523-3 [2023-11-28 23:58:17,770 INFO L750 eck$LassoCheckResult]: Loop: 6538#L523-3 assume !!(lis_~i~0#1 < lis_~N#1);call lis_#t~mem14#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4); 6539#L524 assume lis_~max~0#1 < lis_#t~mem14#1;havoc lis_#t~mem14#1;call lis_#t~mem15#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);lis_~max~0#1 := lis_#t~mem15#1;havoc lis_#t~mem15#1; 6540#L523-2 lis_#t~post13#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post13#1;havoc lis_#t~post13#1; 6538#L523-3 [2023-11-28 23:58:17,770 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:58:17,770 INFO L85 PathProgramCache]: Analyzing trace with hash 271857797, now seen corresponding path program 1 times [2023-11-28 23:58:17,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:58:17,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809278402] [2023-11-28 23:58:17,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:58:17,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:58:17,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:58:18,940 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 15 proven. 24 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-28 23:58:18,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:58:18,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809278402] [2023-11-28 23:58:18,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809278402] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 23:58:18,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2067443288] [2023-11-28 23:58:18,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:58:18,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-28 23:58:18,941 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 23:58:18,942 INFO L229 MonitoredProcess]: Starting monitored process 82 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-28 23:58:18,943 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (82)] Waiting until timeout for monitored process [2023-11-28 23:58:19,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:58:19,069 INFO L262 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 28 conjunts are in the unsatisfiable core [2023-11-28 23:58:19,071 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:58:19,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-28 23:58:19,172 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2023-11-28 23:58:19,382 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 23:58:19,383 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 45 treesize of output 37 [2023-11-28 23:58:19,585 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 23:58:19,585 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 41 treesize of output 15 [2023-11-28 23:58:19,622 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 15 proven. 15 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-11-28 23:58:19,622 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 23:58:20,162 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 89 treesize of output 81 [2023-11-28 23:58:20,169 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 23:58:20,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 311 treesize of output 263 [2023-11-28 23:58:20,198 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 16 proven. 14 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-11-28 23:58:20,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2067443288] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-28 23:58:20,199 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-28 23:58:20,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 14, 14] total 41 [2023-11-28 23:58:20,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486763035] [2023-11-28 23:58:20,199 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-28 23:58:20,199 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-28 23:58:20,200 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:58:20,200 INFO L85 PathProgramCache]: Analyzing trace with hash 111317, now seen corresponding path program 4 times [2023-11-28 23:58:20,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:58:20,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223477676] [2023-11-28 23:58:20,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:58:20,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:58:20,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-28 23:58:20,205 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-28 23:58:20,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-28 23:58:20,208 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-28 23:58:20,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:58:20,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2023-11-28 23:58:20,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=1470, Unknown=0, NotChecked=0, Total=1640 [2023-11-28 23:58:20,259 INFO L87 Difference]: Start difference. First operand 148 states and 183 transitions. cyclomatic complexity: 41 Second operand has 41 states, 41 states have (on average 1.9268292682926829) internal successors, (79), 41 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-28 23:58:27,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 23:58:27,832 INFO L93 Difference]: Finished difference Result 467 states and 599 transitions. [2023-11-28 23:58:27,833 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 467 states and 599 transitions. [2023-11-28 23:58:27,835 INFO L131 ngComponentsAnalysis]: Automaton has 23 accepting balls. 160 [2023-11-28 23:58:27,837 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 467 states to 467 states and 599 transitions. [2023-11-28 23:58:27,838 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 444 [2023-11-28 23:58:27,838 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 444 [2023-11-28 23:58:27,838 INFO L73 IsDeterministic]: Start isDeterministic. Operand 467 states and 599 transitions. [2023-11-28 23:58:27,838 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:58:27,838 INFO L218 hiAutomatonCegarLoop]: Abstraction has 467 states and 599 transitions. [2023-11-28 23:58:27,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states and 599 transitions. [2023-11-28 23:58:27,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 151. [2023-11-28 23:58:27,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 151 states have (on average 1.218543046357616) internal successors, (184), 150 states have internal predecessors, (184), 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-28 23:58:27,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 184 transitions. [2023-11-28 23:58:27,844 INFO L240 hiAutomatonCegarLoop]: Abstraction has 151 states and 184 transitions. [2023-11-28 23:58:27,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2023-11-28 23:58:27,845 INFO L428 stractBuchiCegarLoop]: Abstraction has 151 states and 184 transitions. [2023-11-28 23:58:27,845 INFO L335 stractBuchiCegarLoop]: ======== Iteration 20 ============ [2023-11-28 23:58:27,845 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 151 states and 184 transitions. [2023-11-28 23:58:27,846 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 32 [2023-11-28 23:58:27,846 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-28 23:58:27,846 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-28 23:58:27,846 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:58:27,847 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2023-11-28 23:58:27,847 INFO L748 eck$LassoCheckResult]: Stem: 7655#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 7643#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet19#1, main_#t~post18#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet16#1;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 7644#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 7636#L530-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0; 7630#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet19#1;call write~int#2(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 7631#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 7667#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet19#1;call write~int#2(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 7670#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 7632#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet19#1;call write~int#2(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 7633#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 7662#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 7663#L535-4 havoc main_~i~1#1;assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0; 7659#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#1(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#0(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 7660#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 7674#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#1(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#0(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 7675#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 7671#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#1(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#0(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 7668#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 7669#L517-3 assume !(lis_~i~0#1 < lis_~N#1); 7656#L517-4 lis_~i~0#1 := 1; 7657#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 7690#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 7691#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 7685#L521-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int#1(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int#0(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 7686#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 7679#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 7680#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 7647#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 7648#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 7730#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 7711#L521-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int#1(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int#0(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 7729#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 7728#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 7727#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 7726#L521-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int#1(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int#0(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 7700#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 7724#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 7639#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 7640#L519-3 assume !(lis_~i~0#1 < lis_~N#1); 7658#L519-4 lis_~i~0#1 := 0; 7649#L523-3 [2023-11-28 23:58:27,847 INFO L750 eck$LassoCheckResult]: Loop: 7649#L523-3 assume !!(lis_~i~0#1 < lis_~N#1);call lis_#t~mem14#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4); 7650#L524 assume lis_~max~0#1 < lis_#t~mem14#1;havoc lis_#t~mem14#1;call lis_#t~mem15#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);lis_~max~0#1 := lis_#t~mem15#1;havoc lis_#t~mem15#1; 7652#L523-2 lis_#t~post13#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post13#1;havoc lis_#t~post13#1; 7649#L523-3 [2023-11-28 23:58:27,847 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:58:27,847 INFO L85 PathProgramCache]: Analyzing trace with hash 664884807, now seen corresponding path program 2 times [2023-11-28 23:58:27,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:58:27,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88174631] [2023-11-28 23:58:27,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:58:27,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:58:27,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-28 23:58:27,890 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-28 23:58:27,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-28 23:58:27,924 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-28 23:58:27,925 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:58:27,925 INFO L85 PathProgramCache]: Analyzing trace with hash 111317, now seen corresponding path program 5 times [2023-11-28 23:58:27,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:58:27,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417990400] [2023-11-28 23:58:27,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:58:27,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:58:27,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-28 23:58:27,929 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-28 23:58:27,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-28 23:58:27,932 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-28 23:58:27,932 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:58:27,932 INFO L85 PathProgramCache]: Analyzing trace with hash -805802289, now seen corresponding path program 2 times [2023-11-28 23:58:27,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:58:27,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722502327] [2023-11-28 23:58:27,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:58:27,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:58:27,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-28 23:58:27,965 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-28 23:58:27,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-28 23:58:27,993 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-28 23:59:24,935 WARN L293 SmtUtils]: Spent 56.88s on a formula simplification. DAG size of input: 418 DAG size of output: 287 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2023-11-28 23:59:33,153 WARN L293 SmtUtils]: Spent 7.74s on a formula simplification. DAG size of input: 170 DAG size of output: 159 (called from [L 302] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2023-11-28 23:59:33,157 INFO L210 LassoAnalysis]: Preferences: [2023-11-28 23:59:33,157 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-28 23:59:33,157 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-28 23:59:33,157 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-28 23:59:33,158 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-11-28 23:59:33,158 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-28 23:59:33,158 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-28 23:59:33,158 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-28 23:59:33,158 INFO L133 ssoRankerPreferences]: Filename of dumped script: lis-alloca-1.i_Iteration20_Lasso [2023-11-28 23:59:33,158 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-28 23:59:33,158 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-28 23:59:33,162 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-28 23:59:33,164 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-28 23:59:33,166 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-28 23:59:33,167 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-28 23:59:33,170 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-28 23:59:33,171 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-28 23:59:33,172 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-28 23:59:33,174 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-28 23:59:33,176 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-28 23:59:33,177 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-28 23:59:34,928 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-28 23:59:34,929 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-28 23:59:34,931 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-28 23:59:34,932 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-28 23:59:34,933 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-28 23:59:34,935 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-28 23:59:34,936 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-28 23:59:34,937 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-28 23:59:34,938 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-28 23:59:34,940 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-28 23:59:34,942 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-28 23:59:34,944 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-28 23:59:34,945 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-28 23:59:34,947 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-28 23:59:34,948 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-28 23:59:34,950 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-28 23:59:35,576 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-28 23:59:35,576 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-11-28 23:59:35,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-28 23:59:35,577 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 23:59:35,578 INFO L229 MonitoredProcess]: Starting monitored process 83 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-28 23:59:35,578 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Waiting until timeout for monitored process [2023-11-28 23:59:35,580 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-28 23:59:35,590 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-28 23:59:35,590 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-28 23:59:35,590 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-28 23:59:35,590 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-28 23:59:35,591 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-28 23:59:35,591 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-28 23:59:35,591 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-28 23:59:35,592 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-28 23:59:35,594 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Ended with exit code 0 [2023-11-28 23:59:35,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-28 23:59:35,595 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 23:59:35,596 INFO L229 MonitoredProcess]: Starting monitored process 84 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-28 23:59:35,596 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Waiting until timeout for monitored process [2023-11-28 23:59:35,598 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-28 23:59:35,608 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-28 23:59:35,608 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-28 23:59:35,608 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-28 23:59:35,608 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-28 23:59:35,608 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-28 23:59:35,609 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-28 23:59:35,609 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-28 23:59:35,610 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-28 23:59:35,613 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Forceful destruction successful, exit code 0 [2023-11-28 23:59:35,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-28 23:59:35,613 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 23:59:35,614 INFO L229 MonitoredProcess]: Starting monitored process 85 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-28 23:59:35,615 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Waiting until timeout for monitored process [2023-11-28 23:59:35,616 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-28 23:59:35,626 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-28 23:59:35,626 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-28 23:59:35,626 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-28 23:59:35,626 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-28 23:59:35,626 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-28 23:59:35,627 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-28 23:59:35,627 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-28 23:59:35,628 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-28 23:59:35,630 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Forceful destruction successful, exit code 0 [2023-11-28 23:59:35,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-28 23:59:35,630 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 23:59:35,631 INFO L229 MonitoredProcess]: Starting monitored process 86 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-28 23:59:35,632 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Waiting until timeout for monitored process [2023-11-28 23:59:35,634 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-28 23:59:35,644 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-28 23:59:35,644 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-28 23:59:35,644 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-28 23:59:35,644 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-28 23:59:35,645 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-28 23:59:35,645 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-28 23:59:35,659 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-28 23:59:35,662 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Forceful destruction successful, exit code 0 [2023-11-28 23:59:35,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-28 23:59:35,662 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 23:59:35,663 INFO L229 MonitoredProcess]: Starting monitored process 87 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-28 23:59:35,664 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Waiting until timeout for monitored process [2023-11-28 23:59:35,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-28 23:59:35,675 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-28 23:59:35,675 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-28 23:59:35,675 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-28 23:59:35,675 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-28 23:59:35,676 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-28 23:59:35,676 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-28 23:59:35,676 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-28 23:59:35,677 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-28 23:59:35,679 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Forceful destruction successful, exit code 0 [2023-11-28 23:59:35,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-28 23:59:35,680 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 23:59:35,680 INFO L229 MonitoredProcess]: Starting monitored process 88 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-28 23:59:35,681 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Waiting until timeout for monitored process [2023-11-28 23:59:35,683 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-28 23:59:35,692 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-28 23:59:35,693 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-28 23:59:35,693 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-28 23:59:35,693 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-28 23:59:35,693 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-28 23:59:35,693 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-28 23:59:35,693 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-28 23:59:35,694 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-28 23:59:35,697 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Ended with exit code 0 [2023-11-28 23:59:35,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-28 23:59:35,697 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 23:59:35,698 INFO L229 MonitoredProcess]: Starting monitored process 89 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-28 23:59:35,698 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Waiting until timeout for monitored process [2023-11-28 23:59:35,700 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-28 23:59:35,710 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-28 23:59:35,710 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-28 23:59:35,710 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-28 23:59:35,710 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-28 23:59:35,710 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-28 23:59:35,710 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-28 23:59:35,711 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-28 23:59:35,712 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-28 23:59:35,714 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Forceful destruction successful, exit code 0 [2023-11-28 23:59:35,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-28 23:59:35,715 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 23:59:35,716 INFO L229 MonitoredProcess]: Starting monitored process 90 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-28 23:59:35,716 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Waiting until timeout for monitored process [2023-11-28 23:59:35,718 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-28 23:59:35,728 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-28 23:59:35,728 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-28 23:59:35,728 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-28 23:59:35,728 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-28 23:59:35,729 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-28 23:59:35,729 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-28 23:59:35,732 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-28 23:59:35,734 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Forceful destruction successful, exit code 0 [2023-11-28 23:59:35,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-28 23:59:35,735 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 23:59:35,735 INFO L229 MonitoredProcess]: Starting monitored process 91 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-28 23:59:35,737 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Waiting until timeout for monitored process [2023-11-28 23:59:35,737 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-28 23:59:35,747 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-28 23:59:35,748 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-28 23:59:35,748 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-28 23:59:35,748 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-28 23:59:35,748 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-28 23:59:35,748 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-28 23:59:35,748 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-28 23:59:35,749 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-28 23:59:35,752 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Ended with exit code 0 [2023-11-28 23:59:35,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-28 23:59:35,752 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 23:59:35,753 INFO L229 MonitoredProcess]: Starting monitored process 92 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-28 23:59:35,753 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Waiting until timeout for monitored process [2023-11-28 23:59:35,755 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-28 23:59:35,765 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-28 23:59:35,765 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-28 23:59:35,766 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-28 23:59:35,766 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-28 23:59:35,768 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-28 23:59:35,768 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-28 23:59:35,774 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-28 23:59:35,777 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Ended with exit code 0 [2023-11-28 23:59:35,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-28 23:59:35,777 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 23:59:35,778 INFO L229 MonitoredProcess]: Starting monitored process 93 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-28 23:59:35,779 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Waiting until timeout for monitored process [2023-11-28 23:59:35,780 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-28 23:59:35,791 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-28 23:59:35,791 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-28 23:59:35,791 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-28 23:59:35,791 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-28 23:59:35,792 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-28 23:59:35,793 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-28 23:59:35,798 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-28 23:59:35,801 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Forceful destruction successful, exit code 0 [2023-11-28 23:59:35,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-28 23:59:35,801 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 23:59:35,802 INFO L229 MonitoredProcess]: Starting monitored process 94 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-28 23:59:35,802 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Waiting until timeout for monitored process [2023-11-28 23:59:35,804 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-28 23:59:35,814 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-28 23:59:35,815 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-28 23:59:35,815 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-28 23:59:35,815 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-28 23:59:35,816 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-28 23:59:35,816 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-28 23:59:35,819 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-28 23:59:35,821 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Ended with exit code 0 [2023-11-28 23:59:35,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-28 23:59:35,821 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 23:59:35,822 INFO L229 MonitoredProcess]: Starting monitored process 95 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-28 23:59:35,823 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Waiting until timeout for monitored process [2023-11-28 23:59:35,824 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-28 23:59:35,834 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-28 23:59:35,834 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-28 23:59:35,834 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-28 23:59:35,835 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-28 23:59:35,836 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-28 23:59:35,836 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-28 23:59:35,839 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-28 23:59:35,841 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Ended with exit code 0 [2023-11-28 23:59:35,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-28 23:59:35,841 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 23:59:35,842 INFO L229 MonitoredProcess]: Starting monitored process 96 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-28 23:59:35,843 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Waiting until timeout for monitored process [2023-11-28 23:59:35,844 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-28 23:59:35,854 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-28 23:59:35,854 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-28 23:59:35,854 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-28 23:59:35,854 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-28 23:59:35,855 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-28 23:59:35,856 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-28 23:59:35,859 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-28 23:59:35,862 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Forceful destruction successful, exit code 0 [2023-11-28 23:59:35,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-28 23:59:35,862 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 23:59:35,863 INFO L229 MonitoredProcess]: Starting monitored process 97 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-28 23:59:35,864 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Waiting until timeout for monitored process [2023-11-28 23:59:35,865 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-28 23:59:35,875 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-28 23:59:35,875 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-28 23:59:35,875 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-28 23:59:35,875 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-28 23:59:35,877 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-28 23:59:35,877 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-28 23:59:35,883 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-28 23:59:35,886 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Ended with exit code 0 [2023-11-28 23:59:35,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-28 23:59:35,886 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 23:59:35,887 INFO L229 MonitoredProcess]: Starting monitored process 98 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-28 23:59:35,888 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Waiting until timeout for monitored process [2023-11-28 23:59:35,889 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-28 23:59:35,899 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-28 23:59:35,900 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-28 23:59:35,900 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-28 23:59:35,900 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-28 23:59:35,901 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-28 23:59:35,901 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-28 23:59:35,904 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-28 23:59:35,906 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Forceful destruction successful, exit code 0 [2023-11-28 23:59:35,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-28 23:59:35,907 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 23:59:35,907 INFO L229 MonitoredProcess]: Starting monitored process 99 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-28 23:59:35,908 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Waiting until timeout for monitored process [2023-11-28 23:59:35,909 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-28 23:59:35,920 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-28 23:59:35,920 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-28 23:59:35,920 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-28 23:59:35,920 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-28 23:59:35,921 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-28 23:59:35,921 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-28 23:59:35,924 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-28 23:59:35,928 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Ended with exit code 0 [2023-11-28 23:59:35,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-28 23:59:35,930 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 23:59:35,931 INFO L229 MonitoredProcess]: Starting monitored process 100 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-28 23:59:35,932 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Waiting until timeout for monitored process [2023-11-28 23:59:35,933 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-28 23:59:35,944 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-28 23:59:35,944 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-28 23:59:35,944 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-28 23:59:35,945 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-28 23:59:35,952 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-28 23:59:35,952 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-28 23:59:35,972 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-11-28 23:59:35,999 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2023-11-28 23:59:35,999 INFO L444 ModelExtractionUtils]: 15 out of 49 variables were initially zero. Simplification set additionally 31 variables to zero. [2023-11-28 23:59:35,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-28 23:59:35,999 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 23:59:36,000 INFO L229 MonitoredProcess]: Starting monitored process 101 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-28 23:59:36,001 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Waiting until timeout for monitored process [2023-11-28 23:59:36,002 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-11-28 23:59:36,013 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-11-28 23:59:36,013 INFO L513 LassoAnalysis]: Proved termination. [2023-11-28 23:59:36,014 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_lis_~N#1, ULTIMATE.start_lis_~i~0#1) = 1*ULTIMATE.start_lis_~N#1 - 1*ULTIMATE.start_lis_~i~0#1 Supporting invariants [] [2023-11-28 23:59:36,017 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Forceful destruction successful, exit code 0 [2023-11-28 23:59:36,183 INFO L156 tatePredicateManager]: 25 out of 25 supporting invariants were superfluous and have been removed [2023-11-28 23:59:36,192 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:59:36,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:59:36,247 INFO L262 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-28 23:59:36,248 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:59:36,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:59:36,291 INFO L262 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-28 23:59:36,291 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:59:36,304 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-28 23:59:36,304 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-28 23:59:36,305 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 151 states and 184 transitions. cyclomatic complexity: 39 Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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-28 23:59:36,320 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 151 states and 184 transitions. cyclomatic complexity: 39. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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 154 states and 189 transitions. Complement of second has 4 states. [2023-11-28 23:59:36,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-11-28 23:59:36,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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-28 23:59:36,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 27 transitions. [2023-11-28 23:59:36,321 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 27 transitions. Stem has 40 letters. Loop has 3 letters. [2023-11-28 23:59:36,322 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-28 23:59:36,322 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 27 transitions. Stem has 43 letters. Loop has 3 letters. [2023-11-28 23:59:36,322 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-28 23:59:36,322 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 27 transitions. Stem has 40 letters. Loop has 6 letters. [2023-11-28 23:59:36,322 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-28 23:59:36,323 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 154 states and 189 transitions. [2023-11-28 23:59:36,324 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 29 [2023-11-28 23:59:36,324 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 154 states to 102 states and 123 transitions. [2023-11-28 23:59:36,325 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 86 [2023-11-28 23:59:36,325 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 86 [2023-11-28 23:59:36,325 INFO L73 IsDeterministic]: Start isDeterministic. Operand 102 states and 123 transitions. [2023-11-28 23:59:36,325 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:59:36,325 INFO L218 hiAutomatonCegarLoop]: Abstraction has 102 states and 123 transitions. [2023-11-28 23:59:36,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states and 123 transitions. [2023-11-28 23:59:36,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2023-11-28 23:59:36,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 102 states have (on average 1.2058823529411764) internal successors, (123), 101 states have internal predecessors, (123), 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-28 23:59:36,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 123 transitions. [2023-11-28 23:59:36,328 INFO L240 hiAutomatonCegarLoop]: Abstraction has 102 states and 123 transitions. [2023-11-28 23:59:36,328 INFO L428 stractBuchiCegarLoop]: Abstraction has 102 states and 123 transitions. [2023-11-28 23:59:36,328 INFO L335 stractBuchiCegarLoop]: ======== Iteration 21 ============ [2023-11-28 23:59:36,328 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 102 states and 123 transitions. [2023-11-28 23:59:36,329 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 29 [2023-11-28 23:59:36,329 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-28 23:59:36,329 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-28 23:59:36,329 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:59:36,329 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 1, 1, 1, 1, 1] [2023-11-28 23:59:36,330 INFO L748 eck$LassoCheckResult]: Stem: 8205#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 8195#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet19#1, main_#t~post18#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet16#1;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 8196#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 8189#L530-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0; 8183#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet19#1;call write~int#2(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 8184#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 8185#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet19#1;call write~int#2(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 8186#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 8192#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet19#1;call write~int#2(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 8217#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 8216#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet19#1;call write~int#2(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 8213#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 8212#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 8203#L535-4 havoc main_~i~1#1;assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0; 8204#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#1(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#0(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 8197#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 8198#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#1(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#0(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 8208#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 8215#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#1(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#0(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 8214#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 8211#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#1(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#0(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 8210#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 8209#L517-3 assume !(lis_~i~0#1 < lis_~N#1); 8206#L517-4 lis_~i~0#1 := 1; 8207#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 8226#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 8227#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 8238#L521-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int#1(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int#0(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 8260#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 8271#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 8193#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 8194#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 8251#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 8252#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 8269#L521-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int#1(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int#0(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 8268#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 8267#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 8266#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 8259#L521-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int#1(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int#0(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 8257#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 8255#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 8256#L519-2 [2023-11-28 23:59:36,330 INFO L750 eck$LassoCheckResult]: Loop: 8256#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 8253#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 8254#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 8248#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 8249#L521-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 8270#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 8263#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 8261#L521 assume !lis_#t~short11#1; 8240#L521-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 8265#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 8264#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 8256#L519-2 [2023-11-28 23:59:36,330 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:59:36,330 INFO L85 PathProgramCache]: Analyzing trace with hash -1830415302, now seen corresponding path program 4 times [2023-11-28 23:59:36,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:59:36,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782673980] [2023-11-28 23:59:36,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:59:36,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:59:36,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-28 23:59:36,389 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-28 23:59:36,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-28 23:59:36,427 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-28 23:59:36,427 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:59:36,427 INFO L85 PathProgramCache]: Analyzing trace with hash -943386241, now seen corresponding path program 3 times [2023-11-28 23:59:36,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:59:36,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703428510] [2023-11-28 23:59:36,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:59:36,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:59:36,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-28 23:59:36,433 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-28 23:59:36,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-28 23:59:36,439 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-28 23:59:36,439 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:59:36,439 INFO L85 PathProgramCache]: Analyzing trace with hash 546852774, now seen corresponding path program 5 times [2023-11-28 23:59:36,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:59:36,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637578089] [2023-11-28 23:59:36,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:59:36,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:59:36,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:59:36,603 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 10 proven. 45 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2023-11-28 23:59:36,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:59:36,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637578089] [2023-11-28 23:59:36,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637578089] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 23:59:36,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [495153792] [2023-11-28 23:59:36,604 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-28 23:59:36,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-28 23:59:36,604 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 23:59:36,605 INFO L229 MonitoredProcess]: Starting monitored process 102 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-28 23:59:36,608 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (102)] Waiting until timeout for monitored process [2023-11-28 23:59:38,216 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2023-11-28 23:59:38,216 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-28 23:59:38,221 INFO L262 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-28 23:59:38,223 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:59:38,299 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 37 proven. 23 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2023-11-28 23:59:38,299 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 23:59:38,372 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Forceful destruction successful, exit code 0 [2023-11-28 23:59:38,409 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 33 proven. 27 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2023-11-28 23:59:38,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [495153792] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-28 23:59:38,409 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-28 23:59:38,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 15 [2023-11-28 23:59:38,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870261144] [2023-11-28 23:59:38,410 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-28 23:59:38,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:59:38,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-28 23:59:38,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2023-11-28 23:59:38,652 INFO L87 Difference]: Start difference. First operand 102 states and 123 transitions. cyclomatic complexity: 25 Second operand has 16 states, 15 states have (on average 4.733333333333333) internal successors, (71), 16 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-28 23:59:38,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 23:59:38,840 INFO L93 Difference]: Finished difference Result 122 states and 151 transitions. [2023-11-28 23:59:38,840 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 122 states and 151 transitions. [2023-11-28 23:59:38,841 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 47 [2023-11-28 23:59:38,842 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 122 states to 122 states and 151 transitions. [2023-11-28 23:59:38,842 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 106 [2023-11-28 23:59:38,842 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 106 [2023-11-28 23:59:38,842 INFO L73 IsDeterministic]: Start isDeterministic. Operand 122 states and 151 transitions. [2023-11-28 23:59:38,842 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:59:38,842 INFO L218 hiAutomatonCegarLoop]: Abstraction has 122 states and 151 transitions. [2023-11-28 23:59:38,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states and 151 transitions. [2023-11-28 23:59:38,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 112. [2023-11-28 23:59:38,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 112 states have (on average 1.2232142857142858) internal successors, (137), 111 states have internal predecessors, (137), 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-28 23:59:38,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 137 transitions. [2023-11-28 23:59:38,846 INFO L240 hiAutomatonCegarLoop]: Abstraction has 112 states and 137 transitions. [2023-11-28 23:59:38,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-28 23:59:38,846 INFO L428 stractBuchiCegarLoop]: Abstraction has 112 states and 137 transitions. [2023-11-28 23:59:38,847 INFO L335 stractBuchiCegarLoop]: ======== Iteration 22 ============ [2023-11-28 23:59:38,847 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 112 states and 137 transitions. [2023-11-28 23:59:38,847 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 39 [2023-11-28 23:59:38,847 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-28 23:59:38,847 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-28 23:59:38,848 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:59:38,848 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [3, 3, 3, 2, 1, 1, 1, 1] [2023-11-28 23:59:38,848 INFO L748 eck$LassoCheckResult]: Stem: 8782#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 8770#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet19#1, main_#t~post18#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet16#1;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 8771#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 8764#L530-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0; 8758#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet19#1;call write~int#2(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 8759#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 8760#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet19#1;call write~int#2(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 8761#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 8769#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet19#1;call write~int#2(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 8794#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 8793#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet19#1;call write~int#2(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 8790#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 8789#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 8780#L535-4 havoc main_~i~1#1;assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0; 8781#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#1(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#0(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 8772#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 8773#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#1(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#0(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 8785#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 8792#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#1(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#0(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 8791#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 8788#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#1(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#0(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 8787#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 8786#L517-3 assume !(lis_~i~0#1 < lis_~N#1); 8783#L517-4 lis_~i~0#1 := 1; 8784#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 8806#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 8807#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 8819#L521-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int#1(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int#0(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 8831#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 8830#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 8829#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 8828#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 8827#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 8825#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 8826#L521-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int#1(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int#0(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 8841#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 8842#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 8838#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 8836#L521-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int#1(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int#0(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 8837#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 8861#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 8859#L519-2 [2023-11-28 23:59:38,848 INFO L750 eck$LassoCheckResult]: Loop: 8859#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 8858#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 8857#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 8855#L521 assume !lis_#t~short11#1; 8854#L521-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 8853#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 8852#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 8851#L521 assume !lis_#t~short11#1; 8846#L521-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 8847#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 8762#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 8763#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 8801#L521-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 8800#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 8835#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 8859#L519-2 [2023-11-28 23:59:38,848 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:59:38,849 INFO L85 PathProgramCache]: Analyzing trace with hash -1830415302, now seen corresponding path program 5 times [2023-11-28 23:59:38,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:59:38,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443527863] [2023-11-28 23:59:38,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:59:38,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:59:38,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-28 23:59:38,904 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-28 23:59:38,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-28 23:59:38,942 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-28 23:59:38,943 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:59:38,943 INFO L85 PathProgramCache]: Analyzing trace with hash 1668030712, now seen corresponding path program 4 times [2023-11-28 23:59:38,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:59:38,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478966776] [2023-11-28 23:59:38,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:59:38,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:59:38,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-28 23:59:38,950 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-28 23:59:38,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-28 23:59:38,956 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-28 23:59:38,957 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:59:38,957 INFO L85 PathProgramCache]: Analyzing trace with hash -2036993121, now seen corresponding path program 6 times [2023-11-28 23:59:38,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:59:38,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619388964] [2023-11-28 23:59:38,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:59:38,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:59:39,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:59:41,633 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 14 proven. 100 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-28 23:59:41,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:59:41,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619388964] [2023-11-28 23:59:41,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619388964] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 23:59:41,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1087514071] [2023-11-28 23:59:41,633 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-11-28 23:59:41,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-28 23:59:41,634 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 23:59:41,635 INFO L229 MonitoredProcess]: Starting monitored process 103 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-28 23:59:41,636 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (103)] Waiting until timeout for monitored process [2023-11-28 23:59:41,865 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2023-11-28 23:59:41,865 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-28 23:59:41,867 INFO L262 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 49 conjunts are in the unsatisfiable core [2023-11-28 23:59:41,869 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:59:42,509 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:59:42,519 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 23:59:42,519 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 41 treesize of output 31 [2023-11-28 23:59:42,714 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 2 proven. 100 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-28 23:59:42,714 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 23:59:43,226 INFO L349 Elim1Store]: treesize reduction 20, result has 55.6 percent of original size [2023-11-28 23:59:43,227 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 60 treesize of output 38 [2023-11-28 23:59:43,302 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 36 proven. 41 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-11-28 23:59:43,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1087514071] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-28 23:59:43,303 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-28 23:59:43,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 18, 11] total 52 [2023-11-28 23:59:43,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835320153] [2023-11-28 23:59:43,303 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-28 23:59:43,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:59:43,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2023-11-28 23:59:43,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=2474, Unknown=0, NotChecked=0, Total=2652 [2023-11-28 23:59:43,588 INFO L87 Difference]: Start difference. First operand 112 states and 137 transitions. cyclomatic complexity: 29 Second operand has 52 states, 52 states have (on average 2.5576923076923075) internal successors, (133), 52 states have internal predecessors, (133), 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:00:15,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:00:15,536 INFO L93 Difference]: Finished difference Result 1038 states and 1354 transitions. [2023-11-29 00:00:15,536 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1038 states and 1354 transitions. [2023-11-29 00:00:15,540 INFO L131 ngComponentsAnalysis]: Automaton has 35 accepting balls. 555 [2023-11-29 00:00:15,545 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1038 states to 1038 states and 1354 transitions. [2023-11-29 00:00:15,545 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1011 [2023-11-29 00:00:15,546 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1011 [2023-11-29 00:00:15,546 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1038 states and 1354 transitions. [2023-11-29 00:00:15,547 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:00:15,548 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1038 states and 1354 transitions. [2023-11-29 00:00:15,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1038 states and 1354 transitions. [2023-11-29 00:00:15,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1038 to 260. [2023-11-29 00:00:15,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 260 states have (on average 1.2538461538461538) internal successors, (326), 259 states have internal predecessors, (326), 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:00:15,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 326 transitions. [2023-11-29 00:00:15,557 INFO L240 hiAutomatonCegarLoop]: Abstraction has 260 states and 326 transitions. [2023-11-29 00:00:15,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 280 states. [2023-11-29 00:00:15,558 INFO L428 stractBuchiCegarLoop]: Abstraction has 260 states and 326 transitions. [2023-11-29 00:00:15,558 INFO L335 stractBuchiCegarLoop]: ======== Iteration 23 ============ [2023-11-29 00:00:15,558 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 260 states and 326 transitions. [2023-11-29 00:00:15,559 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 107 [2023-11-29 00:00:15,559 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 00:00:15,559 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 00:00:15,560 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:00:15,560 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [3, 3, 3, 2, 1, 1, 1, 1] [2023-11-29 00:00:15,560 INFO L748 eck$LassoCheckResult]: Stem: 10923#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 10913#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet19#1, main_#t~post18#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet16#1;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 10914#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 10907#L530-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0; 10901#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet19#1;call write~int#2(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 10902#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 10903#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet19#1;call write~int#2(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 10904#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 10912#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet19#1;call write~int#2(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 10948#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 10947#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet19#1;call write~int#2(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 10938#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 10939#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 10921#L535-4 havoc main_~i~1#1;assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0; 10922#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#1(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#0(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 10915#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 10916#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#1(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#0(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 10945#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 10946#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#1(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#0(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 10941#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 10942#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#1(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#0(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 10936#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 10937#L517-3 assume !(lis_~i~0#1 < lis_~N#1); 10924#L517-4 lis_~i~0#1 := 1; 10925#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 10997#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 10995#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 10994#L521-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int#1(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int#0(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 10993#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 10992#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 10991#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 10990#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 10989#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 10987#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 10986#L521-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int#1(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int#0(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 10985#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 10984#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 10982#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 10980#L521-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 10981#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 11123#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 11120#L519-2 [2023-11-29 00:00:15,560 INFO L750 eck$LassoCheckResult]: Loop: 11120#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 11119#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 11118#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 11116#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 11117#L521-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 10972#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 11129#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 11128#L521 assume !lis_#t~short11#1; 11126#L521-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 11021#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 11125#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 11122#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 11124#L521-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 10955#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 11121#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 11120#L519-2 [2023-11-29 00:00:15,560 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:00:15,561 INFO L85 PathProgramCache]: Analyzing trace with hash -1830413380, now seen corresponding path program 1 times [2023-11-29 00:00:15,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:00:15,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177806323] [2023-11-29 00:00:15,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:00:15,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:00:15,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:00:17,214 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 7 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:00:17,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:00:17,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177806323] [2023-11-29 00:00:17,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177806323] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:00:17,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1096922206] [2023-11-29 00:00:17,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:00:17,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:00:17,215 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:00:17,215 INFO L229 MonitoredProcess]: Starting monitored process 104 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:00:17,216 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (104)] Waiting until timeout for monitored process [2023-11-29 00:00:17,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:00:17,394 INFO L262 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 19 conjunts are in the unsatisfiable core [2023-11-29 00:00:17,395 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:00:17,444 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 19 [2023-11-29 00:00:17,562 INFO L349 Elim1Store]: treesize reduction 38, result has 30.9 percent of original size [2023-11-29 00:00:17,563 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 3 case distinctions, treesize of input 37 treesize of output 35 [2023-11-29 00:00:17,677 INFO L349 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2023-11-29 00:00:17,678 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 53 treesize of output 17 [2023-11-29 00:00:17,682 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2023-11-29 00:00:17,682 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:00:17,929 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 77 treesize of output 65 [2023-11-29 00:00:17,941 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:00:17,941 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 79 treesize of output 71 [2023-11-29 00:00:18,002 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2023-11-29 00:00:18,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1096922206] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:00:18,003 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 00:00:18,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 10, 10] total 36 [2023-11-29 00:00:18,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667473169] [2023-11-29 00:00:18,003 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 00:00:18,003 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-29 00:00:18,004 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:00:18,004 INFO L85 PathProgramCache]: Analyzing trace with hash 1409865274, now seen corresponding path program 5 times [2023-11-29 00:00:18,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:00:18,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202751085] [2023-11-29 00:00:18,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:00:18,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:00:18,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:00:18,011 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 00:00:18,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:00:18,016 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 00:00:18,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:00:18,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-11-29 00:00:18,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=1117, Unknown=0, NotChecked=0, Total=1260 [2023-11-29 00:00:18,380 INFO L87 Difference]: Start difference. First operand 260 states and 326 transitions. cyclomatic complexity: 73 Second operand has 36 states, 36 states have (on average 2.0833333333333335) internal successors, (75), 36 states have internal predecessors, (75), 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:00:19,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:00:19,717 INFO L93 Difference]: Finished difference Result 514 states and 646 transitions. [2023-11-29 00:00:19,717 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 514 states and 646 transitions. [2023-11-29 00:00:19,720 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 235 [2023-11-29 00:00:19,723 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 514 states to 514 states and 646 transitions. [2023-11-29 00:00:19,723 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 482 [2023-11-29 00:00:19,724 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 482 [2023-11-29 00:00:19,724 INFO L73 IsDeterministic]: Start isDeterministic. Operand 514 states and 646 transitions. [2023-11-29 00:00:19,724 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:00:19,724 INFO L218 hiAutomatonCegarLoop]: Abstraction has 514 states and 646 transitions. [2023-11-29 00:00:19,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states and 646 transitions. [2023-11-29 00:00:19,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 264. [2023-11-29 00:00:19,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 264 states have (on average 1.246212121212121) internal successors, (329), 263 states have internal predecessors, (329), 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:00:19,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 329 transitions. [2023-11-29 00:00:19,734 INFO L240 hiAutomatonCegarLoop]: Abstraction has 264 states and 329 transitions. [2023-11-29 00:00:19,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2023-11-29 00:00:19,735 INFO L428 stractBuchiCegarLoop]: Abstraction has 264 states and 329 transitions. [2023-11-29 00:00:19,735 INFO L335 stractBuchiCegarLoop]: ======== Iteration 24 ============ [2023-11-29 00:00:19,736 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 264 states and 329 transitions. [2023-11-29 00:00:19,737 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 111 [2023-11-29 00:00:19,737 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 00:00:19,737 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 00:00:19,738 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:00:19,738 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [3, 3, 2, 2, 1, 1, 1, 1, 1] [2023-11-29 00:00:19,738 INFO L748 eck$LassoCheckResult]: Stem: 12042#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 12031#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet19#1, main_#t~post18#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet16#1;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 12032#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 12025#L530-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0; 12019#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet19#1;call write~int#2(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 12020#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 12021#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet19#1;call write~int#2(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 12022#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 12028#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet19#1;call write~int#2(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 12055#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 12054#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet19#1;call write~int#2(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 12052#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 12053#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 12040#L535-4 havoc main_~i~1#1;assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0; 12041#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#1(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#0(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 12066#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 12067#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#1(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#0(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 12033#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 12034#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#1(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#0(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 12062#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 12063#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#1(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#0(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 12058#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 12059#L517-3 assume !(lis_~i~0#1 < lis_~N#1); 12043#L517-4 lis_~i~0#1 := 1; 12044#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 12105#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 12106#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 12100#L521-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int#1(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int#0(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 12101#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 12096#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 12097#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 12092#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 12093#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 12087#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 12088#L521-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int#1(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int#0(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 12126#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 12125#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 12123#L521 assume !lis_#t~short11#1; 12124#L521-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 12225#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 12178#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 12179#L519-2 [2023-11-29 00:00:19,738 INFO L750 eck$LassoCheckResult]: Loop: 12179#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 12174#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 12175#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 12170#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 12168#L521-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int#1(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int#0(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 12115#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 12167#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 12166#L521 assume !lis_#t~short11#1; 12162#L521-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 12163#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 12185#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 12181#L521 assume !lis_#t~short11#1; 12149#L521-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 12147#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 12180#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 12179#L519-2 [2023-11-29 00:00:19,739 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:00:19,739 INFO L85 PathProgramCache]: Analyzing trace with hash -1830353798, now seen corresponding path program 7 times [2023-11-29 00:00:19,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:00:19,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588346292] [2023-11-29 00:00:19,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:00:19,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:00:19,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:00:19,801 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 00:00:19,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:00:19,843 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 00:00:19,844 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:00:19,844 INFO L85 PathProgramCache]: Analyzing trace with hash 708860278, now seen corresponding path program 1 times [2023-11-29 00:00:19,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:00:19,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104558457] [2023-11-29 00:00:19,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:00:19,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:00:19,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:00:19,855 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 00:00:19,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:00:19,864 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 00:00:19,865 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:00:19,865 INFO L85 PathProgramCache]: Analyzing trace with hash 1910682589, now seen corresponding path program 8 times [2023-11-29 00:00:19,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:00:19,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790645054] [2023-11-29 00:00:19,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:00:19,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:00:19,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:00:19,929 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 00:00:19,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:00:19,977 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 00:01:05,805 WARN L293 SmtUtils]: Spent 45.36s on a formula simplification. DAG size of input: 421 DAG size of output: 288 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2023-11-29 00:01:07,771 INFO L210 LassoAnalysis]: Preferences: [2023-11-29 00:01:07,771 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-29 00:01:07,771 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-29 00:01:07,771 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-29 00:01:07,771 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-11-29 00:01:07,771 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 00:01:07,771 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-29 00:01:07,771 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-29 00:01:07,771 INFO L133 ssoRankerPreferences]: Filename of dumped script: lis-alloca-1.i_Iteration24_Lasso [2023-11-29 00:01:07,772 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-29 00:01:07,772 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-29 00:01:07,775 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:01:07,777 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:01:07,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:01:07,781 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:01:07,783 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:01:07,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:01:11,105 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:01:11,107 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:01:11,109 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:01:11,111 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:01:11,112 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:01:11,114 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:01:11,116 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:01:11,117 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:01:11,118 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:01:11,120 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:01:11,122 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:01:11,123 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:01:11,125 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:01:11,127 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:01:11,129 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:01:11,131 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:01:11,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:01:11,135 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:01:11,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:01:11,138 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:01:11,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:01:11,143 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:01:11,145 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:01:11,146 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:01:11,148 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:01:11,741 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-29 00:01:11,741 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-11-29 00:01:11,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 00:01:11,742 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:01:11,743 INFO L229 MonitoredProcess]: Starting monitored process 105 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/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:01:11,743 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (105)] Waiting until timeout for monitored process [2023-11-29 00:01:11,745 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:01:11,755 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 00:01:11,755 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 00:01:11,755 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 00:01:11,755 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 00:01:11,755 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 00:01:11,755 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 00:01:11,756 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 00:01:11,757 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 00:01:11,759 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (105)] Forceful destruction successful, exit code 0 [2023-11-29 00:01:11,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 00:01:11,759 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:01:11,760 INFO L229 MonitoredProcess]: Starting monitored process 106 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/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:01:11,761 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (106)] Waiting until timeout for monitored process [2023-11-29 00:01:11,762 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:01:11,772 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 00:01:11,772 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 00:01:11,772 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 00:01:11,772 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 00:01:11,773 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 00:01:11,773 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 00:01:11,773 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 00:01:11,774 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 00:01:11,776 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (106)] Forceful destruction successful, exit code 0 [2023-11-29 00:01:11,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 00:01:11,777 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:01:11,778 INFO L229 MonitoredProcess]: Starting monitored process 107 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/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:01:11,797 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (107)] Waiting until timeout for monitored process [2023-11-29 00:01:11,797 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:01:11,807 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 00:01:11,808 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 00:01:11,808 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 00:01:11,808 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 00:01:11,808 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 00:01:11,808 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 00:01:11,808 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 00:01:11,809 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 00:01:11,811 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (107)] Ended with exit code 0 [2023-11-29 00:01:11,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 00:01:11,812 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:01:11,813 INFO L229 MonitoredProcess]: Starting monitored process 108 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/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:01:11,813 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (108)] Waiting until timeout for monitored process [2023-11-29 00:01:11,815 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:01:11,825 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 00:01:11,825 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 00:01:11,825 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 00:01:11,825 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 00:01:11,826 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 00:01:11,826 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 00:01:11,829 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 00:01:11,831 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (108)] Ended with exit code 0 [2023-11-29 00:01:11,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 00:01:11,832 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:01:11,833 INFO L229 MonitoredProcess]: Starting monitored process 109 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/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:01:11,833 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (109)] Waiting until timeout for monitored process [2023-11-29 00:01:11,835 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:01:11,845 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 00:01:11,845 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 00:01:11,845 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 00:01:11,845 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 00:01:11,845 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 00:01:11,846 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 00:01:11,846 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 00:01:11,847 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 00:01:11,850 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (109)] Ended with exit code 0 [2023-11-29 00:01:11,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 00:01:11,850 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:01:11,851 INFO L229 MonitoredProcess]: Starting monitored process 110 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/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:01:11,851 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (110)] Waiting until timeout for monitored process [2023-11-29 00:01:11,853 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:01:11,863 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 00:01:11,863 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 00:01:11,864 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 00:01:11,864 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 00:01:11,865 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 00:01:11,865 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 00:01:11,868 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 00:01:11,871 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (110)] Ended with exit code 0 [2023-11-29 00:01:11,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 00:01:11,871 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:01:11,872 INFO L229 MonitoredProcess]: Starting monitored process 111 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/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:01:11,873 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (111)] Waiting until timeout for monitored process [2023-11-29 00:01:11,874 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:01:11,884 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 00:01:11,884 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 00:01:11,884 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 00:01:11,884 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 00:01:11,885 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 00:01:11,885 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 00:01:11,888 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 00:01:11,890 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (111)] Ended with exit code 0 [2023-11-29 00:01:11,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 00:01:11,891 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:01:11,891 INFO L229 MonitoredProcess]: Starting monitored process 112 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/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:01:11,892 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (112)] Waiting until timeout for monitored process [2023-11-29 00:01:11,894 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:01:11,904 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 00:01:11,904 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 00:01:11,904 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 00:01:11,904 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 00:01:11,905 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 00:01:11,905 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 00:01:11,909 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 00:01:11,911 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (112)] Forceful destruction successful, exit code 0 [2023-11-29 00:01:11,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 00:01:11,911 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:01:11,912 INFO L229 MonitoredProcess]: Starting monitored process 113 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/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:01:11,913 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (113)] Waiting until timeout for monitored process [2023-11-29 00:01:11,914 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:01:11,925 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 00:01:11,925 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 00:01:11,925 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 00:01:11,925 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 00:01:11,929 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 00:01:11,929 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 00:01:11,941 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 00:01:11,943 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (113)] Ended with exit code 0 [2023-11-29 00:01:11,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 00:01:11,943 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:01:11,944 INFO L229 MonitoredProcess]: Starting monitored process 114 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/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:01:11,945 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (114)] Waiting until timeout for monitored process [2023-11-29 00:01:11,946 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:01:11,956 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 00:01:11,956 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 00:01:11,956 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 00:01:11,957 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 00:01:11,958 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 00:01:11,958 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 00:01:11,965 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 00:01:11,967 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (114)] Forceful destruction successful, exit code 0 [2023-11-29 00:01:11,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 00:01:11,967 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:01:11,968 INFO L229 MonitoredProcess]: Starting monitored process 115 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/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:01:11,969 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (115)] Waiting until timeout for monitored process [2023-11-29 00:01:11,970 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:01:11,980 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 00:01:11,980 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 00:01:11,980 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 00:01:11,980 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 00:01:11,981 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 00:01:11,981 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 00:01:11,986 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 00:01:11,989 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (115)] Forceful destruction successful, exit code 0 [2023-11-29 00:01:11,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 00:01:11,990 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:01:11,991 INFO L229 MonitoredProcess]: Starting monitored process 116 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/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:01:11,991 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (116)] Waiting until timeout for monitored process [2023-11-29 00:01:11,993 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:01:12,005 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 00:01:12,005 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 00:01:12,005 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 00:01:12,005 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 00:01:12,006 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 00:01:12,006 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 00:01:12,010 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 00:01:12,013 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (116)] Ended with exit code 0 [2023-11-29 00:01:12,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 00:01:12,013 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:01:12,014 INFO L229 MonitoredProcess]: Starting monitored process 117 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/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:01:12,014 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (117)] Waiting until timeout for monitored process [2023-11-29 00:01:12,016 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:01:12,026 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 00:01:12,026 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 00:01:12,026 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 00:01:12,026 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 00:01:12,028 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 00:01:12,028 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 00:01:12,033 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-11-29 00:01:12,040 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2023-11-29 00:01:12,040 INFO L444 ModelExtractionUtils]: 0 out of 7 variables were initially zero. Simplification set additionally 4 variables to zero. [2023-11-29 00:01:12,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 00:01:12,040 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:01:12,041 INFO L229 MonitoredProcess]: Starting monitored process 118 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/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:01:12,042 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (118)] Waiting until timeout for monitored process [2023-11-29 00:01:12,043 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-11-29 00:01:12,054 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-11-29 00:01:12,054 INFO L513 LassoAnalysis]: Proved termination. [2023-11-29 00:01:12,055 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_lis_~i~0#1) = -2*ULTIMATE.start_lis_~i~0#1 + 5 Supporting invariants [] [2023-11-29 00:01:12,057 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (117)] Ended with exit code 0 [2023-11-29 00:01:12,273 INFO L156 tatePredicateManager]: 45 out of 45 supporting invariants were superfluous and have been removed [2023-11-29 00:01:12,282 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:01:12,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:01:12,326 INFO L262 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 00:01:12,326 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:01:12,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:01:12,371 INFO L262 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-29 00:01:12,371 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:01:12,444 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:01:12,445 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2023-11-29 00:01:12,445 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 264 states and 329 transitions. cyclomatic complexity: 72 Second operand has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:01:12,536 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 264 states and 329 transitions. cyclomatic complexity: 72. Second operand has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 654 states and 854 transitions. Complement of second has 12 states. [2023-11-29 00:01:12,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2023-11-29 00:01:12,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:01:12,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 56 transitions. [2023-11-29 00:01:12,537 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 56 transitions. Stem has 41 letters. Loop has 15 letters. [2023-11-29 00:01:12,538 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 00:01:12,538 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 56 transitions. Stem has 56 letters. Loop has 15 letters. [2023-11-29 00:01:12,538 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 00:01:12,538 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 56 transitions. Stem has 41 letters. Loop has 30 letters. [2023-11-29 00:01:12,538 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 00:01:12,539 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 654 states and 854 transitions. [2023-11-29 00:01:12,541 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 176 [2023-11-29 00:01:12,545 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 654 states to 595 states and 787 transitions. [2023-11-29 00:01:12,545 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 263 [2023-11-29 00:01:12,545 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 270 [2023-11-29 00:01:12,545 INFO L73 IsDeterministic]: Start isDeterministic. Operand 595 states and 787 transitions. [2023-11-29 00:01:12,546 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-29 00:01:12,546 INFO L218 hiAutomatonCegarLoop]: Abstraction has 595 states and 787 transitions. [2023-11-29 00:01:12,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states and 787 transitions. [2023-11-29 00:01:12,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 499. [2023-11-29 00:01:12,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 499 states, 499 states have (on average 1.312625250501002) internal successors, (655), 498 states have internal predecessors, (655), 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:01:12,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 655 transitions. [2023-11-29 00:01:12,558 INFO L240 hiAutomatonCegarLoop]: Abstraction has 499 states and 655 transitions. [2023-11-29 00:01:12,558 INFO L428 stractBuchiCegarLoop]: Abstraction has 499 states and 655 transitions. [2023-11-29 00:01:12,558 INFO L335 stractBuchiCegarLoop]: ======== Iteration 25 ============ [2023-11-29 00:01:12,558 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 499 states and 655 transitions. [2023-11-29 00:01:12,560 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 140 [2023-11-29 00:01:12,560 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 00:01:12,560 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 00:01:12,560 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:01:12,560 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 4, 4, 2, 2, 1, 1, 1] [2023-11-29 00:01:12,561 INFO L748 eck$LassoCheckResult]: Stem: 13355#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 13338#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet19#1, main_#t~post18#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet16#1;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 13339#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 13328#L530-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0; 13320#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet19#1;call write~int#2(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 13321#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 13322#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet19#1;call write~int#2(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 13323#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 13333#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet19#1;call write~int#2(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 13373#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 13372#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet19#1;call write~int#2(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 13368#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 13369#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 13353#L535-4 havoc main_~i~1#1;assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0; 13354#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#1(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#0(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 13379#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 13380#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#1(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#0(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 13340#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 13341#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#1(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#0(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 13375#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 13376#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#1(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#0(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 13370#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 13371#L517-3 assume !(lis_~i~0#1 < lis_~N#1); 13356#L517-4 lis_~i~0#1 := 1; 13357#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 13399#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 13400#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 13394#L521-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int#1(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int#0(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 13395#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 13381#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 13382#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 13434#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 13435#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 13429#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 13430#L521-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int#1(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int#0(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 13463#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 13462#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 13460#L521 assume !lis_#t~short11#1; 13461#L521-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 13563#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 13495#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 13496#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 13335#L519-3 [2023-11-29 00:01:12,561 INFO L750 eck$LassoCheckResult]: Loop: 13335#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 13696#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 13692#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 13690#L521-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 13691#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 13745#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 13744#L521 assume !lis_#t~short11#1; 13685#L521-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 13684#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 13683#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 13682#L521 assume !lis_#t~short11#1; 13665#L521-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 13666#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 13661#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 13659#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 13657#L521-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 13658#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 13662#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 13334#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 13335#L519-3 [2023-11-29 00:01:12,561 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:01:12,561 INFO L85 PathProgramCache]: Analyzing trace with hash -906392820, now seen corresponding path program 9 times [2023-11-29 00:01:12,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:01:12,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205252523] [2023-11-29 00:01:12,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:01:12,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:01:12,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:01:12,605 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 00:01:12,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:01:12,637 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 00:01:12,637 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:01:12,637 INFO L85 PathProgramCache]: Analyzing trace with hash 888408663, now seen corresponding path program 6 times [2023-11-29 00:01:12,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:01:12,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593845688] [2023-11-29 00:01:12,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:01:12,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:01:12,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:01:12,646 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 00:01:12,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:01:12,655 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 00:01:12,655 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:01:12,655 INFO L85 PathProgramCache]: Analyzing trace with hash 565499244, now seen corresponding path program 10 times [2023-11-29 00:01:12,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:01:12,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906859760] [2023-11-29 00:01:12,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:01:12,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:01:12,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:01:12,825 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 35 proven. 72 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2023-11-29 00:01:12,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:01:12,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906859760] [2023-11-29 00:01:12,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906859760] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:01:12,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [617106084] [2023-11-29 00:01:12,826 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-29 00:01:12,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:01:12,826 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:01:12,827 INFO L229 MonitoredProcess]: Starting monitored process 119 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:01:12,831 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (119)] Waiting until timeout for monitored process [2023-11-29 00:01:13,028 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-29 00:01:13,029 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 00:01:13,031 INFO L262 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-29 00:01:13,033 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:01:13,105 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (118)] Ended with exit code 0 [2023-11-29 00:01:13,179 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 44 proven. 63 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2023-11-29 00:01:13,179 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:01:13,253 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 44 proven. 63 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2023-11-29 00:01:13,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [617106084] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:01:13,253 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 00:01:13,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 15 [2023-11-29 00:01:13,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869750486] [2023-11-29 00:01:13,254 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 00:01:13,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:01:13,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-29 00:01:13,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2023-11-29 00:01:13,731 INFO L87 Difference]: Start difference. First operand 499 states and 655 transitions. cyclomatic complexity: 167 Second operand has 15 states, 15 states have (on average 4.933333333333334) internal successors, (74), 15 states have internal predecessors, (74), 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:01:13,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:01:13,890 INFO L93 Difference]: Finished difference Result 663 states and 853 transitions. [2023-11-29 00:01:13,890 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 663 states and 853 transitions. [2023-11-29 00:01:13,893 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 124 [2023-11-29 00:01:13,896 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 663 states to 518 states and 667 transitions. [2023-11-29 00:01:13,896 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 157 [2023-11-29 00:01:13,896 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 157 [2023-11-29 00:01:13,896 INFO L73 IsDeterministic]: Start isDeterministic. Operand 518 states and 667 transitions. [2023-11-29 00:01:13,897 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-29 00:01:13,897 INFO L218 hiAutomatonCegarLoop]: Abstraction has 518 states and 667 transitions. [2023-11-29 00:01:13,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states and 667 transitions. [2023-11-29 00:01:13,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 467. [2023-11-29 00:01:13,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 467 states, 467 states have (on average 1.297644539614561) internal successors, (606), 466 states have internal predecessors, (606), 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:01:13,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 606 transitions. [2023-11-29 00:01:13,906 INFO L240 hiAutomatonCegarLoop]: Abstraction has 467 states and 606 transitions. [2023-11-29 00:01:13,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-29 00:01:13,907 INFO L428 stractBuchiCegarLoop]: Abstraction has 467 states and 606 transitions. [2023-11-29 00:01:13,907 INFO L335 stractBuchiCegarLoop]: ======== Iteration 26 ============ [2023-11-29 00:01:13,907 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 467 states and 606 transitions. [2023-11-29 00:01:13,909 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 124 [2023-11-29 00:01:13,909 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 00:01:13,909 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 00:01:13,910 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 6, 6, 4, 4, 4, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:01:13,910 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 4, 4, 3, 1, 1, 1, 1] [2023-11-29 00:01:13,910 INFO L748 eck$LassoCheckResult]: Stem: 14903#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 14890#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet19#1, main_#t~post18#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet16#1;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 14891#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 14880#L530-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0; 14872#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet19#1;call write~int#2(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 14873#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 14874#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet19#1;call write~int#2(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 14875#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 14889#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet19#1;call write~int#2(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 14921#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 14919#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet19#1;call write~int#2(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 14920#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 14910#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 14912#L535-4 havoc main_~i~1#1;assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0; 14906#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#1(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#0(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 14907#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 14908#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#1(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#0(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 14909#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 14925#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#1(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#0(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 14926#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 14922#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#1(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#0(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 14915#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 14913#L517-3 assume !(lis_~i~0#1 < lis_~N#1); 14914#L517-4 lis_~i~0#1 := 1; 14944#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 14945#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 14940#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 14941#L521-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int#1(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int#0(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 15104#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 15103#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 15102#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 15101#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 15100#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 15098#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 15097#L521-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int#1(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int#0(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 15096#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 15095#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 15093#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 15092#L521-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int#1(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int#0(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 15091#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 15090#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 15089#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 15088#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 15087#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 15086#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 15084#L521-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 15083#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 15082#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 15080#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 15081#L521-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 15075#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 15074#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 15073#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 15072#L521-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int#1(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int#0(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 15070#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 15050#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 15040#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 15038#L519-3 [2023-11-29 00:01:13,910 INFO L750 eck$LassoCheckResult]: Loop: 15038#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 15037#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 15035#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 15036#L521-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 14897#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 14876#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 14877#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 14898#L521-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 15057#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 15056#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 15055#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 15053#L521-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 15052#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 15051#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 15043#L521 assume !lis_#t~short11#1; 14948#L521-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 14949#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 15042#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 15039#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 15038#L519-3 [2023-11-29 00:01:13,910 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:01:13,910 INFO L85 PathProgramCache]: Analyzing trace with hash 1184410821, now seen corresponding path program 2 times [2023-11-29 00:01:13,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:01:13,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069860176] [2023-11-29 00:01:13,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:01:13,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:01:13,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:01:16,220 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 37 proven. 80 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-29 00:01:16,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:01:16,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069860176] [2023-11-29 00:01:16,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069860176] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:01:16,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [682622962] [2023-11-29 00:01:16,220 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 00:01:16,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:01:16,220 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:01:16,221 INFO L229 MonitoredProcess]: Starting monitored process 120 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:01:16,222 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (120)] Waiting until timeout for monitored process [2023-11-29 00:01:16,387 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 00:01:16,387 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 00:01:16,390 INFO L262 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 52 conjunts are in the unsatisfiable core [2023-11-29 00:01:16,392 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:01:16,444 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 00:01:16,511 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-11-29 00:01:16,589 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:01:16,589 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2023-11-29 00:01:16,835 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:01:16,836 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 46 treesize of output 43 [2023-11-29 00:01:17,066 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:01:17,066 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 52 treesize of output 45 [2023-11-29 00:01:17,291 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:01:17,291 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 58 treesize of output 47 [2023-11-29 00:01:17,663 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:01:17,664 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 48 treesize of output 20 [2023-11-29 00:01:17,704 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 34 proven. 67 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-11-29 00:01:17,704 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:01:19,134 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 121 treesize of output 113 [2023-11-29 00:01:19,141 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:01:19,142 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 630 treesize of output 546 [2023-11-29 00:01:19,290 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 36 proven. 65 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-11-29 00:01:19,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [682622962] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:01:19,291 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 00:01:19,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 22, 23] total 70 [2023-11-29 00:01:19,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374164839] [2023-11-29 00:01:19,291 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 00:01:19,291 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-29 00:01:19,291 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:01:19,292 INFO L85 PathProgramCache]: Analyzing trace with hash 797003349, now seen corresponding path program 7 times [2023-11-29 00:01:19,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:01:19,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082547275] [2023-11-29 00:01:19,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:01:19,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:01:19,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:01:19,299 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 00:01:19,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:01:19,305 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 00:01:19,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:01:19,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2023-11-29 00:01:19,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=515, Invalid=4315, Unknown=0, NotChecked=0, Total=4830 [2023-11-29 00:01:19,802 INFO L87 Difference]: Start difference. First operand 467 states and 606 transitions. cyclomatic complexity: 146 Second operand has 70 states, 70 states have (on average 1.9) internal successors, (133), 70 states have internal predecessors, (133), 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:48,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:02:48,072 INFO L93 Difference]: Finished difference Result 3985 states and 5432 transitions. [2023-11-29 00:02:48,072 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3985 states and 5432 transitions. [2023-11-29 00:02:48,082 INFO L131 ngComponentsAnalysis]: Automaton has 78 accepting balls. 828 [2023-11-29 00:02:48,107 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3985 states to 3985 states and 5432 transitions. [2023-11-29 00:02:48,107 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1709 [2023-11-29 00:02:48,109 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1709 [2023-11-29 00:02:48,109 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3985 states and 5432 transitions. [2023-11-29 00:02:48,110 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-29 00:02:48,110 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3985 states and 5432 transitions. [2023-11-29 00:02:48,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3985 states and 5432 transitions. [2023-11-29 00:02:48,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3985 to 778. [2023-11-29 00:02:48,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 778 states, 778 states have (on average 1.3380462724935733) internal successors, (1041), 777 states have internal predecessors, (1041), 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:48,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 1041 transitions. [2023-11-29 00:02:48,171 INFO L240 hiAutomatonCegarLoop]: Abstraction has 778 states and 1041 transitions. [2023-11-29 00:02:48,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 321 states. [2023-11-29 00:02:48,172 INFO L428 stractBuchiCegarLoop]: Abstraction has 778 states and 1041 transitions. [2023-11-29 00:02:48,172 INFO L335 stractBuchiCegarLoop]: ======== Iteration 27 ============ [2023-11-29 00:02:48,172 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 778 states and 1041 transitions. [2023-11-29 00:02:48,174 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 202 [2023-11-29 00:02:48,175 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 00:02:48,175 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 00:02:48,177 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 6, 6, 6, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:02:48,177 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 4, 3, 2, 2, 1, 1, 1, 1] [2023-11-29 00:02:48,177 INFO L748 eck$LassoCheckResult]: Stem: 20392#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 20377#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet19#1, main_#t~post18#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet16#1;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 20378#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 20367#L530-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0; 20359#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet19#1;call write~int#2(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 20360#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 20361#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet19#1;call write~int#2(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 20362#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 20376#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet19#1;call write~int#2(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 20402#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 20401#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet19#1;call write~int#2(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 20398#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 20397#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 20390#L535-4 havoc main_~i~1#1;assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0; 20391#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#1(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#0(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 20395#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 20396#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#1(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#0(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 20379#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 20380#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#1(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#0(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 20404#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 20403#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#1(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#0(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 20400#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 20399#L517-3 assume !(lis_~i~0#1 < lis_~N#1); 20393#L517-4 lis_~i~0#1 := 1; 20394#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 20413#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 20412#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 20411#L521-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int#1(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int#0(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 20408#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 20407#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 20372#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 20373#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 20858#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 20856#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 20855#L521-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int#1(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int#0(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 20854#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 20853#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 20851#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 20849#L521-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int#1(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int#0(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 20850#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 20841#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 20842#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 20897#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 20896#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 20835#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 20836#L521-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int#1(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int#0(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 20903#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 20902#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 20901#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 20900#L521-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int#1(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int#0(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 20877#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 20875#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 20873#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 20872#L521-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int#1(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int#0(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 20867#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 20758#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 20743#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 20742#L519-3 [2023-11-29 00:02:48,177 INFO L750 eck$LassoCheckResult]: Loop: 20742#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 20741#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 20739#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 20740#L521-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int#1(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int#0(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 20765#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 20764#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 20763#L521 assume !lis_#t~short11#1; 20760#L521-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 20757#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 20756#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 20755#L521 assume !lis_#t~short11#1; 20753#L521-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 20752#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 20751#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 20747#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 20749#L521-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 20748#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 20746#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 20745#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 20742#L519-3 [2023-11-29 00:02:48,178 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:02:48,178 INFO L85 PathProgramCache]: Analyzing trace with hash 1735592009, now seen corresponding path program 6 times [2023-11-29 00:02:48,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:02:48,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570451609] [2023-11-29 00:02:48,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:02:48,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:02:48,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:02:48,257 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 00:02:48,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:02:48,327 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 00:02:48,327 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:02:48,328 INFO L85 PathProgramCache]: Analyzing trace with hash 1909477017, now seen corresponding path program 2 times [2023-11-29 00:02:48,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:02:48,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354286497] [2023-11-29 00:02:48,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:02:48,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:02:48,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:02:48,338 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 00:02:48,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:02:48,346 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 00:02:48,346 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:02:48,347 INFO L85 PathProgramCache]: Analyzing trace with hash 733253969, now seen corresponding path program 11 times [2023-11-29 00:02:48,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:02:48,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065211042] [2023-11-29 00:02:48,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:02:48,347 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 unsat [2023-11-29 00:02:48,708 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 163 proven. 42 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2023-11-29 00:02:48,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:02:48,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065211042] [2023-11-29 00:02:48,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065211042] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:02:48,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [581920826] [2023-11-29 00:02:48,709 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-29 00:02:48,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:02:48,709 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:02:48,711 INFO L229 MonitoredProcess]: Starting monitored process 121 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:02:48,713 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (121)] Waiting until timeout for monitored process [2023-11-29 00:02:53,780 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2023-11-29 00:02:53,780 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 00:02:53,790 INFO L262 TraceCheckSpWp]: Trace formula consists of 594 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-29 00:02:53,792 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:02:53,994 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 171 proven. 38 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2023-11-29 00:02:53,995 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:02:54,125 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 136 proven. 73 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2023-11-29 00:02:54,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [581920826] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:02:54,126 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 00:02:54,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 13] total 27 [2023-11-29 00:02:54,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646344689] [2023-11-29 00:02:54,126 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 00:02:54,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:02:54,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-11-29 00:02:54,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=599, Unknown=0, NotChecked=0, Total=702 [2023-11-29 00:02:54,762 INFO L87 Difference]: Start difference. First operand 778 states and 1041 transitions. cyclomatic complexity: 277 Second operand has 27 states, 27 states have (on average 3.4814814814814814) internal successors, (94), 27 states have internal predecessors, (94), 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:55,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:02:55,359 INFO L93 Difference]: Finished difference Result 1804 states and 2351 transitions. [2023-11-29 00:02:55,359 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1804 states and 2351 transitions. [2023-11-29 00:02:55,363 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 270 [2023-11-29 00:02:55,369 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1804 states to 1288 states and 1752 transitions. [2023-11-29 00:02:55,369 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 518 [2023-11-29 00:02:55,369 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 518 [2023-11-29 00:02:55,369 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1288 states and 1752 transitions. [2023-11-29 00:02:55,370 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-29 00:02:55,370 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1288 states and 1752 transitions. [2023-11-29 00:02:55,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1288 states and 1752 transitions. [2023-11-29 00:02:55,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1288 to 782. [2023-11-29 00:02:55,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 782 states, 782 states have (on average 1.3363171355498722) internal successors, (1045), 781 states have internal predecessors, (1045), 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:55,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 1045 transitions. [2023-11-29 00:02:55,382 INFO L240 hiAutomatonCegarLoop]: Abstraction has 782 states and 1045 transitions. [2023-11-29 00:02:55,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2023-11-29 00:02:55,382 INFO L428 stractBuchiCegarLoop]: Abstraction has 782 states and 1045 transitions. [2023-11-29 00:02:55,383 INFO L335 stractBuchiCegarLoop]: ======== Iteration 28 ============ [2023-11-29 00:02:55,383 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 782 states and 1045 transitions. [2023-11-29 00:02:55,385 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 202 [2023-11-29 00:02:55,385 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 00:02:55,385 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 00:02:55,386 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 6, 6, 6, 5, 5, 5, 5, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:02:55,386 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 4, 3, 2, 2, 1, 1, 1, 1] [2023-11-29 00:02:55,386 INFO L748 eck$LassoCheckResult]: Stem: 23506#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 23493#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet19#1, main_#t~post18#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet16#1;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 23494#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 23483#L530-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0; 23475#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet19#1;call write~int#2(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 23476#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 23477#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet19#1;call write~int#2(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 23478#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 23492#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet19#1;call write~int#2(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 23518#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 23517#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet19#1;call write~int#2(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 23516#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 23515#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet19#1;call write~int#2(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 23512#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 23511#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 23504#L535-4 havoc main_~i~1#1;assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0; 23505#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#1(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#0(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 23509#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 23510#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#1(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#0(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 23495#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 23496#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#1(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#0(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 23522#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 23521#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#1(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#0(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 23520#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 23519#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#1(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#0(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 23514#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 23513#L517-3 assume !(lis_~i~0#1 < lis_~N#1); 23507#L517-4 lis_~i~0#1 := 1; 23508#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 23536#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 23535#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 23534#L521-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int#1(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int#0(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 23530#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 23531#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 23488#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 23489#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 23974#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 23972#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 23971#L521-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int#1(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int#0(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 23970#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 23969#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 23967#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 23966#L521-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int#1(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int#0(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 23965#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 23964#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 23963#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 23962#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 23961#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 23960#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 23957#L521-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int#1(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int#0(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 23956#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 24078#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 24077#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 24076#L521-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int#1(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int#0(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 24074#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 24073#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 24072#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 24070#L521-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int#1(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int#0(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 24069#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 23915#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 23851#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 23849#L519-3 [2023-11-29 00:02:55,386 INFO L750 eck$LassoCheckResult]: Loop: 23849#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 23848#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 23846#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 23847#L521-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int#1(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int#0(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 23878#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 23876#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 23874#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 23873#L521-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int#1(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int#0(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 23870#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 23869#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 23868#L521 assume !lis_#t~short11#1; 23866#L521-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 23865#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 23863#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 23855#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 23859#L521-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 23857#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 23854#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 23850#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 23849#L519-3 [2023-11-29 00:02:55,386 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:02:55,386 INFO L85 PathProgramCache]: Analyzing trace with hash 1545269573, now seen corresponding path program 7 times [2023-11-29 00:02:55,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:02:55,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868143020] [2023-11-29 00:02:55,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:02:55,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:02:55,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:02:55,498 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 00:02:55,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:02:55,628 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 00:02:55,628 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:02:55,628 INFO L85 PathProgramCache]: Analyzing trace with hash -2056849703, now seen corresponding path program 3 times [2023-11-29 00:02:55,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:02:55,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15623229] [2023-11-29 00:02:55,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:02:55,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:02:55,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:02:55,640 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 00:02:55,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:02:55,650 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 00:02:55,650 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:02:55,650 INFO L85 PathProgramCache]: Analyzing trace with hash 1356420885, now seen corresponding path program 12 times [2023-11-29 00:02:55,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:02:55,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079349706] [2023-11-29 00:02:55,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:02:55,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:02:55,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:02:57,285 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 34 proven. 221 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2023-11-29 00:02:57,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:02:57,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079349706] [2023-11-29 00:02:57,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079349706] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:02:57,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1116099845] [2023-11-29 00:02:57,286 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-11-29 00:02:57,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:02:57,286 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:02:57,287 INFO L229 MonitoredProcess]: Starting monitored process 122 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:02:57,287 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (122)] Waiting until timeout for monitored process [2023-11-29 00:02:57,781 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2023-11-29 00:02:57,781 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 00:02:57,784 INFO L262 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 48 conjunts are in the unsatisfiable core [2023-11-29 00:02:57,786 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:02:58,253 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:02:58,254 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:02:58,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:02:58,271 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:02:58,271 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 57 treesize of output 45 [2023-11-29 00:02:58,377 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 93 proven. 113 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2023-11-29 00:02:58,378 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:02:58,835 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:02:58,836 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 66 treesize of output 1 [2023-11-29 00:02:58,837 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 135 proven. 35 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2023-11-29 00:02:58,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1116099845] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:02:58,837 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 00:02:58,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 17, 13] total 46 [2023-11-29 00:02:58,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483172593] [2023-11-29 00:02:58,838 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 00:02:59,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:02:59,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2023-11-29 00:02:59,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=1840, Unknown=0, NotChecked=0, Total=2070 [2023-11-29 00:02:59,731 INFO L87 Difference]: Start difference. First operand 782 states and 1045 transitions. cyclomatic complexity: 277 Second operand has 46 states, 46 states have (on average 2.8260869565217392) internal successors, (130), 46 states have internal predecessors, (130), 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:11,722 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 7.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:03:18,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:03:18,837 INFO L93 Difference]: Finished difference Result 3018 states and 3995 transitions. [2023-11-29 00:03:18,837 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3018 states and 3995 transitions. [2023-11-29 00:03:18,845 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 1135 [2023-11-29 00:03:18,858 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3018 states to 3018 states and 3995 transitions. [2023-11-29 00:03:18,858 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1311 [2023-11-29 00:03:18,859 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1311 [2023-11-29 00:03:18,859 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3018 states and 3995 transitions. [2023-11-29 00:03:18,859 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-29 00:03:18,859 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3018 states and 3995 transitions. [2023-11-29 00:03:18,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3018 states and 3995 transitions. [2023-11-29 00:03:18,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3018 to 2002. [2023-11-29 00:03:18,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2002 states, 2002 states have (on average 1.3621378621378621) internal successors, (2727), 2001 states have internal predecessors, (2727), 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:18,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2002 states to 2002 states and 2727 transitions. [2023-11-29 00:03:18,908 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2002 states and 2727 transitions. [2023-11-29 00:03:18,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 204 states. [2023-11-29 00:03:18,908 INFO L428 stractBuchiCegarLoop]: Abstraction has 2002 states and 2727 transitions. [2023-11-29 00:03:18,908 INFO L335 stractBuchiCegarLoop]: ======== Iteration 29 ============ [2023-11-29 00:03:18,908 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2002 states and 2727 transitions. [2023-11-29 00:03:18,913 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 681 [2023-11-29 00:03:18,913 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 00:03:18,913 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 00:03:18,914 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 6, 6, 6, 5, 5, 5, 5, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:03:18,914 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 4, 3, 3, 1, 1, 1, 1, 1] [2023-11-29 00:03:18,914 INFO L748 eck$LassoCheckResult]: Stem: 28265#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 28250#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet19#1, main_#t~post18#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet16#1;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 28251#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 28240#L530-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0; 28232#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet19#1;call write~int#2(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 28233#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 28234#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet19#1;call write~int#2(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 28235#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 28245#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet19#1;call write~int#2(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 28279#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 28277#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet19#1;call write~int#2(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 28275#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 28273#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet19#1;call write~int#2(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 28270#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 28269#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 28263#L535-4 havoc main_~i~1#1;assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0; 28264#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#1(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#0(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 28252#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 28253#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#1(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#0(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 28268#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 28281#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#1(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#0(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 28280#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 28278#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#1(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#0(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 28276#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 28274#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#1(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#0(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 28272#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 28271#L517-3 assume !(lis_~i~0#1 < lis_~N#1); 28266#L517-4 lis_~i~0#1 := 1; 28267#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 28294#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 28293#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 28292#L521-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int#1(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int#0(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 28288#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 28289#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 28246#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 28247#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 28398#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 28397#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 28395#L521-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int#1(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int#0(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 28396#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 28390#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 28391#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 28875#L521-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int#1(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int#0(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 28995#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 28994#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 28993#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 28992#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 28991#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 28950#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 28804#L521-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int#1(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int#0(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 28805#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 29114#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 29112#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 29109#L521-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int#1(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int#0(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 29107#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 29106#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 29101#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 29100#L521-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int#1(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int#0(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 29071#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 28855#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 28856#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 29097#L519-3 [2023-11-29 00:03:18,914 INFO L750 eck$LassoCheckResult]: Loop: 29097#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 29699#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 29696#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 29695#L521-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int#1(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int#0(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 29693#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 29691#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 29689#L521 assume !lis_#t~short11#1; 29686#L521-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 29685#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 29684#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 29682#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 29683#L521-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 29702#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 29676#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 29674#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 29675#L521-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 29678#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 29677#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 29624#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 29097#L519-3 [2023-11-29 00:03:18,914 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:03:18,914 INFO L85 PathProgramCache]: Analyzing trace with hash 1545269573, now seen corresponding path program 8 times [2023-11-29 00:03:18,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:03:18,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614783853] [2023-11-29 00:03:18,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:03:18,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:03:18,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:03:18,985 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 00:03:19,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:03:19,080 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 00:03:19,080 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:03:19,080 INFO L85 PathProgramCache]: Analyzing trace with hash 1229418647, now seen corresponding path program 4 times [2023-11-29 00:03:19,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:03:19,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737471409] [2023-11-29 00:03:19,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:03:19,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:03:19,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:03:19,091 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 00:03:19,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:03:19,100 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 00:03:19,100 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:03:19,100 INFO L85 PathProgramCache]: Analyzing trace with hash 347721939, now seen corresponding path program 13 times [2023-11-29 00:03:19,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:03:19,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825821813] [2023-11-29 00:03:19,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:03:19,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:03:19,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:03:20,675 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 82 proven. 157 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2023-11-29 00:03:20,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:03:20,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825821813] [2023-11-29 00:03:20,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825821813] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:03:20,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1251325003] [2023-11-29 00:03:20,676 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-11-29 00:03:20,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:03:20,676 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:03:20,677 INFO L229 MonitoredProcess]: Starting monitored process 123 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:03:20,678 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (123)] Waiting until timeout for monitored process [2023-11-29 00:03:20,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:03:20,881 INFO L262 TraceCheckSpWp]: Trace formula consists of 635 conjuncts, 68 conjunts are in the unsatisfiable core [2023-11-29 00:03:20,883 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:03:21,908 INFO L349 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2023-11-29 00:03:21,908 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 6 case distinctions, treesize of input 56 treesize of output 36 [2023-11-29 00:03:21,940 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 47 proven. 238 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 00:03:21,940 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:03:23,007 INFO L349 Elim1Store]: treesize reduction 23, result has 83.7 percent of original size [2023-11-29 00:03:23,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 78 treesize of output 136 [2023-11-29 00:03:24,261 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 56 proven. 181 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2023-11-29 00:03:24,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1251325003] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:03:24,261 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 00:03:24,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 29, 21] total 61 [2023-11-29 00:03:24,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226452541] [2023-11-29 00:03:24,262 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 00:03:25,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:03:25,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2023-11-29 00:03:25,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=395, Invalid=3265, Unknown=0, NotChecked=0, Total=3660 [2023-11-29 00:03:25,084 INFO L87 Difference]: Start difference. First operand 2002 states and 2727 transitions. cyclomatic complexity: 749 Second operand has 61 states, 61 states have (on average 2.918032786885246) internal successors, (178), 61 states have internal predecessors, (178), 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:30,450 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.24s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 00:03:35,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:03:35,164 INFO L93 Difference]: Finished difference Result 5833 states and 7760 transitions. [2023-11-29 00:03:35,164 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5833 states and 7760 transitions. [2023-11-29 00:03:35,184 INFO L131 ngComponentsAnalysis]: Automaton has 23 accepting balls. 2355 [2023-11-29 00:03:35,213 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5833 states to 5833 states and 7760 transitions. [2023-11-29 00:03:35,213 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2614 [2023-11-29 00:03:35,216 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2614 [2023-11-29 00:03:35,216 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5833 states and 7760 transitions. [2023-11-29 00:03:35,217 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-29 00:03:35,217 INFO L218 hiAutomatonCegarLoop]: Abstraction has 5833 states and 7760 transitions. [2023-11-29 00:03:35,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5833 states and 7760 transitions. [2023-11-29 00:03:35,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5833 to 5366. [2023-11-29 00:03:35,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5366 states, 5366 states have (on average 1.3507267983600448) internal successors, (7248), 5365 states have internal predecessors, (7248), 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:35,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5366 states to 5366 states and 7248 transitions. [2023-11-29 00:03:35,327 INFO L240 hiAutomatonCegarLoop]: Abstraction has 5366 states and 7248 transitions. [2023-11-29 00:03:35,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2023-11-29 00:03:35,328 INFO L428 stractBuchiCegarLoop]: Abstraction has 5366 states and 7248 transitions. [2023-11-29 00:03:35,328 INFO L335 stractBuchiCegarLoop]: ======== Iteration 30 ============ [2023-11-29 00:03:35,328 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5366 states and 7248 transitions. [2023-11-29 00:03:35,342 INFO L131 ngComponentsAnalysis]: Automaton has 23 accepting balls. 2140 [2023-11-29 00:03:35,342 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 00:03:35,342 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 00:03:35,343 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 6, 6, 6, 5, 5, 5, 5, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:03:35,343 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 4, 4, 2, 2, 1, 1, 1] [2023-11-29 00:03:35,343 INFO L748 eck$LassoCheckResult]: Stem: 36865#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 36852#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet19#1, main_#t~post18#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet16#1;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 36853#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 36842#L530-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0; 36834#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet19#1;call write~int#2(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 36835#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 36836#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet19#1;call write~int#2(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 36837#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 36851#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet19#1;call write~int#2(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 36879#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 36877#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet19#1;call write~int#2(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 36875#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 36873#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet19#1;call write~int#2(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 36870#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 36869#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 36863#L535-4 havoc main_~i~1#1;assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0; 36864#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#1(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#0(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 36854#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 36855#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#1(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#0(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 36868#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 36881#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#1(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#0(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 36880#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 36878#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#1(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#0(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 36876#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 36874#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#1(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#0(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 36872#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 36871#L517-3 assume !(lis_~i~0#1 < lis_~N#1); 36866#L517-4 lis_~i~0#1 := 1; 36867#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 36896#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 36895#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 36894#L521-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int#1(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int#0(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 36890#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 36891#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 36847#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 36848#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 36995#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 36994#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 36993#L521-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int#1(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int#0(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 36989#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 36990#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 36984#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 36985#L521-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int#1(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int#0(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 38943#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 38942#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 38941#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 38940#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 38939#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 38937#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 38864#L521-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int#1(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int#0(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 38865#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 39524#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 39522#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 39521#L521-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int#1(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int#0(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 39520#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 39519#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 39517#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 39518#L521-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int#1(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int#0(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 39546#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 39512#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 39511#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 36857#L519-3 [2023-11-29 00:03:35,344 INFO L750 eck$LassoCheckResult]: Loop: 36857#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 36858#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 42040#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 42010#L521-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int#1(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int#0(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 42009#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 42006#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 42002#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 41998#L521-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int#1(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int#0(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 41997#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 41992#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 41989#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 39917#L521-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 39914#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 39908#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 39905#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 39906#L521-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 41964#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 42052#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 36885#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 36857#L519-3 [2023-11-29 00:03:35,344 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:03:35,344 INFO L85 PathProgramCache]: Analyzing trace with hash 1545269573, now seen corresponding path program 9 times [2023-11-29 00:03:35,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:03:35,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522176373] [2023-11-29 00:03:35,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:03:35,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:03:35,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:03:35,412 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 00:03:35,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:03:35,496 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 00:03:35,496 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:03:35,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1558059223, now seen corresponding path program 1 times [2023-11-29 00:03:35,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:03:35,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838722838] [2023-11-29 00:03:35,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:03:35,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:03:35,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:03:35,510 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 00:03:35,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:03:35,520 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 00:03:35,521 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:03:35,521 INFO L85 PathProgramCache]: Analyzing trace with hash 676362515, now seen corresponding path program 3 times [2023-11-29 00:03:35,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:03:35,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893369379] [2023-11-29 00:03:35,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:03:35,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:03:35,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:03:37,576 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 72 proven. 184 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2023-11-29 00:03:37,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:03:37,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893369379] [2023-11-29 00:03:37,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893369379] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:03:37,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [683860271] [2023-11-29 00:03:37,576 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 00:03:37,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:03:37,577 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:03:37,578 INFO L229 MonitoredProcess]: Starting monitored process 124 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:03:37,578 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (124)] Waiting until timeout for monitored process [2023-11-29 00:03:38,042 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2023-11-29 00:03:38,042 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 00:03:38,046 INFO L262 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 51 conjunts are in the unsatisfiable core [2023-11-29 00:03:38,050 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:03:38,121 INFO L349 Elim1Store]: treesize reduction 17, result has 43.3 percent of original size [2023-11-29 00:03:38,121 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2023-11-29 00:03:38,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:03:38,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:03:38,364 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:03:38,364 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 56 treesize of output 40 [2023-11-29 00:03:38,772 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:03:38,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:03:38,775 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:03:38,778 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-29 00:03:38,778 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 62 treesize of output 62 [2023-11-29 00:03:38,974 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:03:38,975 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:03:38,978 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:03:38,979 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:03:38,981 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:03:38,985 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2023-11-29 00:03:38,985 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 12 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 77 treesize of output 74 [2023-11-29 00:03:39,363 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:03:39,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:03:39,366 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:03:39,366 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:03:39,385 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:03:39,385 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 74 treesize of output 54 [2023-11-29 00:03:39,540 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 122 proven. 74 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2023-11-29 00:03:39,540 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:03:40,295 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 133 proven. 54 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2023-11-29 00:03:40,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [683860271] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:03:40,295 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 00:03:40,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 22, 19] total 62 [2023-11-29 00:03:40,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703662705] [2023-11-29 00:03:40,296 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 00:03:41,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:03:41,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2023-11-29 00:03:41,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=548, Invalid=3234, Unknown=0, NotChecked=0, Total=3782 [2023-11-29 00:03:41,564 INFO L87 Difference]: Start difference. First operand 5366 states and 7248 transitions. cyclomatic complexity: 1930 Second operand has 62 states, 62 states have (on average 2.403225806451613) internal successors, (149), 62 states have internal predecessors, (149), 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:31,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:04:31,134 INFO L93 Difference]: Finished difference Result 88410 states and 120941 transitions. [2023-11-29 00:04:31,134 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 88410 states and 120941 transitions. [2023-11-29 00:04:31,437 INFO L131 ngComponentsAnalysis]: Automaton has 80 accepting balls. 38901 [2023-11-29 00:04:31,675 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 88410 states to 88398 states and 120929 transitions. [2023-11-29 00:04:31,676 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42747 [2023-11-29 00:04:31,708 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42747 [2023-11-29 00:04:31,708 INFO L73 IsDeterministic]: Start isDeterministic. Operand 88398 states and 120929 transitions. [2023-11-29 00:04:31,710 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-29 00:04:31,710 INFO L218 hiAutomatonCegarLoop]: Abstraction has 88398 states and 120929 transitions. [2023-11-29 00:04:31,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88398 states and 120929 transitions. [2023-11-29 00:04:32,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88398 to 42843. [2023-11-29 00:04:32,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42843 states, 42843 states have (on average 1.4173143804122026) internal successors, (60722), 42842 states have internal predecessors, (60722), 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:32,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42843 states to 42843 states and 60722 transitions. [2023-11-29 00:04:32,915 INFO L240 hiAutomatonCegarLoop]: Abstraction has 42843 states and 60722 transitions. [2023-11-29 00:04:32,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 427 states. [2023-11-29 00:04:32,916 INFO L428 stractBuchiCegarLoop]: Abstraction has 42843 states and 60722 transitions. [2023-11-29 00:04:32,916 INFO L335 stractBuchiCegarLoop]: ======== Iteration 31 ============ [2023-11-29 00:04:32,916 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42843 states and 60722 transitions. [2023-11-29 00:04:32,992 INFO L131 ngComponentsAnalysis]: Automaton has 58 accepting balls. 18032 [2023-11-29 00:04:32,992 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 00:04:32,992 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 00:04:32,993 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 6, 6, 6, 5, 5, 5, 5, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:04:32,993 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 4, 4, 3, 1, 1, 1, 1] [2023-11-29 00:04:32,993 INFO L748 eck$LassoCheckResult]: Stem: 132170#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 132154#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet19#1, main_#t~post18#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet16#1;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 132155#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 132144#L530-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0; 132136#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet19#1;call write~int#2(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 132137#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 132138#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet19#1;call write~int#2(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 132139#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 132153#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet19#1;call write~int#2(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 132184#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 132182#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet19#1;call write~int#2(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 132180#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 132178#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet19#1;call write~int#2(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 132175#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 132174#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 132168#L535-4 havoc main_~i~1#1;assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0; 132169#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#1(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#0(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 132156#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 132157#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#1(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#0(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 132173#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 132186#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#1(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#0(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 132185#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 132183#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#1(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#0(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 132181#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 132179#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#1(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#0(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 132177#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 132176#L517-3 assume !(lis_~i~0#1 < lis_~N#1); 132171#L517-4 lis_~i~0#1 := 1; 132172#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 132199#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 132198#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 132197#L521-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int#1(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int#0(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 132193#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 132194#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 132149#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 132150#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 137328#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 137326#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 137325#L521-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int#1(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int#0(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 137324#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 137323#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 137321#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 137320#L521-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int#1(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int#0(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 137319#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 137318#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 137317#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 137316#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 137315#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 137313#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 137311#L521-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int#1(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int#0(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 137312#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 146144#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 146142#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 146141#L521-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int#1(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int#0(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 146140#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 146139#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 146137#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 146138#L521-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int#1(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int#0(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 146332#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 146204#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 146197#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 146198#L519-3 [2023-11-29 00:04:32,994 INFO L750 eck$LassoCheckResult]: Loop: 146198#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 173429#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 174568#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 174567#L521-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 174566#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 174565#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 174363#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 174290#L521-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int#1(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int#0(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 173353#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 173348#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 173349#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 171515#L521-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int#1(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int#0(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 171516#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 171590#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 154994#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 171509#L521-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int#1(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int#0(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 171511#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 173781#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 173779#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 146198#L519-3 [2023-11-29 00:04:32,995 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:04:32,995 INFO L85 PathProgramCache]: Analyzing trace with hash 1545269573, now seen corresponding path program 10 times [2023-11-29 00:04:32,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:04:32,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146963813] [2023-11-29 00:04:32,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:04:32,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:04:33,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:04:33,066 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 00:04:33,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:04:33,197 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 00:04:33,197 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:04:33,197 INFO L85 PathProgramCache]: Analyzing trace with hash 1346277913, now seen corresponding path program 2 times [2023-11-29 00:04:33,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:04:33,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779263644] [2023-11-29 00:04:33,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:04:33,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:04:33,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:04:33,212 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 00:04:33,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:04:33,224 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 00:04:33,224 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:04:33,224 INFO L85 PathProgramCache]: Analyzing trace with hash 464581205, now seen corresponding path program 4 times [2023-11-29 00:04:33,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:04:33,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625010166] [2023-11-29 00:04:33,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:04:33,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:04:33,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:35,902 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 109 proven. 160 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-11-29 00:04:35,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:04:35,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625010166] [2023-11-29 00:04:35,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625010166] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:04:35,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1049191829] [2023-11-29 00:04:35,903 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-29 00:04:35,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:04:35,903 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:04:35,904 INFO L229 MonitoredProcess]: Starting monitored process 125 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:04:35,905 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2467ede4-cde7-4eba-a7b0-fa61188312ae/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (125)] Waiting until timeout for monitored process [2023-11-29 00:04:39,793 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-29 00:04:39,793 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 00:04:39,802 INFO L262 TraceCheckSpWp]: Trace formula consists of 682 conjuncts, 48 conjunts are in the unsatisfiable core [2023-11-29 00:04:39,806 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:04:39,834 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 00:04:39,907 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-29 00:04:39,907 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2023-11-29 00:04:40,030 INFO L349 Elim1Store]: treesize reduction 42, result has 28.8 percent of original size [2023-11-29 00:04:40,030 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 3 case distinctions, treesize of input 30 treesize of output 32 [2023-11-29 00:04:44,025 INFO L349 Elim1Store]: treesize reduction 76, result has 25.5 percent of original size [2023-11-29 00:04:44,026 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 6 case distinctions, treesize of input 39 treesize of output 44 [2023-11-29 00:04:44,412 INFO L349 Elim1Store]: treesize reduction 118, result has 22.9 percent of original size [2023-11-29 00:04:44,412 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 10 case distinctions, treesize of input 48 treesize of output 56 [2023-11-29 00:04:45,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:04:45,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:04:45,328 INFO L349 Elim1Store]: treesize reduction 160, result has 38.0 percent of original size [2023-11-29 00:04:45,328 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 20 case distinctions, treesize of input 65 treesize of output 131