./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-15/array12_alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_809d94d4-ff72-4932-9ec8-d8b43bad8f0b/bin/uautomizer-verify-VRDe98Ueme/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_809d94d4-ff72-4932-9ec8-d8b43bad8f0b/bin/uautomizer-verify-VRDe98Ueme/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_809d94d4-ff72-4932-9ec8-d8b43bad8f0b/bin/uautomizer-verify-VRDe98Ueme/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_809d94d4-ff72-4932-9ec8-d8b43bad8f0b/bin/uautomizer-verify-VRDe98Ueme/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-15/array12_alloca.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_809d94d4-ff72-4932-9ec8-d8b43bad8f0b/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_809d94d4-ff72-4932-9ec8-d8b43bad8f0b/bin/uautomizer-verify-VRDe98Ueme --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash b994a1ec31b8c037535d8c99bc15e7231c0aea3fc6bbd2fe006bfaa61a5800c0 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-26 11:43:58,507 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-26 11:43:58,623 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_809d94d4-ff72-4932-9ec8-d8b43bad8f0b/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-Termination-64bit-Automizer_Default.epf [2023-11-26 11:43:58,627 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-26 11:43:58,628 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-26 11:43:58,672 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-26 11:43:58,673 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-26 11:43:58,673 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-26 11:43:58,674 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-26 11:43:58,675 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-26 11:43:58,676 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-26 11:43:58,677 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-26 11:43:58,677 INFO L153 SettingsManager]: * Use SBE=true [2023-11-26 11:43:58,678 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-11-26 11:43:58,678 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-11-26 11:43:58,679 INFO L153 SettingsManager]: * Use old map elimination=false [2023-11-26 11:43:58,679 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2023-11-26 11:43:58,680 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2023-11-26 11:43:58,680 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-11-26 11:43:58,681 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-26 11:43:58,681 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-11-26 11:43:58,682 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-26 11:43:58,682 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-26 11:43:58,683 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-11-26 11:43:58,683 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-11-26 11:43:58,683 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-11-26 11:43:58,684 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-26 11:43:58,684 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-26 11:43:58,685 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-11-26 11:43:58,685 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-26 11:43:58,686 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-26 11:43:58,686 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-26 11:43:58,686 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-26 11:43:58,686 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-26 11:43:58,687 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-11-26 11:43:58,687 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_809d94d4-ff72-4932-9ec8-d8b43bad8f0b/bin/uautomizer-verify-VRDe98Ueme/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_809d94d4-ff72-4932-9ec8-d8b43bad8f0b/bin/uautomizer-verify-VRDe98Ueme Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b994a1ec31b8c037535d8c99bc15e7231c0aea3fc6bbd2fe006bfaa61a5800c0 [2023-11-26 11:43:58,999 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-26 11:43:59,020 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-26 11:43:59,023 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-26 11:43:59,025 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-26 11:43:59,025 INFO L274 PluginConnector]: CDTParser initialized [2023-11-26 11:43:59,026 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_809d94d4-ff72-4932-9ec8-d8b43bad8f0b/bin/uautomizer-verify-VRDe98Ueme/../../sv-benchmarks/c/termination-15/array12_alloca.i [2023-11-26 11:44:02,056 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-26 11:44:02,339 INFO L384 CDTParser]: Found 1 translation units. [2023-11-26 11:44:02,340 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_809d94d4-ff72-4932-9ec8-d8b43bad8f0b/sv-benchmarks/c/termination-15/array12_alloca.i [2023-11-26 11:44:02,359 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_809d94d4-ff72-4932-9ec8-d8b43bad8f0b/bin/uautomizer-verify-VRDe98Ueme/data/c2f491e3c/aeb1ef2445f940beae589b08546ba573/FLAGb19666c1a [2023-11-26 11:44:02,375 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_809d94d4-ff72-4932-9ec8-d8b43bad8f0b/bin/uautomizer-verify-VRDe98Ueme/data/c2f491e3c/aeb1ef2445f940beae589b08546ba573 [2023-11-26 11:44:02,378 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-26 11:44:02,382 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-26 11:44:02,383 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-26 11:44:02,383 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-26 11:44:02,392 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-26 11:44:02,393 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 11:44:02" (1/1) ... [2023-11-26 11:44:02,395 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5bd7b8b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:44:02, skipping insertion in model container [2023-11-26 11:44:02,395 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 11:44:02" (1/1) ... [2023-11-26 11:44:02,464 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-26 11:44:02,853 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 11:44:02,867 INFO L202 MainTranslator]: Completed pre-run [2023-11-26 11:44:02,916 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 11:44:02,963 INFO L206 MainTranslator]: Completed translation [2023-11-26 11:44:02,964 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:44:02 WrapperNode [2023-11-26 11:44:02,964 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-26 11:44:02,966 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-26 11:44:02,966 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-26 11:44:02,966 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-26 11:44:02,974 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:44:02" (1/1) ... [2023-11-26 11:44:03,003 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:44:02" (1/1) ... [2023-11-26 11:44:03,032 INFO L138 Inliner]: procedures = 151, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 55 [2023-11-26 11:44:03,032 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-26 11:44:03,033 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-26 11:44:03,033 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-26 11:44:03,034 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-26 11:44:03,047 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:44:02" (1/1) ... [2023-11-26 11:44:03,047 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:44:02" (1/1) ... [2023-11-26 11:44:03,059 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:44:02" (1/1) ... [2023-11-26 11:44:03,085 INFO L175 MemorySlicer]: Split 4 memory accesses to 1 slices as follows [4]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 2 writes are split as follows [2]. [2023-11-26 11:44:03,087 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:44:02" (1/1) ... [2023-11-26 11:44:03,088 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:44:02" (1/1) ... [2023-11-26 11:44:03,100 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:44:02" (1/1) ... [2023-11-26 11:44:03,104 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:44:02" (1/1) ... [2023-11-26 11:44:03,107 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:44:02" (1/1) ... [2023-11-26 11:44:03,113 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:44:02" (1/1) ... [2023-11-26 11:44:03,115 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-26 11:44:03,118 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-26 11:44:03,119 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-26 11:44:03,119 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-26 11:44:03,120 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:44:02" (1/1) ... [2023-11-26 11:44:03,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-26 11:44:03,140 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_809d94d4-ff72-4932-9ec8-d8b43bad8f0b/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 11:44:03,157 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_809d94d4-ff72-4932-9ec8-d8b43bad8f0b/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-26 11:44:03,201 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-26 11:44:03,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-26 11:44:03,202 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-26 11:44:03,202 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-26 11:44:03,204 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-26 11:44:03,204 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-26 11:44:03,191 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_809d94d4-ff72-4932-9ec8-d8b43bad8f0b/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2023-11-26 11:44:03,313 INFO L241 CfgBuilder]: Building ICFG [2023-11-26 11:44:03,316 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-26 11:44:03,517 INFO L282 CfgBuilder]: Performing block encoding [2023-11-26 11:44:03,524 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-26 11:44:03,525 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-26 11:44:03,526 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 11:44:03 BoogieIcfgContainer [2023-11-26 11:44:03,526 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-26 11:44:03,527 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-11-26 11:44:03,527 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-11-26 11:44:03,531 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-11-26 11:44:03,532 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-26 11:44:03,533 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 26.11 11:44:02" (1/3) ... [2023-11-26 11:44:03,534 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2e72ec45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.11 11:44:03, skipping insertion in model container [2023-11-26 11:44:03,534 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-26 11:44:03,534 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:44:02" (2/3) ... [2023-11-26 11:44:03,535 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2e72ec45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.11 11:44:03, skipping insertion in model container [2023-11-26 11:44:03,535 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-26 11:44:03,535 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 11:44:03" (3/3) ... [2023-11-26 11:44:03,536 INFO L332 chiAutomizerObserver]: Analyzing ICFG array12_alloca.i [2023-11-26 11:44:03,607 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2023-11-26 11:44:03,608 INFO L304 stractBuchiCegarLoop]: Hoare is false [2023-11-26 11:44:03,608 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-11-26 11:44:03,608 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-11-26 11:44:03,608 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-11-26 11:44:03,609 INFO L308 stractBuchiCegarLoop]: Difference is false [2023-11-26 11:44:03,609 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-11-26 11:44:03,609 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2023-11-26 11:44:03,613 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 15 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:44:03,633 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2023-11-26 11:44:03,634 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-26 11:44:03,634 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-26 11:44:03,640 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2023-11-26 11:44:03,640 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2023-11-26 11:44:03,640 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-11-26 11:44:03,641 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 15 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:44:03,643 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2023-11-26 11:44:03,643 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-26 11:44:03,643 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-26 11:44:03,644 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2023-11-26 11:44:03,644 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2023-11-26 11:44:03,653 INFO L748 eck$LassoCheckResult]: Stem: 10#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 5#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 11#L367true assume !(main_~length~0#1 < 1); 6#L367-2true call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 3#L369true assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 4#L370-3true [2023-11-26 11:44:03,654 INFO L750 eck$LassoCheckResult]: Loop: 4#L370-3true assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet208#1;call write~int#0(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 12#L372true assume main_#t~mem209#1 < 0;havoc main_#t~mem209#1;call write~int#0(0, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 15#L370-2true main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 4#L370-3true [2023-11-26 11:44:03,661 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:44:03,661 INFO L85 PathProgramCache]: Analyzing trace with hash 28695753, now seen corresponding path program 1 times [2023-11-26 11:44:03,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:44:03,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597731294] [2023-11-26 11:44:03,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:44:03,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:44:03,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:44:03,837 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 11:44:03,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:44:03,895 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 11:44:03,902 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:44:03,907 INFO L85 PathProgramCache]: Analyzing trace with hash 51737, now seen corresponding path program 1 times [2023-11-26 11:44:03,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:44:03,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289500882] [2023-11-26 11:44:03,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:44:03,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:44:03,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:44:03,939 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 11:44:03,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:44:03,953 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 11:44:03,955 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:44:03,955 INFO L85 PathProgramCache]: Analyzing trace with hash 176707665, now seen corresponding path program 1 times [2023-11-26 11:44:03,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:44:03,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317251547] [2023-11-26 11:44:03,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:44:03,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:44:03,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:44:03,984 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 11:44:04,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:44:04,006 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 11:44:04,413 INFO L210 LassoAnalysis]: Preferences: [2023-11-26 11:44:04,414 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-26 11:44:04,414 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-26 11:44:04,415 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-26 11:44:04,415 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-11-26 11:44:04,415 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-26 11:44:04,415 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-26 11:44:04,416 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-26 11:44:04,416 INFO L133 ssoRankerPreferences]: Filename of dumped script: array12_alloca.i_Iteration1_Lasso [2023-11-26 11:44:04,416 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-26 11:44:04,416 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-26 11:44:04,438 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-26 11:44:04,448 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-26 11:44:04,453 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-26 11:44:04,639 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-26 11:44:04,642 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-26 11:44:04,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-26 11:44:04,648 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-26 11:44:04,651 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-26 11:44:04,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-26 11:44:04,658 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-26 11:44:04,661 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-26 11:44:04,970 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-26 11:44:04,975 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-11-26 11:44:04,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-26 11:44:04,977 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_809d94d4-ff72-4932-9ec8-d8b43bad8f0b/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 11:44:04,981 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_809d94d4-ff72-4932-9ec8-d8b43bad8f0b/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-26 11:44:04,998 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-26 11:44:04,998 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_809d94d4-ff72-4932-9ec8-d8b43bad8f0b/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2023-11-26 11:44:05,012 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-26 11:44:05,012 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-26 11:44:05,013 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-26 11:44:05,013 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-26 11:44:05,013 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-26 11:44:05,016 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-26 11:44:05,017 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-26 11:44:05,028 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-26 11:44:05,038 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_809d94d4-ff72-4932-9ec8-d8b43bad8f0b/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2023-11-26 11:44:05,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-26 11:44:05,039 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_809d94d4-ff72-4932-9ec8-d8b43bad8f0b/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 11:44:05,041 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_809d94d4-ff72-4932-9ec8-d8b43bad8f0b/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-26 11:44:05,050 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-26 11:44:05,063 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_809d94d4-ff72-4932-9ec8-d8b43bad8f0b/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2023-11-26 11:44:05,064 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-26 11:44:05,065 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-26 11:44:05,065 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-26 11:44:05,065 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-26 11:44:05,070 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-26 11:44:05,070 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-26 11:44:05,088 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-26 11:44:05,097 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_809d94d4-ff72-4932-9ec8-d8b43bad8f0b/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2023-11-26 11:44:05,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-26 11:44:05,098 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_809d94d4-ff72-4932-9ec8-d8b43bad8f0b/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 11:44:05,100 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_809d94d4-ff72-4932-9ec8-d8b43bad8f0b/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-26 11:44:05,110 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-26 11:44:05,123 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_809d94d4-ff72-4932-9ec8-d8b43bad8f0b/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2023-11-26 11:44:05,124 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-26 11:44:05,124 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-26 11:44:05,125 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-26 11:44:05,125 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-26 11:44:05,132 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-26 11:44:05,133 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-26 11:44:05,152 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-26 11:44:05,161 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_809d94d4-ff72-4932-9ec8-d8b43bad8f0b/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2023-11-26 11:44:05,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-26 11:44:05,162 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_809d94d4-ff72-4932-9ec8-d8b43bad8f0b/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 11:44:05,164 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_809d94d4-ff72-4932-9ec8-d8b43bad8f0b/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-26 11:44:05,172 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-26 11:44:05,186 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-26 11:44:05,186 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-26 11:44:05,186 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-26 11:44:05,186 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-26 11:44:05,187 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_809d94d4-ff72-4932-9ec8-d8b43bad8f0b/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2023-11-26 11:44:05,196 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-26 11:44:05,198 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-26 11:44:05,224 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-26 11:44:05,233 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_809d94d4-ff72-4932-9ec8-d8b43bad8f0b/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2023-11-26 11:44:05,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-26 11:44:05,235 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_809d94d4-ff72-4932-9ec8-d8b43bad8f0b/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 11:44:05,239 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_809d94d4-ff72-4932-9ec8-d8b43bad8f0b/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-26 11:44:05,244 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-26 11:44:05,256 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_809d94d4-ff72-4932-9ec8-d8b43bad8f0b/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2023-11-26 11:44:05,257 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-26 11:44:05,258 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-26 11:44:05,258 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-26 11:44:05,258 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-26 11:44:05,281 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-26 11:44:05,281 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-26 11:44:05,303 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-11-26 11:44:05,345 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2023-11-26 11:44:05,346 INFO L444 ModelExtractionUtils]: 1 out of 19 variables were initially zero. Simplification set additionally 14 variables to zero. [2023-11-26 11:44:05,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-26 11:44:05,348 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_809d94d4-ff72-4932-9ec8-d8b43bad8f0b/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 11:44:05,395 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_809d94d4-ff72-4932-9ec8-d8b43bad8f0b/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-26 11:44:05,399 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-11-26 11:44:05,411 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_809d94d4-ff72-4932-9ec8-d8b43bad8f0b/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2023-11-26 11:44:05,413 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-11-26 11:44:05,414 INFO L513 LassoAnalysis]: Proved termination. [2023-11-26 11:44:05,414 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~arr~0#1.offset, v_rep(select #length ULTIMATE.start_main_~arr~0#1.base)_1, ULTIMATE.start_main_~i~0#1) = -1*ULTIMATE.start_main_~arr~0#1.offset + 1*v_rep(select #length ULTIMATE.start_main_~arr~0#1.base)_1 - 4*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2023-11-26 11:44:05,419 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_809d94d4-ff72-4932-9ec8-d8b43bad8f0b/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2023-11-26 11:44:05,439 INFO L156 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2023-11-26 11:44:05,456 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #length[~arr~0!base] could not be translated [2023-11-26 11:44:05,480 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:44:05,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:44:05,500 INFO L262 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-26 11:44:05,502 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 11:44:05,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:44:05,536 INFO L262 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-26 11:44:05,538 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 11:44:05,590 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-26 11:44:05,641 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-26 11:44:05,643 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 15 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:44:05,735 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 15 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 33 states and 48 transitions. Complement of second has 8 states. [2023-11-26 11:44:05,738 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-26 11:44:05,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:44:05,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2023-11-26 11:44:05,748 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 31 transitions. Stem has 5 letters. Loop has 3 letters. [2023-11-26 11:44:05,750 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-26 11:44:05,750 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 31 transitions. Stem has 8 letters. Loop has 3 letters. [2023-11-26 11:44:05,751 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-26 11:44:05,751 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 31 transitions. Stem has 5 letters. Loop has 6 letters. [2023-11-26 11:44:05,751 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-26 11:44:05,752 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 48 transitions. [2023-11-26 11:44:05,760 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-11-26 11:44:05,765 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 12 states and 17 transitions. [2023-11-26 11:44:05,766 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2023-11-26 11:44:05,767 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2023-11-26 11:44:05,767 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 17 transitions. [2023-11-26 11:44:05,769 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:44:05,769 INFO L218 hiAutomatonCegarLoop]: Abstraction has 12 states and 17 transitions. [2023-11-26 11:44:05,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 17 transitions. [2023-11-26 11:44:05,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2023-11-26 11:44:05,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 11 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-26 11:44:05,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 17 transitions. [2023-11-26 11:44:05,805 INFO L240 hiAutomatonCegarLoop]: Abstraction has 12 states and 17 transitions. [2023-11-26 11:44:05,805 INFO L428 stractBuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2023-11-26 11:44:05,805 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-11-26 11:44:05,806 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 17 transitions. [2023-11-26 11:44:05,808 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-11-26 11:44:05,808 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-26 11:44:05,809 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-26 11:44:05,809 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:44:05,809 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-26 11:44:05,810 INFO L748 eck$LassoCheckResult]: Stem: 117#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 118#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 119#L367 assume !(main_~length~0#1 < 1); 111#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 112#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 113#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 114#L370-4 main_~j~0#1 := 0; 115#L378-2 [2023-11-26 11:44:05,810 INFO L750 eck$LassoCheckResult]: Loop: 115#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 116#L378 assume main_#t~mem210#1 < 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 115#L378-2 [2023-11-26 11:44:05,812 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:44:05,812 INFO L85 PathProgramCache]: Analyzing trace with hash 1806815510, now seen corresponding path program 1 times [2023-11-26 11:44:05,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:44:05,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226458040] [2023-11-26 11:44:05,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:44:05,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:44:05,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:44:05,941 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_809d94d4-ff72-4932-9ec8-d8b43bad8f0b/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2023-11-26 11:44:06,042 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-26 11:44:06,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:44:06,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226458040] [2023-11-26 11:44:06,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226458040] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:44:06,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:44:06,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-26 11:44:06,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887986623] [2023-11-26 11:44:06,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:44:06,047 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-26 11:44:06,048 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:44:06,048 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 1 times [2023-11-26 11:44:06,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:44:06,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835599751] [2023-11-26 11:44:06,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:44:06,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:44:06,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:44:06,055 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 11:44:06,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:44:06,060 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 11:44:06,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:44:06,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-26 11:44:06,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-26 11:44:06,124 INFO L87 Difference]: Start difference. First operand 12 states and 17 transitions. cyclomatic complexity: 7 Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:44:06,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:44:06,159 INFO L93 Difference]: Finished difference Result 14 states and 19 transitions. [2023-11-26 11:44:06,159 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 19 transitions. [2023-11-26 11:44:06,160 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-11-26 11:44:06,161 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 14 states and 19 transitions. [2023-11-26 11:44:06,161 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2023-11-26 11:44:06,161 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2023-11-26 11:44:06,161 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 19 transitions. [2023-11-26 11:44:06,162 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:44:06,162 INFO L218 hiAutomatonCegarLoop]: Abstraction has 14 states and 19 transitions. [2023-11-26 11:44:06,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 19 transitions. [2023-11-26 11:44:06,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 12. [2023-11-26 11:44:06,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:44:06,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2023-11-26 11:44:06,164 INFO L240 hiAutomatonCegarLoop]: Abstraction has 12 states and 16 transitions. [2023-11-26 11:44:06,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-26 11:44:06,166 INFO L428 stractBuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2023-11-26 11:44:06,166 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-11-26 11:44:06,166 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. [2023-11-26 11:44:06,167 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-11-26 11:44:06,167 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-26 11:44:06,167 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-26 11:44:06,168 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:44:06,168 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-26 11:44:06,169 INFO L748 eck$LassoCheckResult]: Stem: 150#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 151#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 152#L367 assume !(main_~length~0#1 < 1); 144#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 145#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 146#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet208#1;call write~int#0(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 153#L372 assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; 155#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 154#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 147#L370-4 main_~j~0#1 := 0; 148#L378-2 [2023-11-26 11:44:06,169 INFO L750 eck$LassoCheckResult]: Loop: 148#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 149#L378 assume main_#t~mem210#1 < 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 148#L378-2 [2023-11-26 11:44:06,169 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:44:06,169 INFO L85 PathProgramCache]: Analyzing trace with hash -1982565540, now seen corresponding path program 1 times [2023-11-26 11:44:06,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:44:06,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612516561] [2023-11-26 11:44:06,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:44:06,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:44:06,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:44:06,187 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 11:44:06,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:44:06,202 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 11:44:06,202 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:44:06,203 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 2 times [2023-11-26 11:44:06,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:44:06,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671079094] [2023-11-26 11:44:06,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:44:06,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:44:06,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:44:06,209 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 11:44:06,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:44:06,215 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 11:44:06,215 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:44:06,215 INFO L85 PathProgramCache]: Analyzing trace with hash 1719996831, now seen corresponding path program 1 times [2023-11-26 11:44:06,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:44:06,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358844778] [2023-11-26 11:44:06,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:44:06,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:44:06,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:44:06,638 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:44:06,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:44:06,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358844778] [2023-11-26 11:44:06,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358844778] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-26 11:44:06,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [985172313] [2023-11-26 11:44:06,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:44:06,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 11:44:06,641 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_809d94d4-ff72-4932-9ec8-d8b43bad8f0b/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 11:44:06,645 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_809d94d4-ff72-4932-9ec8-d8b43bad8f0b/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-26 11:44:06,649 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_809d94d4-ff72-4932-9ec8-d8b43bad8f0b/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-26 11:44:06,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:44:06,717 INFO L262 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-26 11:44:06,720 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 11:44:06,790 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-26 11:44:06,847 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 15 treesize of output 7 [2023-11-26 11:44:06,857 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:44:06,858 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-26 11:44:06,934 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 16 treesize of output 14 [2023-11-26 11:44:06,940 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 22 treesize of output 20 [2023-11-26 11:44:06,955 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:44:06,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [985172313] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-26 11:44:06,956 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-26 11:44:06,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 6] total 14 [2023-11-26 11:44:06,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806776876] [2023-11-26 11:44:06,957 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-26 11:44:07,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:44:07,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-26 11:44:07,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2023-11-26 11:44:07,017 INFO L87 Difference]: Start difference. First operand 12 states and 16 transitions. cyclomatic complexity: 6 Second operand has 15 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 15 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:44:07,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:44:07,143 INFO L93 Difference]: Finished difference Result 22 states and 30 transitions. [2023-11-26 11:44:07,143 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 30 transitions. [2023-11-26 11:44:07,144 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2023-11-26 11:44:07,145 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 22 states and 30 transitions. [2023-11-26 11:44:07,145 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2023-11-26 11:44:07,146 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2023-11-26 11:44:07,146 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 30 transitions. [2023-11-26 11:44:07,146 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:44:07,146 INFO L218 hiAutomatonCegarLoop]: Abstraction has 22 states and 30 transitions. [2023-11-26 11:44:07,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 30 transitions. [2023-11-26 11:44:07,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 19. [2023-11-26 11:44:07,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.368421052631579) internal successors, (26), 18 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-26 11:44:07,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 26 transitions. [2023-11-26 11:44:07,150 INFO L240 hiAutomatonCegarLoop]: Abstraction has 19 states and 26 transitions. [2023-11-26 11:44:07,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-26 11:44:07,151 INFO L428 stractBuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2023-11-26 11:44:07,152 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-11-26 11:44:07,152 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 26 transitions. [2023-11-26 11:44:07,153 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-11-26 11:44:07,153 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-26 11:44:07,153 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-26 11:44:07,155 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:44:07,155 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-26 11:44:07,155 INFO L748 eck$LassoCheckResult]: Stem: 274#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 275#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 276#L367 assume !(main_~length~0#1 < 1); 268#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 269#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 270#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet208#1;call write~int#0(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 277#L372 assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; 282#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 278#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 279#L370-4 main_~j~0#1 := 0; 281#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 271#L378 assume !(main_#t~mem210#1 < 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 272#L378-2 [2023-11-26 11:44:07,156 INFO L750 eck$LassoCheckResult]: Loop: 272#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 283#L378 assume main_#t~mem210#1 < 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 272#L378-2 [2023-11-26 11:44:07,156 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:44:07,156 INFO L85 PathProgramCache]: Analyzing trace with hash 1719996833, now seen corresponding path program 1 times [2023-11-26 11:44:07,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:44:07,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464698201] [2023-11-26 11:44:07,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:44:07,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:44:07,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:44:07,173 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 11:44:07,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:44:07,191 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 11:44:07,196 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:44:07,197 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 3 times [2023-11-26 11:44:07,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:44:07,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575966424] [2023-11-26 11:44:07,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:44:07,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:44:07,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:44:07,202 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 11:44:07,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:44:07,206 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 11:44:07,206 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:44:07,207 INFO L85 PathProgramCache]: Analyzing trace with hash -645451100, now seen corresponding path program 1 times [2023-11-26 11:44:07,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:44:07,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838754868] [2023-11-26 11:44:07,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:44:07,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:44:07,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:44:07,303 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:44:07,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:44:07,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838754868] [2023-11-26 11:44:07,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838754868] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-26 11:44:07,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1497830770] [2023-11-26 11:44:07,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:44:07,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 11:44:07,305 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_809d94d4-ff72-4932-9ec8-d8b43bad8f0b/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 11:44:07,306 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_809d94d4-ff72-4932-9ec8-d8b43bad8f0b/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-26 11:44:07,336 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_809d94d4-ff72-4932-9ec8-d8b43bad8f0b/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-26 11:44:07,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:44:07,375 INFO L262 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-26 11:44:07,377 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 11:44:07,434 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:44:07,434 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-26 11:44:07,478 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:44:07,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1497830770] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-26 11:44:07,479 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-26 11:44:07,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2023-11-26 11:44:07,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088160422] [2023-11-26 11:44:07,479 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-26 11:44:07,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:44:07,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-26 11:44:07,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2023-11-26 11:44:07,539 INFO L87 Difference]: Start difference. First operand 19 states and 26 transitions. cyclomatic complexity: 10 Second operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:44:07,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:44:07,685 INFO L93 Difference]: Finished difference Result 43 states and 57 transitions. [2023-11-26 11:44:07,685 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 57 transitions. [2023-11-26 11:44:07,690 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2023-11-26 11:44:07,694 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 39 states and 51 transitions. [2023-11-26 11:44:07,694 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2023-11-26 11:44:07,695 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2023-11-26 11:44:07,696 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 51 transitions. [2023-11-26 11:44:07,697 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:44:07,697 INFO L218 hiAutomatonCegarLoop]: Abstraction has 39 states and 51 transitions. [2023-11-26 11:44:07,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 51 transitions. [2023-11-26 11:44:07,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 34. [2023-11-26 11:44:07,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 33 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:44:07,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 45 transitions. [2023-11-26 11:44:07,706 INFO L240 hiAutomatonCegarLoop]: Abstraction has 34 states and 45 transitions. [2023-11-26 11:44:07,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-26 11:44:07,709 INFO L428 stractBuchiCegarLoop]: Abstraction has 34 states and 45 transitions. [2023-11-26 11:44:07,709 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2023-11-26 11:44:07,709 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 45 transitions. [2023-11-26 11:44:07,711 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2023-11-26 11:44:07,711 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-26 11:44:07,711 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-26 11:44:07,712 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:44:07,712 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-26 11:44:07,713 INFO L748 eck$LassoCheckResult]: Stem: 441#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 442#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 443#L367 assume main_~length~0#1 < 1;main_~length~0#1 := 1; 434#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 435#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 436#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet208#1;call write~int#0(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 466#L372 assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; 464#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 465#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet208#1;call write~int#0(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 463#L372 assume main_#t~mem209#1 < 0;havoc main_#t~mem209#1;call write~int#0(0, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 461#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 458#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 437#L370-4 main_~j~0#1 := 0; 438#L378-2 [2023-11-26 11:44:07,713 INFO L750 eck$LassoCheckResult]: Loop: 438#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 450#L378 assume main_#t~mem210#1 < 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 438#L378-2 [2023-11-26 11:44:07,713 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:44:07,713 INFO L85 PathProgramCache]: Analyzing trace with hash 1080825110, now seen corresponding path program 1 times [2023-11-26 11:44:07,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:44:07,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590968901] [2023-11-26 11:44:07,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:44:07,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:44:07,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:44:07,815 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:44:07,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:44:07,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590968901] [2023-11-26 11:44:07,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590968901] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-26 11:44:07,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [527383777] [2023-11-26 11:44:07,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:44:07,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 11:44:07,821 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_809d94d4-ff72-4932-9ec8-d8b43bad8f0b/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 11:44:07,827 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_809d94d4-ff72-4932-9ec8-d8b43bad8f0b/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-26 11:44:07,868 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_809d94d4-ff72-4932-9ec8-d8b43bad8f0b/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-11-26 11:44:07,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:44:07,913 INFO L262 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-26 11:44:07,914 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 11:44:07,970 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:44:07,970 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-26 11:44:07,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [527383777] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:44:07,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-26 11:44:07,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2023-11-26 11:44:07,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031986299] [2023-11-26 11:44:07,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:44:07,971 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-26 11:44:07,971 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:44:07,972 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 4 times [2023-11-26 11:44:07,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:44:07,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52651692] [2023-11-26 11:44:07,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:44:07,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:44:07,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:44:07,978 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 11:44:07,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:44:07,988 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 11:44:08,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:44:08,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-26 11:44:08,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-26 11:44:08,050 INFO L87 Difference]: Start difference. First operand 34 states and 45 transitions. cyclomatic complexity: 17 Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 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-26 11:44:08,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:44:08,081 INFO L93 Difference]: Finished difference Result 27 states and 34 transitions. [2023-11-26 11:44:08,081 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 34 transitions. [2023-11-26 11:44:08,085 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-11-26 11:44:08,086 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 21 states and 27 transitions. [2023-11-26 11:44:08,086 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2023-11-26 11:44:08,086 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2023-11-26 11:44:08,086 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 27 transitions. [2023-11-26 11:44:08,087 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:44:08,087 INFO L218 hiAutomatonCegarLoop]: Abstraction has 21 states and 27 transitions. [2023-11-26 11:44:08,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 27 transitions. [2023-11-26 11:44:08,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2023-11-26 11:44:08,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 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-26 11:44:08,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2023-11-26 11:44:08,090 INFO L240 hiAutomatonCegarLoop]: Abstraction has 21 states and 27 transitions. [2023-11-26 11:44:08,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-26 11:44:08,093 INFO L428 stractBuchiCegarLoop]: Abstraction has 21 states and 27 transitions. [2023-11-26 11:44:08,093 INFO L335 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2023-11-26 11:44:08,094 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 27 transitions. [2023-11-26 11:44:08,097 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-11-26 11:44:08,097 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-26 11:44:08,097 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-26 11:44:08,098 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:44:08,098 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-26 11:44:08,098 INFO L748 eck$LassoCheckResult]: Stem: 547#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 548#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 549#L367 assume !(main_~length~0#1 < 1); 541#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 542#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 543#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet208#1;call write~int#0(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 550#L372 assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; 553#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 551#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet208#1;call write~int#0(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 552#L372 assume main_#t~mem209#1 < 0;havoc main_#t~mem209#1;call write~int#0(0, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 560#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 557#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 544#L370-4 main_~j~0#1 := 0; 545#L378-2 [2023-11-26 11:44:08,098 INFO L750 eck$LassoCheckResult]: Loop: 545#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 554#L378 assume main_#t~mem210#1 < 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 545#L378-2 [2023-11-26 11:44:08,099 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:44:08,099 INFO L85 PathProgramCache]: Analyzing trace with hash 1781889688, now seen corresponding path program 1 times [2023-11-26 11:44:08,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:44:08,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394827664] [2023-11-26 11:44:08,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:44:08,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:44:08,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:44:08,125 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 11:44:08,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:44:08,143 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 11:44:08,146 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:44:08,146 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 5 times [2023-11-26 11:44:08,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:44:08,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437310809] [2023-11-26 11:44:08,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:44:08,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:44:08,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:44:08,153 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 11:44:08,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:44:08,158 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 11:44:08,158 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:44:08,158 INFO L85 PathProgramCache]: Analyzing trace with hash -1295959589, now seen corresponding path program 1 times [2023-11-26 11:44:08,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:44:08,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088879461] [2023-11-26 11:44:08,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:44:08,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:44:08,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:44:08,603 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:44:08,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:44:08,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088879461] [2023-11-26 11:44:08,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088879461] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-26 11:44:08,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [166118669] [2023-11-26 11:44:08,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:44:08,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 11:44:08,604 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_809d94d4-ff72-4932-9ec8-d8b43bad8f0b/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 11:44:08,608 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_809d94d4-ff72-4932-9ec8-d8b43bad8f0b/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-26 11:44:08,643 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_809d94d4-ff72-4932-9ec8-d8b43bad8f0b/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-11-26 11:44:08,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:44:08,689 INFO L262 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 19 conjunts are in the unsatisfiable core [2023-11-26 11:44:08,692 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 11:44:08,719 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-26 11:44:08,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-26 11:44:08,792 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2023-11-26 11:44:08,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-26 11:44:08,817 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-11-26 11:44:08,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-26 11:44:08,998 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-26 11:44:08,999 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 10 [2023-11-26 11:44:09,030 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:44:09,030 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-26 11:44:09,155 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 16 treesize of output 14 [2023-11-26 11:44:09,160 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 22 treesize of output 20 [2023-11-26 11:44:09,177 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-26 11:44:09,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [166118669] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-26 11:44:09,177 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-26 11:44:09,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 7] total 20 [2023-11-26 11:44:09,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745457590] [2023-11-26 11:44:09,178 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-26 11:44:09,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:44:09,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-11-26 11:44:09,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=310, Unknown=0, NotChecked=0, Total=420 [2023-11-26 11:44:09,245 INFO L87 Difference]: Start difference. First operand 21 states and 27 transitions. cyclomatic complexity: 9 Second operand has 21 states, 20 states have (on average 1.8) internal successors, (36), 21 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-26 11:44:09,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:44:09,528 INFO L93 Difference]: Finished difference Result 30 states and 38 transitions. [2023-11-26 11:44:09,528 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 38 transitions. [2023-11-26 11:44:09,529 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2023-11-26 11:44:09,530 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 30 states and 38 transitions. [2023-11-26 11:44:09,530 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2023-11-26 11:44:09,530 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2023-11-26 11:44:09,530 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 38 transitions. [2023-11-26 11:44:09,531 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:44:09,531 INFO L218 hiAutomatonCegarLoop]: Abstraction has 30 states and 38 transitions. [2023-11-26 11:44:09,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 38 transitions. [2023-11-26 11:44:09,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 17. [2023-11-26 11:44:09,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 16 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:44:09,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2023-11-26 11:44:09,534 INFO L240 hiAutomatonCegarLoop]: Abstraction has 17 states and 21 transitions. [2023-11-26 11:44:09,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-26 11:44:09,535 INFO L428 stractBuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2023-11-26 11:44:09,535 INFO L335 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2023-11-26 11:44:09,536 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 21 transitions. [2023-11-26 11:44:09,536 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-11-26 11:44:09,536 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-26 11:44:09,536 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-26 11:44:09,537 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:44:09,537 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-26 11:44:09,538 INFO L748 eck$LassoCheckResult]: Stem: 719#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 720#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 721#L367 assume !(main_~length~0#1 < 1); 712#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 713#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 714#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet208#1;call write~int#0(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 722#L372 assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; 727#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 723#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet208#1;call write~int#0(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 724#L372 assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; 725#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 726#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 717#L370-4 main_~j~0#1 := 0; 718#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 715#L378 assume !(main_#t~mem210#1 < 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 716#L378-2 [2023-11-26 11:44:09,538 INFO L750 eck$LassoCheckResult]: Loop: 716#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 728#L378 assume main_#t~mem210#1 < 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 716#L378-2 [2023-11-26 11:44:09,538 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:44:09,538 INFO L85 PathProgramCache]: Analyzing trace with hash -1238701285, now seen corresponding path program 2 times [2023-11-26 11:44:09,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:44:09,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936457742] [2023-11-26 11:44:09,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:44:09,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:44:09,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:44:09,564 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 11:44:09,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:44:09,586 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 11:44:09,587 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:44:09,587 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 6 times [2023-11-26 11:44:09,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:44:09,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875152852] [2023-11-26 11:44:09,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:44:09,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:44:09,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:44:09,593 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 11:44:09,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:44:09,598 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 11:44:09,598 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:44:09,599 INFO L85 PathProgramCache]: Analyzing trace with hash -685992546, now seen corresponding path program 2 times [2023-11-26 11:44:09,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:44:09,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601963033] [2023-11-26 11:44:09,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:44:09,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:44:09,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:44:09,765 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:44:09,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:44:09,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601963033] [2023-11-26 11:44:09,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601963033] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-26 11:44:09,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1657803210] [2023-11-26 11:44:09,766 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-26 11:44:09,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 11:44:09,767 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_809d94d4-ff72-4932-9ec8-d8b43bad8f0b/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 11:44:09,772 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_809d94d4-ff72-4932-9ec8-d8b43bad8f0b/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-26 11:44:09,780 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_809d94d4-ff72-4932-9ec8-d8b43bad8f0b/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-11-26 11:44:09,847 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-26 11:44:09,848 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-26 11:44:09,850 INFO L262 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 18 conjunts are in the unsatisfiable core [2023-11-26 11:44:09,851 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 11:44:09,915 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-26 11:44:10,043 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 15 treesize of output 7 [2023-11-26 11:44:10,047 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:44:10,047 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-26 11:44:10,137 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 18 treesize of output 16 [2023-11-26 11:44:10,141 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 24 treesize of output 20 [2023-11-26 11:44:10,150 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:44:10,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1657803210] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-26 11:44:10,151 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-26 11:44:10,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 18 [2023-11-26 11:44:10,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357981203] [2023-11-26 11:44:10,151 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-26 11:44:10,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:44:10,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-26 11:44:10,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2023-11-26 11:44:10,210 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. cyclomatic complexity: 6 Second operand has 19 states, 18 states have (on average 2.0) internal successors, (36), 19 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-26 11:44:10,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:44:10,401 INFO L93 Difference]: Finished difference Result 29 states and 37 transitions. [2023-11-26 11:44:10,401 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 37 transitions. [2023-11-26 11:44:10,401 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2023-11-26 11:44:10,402 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 29 states and 37 transitions. [2023-11-26 11:44:10,402 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2023-11-26 11:44:10,402 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2023-11-26 11:44:10,402 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 37 transitions. [2023-11-26 11:44:10,403 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:44:10,403 INFO L218 hiAutomatonCegarLoop]: Abstraction has 29 states and 37 transitions. [2023-11-26 11:44:10,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 37 transitions. [2023-11-26 11:44:10,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 24. [2023-11-26 11:44:10,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 23 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-26 11:44:10,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2023-11-26 11:44:10,406 INFO L240 hiAutomatonCegarLoop]: Abstraction has 24 states and 31 transitions. [2023-11-26 11:44:10,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-26 11:44:10,410 INFO L428 stractBuchiCegarLoop]: Abstraction has 24 states and 31 transitions. [2023-11-26 11:44:10,411 INFO L335 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2023-11-26 11:44:10,411 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 31 transitions. [2023-11-26 11:44:10,411 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-11-26 11:44:10,411 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-26 11:44:10,412 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-26 11:44:10,412 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:44:10,413 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-26 11:44:10,413 INFO L748 eck$LassoCheckResult]: Stem: 892#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 893#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 894#L367 assume !(main_~length~0#1 < 1); 886#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 887#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 888#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet208#1;call write~int#0(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 895#L372 assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; 903#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 896#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet208#1;call write~int#0(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 897#L372 assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; 898#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 900#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 901#L370-4 main_~j~0#1 := 0; 906#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 891#L378 assume !(main_#t~mem210#1 < 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 890#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 899#L378 assume !(main_#t~mem210#1 < 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 905#L378-2 [2023-11-26 11:44:10,413 INFO L750 eck$LassoCheckResult]: Loop: 905#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 904#L378 assume main_#t~mem210#1 < 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 905#L378-2 [2023-11-26 11:44:10,413 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:44:10,414 INFO L85 PathProgramCache]: Analyzing trace with hash -685992544, now seen corresponding path program 3 times [2023-11-26 11:44:10,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:44:10,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593390620] [2023-11-26 11:44:10,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:44:10,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:44:10,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:44:10,430 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 11:44:10,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:44:10,465 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 11:44:10,467 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:44:10,467 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 7 times [2023-11-26 11:44:10,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:44:10,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608655973] [2023-11-26 11:44:10,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:44:10,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:44:10,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:44:10,472 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 11:44:10,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:44:10,476 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 11:44:10,477 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:44:10,477 INFO L85 PathProgramCache]: Analyzing trace with hash -2108837149, now seen corresponding path program 3 times [2023-11-26 11:44:10,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:44:10,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588729482] [2023-11-26 11:44:10,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:44:10,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:44:10,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:44:10,623 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:44:10,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:44:10,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588729482] [2023-11-26 11:44:10,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588729482] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-26 11:44:10,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1473627901] [2023-11-26 11:44:10,624 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-26 11:44:10,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 11:44:10,624 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_809d94d4-ff72-4932-9ec8-d8b43bad8f0b/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 11:44:10,632 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_809d94d4-ff72-4932-9ec8-d8b43bad8f0b/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-26 11:44:10,654 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_809d94d4-ff72-4932-9ec8-d8b43bad8f0b/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-11-26 11:44:10,710 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-11-26 11:44:10,710 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-26 11:44:10,711 INFO L262 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-26 11:44:10,713 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 11:44:10,800 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:44:10,801 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-26 11:44:10,864 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:44:10,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1473627901] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-26 11:44:10,864 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-26 11:44:10,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2023-11-26 11:44:10,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194692397] [2023-11-26 11:44:10,865 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-26 11:44:10,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:44:10,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-26 11:44:10,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2023-11-26 11:44:10,931 INFO L87 Difference]: Start difference. First operand 24 states and 31 transitions. cyclomatic complexity: 10 Second operand has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:44:11,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:44:11,068 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2023-11-26 11:44:11,069 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 43 transitions. [2023-11-26 11:44:11,071 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-11-26 11:44:11,074 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 29 states and 37 transitions. [2023-11-26 11:44:11,074 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2023-11-26 11:44:11,075 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2023-11-26 11:44:11,075 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 37 transitions. [2023-11-26 11:44:11,076 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:44:11,076 INFO L218 hiAutomatonCegarLoop]: Abstraction has 29 states and 37 transitions. [2023-11-26 11:44:11,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 37 transitions. [2023-11-26 11:44:11,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. [2023-11-26 11:44:11,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 25 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-26 11:44:11,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2023-11-26 11:44:11,084 INFO L240 hiAutomatonCegarLoop]: Abstraction has 26 states and 33 transitions. [2023-11-26 11:44:11,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-26 11:44:11,087 INFO L428 stractBuchiCegarLoop]: Abstraction has 26 states and 33 transitions. [2023-11-26 11:44:11,087 INFO L335 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2023-11-26 11:44:11,087 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 33 transitions. [2023-11-26 11:44:11,088 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-11-26 11:44:11,088 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-26 11:44:11,088 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-26 11:44:11,089 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:44:11,089 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-26 11:44:11,089 INFO L748 eck$LassoCheckResult]: Stem: 1087#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1088#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 1089#L367 assume !(main_~length~0#1 < 1); 1080#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 1081#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 1082#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet208#1;call write~int#0(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1090#L372 assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; 1093#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 1094#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet208#1;call write~int#0(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1104#L372 assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; 1105#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 1091#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet208#1;call write~int#0(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1092#L372 assume main_#t~mem209#1 < 0;havoc main_#t~mem209#1;call write~int#0(0, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1103#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 1095#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 1096#L370-4 main_~j~0#1 := 0; 1086#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1102#L378 assume !(main_#t~mem210#1 < 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 1101#L378-2 [2023-11-26 11:44:11,090 INFO L750 eck$LassoCheckResult]: Loop: 1101#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1100#L378 assume main_#t~mem210#1 < 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 1101#L378-2 [2023-11-26 11:44:11,090 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:44:11,090 INFO L85 PathProgramCache]: Analyzing trace with hash 1742222883, now seen corresponding path program 1 times [2023-11-26 11:44:11,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:44:11,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360202834] [2023-11-26 11:44:11,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:44:11,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:44:11,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:44:11,112 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 11:44:11,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:44:11,136 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 11:44:11,136 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:44:11,137 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 8 times [2023-11-26 11:44:11,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:44:11,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646526771] [2023-11-26 11:44:11,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:44:11,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:44:11,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:44:11,141 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 11:44:11,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:44:11,144 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 11:44:11,145 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:44:11,145 INFO L85 PathProgramCache]: Analyzing trace with hash -761053530, now seen corresponding path program 1 times [2023-11-26 11:44:11,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:44:11,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160989852] [2023-11-26 11:44:11,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:44:11,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:44:11,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:44:11,473 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:44:11,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:44:11,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160989852] [2023-11-26 11:44:11,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160989852] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-26 11:44:11,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [202101492] [2023-11-26 11:44:11,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:44:11,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 11:44:11,475 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_809d94d4-ff72-4932-9ec8-d8b43bad8f0b/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 11:44:11,479 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_809d94d4-ff72-4932-9ec8-d8b43bad8f0b/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-26 11:44:11,499 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_809d94d4-ff72-4932-9ec8-d8b43bad8f0b/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-11-26 11:44:11,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:44:11,557 INFO L262 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 24 conjunts are in the unsatisfiable core [2023-11-26 11:44:11,561 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 11:44:11,653 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-26 11:44:11,759 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-26 11:44:11,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-11-26 11:44:11,916 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-26 11:44:11,917 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2023-11-26 11:44:11,920 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:44:11,920 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-26 11:44:12,072 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 26 treesize of output 24 [2023-11-26 11:44:12,078 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 42 treesize of output 38 [2023-11-26 11:44:12,140 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:44:12,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [202101492] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-26 11:44:12,140 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-26 11:44:12,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 10] total 25 [2023-11-26 11:44:12,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685404906] [2023-11-26 11:44:12,143 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-26 11:44:12,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:44:12,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-11-26 11:44:12,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=520, Unknown=0, NotChecked=0, Total=650 [2023-11-26 11:44:12,195 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. cyclomatic complexity: 10 Second operand has 26 states, 25 states have (on average 1.88) internal successors, (47), 26 states have internal predecessors, (47), 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-26 11:44:12,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:44:12,773 INFO L93 Difference]: Finished difference Result 55 states and 69 transitions. [2023-11-26 11:44:12,774 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55 states and 69 transitions. [2023-11-26 11:44:12,774 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2023-11-26 11:44:12,775 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55 states to 55 states and 69 transitions. [2023-11-26 11:44:12,775 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2023-11-26 11:44:12,776 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2023-11-26 11:44:12,776 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 69 transitions. [2023-11-26 11:44:12,776 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:44:12,776 INFO L218 hiAutomatonCegarLoop]: Abstraction has 55 states and 69 transitions. [2023-11-26 11:44:12,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states and 69 transitions. [2023-11-26 11:44:12,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 28. [2023-11-26 11:44:12,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.25) internal successors, (35), 27 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:44:12,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2023-11-26 11:44:12,780 INFO L240 hiAutomatonCegarLoop]: Abstraction has 28 states and 35 transitions. [2023-11-26 11:44:12,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-11-26 11:44:12,781 INFO L428 stractBuchiCegarLoop]: Abstraction has 28 states and 35 transitions. [2023-11-26 11:44:12,782 INFO L335 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2023-11-26 11:44:12,782 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 35 transitions. [2023-11-26 11:44:12,782 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-11-26 11:44:12,783 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-26 11:44:12,783 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-26 11:44:12,783 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:44:12,784 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-26 11:44:12,784 INFO L748 eck$LassoCheckResult]: Stem: 1346#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1347#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 1348#L367 assume !(main_~length~0#1 < 1); 1340#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 1341#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 1342#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet208#1;call write~int#0(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1349#L372 assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; 1356#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 1357#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet208#1;call write~int#0(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1358#L372 assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; 1359#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 1350#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet208#1;call write~int#0(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1351#L372 assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; 1354#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 1355#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 1345#L370-4 main_~j~0#1 := 0; 1344#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1352#L378 assume !(main_#t~mem210#1 < 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 1363#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1362#L378 assume !(main_#t~mem210#1 < 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 1361#L378-2 [2023-11-26 11:44:12,784 INFO L750 eck$LassoCheckResult]: Loop: 1361#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1360#L378 assume main_#t~mem210#1 < 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 1361#L378-2 [2023-11-26 11:44:12,785 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:44:12,785 INFO L85 PathProgramCache]: Analyzing trace with hash -1570400154, now seen corresponding path program 4 times [2023-11-26 11:44:12,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:44:12,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745517820] [2023-11-26 11:44:12,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:44:12,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:44:12,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:44:12,800 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 11:44:12,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:44:12,813 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 11:44:12,814 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:44:12,814 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 9 times [2023-11-26 11:44:12,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:44:12,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687262419] [2023-11-26 11:44:12,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:44:12,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:44:12,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:44:12,818 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 11:44:12,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:44:12,821 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 11:44:12,822 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:44:12,822 INFO L85 PathProgramCache]: Analyzing trace with hash -1621025751, now seen corresponding path program 4 times [2023-11-26 11:44:12,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:44:12,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647859122] [2023-11-26 11:44:12,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:44:12,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:44:12,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:44:13,063 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:44:13,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:44:13,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647859122] [2023-11-26 11:44:13,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647859122] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-26 11:44:13,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1730046071] [2023-11-26 11:44:13,064 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-26 11:44:13,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 11:44:13,065 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_809d94d4-ff72-4932-9ec8-d8b43bad8f0b/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 11:44:13,072 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_809d94d4-ff72-4932-9ec8-d8b43bad8f0b/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-26 11:44:13,089 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_809d94d4-ff72-4932-9ec8-d8b43bad8f0b/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-11-26 11:44:13,145 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-26 11:44:13,145 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-26 11:44:13,146 INFO L262 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 18 conjunts are in the unsatisfiable core [2023-11-26 11:44:13,148 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 11:44:13,176 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 19 treesize of output 1 [2023-11-26 11:44:13,260 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 19 treesize of output 7 [2023-11-26 11:44:13,263 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:44:13,263 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-26 11:44:13,375 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 18 treesize of output 16 [2023-11-26 11:44:13,379 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 24 treesize of output 20 [2023-11-26 11:44:13,395 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:44:13,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1730046071] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-26 11:44:13,395 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-26 11:44:13,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 16 [2023-11-26 11:44:13,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866498789] [2023-11-26 11:44:13,396 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-26 11:44:13,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:44:13,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-26 11:44:13,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2023-11-26 11:44:13,456 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. cyclomatic complexity: 9 Second operand has 17 states, 16 states have (on average 2.125) internal successors, (34), 17 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:44:13,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:44:13,646 INFO L93 Difference]: Finished difference Result 45 states and 55 transitions. [2023-11-26 11:44:13,646 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 55 transitions. [2023-11-26 11:44:13,647 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2023-11-26 11:44:13,647 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 45 states and 55 transitions. [2023-11-26 11:44:13,648 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2023-11-26 11:44:13,648 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2023-11-26 11:44:13,648 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 55 transitions. [2023-11-26 11:44:13,648 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:44:13,648 INFO L218 hiAutomatonCegarLoop]: Abstraction has 45 states and 55 transitions. [2023-11-26 11:44:13,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 55 transitions. [2023-11-26 11:44:13,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 29. [2023-11-26 11:44:13,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 28 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:44:13,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 37 transitions. [2023-11-26 11:44:13,651 INFO L240 hiAutomatonCegarLoop]: Abstraction has 29 states and 37 transitions. [2023-11-26 11:44:13,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-26 11:44:13,655 INFO L428 stractBuchiCegarLoop]: Abstraction has 29 states and 37 transitions. [2023-11-26 11:44:13,656 INFO L335 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2023-11-26 11:44:13,656 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 37 transitions. [2023-11-26 11:44:13,657 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-11-26 11:44:13,657 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-26 11:44:13,657 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-26 11:44:13,658 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:44:13,658 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-26 11:44:13,658 INFO L748 eck$LassoCheckResult]: Stem: 1569#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1570#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 1571#L367 assume !(main_~length~0#1 < 1); 1563#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 1564#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 1565#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet208#1;call write~int#0(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1572#L372 assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; 1580#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 1581#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet208#1;call write~int#0(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1582#L372 assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; 1583#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 1573#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet208#1;call write~int#0(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1574#L372 assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; 1576#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 1577#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 1578#L370-4 main_~j~0#1 := 0; 1588#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1566#L378 assume !(main_#t~mem210#1 < 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 1567#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1575#L378 assume !(main_#t~mem210#1 < 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 1587#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1586#L378 assume !(main_#t~mem210#1 < 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 1585#L378-2 [2023-11-26 11:44:13,658 INFO L750 eck$LassoCheckResult]: Loop: 1585#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1584#L378 assume main_#t~mem210#1 < 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 1585#L378-2 [2023-11-26 11:44:13,659 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:44:13,659 INFO L85 PathProgramCache]: Analyzing trace with hash -1621025749, now seen corresponding path program 5 times [2023-11-26 11:44:13,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:44:13,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110525307] [2023-11-26 11:44:13,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:44:13,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:44:13,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:44:13,690 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 11:44:13,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:44:13,714 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 11:44:13,715 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:44:13,715 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 10 times [2023-11-26 11:44:13,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:44:13,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100624587] [2023-11-26 11:44:13,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:44:13,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:44:13,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:44:13,720 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 11:44:13,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:44:13,723 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 11:44:13,724 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:44:13,724 INFO L85 PathProgramCache]: Analyzing trace with hash 1267385006, now seen corresponding path program 5 times [2023-11-26 11:44:13,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:44:13,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832285073] [2023-11-26 11:44:13,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:44:13,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:44:13,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:44:13,862 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 7 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:44:13,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:44:13,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832285073] [2023-11-26 11:44:13,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832285073] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-26 11:44:13,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [386840405] [2023-11-26 11:44:13,863 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-26 11:44:13,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 11:44:13,864 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_809d94d4-ff72-4932-9ec8-d8b43bad8f0b/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 11:44:13,867 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_809d94d4-ff72-4932-9ec8-d8b43bad8f0b/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-26 11:44:13,880 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_809d94d4-ff72-4932-9ec8-d8b43bad8f0b/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-11-26 11:44:13,958 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2023-11-26 11:44:13,958 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-26 11:44:13,959 INFO L262 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-26 11:44:13,960 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 11:44:14,061 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:44:14,061 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-26 11:44:14,172 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:44:14,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [386840405] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-26 11:44:14,173 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-26 11:44:14,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2023-11-26 11:44:14,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998258800] [2023-11-26 11:44:14,173 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-26 11:44:14,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:44:14,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-26 11:44:14,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2023-11-26 11:44:14,230 INFO L87 Difference]: Start difference. First operand 29 states and 37 transitions. cyclomatic complexity: 11 Second operand has 17 states, 17 states have (on average 2.235294117647059) internal successors, (38), 17 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-26 11:44:14,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:44:14,359 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2023-11-26 11:44:14,359 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 51 transitions. [2023-11-26 11:44:14,359 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-11-26 11:44:14,360 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 34 states and 43 transitions. [2023-11-26 11:44:14,360 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2023-11-26 11:44:14,361 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2023-11-26 11:44:14,361 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 43 transitions. [2023-11-26 11:44:14,361 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:44:14,362 INFO L218 hiAutomatonCegarLoop]: Abstraction has 34 states and 43 transitions. [2023-11-26 11:44:14,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 43 transitions. [2023-11-26 11:44:14,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 31. [2023-11-26 11:44:14,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 30 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:44:14,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2023-11-26 11:44:14,365 INFO L240 hiAutomatonCegarLoop]: Abstraction has 31 states and 39 transitions. [2023-11-26 11:44:14,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-26 11:44:14,366 INFO L428 stractBuchiCegarLoop]: Abstraction has 31 states and 39 transitions. [2023-11-26 11:44:14,367 INFO L335 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2023-11-26 11:44:14,367 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 39 transitions. [2023-11-26 11:44:14,367 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-11-26 11:44:14,367 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-26 11:44:14,368 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-26 11:44:14,368 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:44:14,369 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-26 11:44:14,369 INFO L748 eck$LassoCheckResult]: Stem: 1810#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1811#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 1812#L367 assume !(main_~length~0#1 < 1); 1804#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 1805#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 1806#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet208#1;call write~int#0(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1813#L372 assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; 1826#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 1814#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet208#1;call write~int#0(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1815#L372 assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; 1817#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 1818#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet208#1;call write~int#0(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1825#L372 assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; 1824#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 1822#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet208#1;call write~int#0(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1823#L372 assume main_#t~mem209#1 < 0;havoc main_#t~mem209#1;call write~int#0(0, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1821#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 1819#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 1809#L370-4 main_~j~0#1 := 0; 1808#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1816#L378 assume !(main_#t~mem210#1 < 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 1830#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1829#L378 assume !(main_#t~mem210#1 < 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 1828#L378-2 [2023-11-26 11:44:14,369 INFO L750 eck$LassoCheckResult]: Loop: 1828#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1827#L378 assume main_#t~mem210#1 < 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 1828#L378-2 [2023-11-26 11:44:14,370 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:44:14,370 INFO L85 PathProgramCache]: Analyzing trace with hash 1476197922, now seen corresponding path program 2 times [2023-11-26 11:44:14,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:44:14,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82673395] [2023-11-26 11:44:14,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:44:14,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:44:14,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:44:14,390 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 11:44:14,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:44:14,406 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 11:44:14,407 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:44:14,407 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 11 times [2023-11-26 11:44:14,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:44:14,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010606228] [2023-11-26 11:44:14,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:44:14,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:44:14,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:44:14,413 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 11:44:14,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:44:14,416 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 11:44:14,417 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:44:14,417 INFO L85 PathProgramCache]: Analyzing trace with hash 1286996709, now seen corresponding path program 2 times [2023-11-26 11:44:14,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:44:14,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765418892] [2023-11-26 11:44:14,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:44:14,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:44:14,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:44:14,814 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:44:14,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:44:14,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765418892] [2023-11-26 11:44:14,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765418892] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-26 11:44:14,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2079253382] [2023-11-26 11:44:14,816 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-26 11:44:14,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 11:44:14,816 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_809d94d4-ff72-4932-9ec8-d8b43bad8f0b/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 11:44:14,820 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_809d94d4-ff72-4932-9ec8-d8b43bad8f0b/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-26 11:44:14,829 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_809d94d4-ff72-4932-9ec8-d8b43bad8f0b/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-11-26 11:44:14,922 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-26 11:44:14,922 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-26 11:44:14,923 INFO L262 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 27 conjunts are in the unsatisfiable core [2023-11-26 11:44:14,926 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 11:44:15,041 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-26 11:44:15,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-26 11:44:15,140 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2023-11-26 11:44:15,157 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-26 11:44:15,158 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-11-26 11:44:15,501 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-26 11:44:15,503 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-26 11:44:15,503 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 10 [2023-11-26 11:44:15,507 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:44:15,507 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-26 11:44:15,697 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 18 treesize of output 16 [2023-11-26 11:44:15,704 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 24 treesize of output 20 [2023-11-26 11:44:15,720 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 1 proven. 26 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-26 11:44:15,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2079253382] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-26 11:44:15,720 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-26 11:44:15,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 26 [2023-11-26 11:44:15,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584991722] [2023-11-26 11:44:15,721 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-26 11:44:15,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:44:15,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-11-26 11:44:15,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=587, Unknown=0, NotChecked=0, Total=702 [2023-11-26 11:44:15,781 INFO L87 Difference]: Start difference. First operand 31 states and 39 transitions. cyclomatic complexity: 11 Second operand has 27 states, 26 states have (on average 2.0384615384615383) internal successors, (53), 27 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:44:16,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:44:16,333 INFO L93 Difference]: Finished difference Result 48 states and 58 transitions. [2023-11-26 11:44:16,333 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 58 transitions. [2023-11-26 11:44:16,334 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2023-11-26 11:44:16,334 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 48 states and 58 transitions. [2023-11-26 11:44:16,335 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2023-11-26 11:44:16,335 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2023-11-26 11:44:16,335 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 58 transitions. [2023-11-26 11:44:16,335 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:44:16,335 INFO L218 hiAutomatonCegarLoop]: Abstraction has 48 states and 58 transitions. [2023-11-26 11:44:16,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states and 58 transitions. [2023-11-26 11:44:16,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 27. [2023-11-26 11:44:16,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 26 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-26 11:44:16,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2023-11-26 11:44:16,339 INFO L240 hiAutomatonCegarLoop]: Abstraction has 27 states and 33 transitions. [2023-11-26 11:44:16,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-26 11:44:16,340 INFO L428 stractBuchiCegarLoop]: Abstraction has 27 states and 33 transitions. [2023-11-26 11:44:16,340 INFO L335 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2023-11-26 11:44:16,341 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 33 transitions. [2023-11-26 11:44:16,341 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-11-26 11:44:16,341 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-26 11:44:16,341 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-26 11:44:16,342 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:44:16,342 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-26 11:44:16,343 INFO L748 eck$LassoCheckResult]: Stem: 2086#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2087#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 2088#L367 assume !(main_~length~0#1 < 1); 2079#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 2080#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 2081#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet208#1;call write~int#0(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2089#L372 assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; 2093#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 2090#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet208#1;call write~int#0(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2091#L372 assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; 2101#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 2100#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet208#1;call write~int#0(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2099#L372 assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; 2098#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 2097#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet208#1;call write~int#0(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2095#L372 assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; 2096#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 2094#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 2082#L370-4 main_~j~0#1 := 0; 2083#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2084#L378 assume !(main_#t~mem210#1 < 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 2085#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2092#L378 assume !(main_#t~mem210#1 < 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 2105#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2104#L378 assume !(main_#t~mem210#1 < 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 2103#L378-2 [2023-11-26 11:44:16,343 INFO L750 eck$LassoCheckResult]: Loop: 2103#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2102#L378 assume main_#t~mem210#1 < 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 2103#L378-2 [2023-11-26 11:44:16,343 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:44:16,343 INFO L85 PathProgramCache]: Analyzing trace with hash 893969701, now seen corresponding path program 6 times [2023-11-26 11:44:16,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:44:16,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023049482] [2023-11-26 11:44:16,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:44:16,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:44:16,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:44:16,358 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 11:44:16,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:44:16,372 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 11:44:16,373 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:44:16,373 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 12 times [2023-11-26 11:44:16,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:44:16,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011271090] [2023-11-26 11:44:16,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:44:16,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:44:16,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:44:16,377 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 11:44:16,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:44:16,380 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 11:44:16,381 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:44:16,381 INFO L85 PathProgramCache]: Analyzing trace with hash 111424808, now seen corresponding path program 6 times [2023-11-26 11:44:16,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:44:16,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489728025] [2023-11-26 11:44:16,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:44:16,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:44:16,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:44:16,730 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:44:16,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:44:16,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489728025] [2023-11-26 11:44:16,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489728025] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-26 11:44:16,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [551494745] [2023-11-26 11:44:16,731 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-11-26 11:44:16,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 11:44:16,732 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_809d94d4-ff72-4932-9ec8-d8b43bad8f0b/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 11:44:16,736 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_809d94d4-ff72-4932-9ec8-d8b43bad8f0b/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-26 11:44:16,748 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_809d94d4-ff72-4932-9ec8-d8b43bad8f0b/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-11-26 11:44:16,842 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2023-11-26 11:44:16,843 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-26 11:44:16,844 INFO L262 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 17 conjunts are in the unsatisfiable core [2023-11-26 11:44:16,846 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 11:44:16,928 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2023-11-26 11:44:17,359 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-11-26 11:44:17,359 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 10 [2023-11-26 11:44:17,365 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 9 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:44:17,366 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-26 11:44:17,927 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 20 treesize of output 18 [2023-11-26 11:44:17,932 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 26 treesize of output 20 [2023-11-26 11:44:18,018 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:44:18,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [551494745] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-26 11:44:18,019 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-26 11:44:18,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 14] total 33 [2023-11-26 11:44:18,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750789793] [2023-11-26 11:44:18,020 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-26 11:44:18,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:44:18,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-11-26 11:44:18,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=967, Unknown=0, NotChecked=0, Total=1122 [2023-11-26 11:44:18,077 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. cyclomatic complexity: 8 Second operand has 34 states, 33 states have (on average 1.8484848484848484) internal successors, (61), 34 states have internal predecessors, (61), 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-26 11:44:21,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:44:21,093 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2023-11-26 11:44:21,093 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 47 transitions. [2023-11-26 11:44:21,095 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2023-11-26 11:44:21,096 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 40 states and 47 transitions. [2023-11-26 11:44:21,096 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2023-11-26 11:44:21,096 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2023-11-26 11:44:21,096 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 47 transitions. [2023-11-26 11:44:21,097 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:44:21,097 INFO L218 hiAutomatonCegarLoop]: Abstraction has 40 states and 47 transitions. [2023-11-26 11:44:21,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 47 transitions. [2023-11-26 11:44:21,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 21. [2023-11-26 11:44:21,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 20 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-26 11:44:21,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. [2023-11-26 11:44:21,099 INFO L240 hiAutomatonCegarLoop]: Abstraction has 21 states and 26 transitions. [2023-11-26 11:44:21,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-11-26 11:44:21,100 INFO L428 stractBuchiCegarLoop]: Abstraction has 21 states and 26 transitions. [2023-11-26 11:44:21,100 INFO L335 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2023-11-26 11:44:21,100 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 26 transitions. [2023-11-26 11:44:21,100 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-11-26 11:44:21,100 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-26 11:44:21,100 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-26 11:44:21,101 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:44:21,101 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-26 11:44:21,101 INFO L748 eck$LassoCheckResult]: Stem: 2395#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2396#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 2397#L367 assume !(main_~length~0#1 < 1); 2389#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 2390#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 2391#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet208#1;call write~int#0(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2398#L372 assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; 2409#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 2399#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet208#1;call write~int#0(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2400#L372 assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; 2401#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 2402#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet208#1;call write~int#0(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2408#L372 assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; 2407#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 2406#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet208#1;call write~int#0(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2404#L372 assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; 2405#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 2403#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 2394#L370-4 main_~j~0#1 := 0; 2393#L378-2 [2023-11-26 11:44:21,101 INFO L750 eck$LassoCheckResult]: Loop: 2393#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2392#L378 assume !(main_#t~mem210#1 < 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 2393#L378-2 [2023-11-26 11:44:21,102 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:44:21,102 INFO L85 PathProgramCache]: Analyzing trace with hash -49003114, now seen corresponding path program 2 times [2023-11-26 11:44:21,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:44:21,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225152858] [2023-11-26 11:44:21,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:44:21,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:44:21,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:44:21,114 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 11:44:21,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:44:21,122 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 11:44:21,123 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:44:21,123 INFO L85 PathProgramCache]: Analyzing trace with hash 2310, now seen corresponding path program 1 times [2023-11-26 11:44:21,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:44:21,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346592391] [2023-11-26 11:44:21,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:44:21,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:44:21,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:44:21,127 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 11:44:21,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:44:21,129 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 11:44:21,130 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:44:21,130 INFO L85 PathProgramCache]: Analyzing trace with hash 152649051, now seen corresponding path program 7 times [2023-11-26 11:44:21,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:44:21,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173791065] [2023-11-26 11:44:21,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:44:21,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:44:21,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:44:21,142 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 11:44:21,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:44:21,151 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 11:44:21,938 INFO L210 LassoAnalysis]: Preferences: [2023-11-26 11:44:21,939 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-26 11:44:21,939 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-26 11:44:21,939 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-26 11:44:21,939 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-11-26 11:44:21,939 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-26 11:44:21,940 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-26 11:44:21,940 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-26 11:44:21,940 INFO L133 ssoRankerPreferences]: Filename of dumped script: array12_alloca.i_Iteration14_Lasso [2023-11-26 11:44:21,940 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-26 11:44:21,940 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-26 11:44:21,945 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-26 11:44:21,947 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-26 11:44:21,950 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-26 11:44:21,952 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-26 11:44:21,954 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-26 11:44:21,956 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-26 11:44:21,958 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-26 11:44:21,961 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-26 11:44:21,963 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-26 11:44:21,966 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-26 11:44:22,146 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-26 11:44:22,355 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-26 11:44:22,355 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-11-26 11:44:22,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-26 11:44:22,356 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_809d94d4-ff72-4932-9ec8-d8b43bad8f0b/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 11:44:22,359 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_809d94d4-ff72-4932-9ec8-d8b43bad8f0b/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-26 11:44:22,362 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_809d94d4-ff72-4932-9ec8-d8b43bad8f0b/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2023-11-26 11:44:22,362 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-26 11:44:22,377 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-26 11:44:22,377 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-26 11:44:22,377 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-26 11:44:22,377 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-26 11:44:22,377 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-26 11:44:22,378 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-26 11:44:22,378 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-26 11:44:22,387 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-26 11:44:22,397 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_809d94d4-ff72-4932-9ec8-d8b43bad8f0b/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2023-11-26 11:44:22,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-26 11:44:22,398 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_809d94d4-ff72-4932-9ec8-d8b43bad8f0b/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 11:44:22,399 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_809d94d4-ff72-4932-9ec8-d8b43bad8f0b/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-26 11:44:22,414 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_809d94d4-ff72-4932-9ec8-d8b43bad8f0b/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2023-11-26 11:44:22,415 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-26 11:44:22,429 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-26 11:44:22,429 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-26 11:44:22,430 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-26 11:44:22,430 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-26 11:44:22,430 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-26 11:44:22,431 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-26 11:44:22,431 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-26 11:44:22,444 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-26 11:44:22,453 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_809d94d4-ff72-4932-9ec8-d8b43bad8f0b/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2023-11-26 11:44:22,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-26 11:44:22,454 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_809d94d4-ff72-4932-9ec8-d8b43bad8f0b/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 11:44:22,455 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_809d94d4-ff72-4932-9ec8-d8b43bad8f0b/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-26 11:44:22,460 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_809d94d4-ff72-4932-9ec8-d8b43bad8f0b/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2023-11-26 11:44:22,461 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-26 11:44:22,473 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-26 11:44:22,474 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-26 11:44:22,474 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-26 11:44:22,474 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-26 11:44:22,474 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-26 11:44:22,475 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-26 11:44:22,475 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-26 11:44:22,496 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-26 11:44:22,506 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_809d94d4-ff72-4932-9ec8-d8b43bad8f0b/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2023-11-26 11:44:22,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-26 11:44:22,506 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_809d94d4-ff72-4932-9ec8-d8b43bad8f0b/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 11:44:22,507 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_809d94d4-ff72-4932-9ec8-d8b43bad8f0b/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-26 11:44:22,522 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-26 11:44:22,535 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_809d94d4-ff72-4932-9ec8-d8b43bad8f0b/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2023-11-26 11:44:22,536 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-26 11:44:22,536 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-26 11:44:22,536 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-26 11:44:22,536 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-26 11:44:22,536 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-26 11:44:22,537 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-26 11:44:22,537 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-26 11:44:22,556 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-26 11:44:22,567 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_809d94d4-ff72-4932-9ec8-d8b43bad8f0b/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2023-11-26 11:44:22,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-26 11:44:22,567 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_809d94d4-ff72-4932-9ec8-d8b43bad8f0b/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 11:44:22,568 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_809d94d4-ff72-4932-9ec8-d8b43bad8f0b/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-26 11:44:22,573 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_809d94d4-ff72-4932-9ec8-d8b43bad8f0b/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2023-11-26 11:44:22,574 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-26 11:44:22,589 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-26 11:44:22,589 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-26 11:44:22,589 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-26 11:44:22,589 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-26 11:44:22,590 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-26 11:44:22,590 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-26 11:44:22,590 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-26 11:44:22,604 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-26 11:44:22,607 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_809d94d4-ff72-4932-9ec8-d8b43bad8f0b/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2023-11-26 11:44:22,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-26 11:44:22,608 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_809d94d4-ff72-4932-9ec8-d8b43bad8f0b/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 11:44:22,609 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_809d94d4-ff72-4932-9ec8-d8b43bad8f0b/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-26 11:44:22,612 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_809d94d4-ff72-4932-9ec8-d8b43bad8f0b/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2023-11-26 11:44:22,613 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-26 11:44:22,624 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-26 11:44:22,624 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-26 11:44:22,624 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-26 11:44:22,624 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-26 11:44:22,624 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-26 11:44:22,625 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-26 11:44:22,625 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-26 11:44:22,626 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-26 11:44:22,633 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_809d94d4-ff72-4932-9ec8-d8b43bad8f0b/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2023-11-26 11:44:22,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-26 11:44:22,633 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_809d94d4-ff72-4932-9ec8-d8b43bad8f0b/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 11:44:22,634 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_809d94d4-ff72-4932-9ec8-d8b43bad8f0b/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-26 11:44:22,640 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_809d94d4-ff72-4932-9ec8-d8b43bad8f0b/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2023-11-26 11:44:22,646 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-26 11:44:22,657 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-26 11:44:22,657 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-26 11:44:22,657 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-26 11:44:22,657 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-26 11:44:22,657 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-26 11:44:22,657 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-26 11:44:22,658 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-26 11:44:22,659 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-26 11:44:22,662 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_809d94d4-ff72-4932-9ec8-d8b43bad8f0b/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2023-11-26 11:44:22,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-26 11:44:22,663 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_809d94d4-ff72-4932-9ec8-d8b43bad8f0b/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 11:44:22,664 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_809d94d4-ff72-4932-9ec8-d8b43bad8f0b/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-26 11:44:22,666 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_809d94d4-ff72-4932-9ec8-d8b43bad8f0b/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2023-11-26 11:44:22,667 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-26 11:44:22,677 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-26 11:44:22,678 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-26 11:44:22,678 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-26 11:44:22,678 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-26 11:44:22,680 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-26 11:44:22,681 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-26 11:44:22,689 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-26 11:44:22,697 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_809d94d4-ff72-4932-9ec8-d8b43bad8f0b/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2023-11-26 11:44:22,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-26 11:44:22,698 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_809d94d4-ff72-4932-9ec8-d8b43bad8f0b/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 11:44:22,699 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_809d94d4-ff72-4932-9ec8-d8b43bad8f0b/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-26 11:44:22,701 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_809d94d4-ff72-4932-9ec8-d8b43bad8f0b/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2023-11-26 11:44:22,701 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-26 11:44:22,712 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-26 11:44:22,712 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-26 11:44:22,712 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-26 11:44:22,712 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-26 11:44:22,712 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-26 11:44:22,713 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-26 11:44:22,713 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-26 11:44:22,714 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-26 11:44:22,717 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_809d94d4-ff72-4932-9ec8-d8b43bad8f0b/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2023-11-26 11:44:22,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-26 11:44:22,718 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_809d94d4-ff72-4932-9ec8-d8b43bad8f0b/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 11:44:22,719 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_809d94d4-ff72-4932-9ec8-d8b43bad8f0b/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-26 11:44:22,725 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-26 11:44:22,738 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_809d94d4-ff72-4932-9ec8-d8b43bad8f0b/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2023-11-26 11:44:22,738 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-26 11:44:22,739 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-26 11:44:22,739 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-26 11:44:22,739 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-26 11:44:22,741 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-26 11:44:22,741 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-26 11:44:22,747 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-26 11:44:22,750 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_809d94d4-ff72-4932-9ec8-d8b43bad8f0b/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2023-11-26 11:44:22,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-26 11:44:22,750 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_809d94d4-ff72-4932-9ec8-d8b43bad8f0b/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 11:44:22,751 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_809d94d4-ff72-4932-9ec8-d8b43bad8f0b/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-26 11:44:22,754 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_809d94d4-ff72-4932-9ec8-d8b43bad8f0b/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2023-11-26 11:44:22,755 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-26 11:44:22,766 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-26 11:44:22,766 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-26 11:44:22,766 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-26 11:44:22,766 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-26 11:44:22,770 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-26 11:44:22,770 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-26 11:44:22,777 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-26 11:44:22,780 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_809d94d4-ff72-4932-9ec8-d8b43bad8f0b/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2023-11-26 11:44:22,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-26 11:44:22,781 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_809d94d4-ff72-4932-9ec8-d8b43bad8f0b/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 11:44:22,784 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_809d94d4-ff72-4932-9ec8-d8b43bad8f0b/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-26 11:44:22,785 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_809d94d4-ff72-4932-9ec8-d8b43bad8f0b/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2023-11-26 11:44:22,787 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-26 11:44:22,798 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-26 11:44:22,798 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-26 11:44:22,798 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-26 11:44:22,798 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-26 11:44:22,801 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-26 11:44:22,801 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-26 11:44:22,826 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-26 11:44:22,833 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_809d94d4-ff72-4932-9ec8-d8b43bad8f0b/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2023-11-26 11:44:22,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-26 11:44:22,834 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_809d94d4-ff72-4932-9ec8-d8b43bad8f0b/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 11:44:22,835 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_809d94d4-ff72-4932-9ec8-d8b43bad8f0b/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-26 11:44:22,841 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-26 11:44:22,854 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_809d94d4-ff72-4932-9ec8-d8b43bad8f0b/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2023-11-26 11:44:22,854 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-26 11:44:22,854 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-26 11:44:22,854 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-26 11:44:22,855 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-26 11:44:22,856 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-26 11:44:22,857 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-26 11:44:22,876 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-26 11:44:22,887 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_809d94d4-ff72-4932-9ec8-d8b43bad8f0b/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2023-11-26 11:44:22,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-26 11:44:22,888 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_809d94d4-ff72-4932-9ec8-d8b43bad8f0b/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 11:44:22,889 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_809d94d4-ff72-4932-9ec8-d8b43bad8f0b/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-26 11:44:22,893 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-26 11:44:22,906 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_809d94d4-ff72-4932-9ec8-d8b43bad8f0b/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2023-11-26 11:44:22,907 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-26 11:44:22,907 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-26 11:44:22,907 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-26 11:44:22,907 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-26 11:44:22,910 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-26 11:44:22,910 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-26 11:44:22,926 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-26 11:44:22,937 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_809d94d4-ff72-4932-9ec8-d8b43bad8f0b/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2023-11-26 11:44:22,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-26 11:44:22,938 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_809d94d4-ff72-4932-9ec8-d8b43bad8f0b/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 11:44:22,939 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_809d94d4-ff72-4932-9ec8-d8b43bad8f0b/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-26 11:44:22,943 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-26 11:44:22,956 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_809d94d4-ff72-4932-9ec8-d8b43bad8f0b/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2023-11-26 11:44:22,957 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-26 11:44:22,957 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-26 11:44:22,957 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-26 11:44:22,957 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-26 11:44:22,963 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-26 11:44:22,963 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-26 11:44:22,988 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-11-26 11:44:23,031 INFO L443 ModelExtractionUtils]: Simplification made 18 calls to the SMT solver. [2023-11-26 11:44:23,031 INFO L444 ModelExtractionUtils]: 3 out of 19 variables were initially zero. Simplification set additionally 13 variables to zero. [2023-11-26 11:44:23,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-26 11:44:23,032 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_809d94d4-ff72-4932-9ec8-d8b43bad8f0b/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 11:44:23,036 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_809d94d4-ff72-4932-9ec8-d8b43bad8f0b/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-26 11:44:23,037 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-11-26 11:44:23,052 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_809d94d4-ff72-4932-9ec8-d8b43bad8f0b/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2023-11-26 11:44:23,060 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-11-26 11:44:23,061 INFO L513 LassoAnalysis]: Proved termination. [2023-11-26 11:44:23,061 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~length~0#1, ULTIMATE.start_main_~j~0#1) = 1*ULTIMATE.start_main_~length~0#1 - 1*ULTIMATE.start_main_~j~0#1 Supporting invariants [] [2023-11-26 11:44:23,071 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_809d94d4-ff72-4932-9ec8-d8b43bad8f0b/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2023-11-26 11:44:23,082 INFO L156 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2023-11-26 11:44:23,097 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:44:23,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:44:23,124 INFO L262 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-26 11:44:23,126 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 11:44:23,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:44:23,160 INFO L262 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-26 11:44:23,161 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 11:44:23,176 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-26 11:44:23,176 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-26 11:44:23,177 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 26 transitions. cyclomatic complexity: 7 Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:44:23,192 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 26 transitions. cyclomatic complexity: 7. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 23 states and 29 transitions. Complement of second has 4 states. [2023-11-26 11:44:23,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-11-26 11:44:23,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:44:23,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 13 transitions. [2023-11-26 11:44:23,194 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 19 letters. Loop has 2 letters. [2023-11-26 11:44:23,194 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-26 11:44:23,194 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 21 letters. Loop has 2 letters. [2023-11-26 11:44:23,194 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-26 11:44:23,195 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 19 letters. Loop has 4 letters. [2023-11-26 11:44:23,195 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-26 11:44:23,195 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 29 transitions. [2023-11-26 11:44:23,196 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2023-11-26 11:44:23,196 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 0 states and 0 transitions. [2023-11-26 11:44:23,196 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2023-11-26 11:44:23,196 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2023-11-26 11:44:23,196 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2023-11-26 11:44:23,196 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:44:23,197 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-26 11:44:23,197 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-26 11:44:23,197 INFO L428 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-26 11:44:23,197 INFO L335 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2023-11-26 11:44:23,197 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2023-11-26 11:44:23,197 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2023-11-26 11:44:23,198 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2023-11-26 11:44:23,205 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.11 11:44:23 BoogieIcfgContainer [2023-11-26 11:44:23,205 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-11-26 11:44:23,206 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-26 11:44:23,206 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-26 11:44:23,206 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-26 11:44:23,207 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 11:44:03" (3/4) ... [2023-11-26 11:44:23,209 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-26 11:44:23,210 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-26 11:44:23,211 INFO L158 Benchmark]: Toolchain (without parser) took 20829.50ms. Allocated memory was 119.5MB in the beginning and 272.6MB in the end (delta: 153.1MB). Free memory was 78.8MB in the beginning and 125.1MB in the end (delta: -46.4MB). Peak memory consumption was 106.0MB. Max. memory is 16.1GB. [2023-11-26 11:44:23,211 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 119.5MB. Free memory was 89.4MB in the beginning and 89.3MB in the end (delta: 125.8kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-26 11:44:23,212 INFO L158 Benchmark]: CACSL2BoogieTranslator took 581.63ms. Allocated memory is still 119.5MB. Free memory was 78.8MB in the beginning and 79.9MB in the end (delta: -1.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-11-26 11:44:23,212 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.79ms. Allocated memory is still 119.5MB. Free memory was 79.9MB in the beginning and 78.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-26 11:44:23,213 INFO L158 Benchmark]: Boogie Preprocessor took 83.93ms. Allocated memory is still 119.5MB. Free memory was 78.2MB in the beginning and 76.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-26 11:44:23,213 INFO L158 Benchmark]: RCFGBuilder took 408.60ms. Allocated memory is still 119.5MB. Free memory was 76.1MB in the beginning and 65.2MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-26 11:44:23,214 INFO L158 Benchmark]: BuchiAutomizer took 19677.92ms. Allocated memory was 119.5MB in the beginning and 272.6MB in the end (delta: 153.1MB). Free memory was 65.2MB in the beginning and 126.1MB in the end (delta: -61.0MB). Peak memory consumption was 94.8MB. Max. memory is 16.1GB. [2023-11-26 11:44:23,214 INFO L158 Benchmark]: Witness Printer took 4.67ms. Allocated memory is still 272.6MB. Free memory was 126.1MB in the beginning and 125.1MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-26 11:44:23,216 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26ms. Allocated memory is still 119.5MB. Free memory was 89.4MB in the beginning and 89.3MB in the end (delta: 125.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 581.63ms. Allocated memory is still 119.5MB. Free memory was 78.8MB in the beginning and 79.9MB in the end (delta: -1.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 66.79ms. Allocated memory is still 119.5MB. Free memory was 79.9MB in the beginning and 78.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 83.93ms. Allocated memory is still 119.5MB. Free memory was 78.2MB in the beginning and 76.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 408.60ms. Allocated memory is still 119.5MB. Free memory was 76.1MB in the beginning and 65.2MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 19677.92ms. Allocated memory was 119.5MB in the beginning and 272.6MB in the end (delta: 153.1MB). Free memory was 65.2MB in the beginning and 126.1MB in the end (delta: -61.0MB). Peak memory consumption was 94.8MB. Max. memory is 16.1GB. * Witness Printer took 4.67ms. Allocated memory is still 272.6MB. Free memory was 126.1MB in the beginning and 125.1MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #length[~arr~0!base] could not be translated * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 14 terminating modules (12 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function null and consists of 5 locations. One deterministic module has affine ranking function ((-1 * j) + length) and consists of 3 locations. 12 modules have a trivial ranking function, the largest among these consists of 34 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 19.6s and 15 iterations. TraceHistogramMax:4. Analysis of lassos took 13.4s. Construction of modules took 2.8s. Büchi inclusion checks took 3.1s. Highest rank in rank-based complementation 3. Minimization of det autom 14. Minimization of nondet autom 0. Automata minimization 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 117 StatesRemovedByMinimization, 11 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 2 mSolverCounterUnknown, 636 SdHoareTripleChecker+Valid, 3.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 634 mSDsluCounter, 610 SdHoareTripleChecker+Invalid, 2.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 483 mSDsCounter, 142 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1843 IncrementalHoareTripleChecker+Invalid, 1987 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 142 mSolverCounterUnsat, 127 mSDtfsCounter, 1843 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc10 concLT0 SILN0 SILU2 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital129 mio100 ax100 hnf100 lsp96 ukn74 mio100 lsp54 div137 bol100 ite100 ukn100 eq156 hnf92 smp86 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 49ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2023-11-26 11:44:23,237 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_809d94d4-ff72-4932-9ec8-d8b43bad8f0b/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2023-11-26 11:44:23,436 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_809d94d4-ff72-4932-9ec8-d8b43bad8f0b/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2023-11-26 11:44:23,636 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_809d94d4-ff72-4932-9ec8-d8b43bad8f0b/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2023-11-26 11:44:23,837 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_809d94d4-ff72-4932-9ec8-d8b43bad8f0b/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2023-11-26 11:44:24,037 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_809d94d4-ff72-4932-9ec8-d8b43bad8f0b/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2023-11-26 11:44:24,237 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_809d94d4-ff72-4932-9ec8-d8b43bad8f0b/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2023-11-26 11:44:24,437 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_809d94d4-ff72-4932-9ec8-d8b43bad8f0b/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2023-11-26 11:44:24,637 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_809d94d4-ff72-4932-9ec8-d8b43bad8f0b/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2023-11-26 11:44:24,837 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_809d94d4-ff72-4932-9ec8-d8b43bad8f0b/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2023-11-26 11:44:25,038 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_809d94d4-ff72-4932-9ec8-d8b43bad8f0b/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-11-26 11:44:25,238 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_809d94d4-ff72-4932-9ec8-d8b43bad8f0b/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-11-26 11:44:25,438 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_809d94d4-ff72-4932-9ec8-d8b43bad8f0b/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-11-26 11:44:25,639 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_809d94d4-ff72-4932-9ec8-d8b43bad8f0b/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE