./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 527bcce2 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_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-memsafety/lis-alloca-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 319f31ab0b5c801309acd19f3e336c9a25177d3201cf5ea4438ad6227d5f71cf --- Real Ultimate output --- This is Ultimate 0.2.3-dev-527bcce [2023-11-21 22:23:12,104 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-21 22:23:12,190 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/config/svcomp-Termination-32bit-Automizer_Default.epf [2023-11-21 22:23:12,196 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-21 22:23:12,197 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-21 22:23:12,228 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-21 22:23:12,229 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-21 22:23:12,229 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-21 22:23:12,230 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-21 22:23:12,231 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-21 22:23:12,232 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-21 22:23:12,233 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-21 22:23:12,233 INFO L153 SettingsManager]: * Use SBE=true [2023-11-21 22:23:12,234 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-11-21 22:23:12,235 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-11-21 22:23:12,235 INFO L153 SettingsManager]: * Use old map elimination=false [2023-11-21 22:23:12,236 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2023-11-21 22:23:12,236 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2023-11-21 22:23:12,237 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-11-21 22:23:12,238 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-21 22:23:12,238 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-11-21 22:23:12,239 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-21 22:23:12,240 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-21 22:23:12,240 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-21 22:23:12,241 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-21 22:23:12,242 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-11-21 22:23:12,242 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-11-21 22:23:12,243 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-11-21 22:23:12,244 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-21 22:23:12,244 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-21 22:23:12,245 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-21 22:23:12,245 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-11-21 22:23:12,246 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-21 22:23:12,247 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-21 22:23:12,247 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-21 22:23:12,248 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-21 22:23:12,249 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-21 22:23:12,250 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-11-21 22:23:12,250 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_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 319f31ab0b5c801309acd19f3e336c9a25177d3201cf5ea4438ad6227d5f71cf [2023-11-21 22:23:12,525 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-21 22:23:12,550 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-21 22:23:12,554 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-21 22:23:12,555 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-21 22:23:12,556 INFO L274 PluginConnector]: CDTParser initialized [2023-11-21 22:23:12,557 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/../../sv-benchmarks/c/array-memsafety/lis-alloca-1.i [2023-11-21 22:23:15,847 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-21 22:23:16,185 INFO L384 CDTParser]: Found 1 translation units. [2023-11-21 22:23:16,186 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/sv-benchmarks/c/array-memsafety/lis-alloca-1.i [2023-11-21 22:23:16,200 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/data/5f829a567/ff23180aedc24c0b9a77490d069fb3f7/FLAG98348dca2 [2023-11-21 22:23:16,221 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/data/5f829a567/ff23180aedc24c0b9a77490d069fb3f7 [2023-11-21 22:23:16,225 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-21 22:23:16,226 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-21 22:23:16,228 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-21 22:23:16,228 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-21 22:23:16,233 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-21 22:23:16,233 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 10:23:16" (1/1) ... [2023-11-21 22:23:16,235 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2774961c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:23:16, skipping insertion in model container [2023-11-21 22:23:16,235 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 10:23:16" (1/1) ... [2023-11-21 22:23:16,281 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-21 22:23:16,665 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-21 22:23:16,680 INFO L202 MainTranslator]: Completed pre-run [2023-11-21 22:23:16,744 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-21 22:23:16,782 INFO L206 MainTranslator]: Completed translation [2023-11-21 22:23:16,782 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:23:16 WrapperNode [2023-11-21 22:23:16,782 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-21 22:23:16,783 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-21 22:23:16,784 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-21 22:23:16,784 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-21 22:23:16,792 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:23:16" (1/1) ... [2023-11-21 22:23:16,807 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:23:16" (1/1) ... [2023-11-21 22:23:16,831 INFO L138 Inliner]: procedures = 116, calls = 24, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 115 [2023-11-21 22:23:16,832 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-21 22:23:16,833 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-21 22:23:16,833 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-21 22:23:16,833 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-21 22:23:16,845 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:23:16" (1/1) ... [2023-11-21 22:23:16,845 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:23:16" (1/1) ... [2023-11-21 22:23:16,849 INFO L184 PluginConnector]: Executing the observer HeapSplitter from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:23:16" (1/1) ... [2023-11-21 22:23:16,874 INFO L187 HeapSplitter]: Split 12 memory accesses to 3 slices as follows [7, 3, 2] [2023-11-21 22:23:16,875 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:23:16" (1/1) ... [2023-11-21 22:23:16,875 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:23:16" (1/1) ... [2023-11-21 22:23:16,883 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:23:16" (1/1) ... [2023-11-21 22:23:16,903 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:23:16" (1/1) ... [2023-11-21 22:23:16,905 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:23:16" (1/1) ... [2023-11-21 22:23:16,915 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:23:16" (1/1) ... [2023-11-21 22:23:16,918 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-21 22:23:16,919 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-21 22:23:16,920 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-21 22:23:16,920 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-21 22:23:16,921 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:23:16" (1/1) ... [2023-11-21 22:23:16,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:23:16,941 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:23:16,954 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 22:23:16,981 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2023-11-21 22:23:17,007 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-21 22:23:17,007 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-21 22:23:17,008 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-11-21 22:23:17,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-21 22:23:17,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-21 22:23:17,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-21 22:23:17,008 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-21 22:23:17,009 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-21 22:23:17,010 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-21 22:23:17,010 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-21 22:23:17,186 INFO L240 CfgBuilder]: Building ICFG [2023-11-21 22:23:17,199 INFO L266 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-21 22:23:17,420 INFO L281 CfgBuilder]: Performing block encoding [2023-11-21 22:23:17,429 INFO L303 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-21 22:23:17,430 INFO L308 CfgBuilder]: Removed 5 assume(true) statements. [2023-11-21 22:23:17,431 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 10:23:17 BoogieIcfgContainer [2023-11-21 22:23:17,432 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-21 22:23:17,433 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-11-21 22:23:17,433 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-11-21 22:23:17,437 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-11-21 22:23:17,437 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-21 22:23:17,438 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.11 10:23:16" (1/3) ... [2023-11-21 22:23:17,438 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@68cb461b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.11 10:23:17, skipping insertion in model container [2023-11-21 22:23:17,439 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-21 22:23:17,439 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:23:16" (2/3) ... [2023-11-21 22:23:17,439 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@68cb461b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.11 10:23:17, skipping insertion in model container [2023-11-21 22:23:17,439 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-21 22:23:17,440 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 10:23:17" (3/3) ... [2023-11-21 22:23:17,441 INFO L332 chiAutomizerObserver]: Analyzing ICFG lis-alloca-1.i [2023-11-21 22:23:17,491 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2023-11-21 22:23:17,491 INFO L304 stractBuchiCegarLoop]: Hoare is false [2023-11-21 22:23:17,491 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-11-21 22:23:17,491 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-11-21 22:23:17,491 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-11-21 22:23:17,491 INFO L308 stractBuchiCegarLoop]: Difference is false [2023-11-21 22:23:17,492 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-11-21 22:23:17,492 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2023-11-21 22:23:17,496 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-21 22:23:17,512 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 13 [2023-11-21 22:23:17,512 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-21 22:23:17,512 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-21 22:23:17,517 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2023-11-21 22:23:17,517 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-21 22:23:17,518 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-11-21 22:23:17,518 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-21 22:23:17,520 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 13 [2023-11-21 22:23:17,521 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-21 22:23:17,521 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-21 22:23:17,521 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2023-11-21 22:23:17,521 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-21 22:23:17,528 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-21 22:23:17,529 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#1(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-21 22:23:17,533 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:23:17,534 INFO L85 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2023-11-21 22:23:17,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:23:17,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880190526] [2023-11-21 22:23:17,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:23:17,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:23:17,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:23:17,679 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 22:23:17,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:23:17,710 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 22:23:17,713 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:23:17,714 INFO L85 PathProgramCache]: Analyzing trace with hash 1507, now seen corresponding path program 1 times [2023-11-21 22:23:17,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:23:17,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260683282] [2023-11-21 22:23:17,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:23:17,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:23:17,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:23:17,727 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 22:23:17,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:23:17,738 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 22:23:17,739 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:23:17,740 INFO L85 PathProgramCache]: Analyzing trace with hash 889568455, now seen corresponding path program 1 times [2023-11-21 22:23:17,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:23:17,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930357368] [2023-11-21 22:23:17,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:23:17,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:23:17,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:23:17,770 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 22:23:17,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:23:17,793 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 22:23:18,128 INFO L210 LassoAnalysis]: Preferences: [2023-11-21 22:23:18,129 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-21 22:23:18,129 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-21 22:23:18,129 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-21 22:23:18,130 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-11-21 22:23:18,130 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:23:18,130 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-21 22:23:18,130 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-21 22:23:18,130 INFO L133 ssoRankerPreferences]: Filename of dumped script: lis-alloca-1.i_Iteration1_Lasso [2023-11-21 22:23:18,131 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-21 22:23:18,132 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-21 22:23:18,151 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:23:18,161 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:23:18,165 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:23:18,168 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:23:18,361 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:23:18,365 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:23: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-21 22:23:18,371 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:23:18,376 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:23:18,380 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:23:18,729 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-21 22:23:18,734 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-11-21 22:23:18,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:23:18,736 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:23:18,742 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 22:23:18,749 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2023-11-21 22:23:18,749 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-21 22:23:18,763 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 22:23:18,764 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-21 22:23:18,764 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 22:23:18,764 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 22:23:18,765 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 22:23:18,767 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-21 22:23:18,768 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-21 22:23:18,778 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-21 22:23:18,798 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2023-11-21 22:23:18,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:23:18,798 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:23:18,800 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 22:23:18,808 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-21 22:23:18,822 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 22:23:18,822 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 22:23:18,822 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 22:23:18,822 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 22:23:18,823 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2023-11-21 22:23:18,827 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-21 22:23:18,827 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-21 22:23:18,839 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-21 22:23:18,864 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2023-11-21 22:23:18,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:23:18,865 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:23:18,867 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 22:23:18,876 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-21 22:23:18,877 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2023-11-21 22:23:18,891 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 22:23:18,891 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-21 22:23:18,891 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 22:23:18,892 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 22:23:18,892 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 22:23:18,893 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-21 22:23:18,893 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-21 22:23:18,903 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-21 22:23:18,927 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2023-11-21 22:23:18,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:23:18,927 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:23:18,929 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 22:23:18,936 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2023-11-21 22:23:18,937 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-21 22:23:18,951 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 22:23:18,951 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 22:23:18,951 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 22:23:18,951 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 22:23:18,959 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-21 22:23:18,959 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-21 22:23:18,982 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-21 22:23:19,006 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2023-11-21 22:23:19,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:23:19,007 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:23:19,008 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 22:23:19,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-21 22:23:19,029 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2023-11-21 22:23:19,030 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 22:23:19,030 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-21 22:23:19,031 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 22:23:19,031 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 22:23:19,031 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 22:23:19,032 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-21 22:23:19,032 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-21 22:23:19,046 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-21 22:23:19,070 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2023-11-21 22:23:19,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:23:19,071 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:23:19,072 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 22:23:19,080 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-21 22:23:19,092 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 22:23:19,092 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 22:23:19,092 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 22:23:19,093 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 22:23:19,096 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-21 22:23:19,097 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-21 22:23:19,098 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2023-11-21 22:23:19,122 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-21 22:23:19,143 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2023-11-21 22:23:19,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:23:19,143 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:23:19,145 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 22:23:19,156 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-21 22:23:19,168 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 22:23:19,169 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 22:23:19,169 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 22:23:19,169 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 22:23:19,174 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2023-11-21 22:23:19,190 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-21 22:23:19,190 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-21 22:23:19,211 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-11-21 22:23:19,271 INFO L443 ModelExtractionUtils]: Simplification made 11 calls to the SMT solver. [2023-11-21 22:23:19,271 INFO L444 ModelExtractionUtils]: 3 out of 19 variables were initially zero. Simplification set additionally 13 variables to zero. [2023-11-21 22:23:19,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:23:19,273 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:23:19,313 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 22:23:19,316 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2023-11-21 22:23:19,316 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-11-21 22:23:19,344 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-11-21 22:23:19,345 INFO L513 LassoAnalysis]: Proved termination. [2023-11-21 22:23:19,345 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-21 22:23:19,370 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2023-11-21 22:23:19,385 INFO L156 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2023-11-21 22:23:19,421 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:23:19,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:23:19,444 INFO L262 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-21 22:23:19,446 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:23:19,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:23:19,467 INFO L262 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-21 22:23:19,467 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:23:19,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:23:19,537 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2023-11-21 22:23:19,539 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-21 22:23:19,623 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2023-11-21 22:23:19,636 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-21 22:23:19,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2023-11-21 22:23:19,643 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-21 22:23:19,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 38 transitions. [2023-11-21 22:23:19,646 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 38 transitions. Stem has 4 letters. Loop has 2 letters. [2023-11-21 22:23:19,646 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-21 22:23:19,647 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 38 transitions. Stem has 6 letters. Loop has 2 letters. [2023-11-21 22:23:19,647 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-21 22:23:19,647 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 38 transitions. Stem has 4 letters. Loop has 4 letters. [2023-11-21 22:23:19,647 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-21 22:23:19,648 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 74 transitions. [2023-11-21 22:23:19,652 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2023-11-21 22:23:19,656 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 21 states and 33 transitions. [2023-11-21 22:23:19,657 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2023-11-21 22:23:19,657 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2023-11-21 22:23:19,658 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 33 transitions. [2023-11-21 22:23:19,658 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:23:19,659 INFO L218 hiAutomatonCegarLoop]: Abstraction has 21 states and 33 transitions. [2023-11-21 22:23:19,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 33 transitions. [2023-11-21 22:23:19,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2023-11-21 22:23:19,685 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-21 22:23:19,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 33 transitions. [2023-11-21 22:23:19,687 INFO L240 hiAutomatonCegarLoop]: Abstraction has 21 states and 33 transitions. [2023-11-21 22:23:19,687 INFO L428 stractBuchiCegarLoop]: Abstraction has 21 states and 33 transitions. [2023-11-21 22:23:19,687 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-11-21 22:23:19,688 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 33 transitions. [2023-11-21 22:23:19,689 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2023-11-21 22:23:19,689 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-21 22:23:19,689 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-21 22:23:19,689 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2023-11-21 22:23:19,689 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-21 22:23:19,690 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-21 22:23:19,690 INFO L750 eck$LassoCheckResult]: Loop: 143#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#0(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#2(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-21 22:23:19,690 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:23:19,691 INFO L85 PathProgramCache]: Analyzing trace with hash 889568397, now seen corresponding path program 1 times [2023-11-21 22:23:19,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:23:19,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532611051] [2023-11-21 22:23:19,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:23:19,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:23:19,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:23:19,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:23:19,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:23:19,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532611051] [2023-11-21 22:23:19,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532611051] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:23:19,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:23:19,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-21 22:23:19,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372543127] [2023-11-21 22:23:19,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:23:19,834 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-21 22:23:19,834 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:23:19,834 INFO L85 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 1 times [2023-11-21 22:23:19,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:23:19,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136602619] [2023-11-21 22:23:19,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:23:19,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:23:19,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:23:19,845 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 22:23:19,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:23:19,854 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 22:23:19,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:23:19,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-21 22:23:19,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-21 22:23:19,964 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-21 22:23:19,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:23:19,992 INFO L93 Difference]: Finished difference Result 22 states and 30 transitions. [2023-11-21 22:23:19,992 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 30 transitions. [2023-11-21 22:23:19,993 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2023-11-21 22:23:19,994 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 22 states and 30 transitions. [2023-11-21 22:23:19,994 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2023-11-21 22:23:19,995 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2023-11-21 22:23:19,995 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 30 transitions. [2023-11-21 22:23:19,995 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:23:19,995 INFO L218 hiAutomatonCegarLoop]: Abstraction has 22 states and 30 transitions. [2023-11-21 22:23:19,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 30 transitions. [2023-11-21 22:23:19,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2023-11-21 22:23:19,997 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-21 22:23:19,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 29 transitions. [2023-11-21 22:23:19,998 INFO L240 hiAutomatonCegarLoop]: Abstraction has 21 states and 29 transitions. [2023-11-21 22:23:19,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-21 22:23:19,999 INFO L428 stractBuchiCegarLoop]: Abstraction has 21 states and 29 transitions. [2023-11-21 22:23:20,000 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-11-21 22:23:20,000 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 29 transitions. [2023-11-21 22:23:20,001 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2023-11-21 22:23:20,001 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-21 22:23:20,001 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-21 22:23:20,001 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:23:20,001 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-21 22:23:20,002 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#1(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-21 22:23:20,002 INFO L750 eck$LassoCheckResult]: Loop: 193#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#0(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#2(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-21 22:23:20,002 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:23:20,003 INFO L85 PathProgramCache]: Analyzing trace with hash 176793839, now seen corresponding path program 1 times [2023-11-21 22:23:20,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:23:20,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260037139] [2023-11-21 22:23:20,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:23:20,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:23:20,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:23:20,025 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 22:23:20,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:23:20,045 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 22:23:20,046 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:23:20,046 INFO L85 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 2 times [2023-11-21 22:23:20,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:23:20,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152288295] [2023-11-21 22:23:20,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:23:20,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:23:20,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:23:20,055 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 22:23:20,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:23:20,062 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 22:23:20,062 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:23:20,062 INFO L85 PathProgramCache]: Analyzing trace with hash -1899811567, now seen corresponding path program 1 times [2023-11-21 22:23:20,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:23:20,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482148459] [2023-11-21 22:23:20,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:23:20,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:23:20,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:23:20,094 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 22:23:20,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:23:20,133 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 22:23:20,918 INFO L210 LassoAnalysis]: Preferences: [2023-11-21 22:23:20,918 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-21 22:23:20,918 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-21 22:23:20,919 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-21 22:23:20,919 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-11-21 22:23:20,919 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:23:20,919 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-21 22:23:20,919 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-21 22:23:20,919 INFO L133 ssoRankerPreferences]: Filename of dumped script: lis-alloca-1.i_Iteration3_Lasso [2023-11-21 22:23:20,919 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-21 22:23:20,920 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-21 22:23:20,926 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:23:20,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-21 22:23:20,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-21 22:23:20,934 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:23:20,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-21 22:23:20,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-21 22:23:21,290 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:23:21,293 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:23:21,297 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:23:21,301 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:23:21,304 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:23:21,307 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:23:21,309 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:23:21,312 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:23:21,314 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:23:21,318 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:23:21,320 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:23:21,323 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:23:21,325 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:23:21,328 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:23:21,330 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:23:21,333 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:23:21,336 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:23:21,338 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:23:21,341 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:23:21,344 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:23:21,346 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:23:21,348 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:23:21,351 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:23:21,353 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:23:21,356 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:23:21,359 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:23:21,361 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:23:21,801 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-21 22:23:21,806 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-11-21 22:23:21,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:23:21,806 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:23:21,810 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 22:23:21,813 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2023-11-21 22:23:21,814 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-21 22:23:21,827 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 22:23:21,827 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-21 22:23:21,828 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 22:23:21,828 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 22:23:21,828 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 22:23:21,829 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-21 22:23:21,829 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-21 22:23:21,838 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-21 22:23:21,863 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2023-11-21 22:23:21,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:23:21,864 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:23:21,865 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 22:23:21,871 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-21 22:23:21,885 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2023-11-21 22:23:21,886 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 22:23:21,886 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-21 22:23:21,886 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 22:23:21,886 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 22:23:21,886 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 22:23:21,891 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-21 22:23:21,892 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-21 22:23:21,902 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-21 22:23:21,928 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2023-11-21 22:23:21,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:23:21,929 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:23:21,930 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 22:23:21,940 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-21 22:23:21,953 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 22:23:21,954 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-21 22:23:21,954 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 22:23:21,954 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 22:23:21,954 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 22:23:21,954 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2023-11-21 22:23:21,961 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-21 22:23:21,961 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-21 22:23:21,982 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-21 22:23:22,007 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2023-11-21 22:23:22,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:23:22,008 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:23:22,009 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 22:23:22,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-21 22:23:22,017 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2023-11-21 22:23:22,032 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 22:23:22,032 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 22:23:22,032 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 22:23:22,032 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 22:23:22,036 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-21 22:23:22,036 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-21 22:23:22,047 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-21 22:23:22,073 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2023-11-21 22:23:22,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:23:22,074 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:23:22,075 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 22:23:22,085 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-21 22:23:22,098 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2023-11-21 22:23:22,100 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 22:23:22,100 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-21 22:23:22,100 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 22:23:22,100 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 22:23:22,100 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 22:23:22,102 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-21 22:23:22,102 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-21 22:23:22,117 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-21 22:23:22,142 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2023-11-21 22:23:22,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:23:22,142 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:23:22,144 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 22:23:22,147 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2023-11-21 22:23:22,148 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-21 22:23:22,161 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 22:23:22,161 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-21 22:23:22,162 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 22:23:22,162 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 22:23:22,162 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 22:23:22,163 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-21 22:23:22,163 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-21 22:23:22,172 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-21 22:23:22,197 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2023-11-21 22:23:22,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:23:22,198 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:23:22,199 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 22:23:22,202 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-21 22:23:22,215 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2023-11-21 22:23:22,216 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 22:23:22,216 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 22:23:22,216 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 22:23:22,216 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 22:23:22,222 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-21 22:23:22,222 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-21 22:23:22,234 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-21 22:23:22,252 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2023-11-21 22:23:22,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:23:22,252 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:23:22,253 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 22:23:22,255 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-21 22:23:22,255 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2023-11-21 22:23:22,266 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 22:23:22,266 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-21 22:23:22,266 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 22:23:22,266 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 22:23:22,266 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 22:23:22,267 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-21 22:23:22,267 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-21 22:23:22,276 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-21 22:23:22,288 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2023-11-21 22:23:22,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:23:22,289 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:23:22,290 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 22:23:22,291 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2023-11-21 22:23:22,291 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-21 22:23:22,302 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 22:23:22,302 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 22:23:22,302 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 22:23:22,302 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 22:23:22,305 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-21 22:23:22,305 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-21 22:23:22,334 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-21 22:23:22,360 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2023-11-21 22:23:22,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:23:22,360 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:23:22,361 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 22:23:22,372 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-21 22:23:22,384 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2023-11-21 22:23:22,386 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 22:23:22,386 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 22:23:22,386 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 22:23:22,386 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 22:23:22,394 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-21 22:23:22,394 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-21 22:23:22,418 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-21 22:23:22,444 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2023-11-21 22:23:22,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:23:22,444 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:23:22,445 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 22:23:22,450 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2023-11-21 22:23:22,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-21 22:23:22,468 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 22:23:22,468 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 22:23:22,468 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 22:23:22,468 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 22:23:22,474 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-21 22:23:22,474 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-21 22:23:22,490 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-21 22:23:22,514 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2023-11-21 22:23:22,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:23:22,515 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:23:22,516 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 22:23:22,524 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-21 22:23:22,538 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2023-11-21 22:23:22,538 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 22:23:22,538 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 22:23:22,538 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 22:23:22,539 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 22:23:22,542 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-21 22:23:22,542 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-21 22:23:22,554 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-21 22:23:22,581 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2023-11-21 22:23:22,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:23:22,581 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:23:22,582 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 22:23:22,584 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2023-11-21 22:23:22,584 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-21 22:23:22,598 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 22:23:22,598 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-21 22:23:22,598 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 22:23:22,598 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 22:23:22,598 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 22:23:22,599 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-21 22:23:22,599 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-21 22:23:22,608 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-21 22:23:22,630 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2023-11-21 22:23:22,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:23:22,631 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:23:22,632 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 22:23:22,635 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-21 22:23:22,650 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2023-11-21 22:23:22,650 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 22:23:22,650 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 22:23:22,650 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 22:23:22,651 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 22:23:22,653 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-21 22:23:22,653 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-21 22:23:22,670 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-21 22:23:22,694 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2023-11-21 22:23:22,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:23:22,695 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:23:22,696 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 22:23:22,699 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2023-11-21 22:23:22,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-21 22:23:22,715 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 22:23:22,715 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 22:23:22,715 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 22:23:22,715 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 22:23:22,726 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-21 22:23:22,726 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-21 22:23:22,750 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-11-21 22:23:22,797 INFO L443 ModelExtractionUtils]: Simplification made 13 calls to the SMT solver. [2023-11-21 22:23:22,797 INFO L444 ModelExtractionUtils]: 5 out of 28 variables were initially zero. Simplification set additionally 20 variables to zero. [2023-11-21 22:23:22,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:23:22,798 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:23:22,799 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 22:23:22,802 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-11-21 22:23:22,814 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2023-11-21 22:23:22,840 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-11-21 22:23:22,840 INFO L513 LassoAnalysis]: Proved termination. [2023-11-21 22:23:22,840 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-21 22:23:22,860 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2023-11-21 22:23:22,937 INFO L156 tatePredicateManager]: 15 out of 15 supporting invariants were superfluous and have been removed [2023-11-21 22:23:22,952 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:23:22,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:23:22,983 INFO L262 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-21 22:23:22,984 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:23:23,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:23:23,010 INFO L262 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-21 22:23:23,010 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:23:23,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:23:23,029 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2023-11-21 22:23:23,029 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 29 transitions. cyclomatic complexity: 12 Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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-21 22:23:23,056 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 29 transitions. cyclomatic complexity: 12. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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 7 states. [2023-11-21 22:23:23,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2023-11-21 22:23:23,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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-21 22:23:23,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2023-11-21 22:23:23,059 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 8 letters. Loop has 2 letters. [2023-11-21 22:23:23,059 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-21 22:23:23,059 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 10 letters. Loop has 2 letters. [2023-11-21 22:23:23,060 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-21 22:23:23,060 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 8 letters. Loop has 4 letters. [2023-11-21 22:23:23,060 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-21 22:23:23,060 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 35 transitions. [2023-11-21 22:23:23,062 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2023-11-21 22:23:23,063 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 22 states and 31 transitions. [2023-11-21 22:23:23,063 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2023-11-21 22:23:23,063 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2023-11-21 22:23:23,063 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 31 transitions. [2023-11-21 22:23:23,064 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:23:23,064 INFO L218 hiAutomatonCegarLoop]: Abstraction has 22 states and 31 transitions. [2023-11-21 22:23:23,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 31 transitions. [2023-11-21 22:23:23,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2023-11-21 22:23:23,066 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-21 22:23:23,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2023-11-21 22:23:23,067 INFO L240 hiAutomatonCegarLoop]: Abstraction has 22 states and 31 transitions. [2023-11-21 22:23:23,068 INFO L428 stractBuchiCegarLoop]: Abstraction has 22 states and 31 transitions. [2023-11-21 22:23:23,068 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-11-21 22:23:23,068 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 31 transitions. [2023-11-21 22:23:23,069 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2023-11-21 22:23:23,069 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-21 22:23:23,069 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-21 22:23:23,070 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:23:23,070 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2023-11-21 22:23:23,070 INFO L748 eck$LassoCheckResult]: Stem: 357#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 348#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; 349#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 344#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; 337#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet19#1;call write~int#1(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; 338#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 339#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 340#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; 356#L517-3 assume !(lis_~i~0#1 < lis_~N#1); 358#L517-4 lis_~i~0#1 := 1; 347#L519-3 [2023-11-21 22:23:23,070 INFO L750 eck$LassoCheckResult]: Loop: 347#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 341#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 342#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 347#L519-3 [2023-11-21 22:23:23,071 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:23:23,071 INFO L85 PathProgramCache]: Analyzing trace with hash -1899811625, now seen corresponding path program 1 times [2023-11-21 22:23:23,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:23:23,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726472791] [2023-11-21 22:23:23,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:23:23,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:23:23,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:23:23,194 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-21 22:23:23,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:23:23,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726472791] [2023-11-21 22:23:23,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726472791] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:23:23,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:23:23,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-21 22:23:23,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182912546] [2023-11-21 22:23:23,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:23:23,196 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-21 22:23:23,196 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:23:23,197 INFO L85 PathProgramCache]: Analyzing trace with hash 74687, now seen corresponding path program 1 times [2023-11-21 22:23:23,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:23:23,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363731638] [2023-11-21 22:23:23,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:23:23,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:23:23,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:23:23,205 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 22:23:23,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:23:23,213 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 22:23:23,240 INFO L210 LassoAnalysis]: Preferences: [2023-11-21 22:23:23,241 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-21 22:23:23,241 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-21 22:23:23,241 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-21 22:23:23,241 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-11-21 22:23:23,241 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:23:23,241 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-21 22:23:23,242 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-21 22:23:23,242 INFO L133 ssoRankerPreferences]: Filename of dumped script: lis-alloca-1.i_Iteration4_Loop [2023-11-21 22:23:23,242 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-21 22:23:23,242 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-21 22:23:23,246 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:23:23,248 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:23:23,253 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:23:23,256 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:23:23,264 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:23:23,267 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:23:23,334 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-21 22:23:23,335 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-11-21 22:23:23,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:23:23,338 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:23:23,343 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 22:23:23,347 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-21 22:23:23,348 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-21 22:23:23,361 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2023-11-21 22:23:23,379 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-21 22:23:23,380 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-21 22:23:23,404 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2023-11-21 22:23:23,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:23:23,405 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:23:23,406 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 22:23:23,411 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-21 22:23:23,411 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-21 22:23:23,424 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2023-11-21 22:23:23,439 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-21 22:23:23,439 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-21 22:23:23,463 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2023-11-21 22:23:23,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:23:23,463 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:23:23,464 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 22:23:23,467 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-21 22:23:23,467 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-21 22:23:23,480 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2023-11-21 22:23:23,495 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-21 22:23:23,495 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-21 22:23:23,518 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2023-11-21 22:23:23,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:23:23,519 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:23:23,520 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 22:23:23,522 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-21 22:23:23,522 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-21 22:23:23,526 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2023-11-21 22:23:23,575 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2023-11-21 22:23:23,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:23:23,575 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:23:23,576 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 22:23:23,583 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-11-21 22:23:23,583 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-21 22:23:23,596 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2023-11-21 22:23:23,623 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-11-21 22:23:23,626 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2023-11-21 22:23:23,626 INFO L210 LassoAnalysis]: Preferences: [2023-11-21 22:23:23,626 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-21 22:23:23,626 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-21 22:23:23,626 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-21 22:23:23,626 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-11-21 22:23:23,626 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:23:23,627 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-21 22:23:23,627 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-21 22:23:23,627 INFO L133 ssoRankerPreferences]: Filename of dumped script: lis-alloca-1.i_Iteration4_Loop [2023-11-21 22:23:23,627 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-21 22:23:23,627 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-21 22:23:23,628 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:23:23,637 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:23:23,640 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:23:23,645 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:23:23,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-21 22:23:23,657 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:23:23,718 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-21 22:23:23,719 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-11-21 22:23:23,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:23:23,719 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:23:23,720 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 22:23:23,727 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-21 22:23:23,740 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2023-11-21 22:23:23,740 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 22:23:23,741 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-21 22:23:23,741 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 22:23:23,741 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 22:23:23,741 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 22:23:23,742 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-21 22:23:23,742 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-21 22:23:23,758 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-21 22:23:23,783 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2023-11-21 22:23:23,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:23:23,785 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:23:23,786 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 22:23:23,791 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-21 22:23:23,804 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2023-11-21 22:23:23,805 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 22:23:23,805 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 22:23:23,805 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 22:23:23,805 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 22:23:23,807 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-21 22:23:23,807 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-21 22:23:23,823 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-21 22:23:23,846 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2023-11-21 22:23:23,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:23:23,847 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:23:23,849 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 22:23:23,855 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-21 22:23:23,856 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2023-11-21 22:23:23,869 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 22:23:23,869 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 22:23:23,869 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 22:23:23,869 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 22:23:23,871 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-21 22:23:23,871 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-21 22:23:23,882 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-21 22:23:23,908 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2023-11-21 22:23:23,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:23:23,909 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:23:23,910 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 22:23:23,913 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-21 22:23:23,926 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2023-11-21 22:23:23,928 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 22:23:23,928 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-21 22:23:23,928 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 22:23:23,928 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 22:23:23,928 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 22:23:23,930 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-21 22:23:23,930 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-21 22:23:23,946 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-11-21 22:23:23,949 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-11-21 22:23:23,949 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-11-21 22:23:23,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:23:23,950 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:23:23,956 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 22:23:23,958 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-11-21 22:23:23,959 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-11-21 22:23:23,959 INFO L513 LassoAnalysis]: Proved termination. [2023-11-21 22:23:23,959 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-21 22:23:23,969 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2023-11-21 22:23:23,986 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2023-11-21 22:23:23,987 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-11-21 22:23:24,005 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:23:24,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:23:24,036 INFO L262 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-21 22:23:24,038 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:23:24,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:23:24,061 WARN L260 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-21 22:23:24,062 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:23:24,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:23:24,112 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-21 22:23:24,113 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-21 22:23:24,215 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-21 22:23:24,216 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-21 22:23:24,218 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-21 22:23:24,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2023-11-21 22:23:24,219 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 10 letters. Loop has 3 letters. [2023-11-21 22:23:24,219 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-21 22:23:24,219 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 13 letters. Loop has 3 letters. [2023-11-21 22:23:24,220 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-21 22:23:24,220 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 10 letters. Loop has 6 letters. [2023-11-21 22:23:24,221 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-21 22:23:24,221 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 67 transitions. [2023-11-21 22:23:24,225 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2023-11-21 22:23:24,227 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 41 states and 62 transitions. [2023-11-21 22:23:24,228 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2023-11-21 22:23:24,228 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2023-11-21 22:23:24,228 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 62 transitions. [2023-11-21 22:23:24,229 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-21 22:23:24,229 INFO L218 hiAutomatonCegarLoop]: Abstraction has 41 states and 62 transitions. [2023-11-21 22:23:24,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 62 transitions. [2023-11-21 22:23:24,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 33. [2023-11-21 22:23:24,233 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-21 22:23:24,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 50 transitions. [2023-11-21 22:23:24,235 INFO L240 hiAutomatonCegarLoop]: Abstraction has 33 states and 50 transitions. [2023-11-21 22:23:24,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:23:24,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-21 22:23:24,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-21 22:23:24,236 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-21 22:23:24,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:23:24,296 INFO L93 Difference]: Finished difference Result 34 states and 50 transitions. [2023-11-21 22:23:24,296 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 50 transitions. [2023-11-21 22:23:24,303 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2023-11-21 22:23:24,305 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 34 states and 50 transitions. [2023-11-21 22:23:24,306 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2023-11-21 22:23:24,306 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2023-11-21 22:23:24,306 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 50 transitions. [2023-11-21 22:23:24,306 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-21 22:23:24,306 INFO L218 hiAutomatonCegarLoop]: Abstraction has 34 states and 50 transitions. [2023-11-21 22:23:24,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 50 transitions. [2023-11-21 22:23:24,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2023-11-21 22:23:24,317 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-21 22:23:24,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 49 transitions. [2023-11-21 22:23:24,318 INFO L240 hiAutomatonCegarLoop]: Abstraction has 33 states and 49 transitions. [2023-11-21 22:23:24,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-21 22:23:24,321 INFO L428 stractBuchiCegarLoop]: Abstraction has 33 states and 49 transitions. [2023-11-21 22:23:24,322 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2023-11-21 22:23:24,322 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 49 transitions. [2023-11-21 22:23:24,322 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2023-11-21 22:23:24,323 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-21 22:23:24,323 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-21 22:23:24,323 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:23:24,323 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:23:24,325 INFO L748 eck$LassoCheckResult]: Stem: 566#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 555#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; 556#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 547#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; 538#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet19#1;call write~int#1(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; 539#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 540#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 541#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; 565#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#0(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#2(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 557#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 558#L517-3 assume !(lis_~i~0#1 < lis_~N#1); 567#L517-4 lis_~i~0#1 := 1; 568#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 542#L520-3 [2023-11-21 22:23:24,326 INFO L750 eck$LassoCheckResult]: Loop: 542#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int#1(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int#1(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; 543#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int#0(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; 548#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; 549#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 561#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 552#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 553#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 542#L520-3 [2023-11-21 22:23:24,326 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:23:24,326 INFO L85 PathProgramCache]: Analyzing trace with hash 1792663252, now seen corresponding path program 1 times [2023-11-21 22:23:24,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:23:24,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428244621] [2023-11-21 22:23:24,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:23:24,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:23:24,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:23:24,591 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:23:24,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:23:24,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428244621] [2023-11-21 22:23:24,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428244621] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 22:23:24,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [696667626] [2023-11-21 22:23:24,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:23:24,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:23:24,593 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:23:24,595 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 22:23:24,618 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2023-11-21 22:23:24,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:23:24,718 INFO L262 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-21 22:23:24,720 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:23:24,749 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2023-11-21 22:23:24,783 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2023-11-21 22:23:24,813 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-21 22:23:24,814 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 22:23:24,874 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-21 22:23:24,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [696667626] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 22:23:24,875 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 22:23:24,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2023-11-21 22:23:24,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414978704] [2023-11-21 22:23:24,876 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 22:23:24,876 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-21 22:23:24,877 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:23:24,877 INFO L85 PathProgramCache]: Analyzing trace with hash -1094746892, now seen corresponding path program 1 times [2023-11-21 22:23:24,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:23:24,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681241354] [2023-11-21 22:23:24,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:23:24,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:23:24,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:23:24,892 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 22:23:24,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:23:24,913 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 22:23:25,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:23:25,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-21 22:23:25,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-11-21 22:23:25,125 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.3) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:23:25,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:23:25,448 INFO L93 Difference]: Finished difference Result 81 states and 109 transitions. [2023-11-21 22:23:25,448 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 81 states and 109 transitions. [2023-11-21 22:23:25,449 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2023-11-21 22:23:25,450 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 81 states to 58 states and 81 transitions. [2023-11-21 22:23:25,450 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2023-11-21 22:23:25,450 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2023-11-21 22:23:25,450 INFO L73 IsDeterministic]: Start isDeterministic. Operand 58 states and 81 transitions. [2023-11-21 22:23:25,451 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-21 22:23:25,451 INFO L218 hiAutomatonCegarLoop]: Abstraction has 58 states and 81 transitions. [2023-11-21 22:23:25,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states and 81 transitions. [2023-11-21 22:23:25,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 37. [2023-11-21 22:23:25,453 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-21 22:23:25,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 51 transitions. [2023-11-21 22:23:25,454 INFO L240 hiAutomatonCegarLoop]: Abstraction has 37 states and 51 transitions. [2023-11-21 22:23:25,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-21 22:23:25,461 INFO L428 stractBuchiCegarLoop]: Abstraction has 37 states and 51 transitions. [2023-11-21 22:23:25,461 INFO L335 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2023-11-21 22:23:25,461 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 51 transitions. [2023-11-21 22:23:25,463 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2023-11-21 22:23:25,463 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-21 22:23:25,463 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-21 22:23:25,464 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:23:25,464 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:23:25,465 INFO L748 eck$LassoCheckResult]: Stem: 793#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 781#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; 782#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 773#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; 764#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet19#1;call write~int#1(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; 765#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 766#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet19#1;call write~int#1(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; 767#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 797#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 791#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; 792#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#0(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#2(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 783#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 784#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#0(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#2(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 796#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 798#L517-3 assume !(lis_~i~0#1 < lis_~N#1); 794#L517-4 lis_~i~0#1 := 1; 785#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 768#L520-3 [2023-11-21 22:23:25,465 INFO L750 eck$LassoCheckResult]: Loop: 768#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int#1(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int#1(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; 769#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int#0(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; 774#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; 775#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 787#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 778#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 779#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 768#L520-3 [2023-11-21 22:23:25,465 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:23:25,465 INFO L85 PathProgramCache]: Analyzing trace with hash 37388752, now seen corresponding path program 2 times [2023-11-21 22:23:25,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:23:25,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764390964] [2023-11-21 22:23:25,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:23:25,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:23:25,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:23:25,512 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 22:23:25,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:23:25,556 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 22:23:25,557 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:23:25,557 INFO L85 PathProgramCache]: Analyzing trace with hash -1094746892, now seen corresponding path program 2 times [2023-11-21 22:23:25,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:23:25,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445137648] [2023-11-21 22:23:25,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:23:25,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:23:25,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:23:25,570 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 22:23:25,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:23:25,585 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 22:23:25,585 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:23:25,585 INFO L85 PathProgramCache]: Analyzing trace with hash 502604869, now seen corresponding path program 1 times [2023-11-21 22:23:25,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:23:25,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636271948] [2023-11-21 22:23:25,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:23:25,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:23:25,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:23:25,827 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-21 22:23:25,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:23:25,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636271948] [2023-11-21 22:23:25,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636271948] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 22:23:25,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [183151312] [2023-11-21 22:23:25,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:23:25,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:23:25,828 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:23:25,831 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 22:23:25,854 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2023-11-21 22:23:25,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:23:25,937 INFO L262 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-21 22:23:25,940 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:23:26,033 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-21 22:23:26,034 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 22:23:26,109 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-21 22:23:26,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [183151312] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 22:23:26,110 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 22:23:26,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 12 [2023-11-21 22:23:26,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501875400] [2023-11-21 22:23:26,113 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 22:23:26,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:23:26,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-21 22:23:26,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2023-11-21 22:23:26,371 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-21 22:23:26,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:23:26,545 INFO L93 Difference]: Finished difference Result 68 states and 92 transitions. [2023-11-21 22:23:26,546 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 92 transitions. [2023-11-21 22:23:26,547 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 17 [2023-11-21 22:23:26,548 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 62 states and 83 transitions. [2023-11-21 22:23:26,548 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2023-11-21 22:23:26,548 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2023-11-21 22:23:26,548 INFO L73 IsDeterministic]: Start isDeterministic. Operand 62 states and 83 transitions. [2023-11-21 22:23:26,548 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-21 22:23:26,548 INFO L218 hiAutomatonCegarLoop]: Abstraction has 62 states and 83 transitions. [2023-11-21 22:23:26,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states and 83 transitions. [2023-11-21 22:23:26,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 55. [2023-11-21 22:23:26,552 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-21 22:23:26,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 75 transitions. [2023-11-21 22:23:26,553 INFO L240 hiAutomatonCegarLoop]: Abstraction has 55 states and 75 transitions. [2023-11-21 22:23:26,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-21 22:23:26,555 INFO L428 stractBuchiCegarLoop]: Abstraction has 55 states and 75 transitions. [2023-11-21 22:23:26,555 INFO L335 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2023-11-21 22:23:26,556 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 55 states and 75 transitions. [2023-11-21 22:23:26,556 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2023-11-21 22:23:26,556 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-21 22:23:26,557 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-21 22:23:26,557 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:23:26,557 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2023-11-21 22:23:26,558 INFO L748 eck$LassoCheckResult]: Stem: 1066#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1053#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; 1054#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 1045#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; 1035#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet19#1;call write~int#1(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; 1036#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 1082#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet19#1;call write~int#1(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; 1081#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 1080#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 1079#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; 1069#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#0(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#2(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 1070#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 1071#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#0(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#2(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 1055#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 1056#L517-3 assume !(lis_~i~0#1 < lis_~N#1); 1067#L517-4 lis_~i~0#1 := 1; 1057#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 1058#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int#1(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int#1(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; 1063#L521 [2023-11-21 22:23:26,558 INFO L750 eck$LassoCheckResult]: Loop: 1063#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int#0(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; 1046#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; 1047#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 1059#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int#1(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int#1(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; 1063#L521 [2023-11-21 22:23:26,558 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:23:26,558 INFO L85 PathProgramCache]: Analyzing trace with hash 1159051365, now seen corresponding path program 1 times [2023-11-21 22:23:26,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:23:26,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110761084] [2023-11-21 22:23:26,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:23:26,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:23:26,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:23:26,591 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 22:23:26,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:23:26,613 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 22:23:26,613 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:23:26,614 INFO L85 PathProgramCache]: Analyzing trace with hash 2655420, now seen corresponding path program 1 times [2023-11-21 22:23:26,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:23:26,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231980892] [2023-11-21 22:23:26,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:23:26,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:23:26,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:23:26,620 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 22:23:26,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:23:26,626 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 22:23:26,627 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:23:26,627 INFO L85 PathProgramCache]: Analyzing trace with hash -651990240, now seen corresponding path program 1 times [2023-11-21 22:23:26,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:23:26,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464982161] [2023-11-21 22:23:26,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:23:26,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:23:26,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:23:26,791 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-21 22:23:26,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:23:26,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464982161] [2023-11-21 22:23:26,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464982161] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 22:23:26,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1728713030] [2023-11-21 22:23:26,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:23:26,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:23:26,792 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:23:26,793 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 22:23:26,819 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2023-11-21 22:23:26,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:23:26,905 INFO L262 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-21 22:23:26,908 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:23:26,959 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-21 22:23:26,960 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-21 22:23:26,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1728713030] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:23:26,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-21 22:23:26,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 11 [2023-11-21 22:23:26,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673353215] [2023-11-21 22:23:26,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:23:27,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:23:27,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-21 22:23:27,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2023-11-21 22:23:27,185 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-21 22:23:27,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:23:27,248 INFO L93 Difference]: Finished difference Result 72 states and 97 transitions. [2023-11-21 22:23:27,248 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 72 states and 97 transitions. [2023-11-21 22:23:27,249 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2023-11-21 22:23:27,252 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 72 states to 72 states and 97 transitions. [2023-11-21 22:23:27,253 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2023-11-21 22:23:27,253 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2023-11-21 22:23:27,253 INFO L73 IsDeterministic]: Start isDeterministic. Operand 72 states and 97 transitions. [2023-11-21 22:23:27,253 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-21 22:23:27,253 INFO L218 hiAutomatonCegarLoop]: Abstraction has 72 states and 97 transitions. [2023-11-21 22:23:27,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states and 97 transitions. [2023-11-21 22:23:27,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 64. [2023-11-21 22:23:27,263 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-21 22:23:27,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 88 transitions. [2023-11-21 22:23:27,268 INFO L240 hiAutomatonCegarLoop]: Abstraction has 64 states and 88 transitions. [2023-11-21 22:23:27,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-21 22:23:27,270 INFO L428 stractBuchiCegarLoop]: Abstraction has 64 states and 88 transitions. [2023-11-21 22:23:27,271 INFO L335 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2023-11-21 22:23:27,272 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 64 states and 88 transitions. [2023-11-21 22:23:27,272 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2023-11-21 22:23:27,273 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-21 22:23:27,274 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-21 22:23:27,274 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-21 22:23:27,275 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2023-11-21 22:23:27,275 INFO L748 eck$LassoCheckResult]: Stem: 1274#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1258#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; 1259#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 1251#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; 1242#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet19#1;call write~int#1(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; 1243#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 1297#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet19#1;call write~int#1(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; 1295#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 1292#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 1291#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; 1277#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#0(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#2(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 1260#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 1261#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#0(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#2(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 1278#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); 1275#L517-4 lis_~i~0#1 := 1; 1262#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 1263#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 1302#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 1279#L519-3 assume !(lis_~i~0#1 < lis_~N#1); 1276#L519-4 lis_~i~0#1 := 0; 1270#L523-3 [2023-11-21 22:23:27,275 INFO L750 eck$LassoCheckResult]: Loop: 1270#L523-3 assume !!(lis_~i~0#1 < lis_~N#1);call lis_#t~mem14#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4); 1271#L524 assume lis_~max~0#1 < lis_#t~mem14#1;havoc lis_#t~mem14#1;call lis_#t~mem15#1 := read~int#0(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; 1272#L523-2 lis_#t~post13#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post13#1;havoc lis_#t~post13#1; 1270#L523-3 [2023-11-21 22:23:27,276 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:23:27,276 INFO L85 PathProgramCache]: Analyzing trace with hash 2057131266, now seen corresponding path program 1 times [2023-11-21 22:23:27,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:23:27,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354531809] [2023-11-21 22:23:27,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:23:27,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:23:27,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:23:27,358 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-21 22:23:27,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:23:27,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354531809] [2023-11-21 22:23:27,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354531809] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:23:27,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:23:27,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-21 22:23:27,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468034355] [2023-11-21 22:23:27,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:23:27,360 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-21 22:23:27,361 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:23:27,361 INFO L85 PathProgramCache]: Analyzing trace with hash 111317, now seen corresponding path program 1 times [2023-11-21 22:23:27,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:23:27,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041435464] [2023-11-21 22:23:27,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:23:27,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:23:27,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:23:27,368 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 22:23:27,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:23:27,375 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 22:23:27,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:23:27,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-21 22:23:27,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-21 22:23:27,440 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-21 22:23:27,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:23:27,510 INFO L93 Difference]: Finished difference Result 67 states and 89 transitions. [2023-11-21 22:23:27,510 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 67 states and 89 transitions. [2023-11-21 22:23:27,510 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2023-11-21 22:23:27,511 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 67 states to 66 states and 88 transitions. [2023-11-21 22:23:27,512 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2023-11-21 22:23:27,512 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2023-11-21 22:23:27,512 INFO L73 IsDeterministic]: Start isDeterministic. Operand 66 states and 88 transitions. [2023-11-21 22:23:27,512 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-21 22:23:27,512 INFO L218 hiAutomatonCegarLoop]: Abstraction has 66 states and 88 transitions. [2023-11-21 22:23:27,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states and 88 transitions. [2023-11-21 22:23:27,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2023-11-21 22:23:27,516 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-21 22:23:27,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 86 transitions. [2023-11-21 22:23:27,517 INFO L240 hiAutomatonCegarLoop]: Abstraction has 64 states and 86 transitions. [2023-11-21 22:23:27,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-21 22:23:27,518 INFO L428 stractBuchiCegarLoop]: Abstraction has 64 states and 86 transitions. [2023-11-21 22:23:27,518 INFO L335 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2023-11-21 22:23:27,518 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 64 states and 86 transitions. [2023-11-21 22:23:27,519 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2023-11-21 22:23:27,519 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-21 22:23:27,519 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-21 22:23:27,520 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-21 22:23:27,520 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:23:27,521 INFO L748 eck$LassoCheckResult]: Stem: 1411#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1395#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; 1396#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 1388#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; 1380#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet19#1;call write~int#1(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; 1381#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 1382#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet19#1;call write~int#1(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; 1383#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 1434#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet19#1;call write~int#1(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; 1435#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 1436#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 1433#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; 1432#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#0(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#2(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 1397#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 1398#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#0(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#2(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 1415#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 1428#L517-3 assume !(lis_~i~0#1 < lis_~N#1); 1427#L517-4 lis_~i~0#1 := 1; 1424#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 1425#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int#1(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int#1(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; 1443#L521 assume !lis_#t~short11#1; 1442#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#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int#0(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#2(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 1441#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 1384#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 1385#L519-2 [2023-11-21 22:23:27,521 INFO L750 eck$LassoCheckResult]: Loop: 1385#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 1393#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 1418#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int#1(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int#1(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; 1439#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int#0(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; 1438#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; 1402#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 1403#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 1385#L519-2 [2023-11-21 22:23:27,521 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:23:27,521 INFO L85 PathProgramCache]: Analyzing trace with hash -1034472260, now seen corresponding path program 1 times [2023-11-21 22:23:27,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:23:27,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392063944] [2023-11-21 22:23:27,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:23:27,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:23:27,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:23:27,570 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-21 22:23:27,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:23:27,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392063944] [2023-11-21 22:23:27,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392063944] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:23:27,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:23:27,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-21 22:23:27,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447472687] [2023-11-21 22:23:27,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:23:27,572 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-21 22:23:27,572 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:23:27,572 INFO L85 PathProgramCache]: Analyzing trace with hash 782548870, now seen corresponding path program 3 times [2023-11-21 22:23:27,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:23:27,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022709263] [2023-11-21 22:23:27,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:23:27,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:23:27,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:23:27,580 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 22:23:27,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:23:27,587 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 22:23:27,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:23:27,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 22:23:27,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 22:23:27,810 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-21 22:23:27,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:23:27,824 INFO L93 Difference]: Finished difference Result 69 states and 91 transitions. [2023-11-21 22:23:27,824 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 91 transitions. [2023-11-21 22:23:27,824 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2023-11-21 22:23:27,825 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 69 states and 91 transitions. [2023-11-21 22:23:27,825 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39 [2023-11-21 22:23:27,826 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39 [2023-11-21 22:23:27,826 INFO L73 IsDeterministic]: Start isDeterministic. Operand 69 states and 91 transitions. [2023-11-21 22:23:27,826 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-21 22:23:27,826 INFO L218 hiAutomatonCegarLoop]: Abstraction has 69 states and 91 transitions. [2023-11-21 22:23:27,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states and 91 transitions. [2023-11-21 22:23:27,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2023-11-21 22:23:27,830 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-21 22:23:27,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 91 transitions. [2023-11-21 22:23:27,830 INFO L240 hiAutomatonCegarLoop]: Abstraction has 69 states and 91 transitions. [2023-11-21 22:23:27,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:23:27,832 INFO L428 stractBuchiCegarLoop]: Abstraction has 69 states and 91 transitions. [2023-11-21 22:23:27,832 INFO L335 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2023-11-21 22:23:27,832 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 69 states and 91 transitions. [2023-11-21 22:23:27,833 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2023-11-21 22:23:27,833 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-21 22:23:27,833 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-21 22:23:27,834 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-21 22:23:27,834 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:23:27,834 INFO L748 eck$LassoCheckResult]: Stem: 1555#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1535#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; 1536#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 1527#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; 1519#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet19#1;call write~int#1(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; 1520#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 1521#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet19#1;call write~int#1(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; 1522#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 1578#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet19#1;call write~int#1(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; 1577#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 1576#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 1575#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; 1573#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#0(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#2(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 1572#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 1571#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#0(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#2(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 1570#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 1569#L517-3 assume !(lis_~i~0#1 < lis_~N#1); 1568#L517-4 lis_~i~0#1 := 1; 1566#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 1523#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int#1(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int#1(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; 1524#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int#0(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; 1587#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#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int#0(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#2(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 1542#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 1543#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 1532#L519-2 [2023-11-21 22:23:27,834 INFO L750 eck$LassoCheckResult]: Loop: 1532#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 1533#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 1561#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int#1(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int#1(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; 1580#L521 assume !lis_#t~short11#1; 1582#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; 1581#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 1579#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 1532#L519-2 [2023-11-21 22:23:27,835 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:23:27,835 INFO L85 PathProgramCache]: Analyzing trace with hash -1034531842, now seen corresponding path program 1 times [2023-11-21 22:23:27,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:23:27,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626231440] [2023-11-21 22:23:27,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:23:27,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:23:27,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:23:28,001 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-21 22:23:28,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:23:28,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626231440] [2023-11-21 22:23:28,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626231440] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 22:23:28,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1387107623] [2023-11-21 22:23:28,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:23:28,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:23:28,003 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:23:28,006 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 22:23:28,041 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2023-11-21 22:23:28,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:23:28,127 INFO L262 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-21 22:23:28,129 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:23:28,214 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-21 22:23:28,214 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 22:23:28,299 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-21 22:23:28,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1387107623] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 22:23:28,299 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 22:23:28,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2023-11-21 22:23:28,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429768815] [2023-11-21 22:23:28,299 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 22:23:28,300 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-21 22:23:28,300 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:23:28,300 INFO L85 PathProgramCache]: Analyzing trace with hash 782608452, now seen corresponding path program 1 times [2023-11-21 22:23:28,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:23:28,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550956620] [2023-11-21 22:23:28,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:23:28,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:23:28,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:23:28,306 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 22:23:28,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:23:28,310 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 22:23:28,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:23:28,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-21 22:23:28,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2023-11-21 22:23:28,434 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-21 22:23:28,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:23:28,737 INFO L93 Difference]: Finished difference Result 76 states and 99 transitions. [2023-11-21 22:23:28,737 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 76 states and 99 transitions. [2023-11-21 22:23:28,738 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2023-11-21 22:23:28,739 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 76 states to 76 states and 99 transitions. [2023-11-21 22:23:28,739 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 43 [2023-11-21 22:23:28,739 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 43 [2023-11-21 22:23:28,739 INFO L73 IsDeterministic]: Start isDeterministic. Operand 76 states and 99 transitions. [2023-11-21 22:23:28,740 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-21 22:23:28,740 INFO L218 hiAutomatonCegarLoop]: Abstraction has 76 states and 99 transitions. [2023-11-21 22:23:28,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states and 99 transitions. [2023-11-21 22:23:28,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 71. [2023-11-21 22:23:28,744 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-21 22:23:28,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 93 transitions. [2023-11-21 22:23:28,744 INFO L240 hiAutomatonCegarLoop]: Abstraction has 71 states and 93 transitions. [2023-11-21 22:23:28,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-21 22:23:28,745 INFO L428 stractBuchiCegarLoop]: Abstraction has 71 states and 93 transitions. [2023-11-21 22:23:28,745 INFO L335 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2023-11-21 22:23:28,746 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 71 states and 93 transitions. [2023-11-21 22:23:28,746 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2023-11-21 22:23:28,747 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-21 22:23:28,747 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-21 22:23:28,748 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-21 22:23:28,748 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2023-11-21 22:23:28,748 INFO L748 eck$LassoCheckResult]: Stem: 1864#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1846#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; 1847#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 1837#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; 1829#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet19#1;call write~int#1(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; 1830#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 1831#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet19#1;call write~int#1(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; 1832#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 1879#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 1881#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; 1867#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#0(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#2(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 1868#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 1885#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#0(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#2(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 1884#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 1883#L517-3 assume !(lis_~i~0#1 < lis_~N#1); 1865#L517-4 lis_~i~0#1 := 1; 1850#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 1851#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int#1(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int#1(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; 1895#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int#0(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; 1893#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#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int#0(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#2(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 1892#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 1891#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 1890#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 1887#L519-3 assume !(lis_~i~0#1 < lis_~N#1); 1866#L519-4 lis_~i~0#1 := 0; 1859#L523-3 [2023-11-21 22:23:28,748 INFO L750 eck$LassoCheckResult]: Loop: 1859#L523-3 assume !!(lis_~i~0#1 < lis_~N#1);call lis_#t~mem14#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4); 1860#L524 assume lis_~max~0#1 < lis_#t~mem14#1;havoc lis_#t~mem14#1;call lis_#t~mem15#1 := read~int#0(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; 1861#L523-2 lis_#t~post13#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post13#1;havoc lis_#t~post13#1; 1859#L523-3 [2023-11-21 22:23:28,749 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:23:28,749 INFO L85 PathProgramCache]: Analyzing trace with hash -1656376535, now seen corresponding path program 1 times [2023-11-21 22:23:28,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:23:28,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389356916] [2023-11-21 22:23:28,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:23:28,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:23:28,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:23:28,780 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 22:23:28,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:23:28,806 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 22:23:28,807 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:23:28,807 INFO L85 PathProgramCache]: Analyzing trace with hash 111317, now seen corresponding path program 2 times [2023-11-21 22:23:28,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:23:28,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315388851] [2023-11-21 22:23:28,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:23:28,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:23:28,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:23:28,812 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 22:23:28,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:23:28,815 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 22:23:28,816 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:23:28,816 INFO L85 PathProgramCache]: Analyzing trace with hash -234008915, now seen corresponding path program 1 times [2023-11-21 22:23:28,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:23:28,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96614318] [2023-11-21 22:23:28,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:23:28,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:23:28,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:23:28,849 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 22:23:28,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:23:28,881 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 22:23:34,093 WARN L293 SmtUtils]: Spent 5.11s 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-21 22:23:35,195 INFO L210 LassoAnalysis]: Preferences: [2023-11-21 22:23:35,195 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-21 22:23:35,195 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-21 22:23:35,195 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-21 22:23:35,195 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-11-21 22:23:35,195 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:23:35,195 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-21 22:23:35,196 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-21 22:23:35,196 INFO L133 ssoRankerPreferences]: Filename of dumped script: lis-alloca-1.i_Iteration11_Lasso [2023-11-21 22:23:35,196 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-21 22:23:35,196 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-21 22:23:35,200 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:23:35,208 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:23:35,211 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:23:35,213 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:23:35,216 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:23:35,218 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:23:35,221 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:23:35,224 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:23:35,232 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:23:35,239 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:23:35,242 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:23:35,244 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:23:35,247 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:23:35,249 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:23:35,252 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:23:35,255 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:23:35,258 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:23:36,149 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:23:36,152 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:23:36,154 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:23:36,178 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:23:36,181 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:23:36,184 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:23:36,187 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:23:36,189 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:23:36,192 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:23:36,194 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:23:36,197 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:23:36,199 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:23:36,202 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:23:36,804 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-21 22:23:36,804 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-11-21 22:23:36,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:23:36,805 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:23:36,807 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 22:23:36,813 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2023-11-21 22:23:36,814 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-21 22:23:36,824 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 22:23:36,824 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-21 22:23:36,825 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 22:23:36,825 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 22:23:36,825 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 22:23:36,825 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-21 22:23:36,825 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-21 22:23:36,826 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-21 22:23:36,839 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Ended with exit code 0 [2023-11-21 22:23:36,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:23:36,840 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:23:36,841 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 22:23:36,842 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-21 22:23:36,845 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2023-11-21 22:23:36,852 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 22:23:36,853 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-21 22:23:36,853 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 22:23:36,853 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 22:23:36,853 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 22:23:36,853 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-21 22:23:36,853 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-21 22:23:36,854 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-21 22:23:36,865 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2023-11-21 22:23:36,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:23:36,866 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:23:36,867 INFO L229 MonitoredProcess]: Starting monitored process 42 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 22:23:36,868 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2023-11-21 22:23:36,868 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-21 22:23:36,878 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 22:23:36,878 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-21 22:23:36,878 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 22:23:36,878 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 22:23:36,878 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 22:23:36,879 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-21 22:23:36,879 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-21 22:23:36,890 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-21 22:23:36,904 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2023-11-21 22:23:36,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:23:36,904 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:23:36,905 INFO L229 MonitoredProcess]: Starting monitored process 43 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 22:23:36,906 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2023-11-21 22:23:36,906 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-21 22:23:36,916 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 22:23:36,916 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-21 22:23:36,916 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 22:23:36,916 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 22:23:36,917 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 22:23:36,917 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-21 22:23:36,917 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-21 22:23:36,935 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-21 22:23:36,951 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2023-11-21 22:23:36,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:23:36,953 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:23:36,953 INFO L229 MonitoredProcess]: Starting monitored process 44 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 22:23:36,954 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2023-11-21 22:23:36,958 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-21 22:23:36,970 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 22:23:36,970 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-21 22:23:36,971 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 22:23:36,971 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 22:23:36,971 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 22:23:36,971 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-21 22:23:36,972 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-21 22:23:36,986 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-21 22:23:37,006 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2023-11-21 22:23:37,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:23:37,007 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:23:37,008 INFO L229 MonitoredProcess]: Starting monitored process 45 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 22:23:37,015 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-21 22:23:37,028 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2023-11-21 22:23:37,028 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 22:23:37,028 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-21 22:23:37,029 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 22:23:37,029 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 22:23:37,029 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 22:23:37,029 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-21 22:23:37,029 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-21 22:23:37,046 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-21 22:23:37,070 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0 [2023-11-21 22:23:37,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:23:37,070 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:23:37,071 INFO L229 MonitoredProcess]: Starting monitored process 46 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 22:23:37,079 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-21 22:23:37,092 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2023-11-21 22:23:37,093 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 22:23:37,093 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 22:23:37,093 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 22:23:37,093 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 22:23:37,107 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-21 22:23:37,107 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-21 22:23:37,126 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-21 22:23:37,142 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Forceful destruction successful, exit code 0 [2023-11-21 22:23:37,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:23:37,142 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:23:37,143 INFO L229 MonitoredProcess]: Starting monitored process 47 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 22:23:37,144 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2023-11-21 22:23:37,144 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-21 22:23:37,155 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 22:23:37,155 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 22:23:37,155 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 22:23:37,155 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 22:23:37,157 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-21 22:23:37,157 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-21 22:23:37,166 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-21 22:23:37,190 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Ended with exit code 0 [2023-11-21 22:23:37,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:23:37,191 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:23:37,191 INFO L229 MonitoredProcess]: Starting monitored process 48 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 22:23:37,193 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2023-11-21 22:23:37,193 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-21 22:23:37,204 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 22:23:37,204 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-21 22:23:37,204 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 22:23:37,205 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 22:23:37,205 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 22:23:37,205 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-21 22:23:37,205 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-21 22:23:37,206 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-21 22:23:37,223 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Ended with exit code 0 [2023-11-21 22:23:37,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:23:37,223 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:23:37,224 INFO L229 MonitoredProcess]: Starting monitored process 49 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 22:23:37,225 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2023-11-21 22:23:37,225 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-21 22:23:37,235 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 22:23:37,235 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 22:23:37,236 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 22:23:37,236 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 22:23:37,237 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-21 22:23:37,237 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-21 22:23:37,241 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-21 22:23:37,253 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Forceful destruction successful, exit code 0 [2023-11-21 22:23:37,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:23:37,254 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:23:37,255 INFO L229 MonitoredProcess]: Starting monitored process 50 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 22:23:37,256 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-21 22:23:37,257 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2023-11-21 22:23:37,267 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 22:23:37,267 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-21 22:23:37,268 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 22:23:37,268 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 22:23:37,268 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 22:23:37,268 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-21 22:23:37,268 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-21 22:23:37,270 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-21 22:23:37,281 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Ended with exit code 0 [2023-11-21 22:23:37,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:23:37,283 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:23:37,284 INFO L229 MonitoredProcess]: Starting monitored process 51 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 22:23:37,287 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-21 22:23:37,299 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 22:23:37,299 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-21 22:23:37,300 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 22:23:37,300 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 22:23:37,300 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 22:23:37,300 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-21 22:23:37,300 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-21 22:23:37,301 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2023-11-21 22:23:37,302 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-21 22:23:37,313 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Ended with exit code 0 [2023-11-21 22:23:37,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:23:37,313 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:23:37,314 INFO L229 MonitoredProcess]: Starting monitored process 52 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 22:23:37,315 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2023-11-21 22:23:37,316 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-21 22:23:37,326 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 22:23:37,326 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-21 22:23:37,326 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 22:23:37,326 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 22:23:37,326 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 22:23:37,327 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-21 22:23:37,327 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-21 22:23:37,331 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-21 22:23:37,344 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Ended with exit code 0 [2023-11-21 22:23:37,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:23:37,344 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:23:37,345 INFO L229 MonitoredProcess]: Starting monitored process 53 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 22:23:37,347 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2023-11-21 22:23:37,347 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-21 22:23:37,359 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 22:23:37,360 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 22:23:37,360 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 22:23:37,360 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 22:23:37,362 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-21 22:23:37,362 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-21 22:23:37,366 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-21 22:23:37,379 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Ended with exit code 0 [2023-11-21 22:23:37,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:23:37,379 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:23:37,382 INFO L229 MonitoredProcess]: Starting monitored process 54 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 22:23:37,385 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-21 22:23:37,400 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2023-11-21 22:23:37,400 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 22:23:37,400 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-21 22:23:37,401 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 22:23:37,401 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 22:23:37,401 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 22:23:37,401 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-21 22:23:37,402 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-21 22:23:37,426 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-21 22:23:37,446 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Forceful destruction successful, exit code 0 [2023-11-21 22:23:37,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:23:37,447 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:23:37,448 INFO L229 MonitoredProcess]: Starting monitored process 55 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 22:23:37,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-21 22:23:37,463 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2023-11-21 22:23:37,464 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 22:23:37,464 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 22:23:37,464 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 22:23:37,465 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 22:23:37,466 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-21 22:23:37,466 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-21 22:23:37,490 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-21 22:23:37,510 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Forceful destruction successful, exit code 0 [2023-11-21 22:23:37,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:23:37,511 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:23:37,512 INFO L229 MonitoredProcess]: Starting monitored process 56 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 22:23:37,513 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2023-11-21 22:23:37,513 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-21 22:23:37,535 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 22:23:37,535 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 22:23:37,535 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 22:23:37,535 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 22:23:37,539 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-21 22:23:37,539 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-21 22:23:37,545 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-21 22:23:37,557 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Ended with exit code 0 [2023-11-21 22:23:37,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:23:37,557 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:23:37,558 INFO L229 MonitoredProcess]: Starting monitored process 57 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 22:23:37,559 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2023-11-21 22:23:37,560 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-21 22:23:37,571 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 22:23:37,571 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 22:23:37,571 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 22:23:37,571 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 22:23:37,578 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-21 22:23:37,578 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-21 22:23:37,593 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-11-21 22:23:37,614 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2023-11-21 22:23:37,614 INFO L444 ModelExtractionUtils]: 0 out of 19 variables were initially zero. Simplification set additionally 16 variables to zero. [2023-11-21 22:23:37,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:23:37,614 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:23:37,615 INFO L229 MonitoredProcess]: Starting monitored process 58 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 22:23:37,616 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2023-11-21 22:23:37,617 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-11-21 22:23:37,629 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-11-21 22:23:37,629 INFO L513 LassoAnalysis]: Proved termination. [2023-11-21 22:23:37,629 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_lis_~N#1, ULTIMATE.start_lis_~i~0#1) = 3*ULTIMATE.start_lis_~N#1 - 4*ULTIMATE.start_lis_~i~0#1 Supporting invariants [] [2023-11-21 22:23:37,645 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Forceful destruction successful, exit code 0 [2023-11-21 22:23:37,744 INFO L156 tatePredicateManager]: 20 out of 21 supporting invariants were superfluous and have been removed [2023-11-21 22:23:37,768 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:23:37,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:23:37,826 INFO L262 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 13 conjunts are in the unsatisfiable core [2023-11-21 22:23:37,828 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:23:38,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:23:38,026 INFO L262 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-21 22:23:38,026 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:23:38,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:23:38,057 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.7 stem predicates 2 loop predicates [2023-11-21 22:23:38,057 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 71 states and 93 transitions. cyclomatic complexity: 28 Second operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 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-21 22:23:38,255 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 71 states and 93 transitions. cyclomatic complexity: 28. Second operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 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 12 states. [2023-11-21 22:23:38,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 7 stem states 1 non-accepting loop states 2 accepting loop states [2023-11-21 22:23:38,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 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-21 22:23:38,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 50 transitions. [2023-11-21 22:23:38,257 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 50 transitions. Stem has 25 letters. Loop has 3 letters. [2023-11-21 22:23:38,257 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-21 22:23:38,257 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 50 transitions. Stem has 28 letters. Loop has 3 letters. [2023-11-21 22:23:38,257 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-21 22:23:38,258 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 50 transitions. Stem has 25 letters. Loop has 6 letters. [2023-11-21 22:23:38,258 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-21 22:23:38,258 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 81 states and 107 transitions. [2023-11-21 22:23:38,259 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2023-11-21 22:23:38,261 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 81 states to 58 states and 77 transitions. [2023-11-21 22:23:38,261 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2023-11-21 22:23:38,262 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2023-11-21 22:23:38,262 INFO L73 IsDeterministic]: Start isDeterministic. Operand 58 states and 77 transitions. [2023-11-21 22:23:38,262 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-21 22:23:38,262 INFO L218 hiAutomatonCegarLoop]: Abstraction has 58 states and 77 transitions. [2023-11-21 22:23:38,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states and 77 transitions. [2023-11-21 22:23:38,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 55. [2023-11-21 22:23:38,265 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-21 22:23:38,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 73 transitions. [2023-11-21 22:23:38,266 INFO L240 hiAutomatonCegarLoop]: Abstraction has 55 states and 73 transitions. [2023-11-21 22:23:38,266 INFO L428 stractBuchiCegarLoop]: Abstraction has 55 states and 73 transitions. [2023-11-21 22:23:38,266 INFO L335 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2023-11-21 22:23:38,266 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 55 states and 73 transitions. [2023-11-21 22:23:38,267 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2023-11-21 22:23:38,267 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-21 22:23:38,267 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-21 22:23:38,268 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-21 22:23:38,268 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:23:38,269 INFO L748 eck$LassoCheckResult]: Stem: 2230#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2215#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; 2216#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 2205#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; 2197#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet19#1;call write~int#1(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; 2198#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 2242#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet19#1;call write~int#1(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; 2214#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 2199#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet19#1;call write~int#1(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; 2200#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 2234#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 2228#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; 2229#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#0(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#2(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 2217#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 2218#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#0(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#2(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 2233#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 2240#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#0(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#2(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 2236#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 2235#L517-3 assume !(lis_~i~0#1 < lis_~N#1); 2231#L517-4 lis_~i~0#1 := 1; 2219#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 2201#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int#1(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int#1(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; 2202#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int#0(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; 2225#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#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int#0(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#2(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 2207#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 2221#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 2210#L519-2 [2023-11-21 22:23:38,269 INFO L750 eck$LassoCheckResult]: Loop: 2210#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 2211#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 2237#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int#1(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int#1(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; 2246#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; 2245#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 2243#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 2210#L519-2 [2023-11-21 22:23:38,269 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:23:38,269 INFO L85 PathProgramCache]: Analyzing trace with hash 1035299872, now seen corresponding path program 2 times [2023-11-21 22:23:38,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:23:38,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904305986] [2023-11-21 22:23:38,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:23:38,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:23:38,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:23:38,317 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 22:23:38,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:23:38,353 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 22:23:38,353 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:23:38,353 INFO L85 PathProgramCache]: Analyzing trace with hash 782608452, now seen corresponding path program 2 times [2023-11-21 22:23:38,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:23:38,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747820482] [2023-11-21 22:23:38,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:23:38,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:23:38,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:23:38,359 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 22:23:38,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:23:38,363 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 22:23:38,364 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:23:38,364 INFO L85 PathProgramCache]: Analyzing trace with hash -1635570875, now seen corresponding path program 1 times [2023-11-21 22:23:38,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:23:38,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034911418] [2023-11-21 22:23:38,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:23:38,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:23:38,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:23:38,452 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Forceful destruction successful, exit code 0 [2023-11-21 22:23:38,530 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-21 22:23:38,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:23:38,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034911418] [2023-11-21 22:23:38,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034911418] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 22:23:38,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [127245127] [2023-11-21 22:23:38,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:23:38,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:23:38,532 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:23:38,533 INFO L229 MonitoredProcess]: Starting monitored process 59 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 22:23:38,565 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Waiting until timeout for monitored process [2023-11-21 22:23:38,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:23:38,673 INFO L262 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-21 22:23:38,675 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:23:38,740 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-21 22:23:38,740 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 22:23:38,788 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-21 22:23:38,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [127245127] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 22:23:38,788 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 22:23:38,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2023-11-21 22:23:38,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84404192] [2023-11-21 22:23:38,789 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 22:23:38,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:23:38,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-21 22:23:38,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2023-11-21 22:23:38,901 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-21 22:23:39,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:23:39,025 INFO L93 Difference]: Finished difference Result 73 states and 96 transitions. [2023-11-21 22:23:39,025 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 73 states and 96 transitions. [2023-11-21 22:23:39,026 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2023-11-21 22:23:39,027 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 73 states to 49 states and 62 transitions. [2023-11-21 22:23:39,027 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2023-11-21 22:23:39,027 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2023-11-21 22:23:39,027 INFO L73 IsDeterministic]: Start isDeterministic. Operand 49 states and 62 transitions. [2023-11-21 22:23:39,028 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:23:39,028 INFO L218 hiAutomatonCegarLoop]: Abstraction has 49 states and 62 transitions. [2023-11-21 22:23:39,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states and 62 transitions. [2023-11-21 22:23:39,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 44. [2023-11-21 22:23:39,030 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-21 22:23:39,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 55 transitions. [2023-11-21 22:23:39,031 INFO L240 hiAutomatonCegarLoop]: Abstraction has 44 states and 55 transitions. [2023-11-21 22:23:39,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-21 22:23:39,047 INFO L428 stractBuchiCegarLoop]: Abstraction has 44 states and 55 transitions. [2023-11-21 22:23:39,047 INFO L335 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2023-11-21 22:23:39,048 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 55 transitions. [2023-11-21 22:23:39,048 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16 [2023-11-21 22:23:39,048 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-21 22:23:39,048 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-21 22:23:39,049 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-21 22:23:39,049 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 1, 1, 1, 1, 1] [2023-11-21 22:23:39,049 INFO L748 eck$LassoCheckResult]: Stem: 2560#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2547#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; 2548#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 2542#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; 2536#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet19#1;call write~int#1(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; 2537#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 2538#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet19#1;call write~int#1(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; 2539#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 2569#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet19#1;call write~int#1(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; 2567#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 2566#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 2558#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; 2559#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#0(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#2(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 2549#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 2550#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#0(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#2(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 2563#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 2568#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#0(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#2(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 2565#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 2564#L517-3 assume !(lis_~i~0#1 < lis_~N#1); 2561#L517-4 lis_~i~0#1 := 1; 2551#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 2552#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int#1(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int#1(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; 2579#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int#0(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; 2577#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#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int#0(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#2(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 2576#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 2571#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 2545#L519-2 [2023-11-21 22:23:39,049 INFO L750 eck$LassoCheckResult]: Loop: 2545#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 2546#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 2570#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int#1(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int#1(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; 2575#L521 assume !lis_#t~short11#1; 2573#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; 2553#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 2540#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int#1(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int#1(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; 2541#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int#0(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; 2554#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; 2544#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 2572#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 2545#L519-2 [2023-11-21 22:23:39,050 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:23:39,050 INFO L85 PathProgramCache]: Analyzing trace with hash 1035299872, now seen corresponding path program 3 times [2023-11-21 22:23:39,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:23:39,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182481814] [2023-11-21 22:23:39,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:23:39,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:23:39,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:23:39,154 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 22:23:39,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:23:39,203 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 22:23:39,204 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:23:39,204 INFO L85 PathProgramCache]: Analyzing trace with hash -1752792449, now seen corresponding path program 1 times [2023-11-21 22:23:39,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:23:39,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659892318] [2023-11-21 22:23:39,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:23:39,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:23:39,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:23:39,217 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 22:23:39,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:23:39,225 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 22:23:39,226 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:23:39,227 INFO L85 PathProgramCache]: Analyzing trace with hash 116956416, now seen corresponding path program 2 times [2023-11-21 22:23:39,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:23:39,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55562164] [2023-11-21 22:23:39,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:23:39,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:23:39,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:23:40,516 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-21 22:23:40,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:23:40,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55562164] [2023-11-21 22:23:40,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55562164] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 22:23:40,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [755761436] [2023-11-21 22:23:40,517 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-21 22:23:40,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:23:40,517 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:23:40,519 INFO L229 MonitoredProcess]: Starting monitored process 60 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 22:23:40,534 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Waiting until timeout for monitored process [2023-11-21 22:23:40,658 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-21 22:23:40,658 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-21 22:23:40,660 INFO L262 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 32 conjunts are in the unsatisfiable core [2023-11-21 22:23:40,663 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:23:41,063 INFO L349 Elim1Store]: treesize reduction 4, result has 76.5 percent of original size [2023-11-21 22:23:41,064 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 43 treesize of output 27 [2023-11-21 22:23:41,083 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 13 proven. 12 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-11-21 22:23:41,083 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 22:23:41,474 INFO L349 Elim1Store]: treesize reduction 10, result has 86.3 percent of original size [2023-11-21 22:23:41,474 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 56 treesize of output 76 [2023-11-21 22:23:41,731 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 9 proven. 11 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-11-21 22:23:41,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [755761436] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 22:23:41,731 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 22:23:41,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14, 11] total 31 [2023-11-21 22:23:41,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405132167] [2023-11-21 22:23:41,732 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 22:23:41,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:23:41,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-11-21 22:23:41,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=785, Unknown=0, NotChecked=0, Total=930 [2023-11-21 22:23:41,994 INFO L87 Difference]: Start difference. First operand 44 states and 55 transitions. cyclomatic complexity: 15 Second operand has 31 states, 31 states have (on average 2.225806451612903) internal successors, (69), 31 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:23:43,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:23:43,437 INFO L93 Difference]: Finished difference Result 82 states and 104 transitions. [2023-11-21 22:23:43,437 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 82 states and 104 transitions. [2023-11-21 22:23:43,438 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 39 [2023-11-21 22:23:43,438 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 82 states to 82 states and 104 transitions. [2023-11-21 22:23:43,439 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 70 [2023-11-21 22:23:43,439 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 70 [2023-11-21 22:23:43,439 INFO L73 IsDeterministic]: Start isDeterministic. Operand 82 states and 104 transitions. [2023-11-21 22:23:43,439 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:23:43,440 INFO L218 hiAutomatonCegarLoop]: Abstraction has 82 states and 104 transitions. [2023-11-21 22:23:43,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states and 104 transitions. [2023-11-21 22:23:43,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 62. [2023-11-21 22:23:43,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 62 states have (on average 1.2741935483870968) internal successors, (79), 61 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-21 22:23:43,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 79 transitions. [2023-11-21 22:23:43,443 INFO L240 hiAutomatonCegarLoop]: Abstraction has 62 states and 79 transitions. [2023-11-21 22:23:43,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-11-21 22:23:43,444 INFO L428 stractBuchiCegarLoop]: Abstraction has 62 states and 79 transitions. [2023-11-21 22:23:43,444 INFO L335 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2023-11-21 22:23:43,444 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 62 states and 79 transitions. [2023-11-21 22:23:43,445 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 32 [2023-11-21 22:23:43,445 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-21 22:23:43,445 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-21 22:23:43,446 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-21 22:23:43,446 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 1, 1, 1, 1, 1] [2023-11-21 22:23:43,446 INFO L748 eck$LassoCheckResult]: Stem: 2998#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2984#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; 2985#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 2978#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; 2972#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet19#1;call write~int#1(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; 2973#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 2974#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet19#1;call write~int#1(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; 2975#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 2981#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet19#1;call write~int#1(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; 3003#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 3002#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 2996#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; 2997#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#0(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#2(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 2986#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 2987#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#0(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#2(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 3001#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 3006#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#0(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#2(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 3005#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 3004#L517-3 assume !(lis_~i~0#1 < lis_~N#1); 2999#L517-4 lis_~i~0#1 := 1; 2989#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 2990#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int#1(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int#1(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; 3032#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int#0(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; 3030#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#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int#0(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#2(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 3028#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 3026#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 2982#L519-2 [2023-11-21 22:23:43,447 INFO L750 eck$LassoCheckResult]: Loop: 2982#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 2983#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 2976#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int#1(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int#1(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; 2977#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int#0(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; 3024#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; 3033#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 3020#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int#1(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int#1(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; 3015#L521 assume !lis_#t~short11#1; 2992#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; 3027#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 3025#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 2982#L519-2 [2023-11-21 22:23:43,447 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:23:43,447 INFO L85 PathProgramCache]: Analyzing trace with hash 1035299872, now seen corresponding path program 4 times [2023-11-21 22:23:43,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:23:43,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463345110] [2023-11-21 22:23:43,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:23:43,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:23:43,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:23:43,482 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 22:23:43,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:23:43,510 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 22:23:43,511 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:23:43,511 INFO L85 PathProgramCache]: Analyzing trace with hash -943386241, now seen corresponding path program 2 times [2023-11-21 22:23:43,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:23:43,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377319621] [2023-11-21 22:23:43,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:23:43,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:23:43,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:23:43,518 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 22:23:43,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:23:43,525 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 22:23:43,526 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:23:43,526 INFO L85 PathProgramCache]: Analyzing trace with hash 926362624, now seen corresponding path program 3 times [2023-11-21 22:23:43,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:23:43,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441303937] [2023-11-21 22:23:43,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:23:43,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:23:43,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:23:45,168 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 12 proven. 24 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-21 22:23:45,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:23:45,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441303937] [2023-11-21 22:23:45,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441303937] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 22:23:45,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [401629934] [2023-11-21 22:23:45,169 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-21 22:23:45,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:23:45,169 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:23:45,171 INFO L229 MonitoredProcess]: Starting monitored process 61 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 22:23:45,201 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceda25bd-6907-4136-b4e2-3c0873b9e827/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (61)] Waiting until timeout for monitored process [2023-11-21 22:23:45,354 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-11-21 22:23:45,354 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-21 22:23:45,357 INFO L262 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 48 conjunts are in the unsatisfiable core [2023-11-21 22:23:45,361 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:23:45,608 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-21 22:23:45,669 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-21 22:23:45,669 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-21 22:23:46,112 INFO L349 Elim1Store]: treesize reduction 35, result has 30.0 percent of original size [2023-11-21 22:23:46,113 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 41 [2023-11-21 22:23:46,507 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:23:46,508 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:23:46,509 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 22:23:46,512 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:23:46,513 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 48 treesize of output 21 [2023-11-21 22:23:46,561 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 14 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-21 22:23:46,561 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 22:23:47,667 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 117 treesize of output 107 [2023-11-21 22:23:47,693 INFO L349 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2023-11-21 22:23:47,694 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 673 treesize of output 575 [2023-11-21 22:23:48,352 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 13 proven. 23 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-21 22:23:48,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [401629934] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 22:23:48,352 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 22:23:48,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 55 [2023-11-21 22:23:48,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140289938] [2023-11-21 22:23:48,352 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 22:23:48,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:23:48,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2023-11-21 22:23:48,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=289, Invalid=2681, Unknown=0, NotChecked=0, Total=2970 [2023-11-21 22:23:48,630 INFO L87 Difference]: Start difference. First operand 62 states and 79 transitions. cyclomatic complexity: 22 Second operand has 55 states, 55 states have (on average 1.6545454545454545) internal successors, (91), 55 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)