./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/ldv-regression/ex3_forlist.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/ldv-regression/ex3_forlist.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ddbd4e73adf4663f87721f5aa250c32f7b058621a618ab1d03544a940de1ce0e --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 04:37:35,209 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 04:37:35,276 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Termination-32bit-Automizer_Default.epf [2023-11-29 04:37:35,280 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 04:37:35,281 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 04:37:35,303 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 04:37:35,304 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 04:37:35,304 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 04:37:35,305 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 04:37:35,306 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 04:37:35,306 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 04:37:35,307 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 04:37:35,307 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 04:37:35,308 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-11-29 04:37:35,308 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-11-29 04:37:35,309 INFO L153 SettingsManager]: * Use old map elimination=false [2023-11-29 04:37:35,309 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2023-11-29 04:37:35,310 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2023-11-29 04:37:35,310 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-11-29 04:37:35,311 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 04:37:35,311 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-11-29 04:37:35,313 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 04:37:35,313 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 04:37:35,314 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 04:37:35,314 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 04:37:35,315 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-11-29 04:37:35,315 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-11-29 04:37:35,315 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-11-29 04:37:35,316 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 04:37:35,316 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 04:37:35,316 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 04:37:35,317 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-11-29 04:37:35,317 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 04:37:35,317 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 04:37:35,317 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 04:37:35,318 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 04:37:35,318 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 04:37:35,318 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-11-29 04:37:35,318 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_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ddbd4e73adf4663f87721f5aa250c32f7b058621a618ab1d03544a940de1ce0e [2023-11-29 04:37:35,550 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 04:37:35,580 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 04:37:35,583 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 04:37:35,584 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 04:37:35,584 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 04:37:35,585 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/ldv-regression/ex3_forlist.i [2023-11-29 04:37:38,356 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 04:37:38,534 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 04:37:38,534 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/sv-benchmarks/c/ldv-regression/ex3_forlist.i [2023-11-29 04:37:38,541 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/data/9ae20e732/f3f572c85a2141f8a3f03444a863c9c0/FLAG866646a9d [2023-11-29 04:37:38,555 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/data/9ae20e732/f3f572c85a2141f8a3f03444a863c9c0 [2023-11-29 04:37:38,558 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 04:37:38,559 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 04:37:38,560 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 04:37:38,561 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 04:37:38,564 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 04:37:38,565 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 04:37:38" (1/1) ... [2023-11-29 04:37:38,566 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1caf4fde and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:37:38, skipping insertion in model container [2023-11-29 04:37:38,566 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 04:37:38" (1/1) ... [2023-11-29 04:37:38,589 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 04:37:38,734 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 04:37:38,746 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 04:37:38,766 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 04:37:38,783 INFO L206 MainTranslator]: Completed translation [2023-11-29 04:37:38,783 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:37:38 WrapperNode [2023-11-29 04:37:38,784 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 04:37:38,785 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 04:37:38,785 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 04:37:38,785 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 04:37:38,792 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:37:38" (1/1) ... [2023-11-29 04:37:38,800 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:37:38" (1/1) ... [2023-11-29 04:37:38,821 INFO L138 Inliner]: procedures = 19, calls = 30, calls flagged for inlining = 11, calls inlined = 13, statements flattened = 139 [2023-11-29 04:37:38,821 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 04:37:38,822 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 04:37:38,822 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 04:37:38,822 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 04:37:38,830 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:37:38" (1/1) ... [2023-11-29 04:37:38,830 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:37:38" (1/1) ... [2023-11-29 04:37:38,833 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:37:38" (1/1) ... [2023-11-29 04:37:38,847 INFO L175 MemorySlicer]: Split 20 memory accesses to 3 slices as follows [2, 9, 9]. 45 percent of accesses are in the largest equivalence class. The 6 initializations are split as follows [2, 2, 2]. The 8 writes are split as follows [0, 3, 5]. [2023-11-29 04:37:38,847 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:37:38" (1/1) ... [2023-11-29 04:37:38,847 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:37:38" (1/1) ... [2023-11-29 04:37:38,854 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:37:38" (1/1) ... [2023-11-29 04:37:38,858 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:37:38" (1/1) ... [2023-11-29 04:37:38,860 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:37:38" (1/1) ... [2023-11-29 04:37:38,861 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:37:38" (1/1) ... [2023-11-29 04:37:38,863 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 04:37:38,864 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 04:37:38,864 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 04:37:38,864 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 04:37:38,865 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:37:38" (1/1) ... [2023-11-29 04:37:38,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 04:37:38,879 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:37:38,894 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 04:37:38,897 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2023-11-29 04:37:38,929 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-29 04:37:38,929 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-29 04:37:38,929 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-11-29 04:37:38,929 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-11-29 04:37:38,929 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-11-29 04:37:38,929 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2023-11-29 04:37:38,930 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 04:37:38,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 04:37:38,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-29 04:37:38,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-29 04:37:38,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-29 04:37:38,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-29 04:37:38,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-11-29 04:37:38,931 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-29 04:37:38,931 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-29 04:37:38,931 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-29 04:37:38,931 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 04:37:38,931 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 04:37:38,931 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-29 04:37:38,931 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-29 04:37:38,931 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-11-29 04:37:39,031 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 04:37:39,033 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 04:37:39,253 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 04:37:39,263 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 04:37:39,264 INFO L309 CfgBuilder]: Removed 5 assume(true) statements. [2023-11-29 04:37:39,265 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:37:39 BoogieIcfgContainer [2023-11-29 04:37:39,266 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 04:37:39,267 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-11-29 04:37:39,267 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-11-29 04:37:39,270 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-11-29 04:37:39,271 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-29 04:37:39,271 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.11 04:37:38" (1/3) ... [2023-11-29 04:37:39,272 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7349d80a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.11 04:37:39, skipping insertion in model container [2023-11-29 04:37:39,272 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-29 04:37:39,272 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:37:38" (2/3) ... [2023-11-29 04:37:39,273 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7349d80a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.11 04:37:39, skipping insertion in model container [2023-11-29 04:37:39,273 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-29 04:37:39,273 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:37:39" (3/3) ... [2023-11-29 04:37:39,274 INFO L332 chiAutomizerObserver]: Analyzing ICFG ex3_forlist.i [2023-11-29 04:37:39,320 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2023-11-29 04:37:39,320 INFO L304 stractBuchiCegarLoop]: Hoare is false [2023-11-29 04:37:39,320 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-11-29 04:37:39,320 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-11-29 04:37:39,320 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-11-29 04:37:39,320 INFO L308 stractBuchiCegarLoop]: Difference is false [2023-11-29 04:37:39,320 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-11-29 04:37:39,321 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2023-11-29 04:37:39,324 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 37 states, 36 states have (on average 1.4722222222222223) internal successors, (53), 36 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:37:39,339 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 24 [2023-11-29 04:37:39,339 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 04:37:39,340 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 04:37:39,345 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-29 04:37:39,345 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-29 04:37:39,345 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-11-29 04:37:39,345 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 37 states, 36 states have (on average 1.4722222222222223) internal successors, (53), 36 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:37:39,348 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 24 [2023-11-29 04:37:39,349 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 04:37:39,349 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 04:37:39,349 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-29 04:37:39,349 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-29 04:37:39,356 INFO L748 eck$LassoCheckResult]: Stem: 33#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(8, 4);~#pp~0.base, ~#pp~0.offset := 4, 0;call write~init~$Pointer$#1(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$#1(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);call #Ultimate.allocInit(8, 5);~#pstate~0.base, ~#pstate~0.offset := 5, 0;call write~init~int#2(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int#2(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1; 6#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset;havoc main_~a~0#1.base, main_~a~0#1.offset;havoc main_~b~0#1.base, main_~b~0#1.offset;assume { :begin_inline_init } true;havoc init_#t~post4#1, init_~i~0#1;havoc init_~i~0#1;init_~i~0#1 := 0; 37#L19-3true [2023-11-29 04:37:39,357 INFO L750 eck$LassoCheckResult]: Loop: 37#L19-3true assume !!(init_~i~0#1 < 2);call write~$Pointer$#1(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int#2(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4); 2#L19-2true init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1; 37#L19-3true [2023-11-29 04:37:39,361 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:37:39,361 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2023-11-29 04:37:39,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:37:39,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494309090] [2023-11-29 04:37:39,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:37:39,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:37:39,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 04:37:39,446 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 04:37:39,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 04:37:39,475 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 04:37:39,478 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:37:39,478 INFO L85 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2023-11-29 04:37:39,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:37:39,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315663551] [2023-11-29 04:37:39,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:37:39,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:37:39,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 04:37:39,508 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 04:37:39,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 04:37:39,524 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 04:37:39,526 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:37:39,526 INFO L85 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2023-11-29 04:37:39,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:37:39,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275871331] [2023-11-29 04:37:39,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:37:39,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:37:39,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 04:37:39,563 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 04:37:39,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 04:37:39,607 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 04:37:40,267 INFO L210 LassoAnalysis]: Preferences: [2023-11-29 04:37:40,267 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-29 04:37:40,268 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-29 04:37:40,268 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-29 04:37:40,268 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-11-29 04:37:40,268 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 04:37:40,268 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-29 04:37:40,268 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-29 04:37:40,268 INFO L133 ssoRankerPreferences]: Filename of dumped script: ex3_forlist.i_Iteration1_Lasso [2023-11-29 04:37:40,269 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-29 04:37:40,269 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-29 04:37:40,290 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 04:37:40,301 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 04:37:40,647 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 04:37:40,659 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 04:37:40,662 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 04:37:40,673 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 04:37:40,676 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 04:37:40,680 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 04:37:40,684 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 04:37:40,687 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 04:37:40,690 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 04:37:40,693 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 04:37:40,696 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 04:37:40,699 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 04:37:41,125 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-29 04:37:41,129 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-11-29 04:37:41,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 04:37:41,131 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:37:41,132 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 04:37:41,135 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2023-11-29 04:37:41,136 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 04:37:41,149 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 04:37:41,149 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 04:37:41,149 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 04:37:41,150 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 04:37:41,150 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 04:37:41,151 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 04:37:41,151 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 04:37:41,157 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 04:37:41,165 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2023-11-29 04:37:41,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 04:37:41,166 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:37:41,167 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 04:37:41,168 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2023-11-29 04:37:41,169 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 04:37:41,180 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 04:37:41,180 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 04:37:41,180 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 04:37:41,180 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 04:37:41,184 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 04:37:41,184 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 04:37:41,192 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 04:37:41,196 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2023-11-29 04:37:41,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 04:37:41,197 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:37:41,198 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 04:37:41,201 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2023-11-29 04:37:41,201 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 04:37:41,214 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 04:37:41,214 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 04:37:41,214 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 04:37:41,214 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 04:37:41,217 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 04:37:41,217 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 04:37:41,221 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 04:37:41,225 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2023-11-29 04:37:41,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 04:37:41,226 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:37:41,227 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 04:37:41,229 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2023-11-29 04:37:41,230 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 04:37:41,244 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 04:37:41,244 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 04:37:41,244 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 04:37:41,244 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 04:37:41,249 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 04:37:41,249 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 04:37:41,254 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 04:37:41,258 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2023-11-29 04:37:41,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 04:37:41,258 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:37:41,260 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 04:37:41,262 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2023-11-29 04:37:41,263 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 04:37:41,275 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 04:37:41,275 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 04:37:41,275 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 04:37:41,275 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 04:37:41,275 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 04:37:41,276 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 04:37:41,276 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 04:37:41,277 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 04:37:41,281 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2023-11-29 04:37:41,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 04:37:41,281 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:37:41,282 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 04:37:41,285 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2023-11-29 04:37:41,286 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 04:37:41,296 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 04:37:41,296 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 04:37:41,296 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 04:37:41,297 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 04:37:41,299 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 04:37:41,299 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 04:37:41,309 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 04:37:41,312 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2023-11-29 04:37:41,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 04:37:41,313 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:37:41,314 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 04:37:41,316 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2023-11-29 04:37:41,317 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 04:37:41,330 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 04:37:41,330 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 04:37:41,330 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 04:37:41,330 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 04:37:41,333 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 04:37:41,334 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 04:37:41,338 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 04:37:41,347 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2023-11-29 04:37:41,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 04:37:41,347 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:37:41,348 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 04:37:41,350 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2023-11-29 04:37:41,351 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 04:37:41,361 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 04:37:41,361 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 04:37:41,361 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 04:37:41,361 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 04:37:41,364 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 04:37:41,364 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 04:37:41,369 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 04:37:41,373 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2023-11-29 04:37:41,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 04:37:41,374 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:37:41,375 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 04:37:41,377 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2023-11-29 04:37:41,378 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 04:37:41,390 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 04:37:41,391 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 04:37:41,391 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 04:37:41,391 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 04:37:41,400 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 04:37:41,404 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 04:37:41,423 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-11-29 04:37:41,507 INFO L443 ModelExtractionUtils]: Simplification made 28 calls to the SMT solver. [2023-11-29 04:37:41,507 INFO L444 ModelExtractionUtils]: 3 out of 25 variables were initially zero. Simplification set additionally 19 variables to zero. [2023-11-29 04:37:41,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 04:37:41,509 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:37:41,529 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 04:37:41,532 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2023-11-29 04:37:41,533 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-11-29 04:37:41,546 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-11-29 04:37:41,546 INFO L513 LassoAnalysis]: Proved termination. [2023-11-29 04:37:41,547 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ~#pp~0.base)_1, ULTIMATE.start_init_~i~0#1) = 3*v_rep(select #length ~#pp~0.base)_1 - 8*ULTIMATE.start_init_~i~0#1 Supporting invariants [] [2023-11-29 04:37:41,551 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2023-11-29 04:37:41,606 INFO L156 tatePredicateManager]: 14 out of 14 supporting invariants were superfluous and have been removed [2023-11-29 04:37:41,615 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #length[~#pp~0!base] could not be translated [2023-11-29 04:37:41,631 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:37:41,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:37:41,660 INFO L262 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 04:37:41,661 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:37:41,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:37:41,683 INFO L262 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 04:37:41,683 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:37:41,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:37:41,754 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2023-11-29 04:37:41,756 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 37 states, 36 states have (on average 1.4722222222222223) internal successors, (53), 36 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) Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:37:41,811 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 37 states, 36 states have (on average 1.4722222222222223) internal successors, (53), 36 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). Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 73 states and 107 transitions. Complement of second has 8 states. [2023-11-29 04:37:41,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2023-11-29 04:37:41,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:37:41,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2023-11-29 04:37:41,820 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 53 transitions. Stem has 2 letters. Loop has 2 letters. [2023-11-29 04:37:41,821 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 04:37:41,821 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 53 transitions. Stem has 4 letters. Loop has 2 letters. [2023-11-29 04:37:41,821 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 04:37:41,821 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 53 transitions. Stem has 2 letters. Loop has 4 letters. [2023-11-29 04:37:41,821 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 04:37:41,822 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 73 states and 107 transitions. [2023-11-29 04:37:41,826 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 22 [2023-11-29 04:37:41,830 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 73 states to 34 states and 48 transitions. [2023-11-29 04:37:41,831 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2023-11-29 04:37:41,832 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2023-11-29 04:37:41,832 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 48 transitions. [2023-11-29 04:37:41,833 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:37:41,833 INFO L218 hiAutomatonCegarLoop]: Abstraction has 34 states and 48 transitions. [2023-11-29 04:37:41,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 48 transitions. [2023-11-29 04:37:41,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2023-11-29 04:37:41,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.411764705882353) internal successors, (48), 33 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:37:41,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 48 transitions. [2023-11-29 04:37:41,859 INFO L240 hiAutomatonCegarLoop]: Abstraction has 34 states and 48 transitions. [2023-11-29 04:37:41,859 INFO L428 stractBuchiCegarLoop]: Abstraction has 34 states and 48 transitions. [2023-11-29 04:37:41,859 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-11-29 04:37:41,860 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 48 transitions. [2023-11-29 04:37:41,861 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 22 [2023-11-29 04:37:41,861 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 04:37:41,861 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 04:37:41,861 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:37:41,861 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2023-11-29 04:37:41,862 INFO L748 eck$LassoCheckResult]: Stem: 238#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(8, 4);~#pp~0.base, ~#pp~0.offset := 4, 0;call write~init~$Pointer$#1(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$#1(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);call #Ultimate.allocInit(8, 5);~#pstate~0.base, ~#pstate~0.offset := 5, 0;call write~init~int#2(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int#2(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1; 214#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset;havoc main_~a~0#1.base, main_~a~0#1.offset;havoc main_~b~0#1.base, main_~b~0#1.offset;assume { :begin_inline_init } true;havoc init_#t~post4#1, init_~i~0#1;havoc init_~i~0#1;init_~i~0#1 := 0; 215#L19-3 assume !(init_~i~0#1 < 2); 234#L17 havoc init_#t~post4#1, init_~i~0#1;assume { :end_inline_init } true;assume { :begin_inline_fake_malloc } true;fake_malloc_#in~size#1 := 4;havoc fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;fake_malloc_~size#1 := fake_malloc_#in~size#1;fake_malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + fake_malloc_#t~post10#1;fake_malloc_#res#1.base, fake_malloc_#res#1.offset := 0, fake_malloc_#t~post10#1;havoc fake_malloc_#t~post10#1; 229#fake_malloc_returnLabel#1 main_#t~ret11#1.base, main_#t~ret11#1.offset := fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;havoc fake_malloc_#in~size#1;assume { :end_inline_fake_malloc } true;main_~a~0#1.base, main_~a~0#1.offset := main_#t~ret11#1.base, main_#t~ret11#1.offset;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset;assume { :begin_inline_fake_malloc } true;fake_malloc_#in~size#1 := 4;havoc fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;fake_malloc_~size#1 := fake_malloc_#in~size#1;fake_malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + fake_malloc_#t~post10#1;fake_malloc_#res#1.base, fake_malloc_#res#1.offset := 0, fake_malloc_#t~post10#1;havoc fake_malloc_#t~post10#1; 230#fake_malloc_returnLabel#2 main_#t~ret12#1.base, main_#t~ret12#1.offset := fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;havoc fake_malloc_#in~size#1;assume { :end_inline_fake_malloc } true;main_~b~0#1.base, main_~b~0#1.offset := main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset; 207#L59 assume !((main_~a~0#1.base == 0 && main_~a~0#1.offset == 0) || (main_~b~0#1.base == 0 && main_~b~0#1.offset == 0));assume { :begin_inline_f } true;f_#in~pointer#1.base, f_#in~pointer#1.offset := main_~a~0#1.base, main_~a~0#1.offset;havoc f_#t~mem6#1.base, f_#t~mem6#1.offset, f_#t~post5#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;f_~pointer#1.base, f_~pointer#1.offset := f_#in~pointer#1.base, f_#in~pointer#1.offset;havoc f_~i~1#1;f_~i~1#1 := 0; 208#L27-3 [2023-11-29 04:37:41,862 INFO L750 eck$LassoCheckResult]: Loop: 208#L27-3 assume !!(f_~i~1#1 < 2);call f_#t~mem6#1.base, f_#t~mem6#1.offset := read~$Pointer$#1(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4); 237#L28 assume !(f_#t~mem6#1.base == 0 && f_#t~mem6#1.offset == 0);havoc f_#t~mem6#1.base, f_#t~mem6#1.offset; 216#L27-2 f_#t~post5#1 := f_~i~1#1;f_~i~1#1 := 1 + f_#t~post5#1;havoc f_#t~post5#1; 208#L27-3 [2023-11-29 04:37:41,862 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:37:41,863 INFO L85 PathProgramCache]: Analyzing trace with hash 1807951404, now seen corresponding path program 1 times [2023-11-29 04:37:41,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:37:41,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013870557] [2023-11-29 04:37:41,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:37:41,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:37:41,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:37:41,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:37:41,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:37:41,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013870557] [2023-11-29 04:37:41,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013870557] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:37:41,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:37:41,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 04:37:41,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859818062] [2023-11-29 04:37:41,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:37:41,934 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-29 04:37:41,934 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:37:41,934 INFO L85 PathProgramCache]: Analyzing trace with hash 62722, now seen corresponding path program 1 times [2023-11-29 04:37:41,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:37:41,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268626019] [2023-11-29 04:37:41,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:37:41,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:37:41,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 04:37:41,941 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 04:37:41,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 04:37:41,947 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 04:37:42,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:37:42,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:37:42,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:37:42,011 INFO L87 Difference]: Start difference. First operand 34 states and 48 transitions. cyclomatic complexity: 19 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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-29 04:37:42,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:37:42,029 INFO L93 Difference]: Finished difference Result 31 states and 39 transitions. [2023-11-29 04:37:42,029 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 39 transitions. [2023-11-29 04:37:42,030 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2023-11-29 04:37:42,031 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 29 states and 37 transitions. [2023-11-29 04:37:42,031 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2023-11-29 04:37:42,031 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2023-11-29 04:37:42,031 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 37 transitions. [2023-11-29 04:37:42,032 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:37:42,032 INFO L218 hiAutomatonCegarLoop]: Abstraction has 29 states and 37 transitions. [2023-11-29 04:37:42,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 37 transitions. [2023-11-29 04:37:42,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2023-11-29 04:37:42,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 27 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:37:42,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2023-11-29 04:37:42,035 INFO L240 hiAutomatonCegarLoop]: Abstraction has 28 states and 36 transitions. [2023-11-29 04:37:42,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:37:42,036 INFO L428 stractBuchiCegarLoop]: Abstraction has 28 states and 36 transitions. [2023-11-29 04:37:42,036 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-11-29 04:37:42,036 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 36 transitions. [2023-11-29 04:37:42,037 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2023-11-29 04:37:42,037 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 04:37:42,037 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 04:37:42,038 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:37:42,038 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2023-11-29 04:37:42,038 INFO L748 eck$LassoCheckResult]: Stem: 303#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(8, 4);~#pp~0.base, ~#pp~0.offset := 4, 0;call write~init~$Pointer$#1(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$#1(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);call #Ultimate.allocInit(8, 5);~#pstate~0.base, ~#pstate~0.offset := 5, 0;call write~init~int#2(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int#2(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1; 285#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset;havoc main_~a~0#1.base, main_~a~0#1.offset;havoc main_~b~0#1.base, main_~b~0#1.offset;assume { :begin_inline_init } true;havoc init_#t~post4#1, init_~i~0#1;havoc init_~i~0#1;init_~i~0#1 := 0; 286#L19-3 assume !!(init_~i~0#1 < 2);call write~$Pointer$#1(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int#2(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4); 276#L19-2 init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1; 277#L19-3 assume !(init_~i~0#1 < 2); 300#L17 havoc init_#t~post4#1, init_~i~0#1;assume { :end_inline_init } true;assume { :begin_inline_fake_malloc } true;fake_malloc_#in~size#1 := 4;havoc fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;fake_malloc_~size#1 := fake_malloc_#in~size#1;fake_malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + fake_malloc_#t~post10#1;fake_malloc_#res#1.base, fake_malloc_#res#1.offset := 0, fake_malloc_#t~post10#1;havoc fake_malloc_#t~post10#1; 296#fake_malloc_returnLabel#1 main_#t~ret11#1.base, main_#t~ret11#1.offset := fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;havoc fake_malloc_#in~size#1;assume { :end_inline_fake_malloc } true;main_~a~0#1.base, main_~a~0#1.offset := main_#t~ret11#1.base, main_#t~ret11#1.offset;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset;assume { :begin_inline_fake_malloc } true;fake_malloc_#in~size#1 := 4;havoc fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;fake_malloc_~size#1 := fake_malloc_#in~size#1;fake_malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + fake_malloc_#t~post10#1;fake_malloc_#res#1.base, fake_malloc_#res#1.offset := 0, fake_malloc_#t~post10#1;havoc fake_malloc_#t~post10#1; 297#fake_malloc_returnLabel#2 main_#t~ret12#1.base, main_#t~ret12#1.offset := fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;havoc fake_malloc_#in~size#1;assume { :end_inline_fake_malloc } true;main_~b~0#1.base, main_~b~0#1.offset := main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset; 281#L59 assume !((main_~a~0#1.base == 0 && main_~a~0#1.offset == 0) || (main_~b~0#1.base == 0 && main_~b~0#1.offset == 0));assume { :begin_inline_f } true;f_#in~pointer#1.base, f_#in~pointer#1.offset := main_~a~0#1.base, main_~a~0#1.offset;havoc f_#t~mem6#1.base, f_#t~mem6#1.offset, f_#t~post5#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;f_~pointer#1.base, f_~pointer#1.offset := f_#in~pointer#1.base, f_#in~pointer#1.offset;havoc f_~i~1#1;f_~i~1#1 := 0; 282#L27-3 [2023-11-29 04:37:42,038 INFO L750 eck$LassoCheckResult]: Loop: 282#L27-3 assume !!(f_~i~1#1 < 2);call f_#t~mem6#1.base, f_#t~mem6#1.offset := read~$Pointer$#1(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4); 302#L28 assume !(f_#t~mem6#1.base == 0 && f_#t~mem6#1.offset == 0);havoc f_#t~mem6#1.base, f_#t~mem6#1.offset; 287#L27-2 f_#t~post5#1 := f_~i~1#1;f_~i~1#1 := 1 + f_#t~post5#1;havoc f_#t~post5#1; 282#L27-3 [2023-11-29 04:37:42,039 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:37:42,039 INFO L85 PathProgramCache]: Analyzing trace with hash -369325334, now seen corresponding path program 1 times [2023-11-29 04:37:42,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:37:42,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854264475] [2023-11-29 04:37:42,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:37:42,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:37:42,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:37:42,107 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:37:42,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:37:42,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854264475] [2023-11-29 04:37:42,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854264475] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:37:42,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1630211073] [2023-11-29 04:37:42,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:37:42,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:37:42,108 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:37:42,109 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 04:37:42,113 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-11-29 04:37:42,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:37:42,194 INFO L262 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 04:37:42,196 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:37:42,208 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:37:42,208 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:37:42,223 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:37:42,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1630211073] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 04:37:42,224 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 04:37:42,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-11-29 04:37:42,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644557099] [2023-11-29 04:37:42,224 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 04:37:42,225 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-29 04:37:42,225 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:37:42,225 INFO L85 PathProgramCache]: Analyzing trace with hash 62722, now seen corresponding path program 2 times [2023-11-29 04:37:42,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:37:42,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325837326] [2023-11-29 04:37:42,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:37:42,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:37:42,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 04:37:42,230 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 04:37:42,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 04:37:42,236 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 04:37:42,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:37:42,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 04:37:42,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-29 04:37:42,294 INFO L87 Difference]: Start difference. First operand 28 states and 36 transitions. cyclomatic complexity: 13 Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:37:42,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:37:42,315 INFO L93 Difference]: Finished difference Result 30 states and 38 transitions. [2023-11-29 04:37:42,315 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 38 transitions. [2023-11-29 04:37:42,316 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2023-11-29 04:37:42,317 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 30 states and 38 transitions. [2023-11-29 04:37:42,317 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2023-11-29 04:37:42,317 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2023-11-29 04:37:42,317 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 38 transitions. [2023-11-29 04:37:42,317 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:37:42,318 INFO L218 hiAutomatonCegarLoop]: Abstraction has 30 states and 38 transitions. [2023-11-29 04:37:42,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 38 transitions. [2023-11-29 04:37:42,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2023-11-29 04:37:42,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 29 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:37:42,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2023-11-29 04:37:42,321 INFO L240 hiAutomatonCegarLoop]: Abstraction has 30 states and 38 transitions. [2023-11-29 04:37:42,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 04:37:42,322 INFO L428 stractBuchiCegarLoop]: Abstraction has 30 states and 38 transitions. [2023-11-29 04:37:42,322 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-11-29 04:37:42,322 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 38 transitions. [2023-11-29 04:37:42,323 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2023-11-29 04:37:42,323 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 04:37:42,323 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 04:37:42,324 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:37:42,324 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2023-11-29 04:37:42,324 INFO L748 eck$LassoCheckResult]: Stem: 417#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(8, 4);~#pp~0.base, ~#pp~0.offset := 4, 0;call write~init~$Pointer$#1(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$#1(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);call #Ultimate.allocInit(8, 5);~#pstate~0.base, ~#pstate~0.offset := 5, 0;call write~init~int#2(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int#2(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1; 399#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset;havoc main_~a~0#1.base, main_~a~0#1.offset;havoc main_~b~0#1.base, main_~b~0#1.offset;assume { :begin_inline_init } true;havoc init_#t~post4#1, init_~i~0#1;havoc init_~i~0#1;init_~i~0#1 := 0; 400#L19-3 assume !!(init_~i~0#1 < 2);call write~$Pointer$#1(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int#2(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4); 390#L19-2 init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1; 391#L19-3 assume !!(init_~i~0#1 < 2);call write~$Pointer$#1(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int#2(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4); 418#L19-2 init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1; 419#L19-3 assume !(init_~i~0#1 < 2); 414#L17 havoc init_#t~post4#1, init_~i~0#1;assume { :end_inline_init } true;assume { :begin_inline_fake_malloc } true;fake_malloc_#in~size#1 := 4;havoc fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;fake_malloc_~size#1 := fake_malloc_#in~size#1;fake_malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + fake_malloc_#t~post10#1;fake_malloc_#res#1.base, fake_malloc_#res#1.offset := 0, fake_malloc_#t~post10#1;havoc fake_malloc_#t~post10#1; 410#fake_malloc_returnLabel#1 main_#t~ret11#1.base, main_#t~ret11#1.offset := fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;havoc fake_malloc_#in~size#1;assume { :end_inline_fake_malloc } true;main_~a~0#1.base, main_~a~0#1.offset := main_#t~ret11#1.base, main_#t~ret11#1.offset;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset;assume { :begin_inline_fake_malloc } true;fake_malloc_#in~size#1 := 4;havoc fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;fake_malloc_~size#1 := fake_malloc_#in~size#1;fake_malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + fake_malloc_#t~post10#1;fake_malloc_#res#1.base, fake_malloc_#res#1.offset := 0, fake_malloc_#t~post10#1;havoc fake_malloc_#t~post10#1; 411#fake_malloc_returnLabel#2 main_#t~ret12#1.base, main_#t~ret12#1.offset := fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;havoc fake_malloc_#in~size#1;assume { :end_inline_fake_malloc } true;main_~b~0#1.base, main_~b~0#1.offset := main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset; 392#L59 assume !((main_~a~0#1.base == 0 && main_~a~0#1.offset == 0) || (main_~b~0#1.base == 0 && main_~b~0#1.offset == 0));assume { :begin_inline_f } true;f_#in~pointer#1.base, f_#in~pointer#1.offset := main_~a~0#1.base, main_~a~0#1.offset;havoc f_#t~mem6#1.base, f_#t~mem6#1.offset, f_#t~post5#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;f_~pointer#1.base, f_~pointer#1.offset := f_#in~pointer#1.base, f_#in~pointer#1.offset;havoc f_~i~1#1;f_~i~1#1 := 0; 393#L27-3 [2023-11-29 04:37:42,324 INFO L750 eck$LassoCheckResult]: Loop: 393#L27-3 assume !!(f_~i~1#1 < 2);call f_#t~mem6#1.base, f_#t~mem6#1.offset := read~$Pointer$#1(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4); 416#L28 assume !(f_#t~mem6#1.base == 0 && f_#t~mem6#1.offset == 0);havoc f_#t~mem6#1.base, f_#t~mem6#1.offset; 401#L27-2 f_#t~post5#1 := f_~i~1#1;f_~i~1#1 := 1 + f_#t~post5#1;havoc f_#t~post5#1; 393#L27-3 [2023-11-29 04:37:42,324 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:37:42,324 INFO L85 PathProgramCache]: Analyzing trace with hash -1083197400, now seen corresponding path program 2 times [2023-11-29 04:37:42,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:37:42,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712494183] [2023-11-29 04:37:42,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:37:42,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:37:42,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 04:37:42,354 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 04:37:42,380 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2023-11-29 04:37:42,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 04:37:42,394 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 04:37:42,395 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:37:42,395 INFO L85 PathProgramCache]: Analyzing trace with hash 62722, now seen corresponding path program 3 times [2023-11-29 04:37:42,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:37:42,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615610858] [2023-11-29 04:37:42,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:37:42,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:37:42,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 04:37:42,400 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 04:37:42,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 04:37:42,405 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 04:37:42,406 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:37:42,406 INFO L85 PathProgramCache]: Analyzing trace with hash -1444415621, now seen corresponding path program 1 times [2023-11-29 04:37:42,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:37:42,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023606419] [2023-11-29 04:37:42,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:37:42,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:37:42,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:37:42,874 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:37:42,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:37:42,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023606419] [2023-11-29 04:37:42,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023606419] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:37:42,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1703510075] [2023-11-29 04:37:42,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:37:42,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:37:42,876 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:37:42,877 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 04:37:42,880 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-11-29 04:37:42,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:37:42,970 INFO L262 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 22 conjunts are in the unsatisfiable core [2023-11-29 04:37:42,972 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:37:43,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 04:37:43,014 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 04:37:43,063 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:37:43,064 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-29 04:37:43,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:37:43,070 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-29 04:37:43,319 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:37:43,319 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:37:43,536 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 21 treesize of output 19 [2023-11-29 04:37:43,541 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 23 treesize of output 21 [2023-11-29 04:37:43,548 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 17 treesize of output 15 [2023-11-29 04:37:43,562 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:37:43,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1703510075] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 04:37:43,563 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 04:37:43,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2023-11-29 04:37:43,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573197817] [2023-11-29 04:37:43,563 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 04:37:43,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:37:43,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-11-29 04:37:43,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2023-11-29 04:37:43,624 INFO L87 Difference]: Start difference. First operand 30 states and 38 transitions. cyclomatic complexity: 13 Second operand has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:37:43,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:37:43,851 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2023-11-29 04:37:43,851 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 35 transitions. [2023-11-29 04:37:43,852 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2023-11-29 04:37:43,853 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 29 states and 35 transitions. [2023-11-29 04:37:43,853 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2023-11-29 04:37:43,853 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2023-11-29 04:37:43,853 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 35 transitions. [2023-11-29 04:37:43,853 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:37:43,853 INFO L218 hiAutomatonCegarLoop]: Abstraction has 29 states and 35 transitions. [2023-11-29 04:37:43,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 35 transitions. [2023-11-29 04:37:43,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2023-11-29 04:37:43,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 1.206896551724138) internal successors, (35), 28 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:37:43,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2023-11-29 04:37:43,856 INFO L240 hiAutomatonCegarLoop]: Abstraction has 29 states and 35 transitions. [2023-11-29 04:37:43,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 04:37:43,857 INFO L428 stractBuchiCegarLoop]: Abstraction has 29 states and 35 transitions. [2023-11-29 04:37:43,857 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2023-11-29 04:37:43,858 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 35 transitions. [2023-11-29 04:37:43,858 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2023-11-29 04:37:43,858 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 04:37:43,858 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 04:37:43,859 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:37:43,859 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2023-11-29 04:37:43,859 INFO L748 eck$LassoCheckResult]: Stem: 582#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(8, 4);~#pp~0.base, ~#pp~0.offset := 4, 0;call write~init~$Pointer$#1(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$#1(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);call #Ultimate.allocInit(8, 5);~#pstate~0.base, ~#pstate~0.offset := 5, 0;call write~init~int#2(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int#2(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1; 563#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset;havoc main_~a~0#1.base, main_~a~0#1.offset;havoc main_~b~0#1.base, main_~b~0#1.offset;assume { :begin_inline_init } true;havoc init_#t~post4#1, init_~i~0#1;havoc init_~i~0#1;init_~i~0#1 := 0; 564#L19-3 assume !!(init_~i~0#1 < 2);call write~$Pointer$#1(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int#2(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4); 556#L19-2 init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1; 557#L19-3 assume !!(init_~i~0#1 < 2);call write~$Pointer$#1(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int#2(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4); 583#L19-2 init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1; 584#L19-3 assume !(init_~i~0#1 < 2); 579#L17 havoc init_#t~post4#1, init_~i~0#1;assume { :end_inline_init } true;assume { :begin_inline_fake_malloc } true;fake_malloc_#in~size#1 := 4;havoc fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;fake_malloc_~size#1 := fake_malloc_#in~size#1;fake_malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + fake_malloc_#t~post10#1;fake_malloc_#res#1.base, fake_malloc_#res#1.offset := 0, fake_malloc_#t~post10#1;havoc fake_malloc_#t~post10#1; 575#fake_malloc_returnLabel#1 main_#t~ret11#1.base, main_#t~ret11#1.offset := fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;havoc fake_malloc_#in~size#1;assume { :end_inline_fake_malloc } true;main_~a~0#1.base, main_~a~0#1.offset := main_#t~ret11#1.base, main_#t~ret11#1.offset;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset;assume { :begin_inline_fake_malloc } true;fake_malloc_#in~size#1 := 4;havoc fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;fake_malloc_~size#1 := fake_malloc_#in~size#1;fake_malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + fake_malloc_#t~post10#1;fake_malloc_#res#1.base, fake_malloc_#res#1.offset := 0, fake_malloc_#t~post10#1;havoc fake_malloc_#t~post10#1; 576#fake_malloc_returnLabel#2 main_#t~ret12#1.base, main_#t~ret12#1.offset := fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;havoc fake_malloc_#in~size#1;assume { :end_inline_fake_malloc } true;main_~b~0#1.base, main_~b~0#1.offset := main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset; 558#L59 assume !((main_~a~0#1.base == 0 && main_~a~0#1.offset == 0) || (main_~b~0#1.base == 0 && main_~b~0#1.offset == 0));assume { :begin_inline_f } true;f_#in~pointer#1.base, f_#in~pointer#1.offset := main_~a~0#1.base, main_~a~0#1.offset;havoc f_#t~mem6#1.base, f_#t~mem6#1.offset, f_#t~post5#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;f_~pointer#1.base, f_~pointer#1.offset := f_#in~pointer#1.base, f_#in~pointer#1.offset;havoc f_~i~1#1;f_~i~1#1 := 0; 559#L27-3 assume !!(f_~i~1#1 < 2);call f_#t~mem6#1.base, f_#t~mem6#1.offset := read~$Pointer$#1(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4); 581#L28 assume f_#t~mem6#1.base == 0 && f_#t~mem6#1.offset == 0;havoc f_#t~mem6#1.base, f_#t~mem6#1.offset;call write~$Pointer$#1(f_~pointer#1.base, f_~pointer#1.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4);call write~int#2(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1#1, 4); 577#L25 havoc f_#t~mem6#1.base, f_#t~mem6#1.offset, f_#t~post5#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;havoc f_#in~pointer#1.base, f_#in~pointer#1.offset;assume { :end_inline_f } true;assume { :begin_inline_f } true;f_#in~pointer#1.base, f_#in~pointer#1.offset := main_~b~0#1.base, main_~b~0#1.offset;havoc f_#t~mem6#1.base, f_#t~mem6#1.offset, f_#t~post5#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;f_~pointer#1.base, f_~pointer#1.offset := f_#in~pointer#1.base, f_#in~pointer#1.offset;havoc f_~i~1#1;f_~i~1#1 := 0; 574#L27-7 [2023-11-29 04:37:43,860 INFO L750 eck$LassoCheckResult]: Loop: 574#L27-7 assume !!(f_~i~1#1 < 2);call f_#t~mem6#1.base, f_#t~mem6#1.offset := read~$Pointer$#1(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4); 567#L28-1 assume !(f_#t~mem6#1.base == 0 && f_#t~mem6#1.offset == 0);havoc f_#t~mem6#1.base, f_#t~mem6#1.offset; 569#L27-6 f_#t~post5#1 := f_~i~1#1;f_~i~1#1 := 1 + f_#t~post5#1;havoc f_#t~post5#1; 574#L27-7 [2023-11-29 04:37:43,860 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:37:43,860 INFO L85 PathProgramCache]: Analyzing trace with hash -1444415679, now seen corresponding path program 1 times [2023-11-29 04:37:43,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:37:43,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441307337] [2023-11-29 04:37:43,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:37:43,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:37:43,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 04:37:43,887 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 04:37:43,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 04:37:43,911 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 04:37:43,911 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:37:43,911 INFO L85 PathProgramCache]: Analyzing trace with hash 81589, now seen corresponding path program 1 times [2023-11-29 04:37:43,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:37:43,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135095665] [2023-11-29 04:37:43,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:37:43,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:37:43,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 04:37:43,916 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 04:37:43,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 04:37:43,920 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 04:37:43,920 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:37:43,920 INFO L85 PathProgramCache]: Analyzing trace with hash 689897333, now seen corresponding path program 1 times [2023-11-29 04:37:43,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:37:43,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622284869] [2023-11-29 04:37:43,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:37:43,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:37:43,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 04:37:43,950 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 04:37:43,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 04:37:43,974 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 04:38:06,550 WARN L293 SmtUtils]: Spent 22.52s on a formula simplification. DAG size of input: 290 DAG size of output: 250 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2023-11-29 04:38:07,454 INFO L210 LassoAnalysis]: Preferences: [2023-11-29 04:38:07,454 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-29 04:38:07,454 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-29 04:38:07,454 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-29 04:38:07,455 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-11-29 04:38:07,455 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 04:38:07,455 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-29 04:38:07,455 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-29 04:38:07,455 INFO L133 ssoRankerPreferences]: Filename of dumped script: ex3_forlist.i_Iteration5_Lasso [2023-11-29 04:38:07,455 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-29 04:38:07,455 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-29 04:38:07,459 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 04:38:07,468 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 04:38:07,470 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 04:38:07,472 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 04:38:07,475 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 04:38:07,477 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 04:38:07,479 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 04:38:07,491 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 04:38:07,494 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 04:38:07,503 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 04:38:07,506 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 04:38:07,508 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 04:38:07,510 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 04:38:07,512 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 04:38:07,515 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 04:38:07,517 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 04:38:07,519 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 04:38:07,521 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 04:38:07,524 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 04:38:07,534 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 04:38:07,536 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 04:38:07,537 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 04:38:07,539 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 04:38:07,541 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 04:38:07,543 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 04:38:07,546 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 04:38:07,548 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 04:38:07,846 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 04:38:07,860 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 04:38:07,863 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 04:38:07,864 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 04:38:07,866 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 04:38:07,867 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 04:38:08,184 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-29 04:38:08,185 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-11-29 04:38:08,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 04:38:08,185 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:38:08,186 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 04:38:08,188 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2023-11-29 04:38:08,188 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 04:38:08,199 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 04:38:08,199 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 04:38:08,199 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 04:38:08,199 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 04:38:08,199 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 04:38:08,199 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 04:38:08,199 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 04:38:08,201 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 04:38:08,203 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2023-11-29 04:38:08,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 04:38:08,203 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:38:08,204 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 04:38:08,205 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2023-11-29 04:38:08,206 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 04:38:08,216 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 04:38:08,217 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 04:38:08,217 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 04:38:08,217 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 04:38:08,217 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 04:38:08,217 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 04:38:08,217 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 04:38:08,218 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 04:38:08,221 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2023-11-29 04:38:08,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 04:38:08,221 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:38:08,222 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 04:38:08,223 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2023-11-29 04:38:08,225 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 04:38:08,235 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 04:38:08,235 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 04:38:08,235 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 04:38:08,235 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 04:38:08,237 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 04:38:08,237 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 04:38:08,240 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 04:38:08,243 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2023-11-29 04:38:08,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 04:38:08,243 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:38:08,244 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 04:38:08,246 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2023-11-29 04:38:08,249 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 04:38:08,259 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 04:38:08,259 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 04:38:08,259 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 04:38:08,259 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 04:38:08,261 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 04:38:08,261 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 04:38:08,264 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 04:38:08,267 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2023-11-29 04:38:08,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 04:38:08,267 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:38:08,268 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 04:38:08,269 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2023-11-29 04:38:08,271 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 04:38:08,281 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 04:38:08,281 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 04:38:08,281 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 04:38:08,281 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 04:38:08,282 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 04:38:08,283 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 04:38:08,286 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 04:38:08,288 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2023-11-29 04:38:08,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 04:38:08,289 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:38:08,290 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 04:38:08,290 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2023-11-29 04:38:08,292 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 04:38:08,302 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 04:38:08,302 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 04:38:08,302 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 04:38:08,302 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 04:38:08,302 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 04:38:08,303 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 04:38:08,303 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 04:38:08,304 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 04:38:08,307 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2023-11-29 04:38:08,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 04:38:08,307 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:38:08,308 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 04:38:08,309 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2023-11-29 04:38:08,310 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 04:38:08,320 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 04:38:08,320 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 04:38:08,320 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 04:38:08,320 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 04:38:08,322 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 04:38:08,322 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 04:38:08,325 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 04:38:08,328 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2023-11-29 04:38:08,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 04:38:08,328 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:38:08,329 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 04:38:08,330 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2023-11-29 04:38:08,331 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 04:38:08,341 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 04:38:08,341 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 04:38:08,341 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 04:38:08,342 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 04:38:08,342 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 04:38:08,342 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 04:38:08,342 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 04:38:08,343 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 04:38:08,346 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2023-11-29 04:38:08,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 04:38:08,346 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:38:08,347 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 04:38:08,347 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2023-11-29 04:38:08,349 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 04:38:08,359 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 04:38:08,359 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 04:38:08,359 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 04:38:08,359 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 04:38:08,359 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 04:38:08,360 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 04:38:08,360 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 04:38:08,361 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 04:38:08,363 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2023-11-29 04:38:08,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 04:38:08,364 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:38:08,364 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 04:38:08,365 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2023-11-29 04:38:08,366 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 04:38:08,376 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 04:38:08,377 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 04:38:08,377 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 04:38:08,377 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 04:38:08,378 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 04:38:08,378 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 04:38:08,382 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 04:38:08,386 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2023-11-29 04:38:08,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 04:38:08,386 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:38:08,387 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 04:38:08,388 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2023-11-29 04:38:08,389 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 04:38:08,399 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 04:38:08,400 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 04:38:08,400 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 04:38:08,400 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 04:38:08,400 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 04:38:08,400 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 04:38:08,400 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 04:38:08,401 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 04:38:08,404 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2023-11-29 04:38:08,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 04:38:08,405 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:38:08,405 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 04:38:08,406 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2023-11-29 04:38:08,408 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 04:38:08,418 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 04:38:08,418 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 04:38:08,418 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 04:38:08,418 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 04:38:08,418 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 04:38:08,419 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 04:38:08,419 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 04:38:08,420 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 04:38:08,423 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2023-11-29 04:38:08,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 04:38:08,423 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:38:08,424 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 04:38:08,425 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2023-11-29 04:38:08,427 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 04:38:08,437 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 04:38:08,437 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 04:38:08,437 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 04:38:08,437 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 04:38:08,438 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 04:38:08,438 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 04:38:08,442 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 04:38:08,444 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2023-11-29 04:38:08,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 04:38:08,445 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:38:08,445 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 04:38:08,446 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2023-11-29 04:38:08,448 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 04:38:08,458 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 04:38:08,458 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 04:38:08,458 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 04:38:08,458 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 04:38:08,458 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 04:38:08,458 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 04:38:08,458 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 04:38:08,460 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 04:38:08,462 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2023-11-29 04:38:08,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 04:38:08,462 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:38:08,463 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 04:38:08,464 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2023-11-29 04:38:08,465 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 04:38:08,475 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 04:38:08,475 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 04:38:08,476 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 04:38:08,476 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 04:38:08,476 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 04:38:08,476 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 04:38:08,476 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 04:38:08,477 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 04:38:08,480 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2023-11-29 04:38:08,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 04:38:08,480 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:38:08,481 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 04:38:08,482 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2023-11-29 04:38:08,483 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 04:38:08,493 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 04:38:08,494 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 04:38:08,494 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 04:38:08,494 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 04:38:08,495 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 04:38:08,495 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 04:38:08,498 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 04:38:08,500 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2023-11-29 04:38:08,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 04:38:08,501 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:38:08,502 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 04:38:08,503 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2023-11-29 04:38:08,504 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 04:38:08,516 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 04:38:08,516 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 04:38:08,516 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 04:38:08,516 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 04:38:08,517 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 04:38:08,517 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 04:38:08,521 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 04:38:08,524 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2023-11-29 04:38:08,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 04:38:08,524 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:38:08,525 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 04:38:08,526 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2023-11-29 04:38:08,527 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 04:38:08,538 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 04:38:08,538 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 04:38:08,539 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 04:38:08,539 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 04:38:08,539 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 04:38:08,539 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 04:38:08,539 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 04:38:08,540 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 04:38:08,543 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2023-11-29 04:38:08,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 04:38:08,543 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:38:08,544 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 04:38:08,545 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2023-11-29 04:38:08,546 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 04:38:08,556 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 04:38:08,557 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 04:38:08,557 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 04:38:08,557 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 04:38:08,557 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 04:38:08,557 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 04:38:08,557 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 04:38:08,558 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 04:38:08,561 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2023-11-29 04:38:08,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 04:38:08,561 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:38:08,562 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 04:38:08,563 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2023-11-29 04:38:08,564 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 04:38:08,574 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 04:38:08,574 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 04:38:08,574 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 04:38:08,574 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 04:38:08,574 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 04:38:08,575 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 04:38:08,575 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 04:38:08,576 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 04:38:08,578 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2023-11-29 04:38:08,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 04:38:08,579 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:38:08,580 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 04:38:08,580 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2023-11-29 04:38:08,582 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 04:38:08,592 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 04:38:08,592 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 04:38:08,592 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 04:38:08,592 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 04:38:08,593 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 04:38:08,593 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 04:38:08,596 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 04:38:08,600 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2023-11-29 04:38:08,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 04:38:08,600 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:38:08,601 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 04:38:08,602 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2023-11-29 04:38:08,603 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 04:38:08,613 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 04:38:08,613 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 04:38:08,613 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 04:38:08,613 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 04:38:08,614 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 04:38:08,614 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 04:38:08,618 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 04:38:08,620 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2023-11-29 04:38:08,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 04:38:08,620 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:38:08,621 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 04:38:08,622 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2023-11-29 04:38:08,623 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 04:38:08,633 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 04:38:08,633 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 04:38:08,633 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 04:38:08,633 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 04:38:08,635 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 04:38:08,635 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 04:38:08,638 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 04:38:08,640 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2023-11-29 04:38:08,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 04:38:08,641 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:38:08,641 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 04:38:08,642 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2023-11-29 04:38:08,643 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 04:38:08,653 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 04:38:08,653 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 04:38:08,653 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 04:38:08,653 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 04:38:08,654 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 04:38:08,654 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 04:38:08,654 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 04:38:08,655 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 04:38:08,657 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2023-11-29 04:38:08,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 04:38:08,658 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:38:08,658 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 04:38:08,659 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2023-11-29 04:38:08,660 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 04:38:08,670 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 04:38:08,670 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 04:38:08,670 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 04:38:08,670 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 04:38:08,671 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 04:38:08,671 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 04:38:08,671 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 04:38:08,672 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 04:38:08,674 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2023-11-29 04:38:08,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 04:38:08,675 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:38:08,675 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 04:38:08,676 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2023-11-29 04:38:08,678 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 04:38:08,688 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 04:38:08,688 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 04:38:08,688 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 04:38:08,688 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 04:38:08,688 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 04:38:08,688 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 04:38:08,688 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 04:38:08,690 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 04:38:08,692 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2023-11-29 04:38:08,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 04:38:08,692 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:38:08,693 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 04:38:08,694 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2023-11-29 04:38:08,695 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 04:38:08,705 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 04:38:08,705 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 04:38:08,705 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 04:38:08,705 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 04:38:08,706 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 04:38:08,706 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 04:38:08,710 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 04:38:08,712 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Ended with exit code 0 [2023-11-29 04:38:08,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 04:38:08,712 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:38:08,713 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 04:38:08,714 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2023-11-29 04:38:08,715 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 04:38:08,725 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 04:38:08,726 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 04:38:08,726 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 04:38:08,726 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 04:38:08,727 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 04:38:08,727 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 04:38:08,730 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 04:38:08,732 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Ended with exit code 0 [2023-11-29 04:38:08,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 04:38:08,732 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:38:08,733 INFO L229 MonitoredProcess]: Starting monitored process 42 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 04:38:08,734 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2023-11-29 04:38:08,735 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 04:38:08,745 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 04:38:08,745 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 04:38:08,745 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 04:38:08,745 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 04:38:08,746 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 04:38:08,746 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 04:38:08,749 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 04:38:08,752 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Ended with exit code 0 [2023-11-29 04:38:08,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 04:38:08,752 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:38:08,753 INFO L229 MonitoredProcess]: Starting monitored process 43 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 04:38:08,753 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2023-11-29 04:38:08,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-29 04:38:08,765 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 04:38:08,765 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 04:38:08,765 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 04:38:08,765 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 04:38:08,766 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 04:38:08,766 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 04:38:08,769 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 04:38:08,772 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2023-11-29 04:38:08,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 04:38:08,772 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:38:08,773 INFO L229 MonitoredProcess]: Starting monitored process 44 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 04:38:08,773 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2023-11-29 04:38:08,775 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 04:38:08,785 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 04:38:08,785 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 04:38:08,785 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 04:38:08,785 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 04:38:08,786 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 04:38:08,786 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 04:38:08,790 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 04:38:08,793 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2023-11-29 04:38:08,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 04:38:08,793 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:38:08,794 INFO L229 MonitoredProcess]: Starting monitored process 45 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 04:38:08,794 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2023-11-29 04:38:08,796 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 04:38:08,808 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 04:38:08,808 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 04:38:08,808 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 04:38:08,808 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 04:38:08,819 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 04:38:08,819 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 04:38:08,823 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 04:38:08,826 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Ended with exit code 0 [2023-11-29 04:38:08,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 04:38:08,826 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:38:08,827 INFO L229 MonitoredProcess]: Starting monitored process 46 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 04:38:08,828 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2023-11-29 04:38:08,829 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 04:38:08,839 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 04:38:08,840 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 04:38:08,840 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 04:38:08,840 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 04:38:08,843 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 04:38:08,843 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 04:38:08,852 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-11-29 04:38:08,874 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2023-11-29 04:38:08,874 INFO L444 ModelExtractionUtils]: 3 out of 16 variables were initially zero. Simplification set additionally 10 variables to zero. [2023-11-29 04:38:08,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 04:38:08,874 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:38:08,875 INFO L229 MonitoredProcess]: Starting monitored process 47 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 04:38:08,877 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2023-11-29 04:38:08,877 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-11-29 04:38:08,888 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-11-29 04:38:08,888 INFO L513 LassoAnalysis]: Proved termination. [2023-11-29 04:38:08,888 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_f_~i~1#1) = -2*ULTIMATE.start_f_~i~1#1 + 3 Supporting invariants [] [2023-11-29 04:38:08,891 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Ended with exit code 0 [2023-11-29 04:38:08,908 INFO L156 tatePredicateManager]: 7 out of 7 supporting invariants were superfluous and have been removed [2023-11-29 04:38:08,920 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:38:08,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:38:08,967 INFO L262 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 04:38:08,968 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:38:08,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:38:08,985 INFO L262 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 04:38:08,986 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:38:08,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:38:08,998 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2023-11-29 04:38:08,999 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 29 states and 35 transitions. cyclomatic complexity: 10 Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:38:09,022 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 29 states and 35 transitions. cyclomatic complexity: 10. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 35 states and 44 transitions. Complement of second has 7 states. [2023-11-29 04:38:09,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2023-11-29 04:38:09,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:38:09,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2023-11-29 04:38:09,023 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 14 letters. Loop has 3 letters. [2023-11-29 04:38:09,024 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 04:38:09,024 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 17 letters. Loop has 3 letters. [2023-11-29 04:38:09,025 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 04:38:09,025 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 14 letters. Loop has 6 letters. [2023-11-29 04:38:09,025 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 04:38:09,025 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 44 transitions. [2023-11-29 04:38:09,026 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2023-11-29 04:38:09,027 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 32 states and 40 transitions. [2023-11-29 04:38:09,027 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2023-11-29 04:38:09,027 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2023-11-29 04:38:09,027 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 40 transitions. [2023-11-29 04:38:09,027 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-29 04:38:09,027 INFO L218 hiAutomatonCegarLoop]: Abstraction has 32 states and 40 transitions. [2023-11-29 04:38:09,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 40 transitions. [2023-11-29 04:38:09,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2023-11-29 04:38:09,030 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-29 04:38:09,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2023-11-29 04:38:09,030 INFO L240 hiAutomatonCegarLoop]: Abstraction has 31 states and 39 transitions. [2023-11-29 04:38:09,030 INFO L428 stractBuchiCegarLoop]: Abstraction has 31 states and 39 transitions. [2023-11-29 04:38:09,030 INFO L335 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2023-11-29 04:38:09,030 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 39 transitions. [2023-11-29 04:38:09,031 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2023-11-29 04:38:09,031 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 04:38:09,031 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 04:38:09,032 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:38:09,032 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2023-11-29 04:38:09,032 INFO L748 eck$LassoCheckResult]: Stem: 750#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(8, 4);~#pp~0.base, ~#pp~0.offset := 4, 0;call write~init~$Pointer$#1(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$#1(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);call #Ultimate.allocInit(8, 5);~#pstate~0.base, ~#pstate~0.offset := 5, 0;call write~init~int#2(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int#2(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1; 731#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset;havoc main_~a~0#1.base, main_~a~0#1.offset;havoc main_~b~0#1.base, main_~b~0#1.offset;assume { :begin_inline_init } true;havoc init_#t~post4#1, init_~i~0#1;havoc init_~i~0#1;init_~i~0#1 := 0; 732#L19-3 assume !!(init_~i~0#1 < 2);call write~$Pointer$#1(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int#2(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4); 722#L19-2 init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1; 723#L19-3 assume !!(init_~i~0#1 < 2);call write~$Pointer$#1(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int#2(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4); 751#L19-2 init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1; 752#L19-3 assume !(init_~i~0#1 < 2); 747#L17 havoc init_#t~post4#1, init_~i~0#1;assume { :end_inline_init } true;assume { :begin_inline_fake_malloc } true;fake_malloc_#in~size#1 := 4;havoc fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;fake_malloc_~size#1 := fake_malloc_#in~size#1;fake_malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + fake_malloc_#t~post10#1;fake_malloc_#res#1.base, fake_malloc_#res#1.offset := 0, fake_malloc_#t~post10#1;havoc fake_malloc_#t~post10#1; 742#fake_malloc_returnLabel#1 main_#t~ret11#1.base, main_#t~ret11#1.offset := fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;havoc fake_malloc_#in~size#1;assume { :end_inline_fake_malloc } true;main_~a~0#1.base, main_~a~0#1.offset := main_#t~ret11#1.base, main_#t~ret11#1.offset;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset;assume { :begin_inline_fake_malloc } true;fake_malloc_#in~size#1 := 4;havoc fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;fake_malloc_~size#1 := fake_malloc_#in~size#1;fake_malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + fake_malloc_#t~post10#1;fake_malloc_#res#1.base, fake_malloc_#res#1.offset := 0, fake_malloc_#t~post10#1;havoc fake_malloc_#t~post10#1; 743#fake_malloc_returnLabel#2 main_#t~ret12#1.base, main_#t~ret12#1.offset := fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;havoc fake_malloc_#in~size#1;assume { :end_inline_fake_malloc } true;main_~b~0#1.base, main_~b~0#1.offset := main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset; 727#L59 assume !((main_~a~0#1.base == 0 && main_~a~0#1.offset == 0) || (main_~b~0#1.base == 0 && main_~b~0#1.offset == 0));assume { :begin_inline_f } true;f_#in~pointer#1.base, f_#in~pointer#1.offset := main_~a~0#1.base, main_~a~0#1.offset;havoc f_#t~mem6#1.base, f_#t~mem6#1.offset, f_#t~post5#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;f_~pointer#1.base, f_~pointer#1.offset := f_#in~pointer#1.base, f_#in~pointer#1.offset;havoc f_~i~1#1;f_~i~1#1 := 0; 728#L27-3 assume !!(f_~i~1#1 < 2);call f_#t~mem6#1.base, f_#t~mem6#1.offset := read~$Pointer$#1(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4); 749#L28 assume f_#t~mem6#1.base == 0 && f_#t~mem6#1.offset == 0;havoc f_#t~mem6#1.base, f_#t~mem6#1.offset;call write~$Pointer$#1(f_~pointer#1.base, f_~pointer#1.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4);call write~int#2(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1#1, 4); 744#L25 havoc f_#t~mem6#1.base, f_#t~mem6#1.offset, f_#t~post5#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;havoc f_#in~pointer#1.base, f_#in~pointer#1.offset;assume { :end_inline_f } true;assume { :begin_inline_f } true;f_#in~pointer#1.base, f_#in~pointer#1.offset := main_~b~0#1.base, main_~b~0#1.offset;havoc f_#t~mem6#1.base, f_#t~mem6#1.offset, f_#t~post5#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;f_~pointer#1.base, f_~pointer#1.offset := f_#in~pointer#1.base, f_#in~pointer#1.offset;havoc f_~i~1#1;f_~i~1#1 := 0; 745#L27-7 assume !(f_~i~1#1 < 2); 734#L25-1 havoc f_#t~mem6#1.base, f_#t~mem6#1.offset, f_#t~post5#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;havoc f_#in~pointer#1.base, f_#in~pointer#1.offset;assume { :end_inline_f } true;assume { :begin_inline_g } true;g_#in~pointer#1.base, g_#in~pointer#1.offset := main_~a~0#1.base, main_~a~0#1.offset;havoc g_#t~mem8#1.base, g_#t~mem8#1.offset, g_#t~mem9#1, g_#t~post7#1, g_~pointer#1.base, g_~pointer#1.offset, g_~i~2#1;g_~pointer#1.base, g_~pointer#1.offset := g_#in~pointer#1.base, g_#in~pointer#1.offset;havoc g_~i~2#1;g_~i~2#1 := 0; 724#L38-3 [2023-11-29 04:38:09,032 INFO L750 eck$LassoCheckResult]: Loop: 724#L38-3 assume !!(g_~i~2#1 < 2);call g_#t~mem8#1.base, g_#t~mem8#1.offset := read~$Pointer$#1(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2#1, 4); 726#L39 assume !(g_#t~mem8#1.base == g_~pointer#1.base && g_#t~mem8#1.offset == g_~pointer#1.offset);havoc g_#t~mem8#1.base, g_#t~mem8#1.offset; 739#L38-2 g_#t~post7#1 := g_~i~2#1;g_~i~2#1 := 1 + g_#t~post7#1;havoc g_#t~post7#1; 724#L38-3 [2023-11-29 04:38:09,033 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:38:09,033 INFO L85 PathProgramCache]: Analyzing trace with hash -809029298, now seen corresponding path program 1 times [2023-11-29 04:38:09,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:38:09,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156624515] [2023-11-29 04:38:09,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:38:09,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:38:09,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:38:09,084 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-29 04:38:09,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:38:09,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156624515] [2023-11-29 04:38:09,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156624515] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:38:09,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:38:09,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 04:38:09,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370281925] [2023-11-29 04:38:09,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:38:09,085 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-29 04:38:09,086 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:38:09,086 INFO L85 PathProgramCache]: Analyzing trace with hash 100872, now seen corresponding path program 1 times [2023-11-29 04:38:09,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:38:09,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251669552] [2023-11-29 04:38:09,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:38:09,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:38:09,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 04:38:09,089 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 04:38:09,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 04:38:09,093 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 04:38:09,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:38:09,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:38:09,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:38:09,145 INFO L87 Difference]: Start difference. First operand 31 states and 39 transitions. cyclomatic complexity: 12 Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:38:09,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:38:09,166 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2023-11-29 04:38:09,166 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 42 transitions. [2023-11-29 04:38:09,167 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2023-11-29 04:38:09,167 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 35 states and 42 transitions. [2023-11-29 04:38:09,167 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2023-11-29 04:38:09,168 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2023-11-29 04:38:09,168 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 42 transitions. [2023-11-29 04:38:09,168 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-29 04:38:09,168 INFO L218 hiAutomatonCegarLoop]: Abstraction has 35 states and 42 transitions. [2023-11-29 04:38:09,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 42 transitions. [2023-11-29 04:38:09,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 31. [2023-11-29 04:38:09,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 30 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:38:09,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2023-11-29 04:38:09,171 INFO L240 hiAutomatonCegarLoop]: Abstraction has 31 states and 38 transitions. [2023-11-29 04:38:09,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:38:09,172 INFO L428 stractBuchiCegarLoop]: Abstraction has 31 states and 38 transitions. [2023-11-29 04:38:09,172 INFO L335 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2023-11-29 04:38:09,172 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 38 transitions. [2023-11-29 04:38:09,173 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2023-11-29 04:38:09,173 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 04:38:09,173 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 04:38:09,173 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:38:09,174 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2023-11-29 04:38:09,174 INFO L748 eck$LassoCheckResult]: Stem: 822#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(8, 4);~#pp~0.base, ~#pp~0.offset := 4, 0;call write~init~$Pointer$#1(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$#1(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);call #Ultimate.allocInit(8, 5);~#pstate~0.base, ~#pstate~0.offset := 5, 0;call write~init~int#2(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int#2(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1; 803#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset;havoc main_~a~0#1.base, main_~a~0#1.offset;havoc main_~b~0#1.base, main_~b~0#1.offset;assume { :begin_inline_init } true;havoc init_#t~post4#1, init_~i~0#1;havoc init_~i~0#1;init_~i~0#1 := 0; 804#L19-3 assume !!(init_~i~0#1 < 2);call write~$Pointer$#1(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int#2(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4); 794#L19-2 init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1; 795#L19-3 assume !!(init_~i~0#1 < 2);call write~$Pointer$#1(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int#2(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4); 823#L19-2 init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1; 824#L19-3 assume !(init_~i~0#1 < 2); 819#L17 havoc init_#t~post4#1, init_~i~0#1;assume { :end_inline_init } true;assume { :begin_inline_fake_malloc } true;fake_malloc_#in~size#1 := 4;havoc fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;fake_malloc_~size#1 := fake_malloc_#in~size#1;fake_malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + fake_malloc_#t~post10#1;fake_malloc_#res#1.base, fake_malloc_#res#1.offset := 0, fake_malloc_#t~post10#1;havoc fake_malloc_#t~post10#1; 814#fake_malloc_returnLabel#1 main_#t~ret11#1.base, main_#t~ret11#1.offset := fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;havoc fake_malloc_#in~size#1;assume { :end_inline_fake_malloc } true;main_~a~0#1.base, main_~a~0#1.offset := main_#t~ret11#1.base, main_#t~ret11#1.offset;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset;assume { :begin_inline_fake_malloc } true;fake_malloc_#in~size#1 := 4;havoc fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;fake_malloc_~size#1 := fake_malloc_#in~size#1;fake_malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + fake_malloc_#t~post10#1;fake_malloc_#res#1.base, fake_malloc_#res#1.offset := 0, fake_malloc_#t~post10#1;havoc fake_malloc_#t~post10#1; 815#fake_malloc_returnLabel#2 main_#t~ret12#1.base, main_#t~ret12#1.offset := fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;havoc fake_malloc_#in~size#1;assume { :end_inline_fake_malloc } true;main_~b~0#1.base, main_~b~0#1.offset := main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset; 796#L59 assume !((main_~a~0#1.base == 0 && main_~a~0#1.offset == 0) || (main_~b~0#1.base == 0 && main_~b~0#1.offset == 0));assume { :begin_inline_f } true;f_#in~pointer#1.base, f_#in~pointer#1.offset := main_~a~0#1.base, main_~a~0#1.offset;havoc f_#t~mem6#1.base, f_#t~mem6#1.offset, f_#t~post5#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;f_~pointer#1.base, f_~pointer#1.offset := f_#in~pointer#1.base, f_#in~pointer#1.offset;havoc f_~i~1#1;f_~i~1#1 := 0; 797#L27-3 assume !!(f_~i~1#1 < 2);call f_#t~mem6#1.base, f_#t~mem6#1.offset := read~$Pointer$#1(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4); 821#L28 assume f_#t~mem6#1.base == 0 && f_#t~mem6#1.offset == 0;havoc f_#t~mem6#1.base, f_#t~mem6#1.offset;call write~$Pointer$#1(f_~pointer#1.base, f_~pointer#1.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4);call write~int#2(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1#1, 4); 816#L25 havoc f_#t~mem6#1.base, f_#t~mem6#1.offset, f_#t~post5#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;havoc f_#in~pointer#1.base, f_#in~pointer#1.offset;assume { :end_inline_f } true;assume { :begin_inline_f } true;f_#in~pointer#1.base, f_#in~pointer#1.offset := main_~b~0#1.base, main_~b~0#1.offset;havoc f_#t~mem6#1.base, f_#t~mem6#1.offset, f_#t~post5#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;f_~pointer#1.base, f_~pointer#1.offset := f_#in~pointer#1.base, f_#in~pointer#1.offset;havoc f_~i~1#1;f_~i~1#1 := 0; 817#L27-7 assume !!(f_~i~1#1 < 2);call f_#t~mem6#1.base, f_#t~mem6#1.offset := read~$Pointer$#1(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4); 805#L28-1 assume f_#t~mem6#1.base == 0 && f_#t~mem6#1.offset == 0;havoc f_#t~mem6#1.base, f_#t~mem6#1.offset;call write~$Pointer$#1(f_~pointer#1.base, f_~pointer#1.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4);call write~int#2(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1#1, 4); 806#L25-1 havoc f_#t~mem6#1.base, f_#t~mem6#1.offset, f_#t~post5#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;havoc f_#in~pointer#1.base, f_#in~pointer#1.offset;assume { :end_inline_f } true;assume { :begin_inline_g } true;g_#in~pointer#1.base, g_#in~pointer#1.offset := main_~a~0#1.base, main_~a~0#1.offset;havoc g_#t~mem8#1.base, g_#t~mem8#1.offset, g_#t~mem9#1, g_#t~post7#1, g_~pointer#1.base, g_~pointer#1.offset, g_~i~2#1;g_~pointer#1.base, g_~pointer#1.offset := g_#in~pointer#1.base, g_#in~pointer#1.offset;havoc g_~i~2#1;g_~i~2#1 := 0; 798#L38-3 [2023-11-29 04:38:09,174 INFO L750 eck$LassoCheckResult]: Loop: 798#L38-3 assume !!(g_~i~2#1 < 2);call g_#t~mem8#1.base, g_#t~mem8#1.offset := read~$Pointer$#1(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2#1, 4); 800#L39 assume !(g_#t~mem8#1.base == g_~pointer#1.base && g_#t~mem8#1.offset == g_~pointer#1.offset);havoc g_#t~mem8#1.base, g_#t~mem8#1.offset; 811#L38-2 g_#t~post7#1 := g_~i~2#1;g_~i~2#1 := 1 + g_#t~post7#1;havoc g_#t~post7#1; 798#L38-3 [2023-11-29 04:38:09,174 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:38:09,174 INFO L85 PathProgramCache]: Analyzing trace with hash 689897275, now seen corresponding path program 1 times [2023-11-29 04:38:09,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:38:09,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698754602] [2023-11-29 04:38:09,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:38:09,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:38:09,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:38:09,441 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Ended with exit code 0 [2023-11-29 04:38:09,576 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-29 04:38:09,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:38:09,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698754602] [2023-11-29 04:38:09,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698754602] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:38:09,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:38:09,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 04:38:09,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582392197] [2023-11-29 04:38:09,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:38:09,577 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-29 04:38:09,577 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:38:09,578 INFO L85 PathProgramCache]: Analyzing trace with hash 100872, now seen corresponding path program 2 times [2023-11-29 04:38:09,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:38:09,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961907911] [2023-11-29 04:38:09,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:38:09,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:38:09,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 04:38:09,582 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 04:38:09,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 04:38:09,585 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 04:38:09,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:38:09,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 04:38:09,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-11-29 04:38:09,640 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. cyclomatic complexity: 11 Second operand has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:38:09,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:38:09,745 INFO L93 Difference]: Finished difference Result 46 states and 55 transitions. [2023-11-29 04:38:09,745 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 55 transitions. [2023-11-29 04:38:09,746 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 20 [2023-11-29 04:38:09,746 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 45 states and 54 transitions. [2023-11-29 04:38:09,746 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2023-11-29 04:38:09,747 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2023-11-29 04:38:09,747 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 54 transitions. [2023-11-29 04:38:09,747 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-29 04:38:09,747 INFO L218 hiAutomatonCegarLoop]: Abstraction has 45 states and 54 transitions. [2023-11-29 04:38:09,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 54 transitions. [2023-11-29 04:38:09,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 31. [2023-11-29 04:38:09,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 30 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:38:09,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2023-11-29 04:38:09,750 INFO L240 hiAutomatonCegarLoop]: Abstraction has 31 states and 37 transitions. [2023-11-29 04:38:09,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 04:38:09,751 INFO L428 stractBuchiCegarLoop]: Abstraction has 31 states and 37 transitions. [2023-11-29 04:38:09,751 INFO L335 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2023-11-29 04:38:09,752 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 37 transitions. [2023-11-29 04:38:09,752 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2023-11-29 04:38:09,752 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 04:38:09,752 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 04:38:09,753 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:38:09,753 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2023-11-29 04:38:09,753 INFO L748 eck$LassoCheckResult]: Stem: 915#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(8, 4);~#pp~0.base, ~#pp~0.offset := 4, 0;call write~init~$Pointer$#1(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$#1(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);call #Ultimate.allocInit(8, 5);~#pstate~0.base, ~#pstate~0.offset := 5, 0;call write~init~int#2(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int#2(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1; 894#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset;havoc main_~a~0#1.base, main_~a~0#1.offset;havoc main_~b~0#1.base, main_~b~0#1.offset;assume { :begin_inline_init } true;havoc init_#t~post4#1, init_~i~0#1;havoc init_~i~0#1;init_~i~0#1 := 0; 895#L19-3 assume !!(init_~i~0#1 < 2);call write~$Pointer$#1(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int#2(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4); 887#L19-2 init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1; 888#L19-3 assume !!(init_~i~0#1 < 2);call write~$Pointer$#1(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int#2(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4); 916#L19-2 init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1; 917#L19-3 assume !(init_~i~0#1 < 2); 912#L17 havoc init_#t~post4#1, init_~i~0#1;assume { :end_inline_init } true;assume { :begin_inline_fake_malloc } true;fake_malloc_#in~size#1 := 4;havoc fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;fake_malloc_~size#1 := fake_malloc_#in~size#1;fake_malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + fake_malloc_#t~post10#1;fake_malloc_#res#1.base, fake_malloc_#res#1.offset := 0, fake_malloc_#t~post10#1;havoc fake_malloc_#t~post10#1; 907#fake_malloc_returnLabel#1 main_#t~ret11#1.base, main_#t~ret11#1.offset := fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;havoc fake_malloc_#in~size#1;assume { :end_inline_fake_malloc } true;main_~a~0#1.base, main_~a~0#1.offset := main_#t~ret11#1.base, main_#t~ret11#1.offset;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset;assume { :begin_inline_fake_malloc } true;fake_malloc_#in~size#1 := 4;havoc fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;fake_malloc_~size#1 := fake_malloc_#in~size#1;fake_malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + fake_malloc_#t~post10#1;fake_malloc_#res#1.base, fake_malloc_#res#1.offset := 0, fake_malloc_#t~post10#1;havoc fake_malloc_#t~post10#1; 908#fake_malloc_returnLabel#2 main_#t~ret12#1.base, main_#t~ret12#1.offset := fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;havoc fake_malloc_#in~size#1;assume { :end_inline_fake_malloc } true;main_~b~0#1.base, main_~b~0#1.offset := main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset; 889#L59 assume !((main_~a~0#1.base == 0 && main_~a~0#1.offset == 0) || (main_~b~0#1.base == 0 && main_~b~0#1.offset == 0));assume { :begin_inline_f } true;f_#in~pointer#1.base, f_#in~pointer#1.offset := main_~a~0#1.base, main_~a~0#1.offset;havoc f_#t~mem6#1.base, f_#t~mem6#1.offset, f_#t~post5#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;f_~pointer#1.base, f_~pointer#1.offset := f_#in~pointer#1.base, f_#in~pointer#1.offset;havoc f_~i~1#1;f_~i~1#1 := 0; 890#L27-3 assume !!(f_~i~1#1 < 2);call f_#t~mem6#1.base, f_#t~mem6#1.offset := read~$Pointer$#1(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4); 914#L28 assume f_#t~mem6#1.base == 0 && f_#t~mem6#1.offset == 0;havoc f_#t~mem6#1.base, f_#t~mem6#1.offset;call write~$Pointer$#1(f_~pointer#1.base, f_~pointer#1.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4);call write~int#2(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1#1, 4); 909#L25 havoc f_#t~mem6#1.base, f_#t~mem6#1.offset, f_#t~post5#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;havoc f_#in~pointer#1.base, f_#in~pointer#1.offset;assume { :end_inline_f } true;assume { :begin_inline_f } true;f_#in~pointer#1.base, f_#in~pointer#1.offset := main_~b~0#1.base, main_~b~0#1.offset;havoc f_#t~mem6#1.base, f_#t~mem6#1.offset, f_#t~post5#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;f_~pointer#1.base, f_~pointer#1.offset := f_#in~pointer#1.base, f_#in~pointer#1.offset;havoc f_~i~1#1;f_~i~1#1 := 0; 910#L27-7 assume !!(f_~i~1#1 < 2);call f_#t~mem6#1.base, f_#t~mem6#1.offset := read~$Pointer$#1(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4); 900#L28-1 assume !(f_#t~mem6#1.base == 0 && f_#t~mem6#1.offset == 0);havoc f_#t~mem6#1.base, f_#t~mem6#1.offset; 901#L27-6 f_#t~post5#1 := f_~i~1#1;f_~i~1#1 := 1 + f_#t~post5#1;havoc f_#t~post5#1; 906#L27-7 assume !(f_~i~1#1 < 2); 899#L25-1 havoc f_#t~mem6#1.base, f_#t~mem6#1.offset, f_#t~post5#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;havoc f_#in~pointer#1.base, f_#in~pointer#1.offset;assume { :end_inline_f } true;assume { :begin_inline_g } true;g_#in~pointer#1.base, g_#in~pointer#1.offset := main_~a~0#1.base, main_~a~0#1.offset;havoc g_#t~mem8#1.base, g_#t~mem8#1.offset, g_#t~mem9#1, g_#t~post7#1, g_~pointer#1.base, g_~pointer#1.offset, g_~i~2#1;g_~pointer#1.base, g_~pointer#1.offset := g_#in~pointer#1.base, g_#in~pointer#1.offset;havoc g_~i~2#1;g_~i~2#1 := 0; 891#L38-3 [2023-11-29 04:38:09,753 INFO L750 eck$LassoCheckResult]: Loop: 891#L38-3 assume !!(g_~i~2#1 < 2);call g_#t~mem8#1.base, g_#t~mem8#1.offset := read~$Pointer$#1(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2#1, 4); 893#L39 assume !(g_#t~mem8#1.base == g_~pointer#1.base && g_#t~mem8#1.offset == g_~pointer#1.offset);havoc g_#t~mem8#1.base, g_#t~mem8#1.offset; 904#L38-2 g_#t~post7#1 := g_~i~2#1;g_~i~2#1 := 1 + g_#t~post7#1;havoc g_#t~post7#1; 891#L38-3 [2023-11-29 04:38:09,754 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:38:09,754 INFO L85 PathProgramCache]: Analyzing trace with hash 1566375042, now seen corresponding path program 1 times [2023-11-29 04:38:09,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:38:09,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508957580] [2023-11-29 04:38:09,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:38:09,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:38:09,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:38:09,813 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-29 04:38:09,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:38:09,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508957580] [2023-11-29 04:38:09,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508957580] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:38:09,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1917944403] [2023-11-29 04:38:09,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:38:09,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:38:09,814 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:38:09,815 INFO L229 MonitoredProcess]: Starting monitored process 48 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 04:38:09,821 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Waiting until timeout for monitored process [2023-11-29 04:38:09,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:38:09,931 INFO L262 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 04:38:09,933 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:38:09,945 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-29 04:38:09,945 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:38:09,961 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-29 04:38:09,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1917944403] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 04:38:09,961 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 04:38:09,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-11-29 04:38:09,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398690778] [2023-11-29 04:38:09,962 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 04:38:09,962 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-29 04:38:09,962 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:38:09,962 INFO L85 PathProgramCache]: Analyzing trace with hash 100872, now seen corresponding path program 3 times [2023-11-29 04:38:09,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:38:09,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78930270] [2023-11-29 04:38:09,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:38:09,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:38:09,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 04:38:09,966 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 04:38:09,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 04:38:09,970 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 04:38:10,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:38:10,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 04:38:10,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-29 04:38:10,024 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. cyclomatic complexity: 10 Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:38:10,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:38:10,050 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2023-11-29 04:38:10,050 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 42 transitions. [2023-11-29 04:38:10,051 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2023-11-29 04:38:10,051 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 35 states and 42 transitions. [2023-11-29 04:38:10,052 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2023-11-29 04:38:10,052 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2023-11-29 04:38:10,052 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 42 transitions. [2023-11-29 04:38:10,052 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-29 04:38:10,052 INFO L218 hiAutomatonCegarLoop]: Abstraction has 35 states and 42 transitions. [2023-11-29 04:38:10,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 42 transitions. [2023-11-29 04:38:10,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2023-11-29 04:38:10,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 33 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:38:10,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2023-11-29 04:38:10,055 INFO L240 hiAutomatonCegarLoop]: Abstraction has 34 states and 41 transitions. [2023-11-29 04:38:10,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 04:38:10,056 INFO L428 stractBuchiCegarLoop]: Abstraction has 34 states and 41 transitions. [2023-11-29 04:38:10,056 INFO L335 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2023-11-29 04:38:10,056 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 41 transitions. [2023-11-29 04:38:10,057 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2023-11-29 04:38:10,057 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 04:38:10,057 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 04:38:10,058 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:38:10,058 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2023-11-29 04:38:10,058 INFO L748 eck$LassoCheckResult]: Stem: 1097#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(8, 4);~#pp~0.base, ~#pp~0.offset := 4, 0;call write~init~$Pointer$#1(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$#1(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);call #Ultimate.allocInit(8, 5);~#pstate~0.base, ~#pstate~0.offset := 5, 0;call write~init~int#2(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int#2(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1; 1076#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset;havoc main_~a~0#1.base, main_~a~0#1.offset;havoc main_~b~0#1.base, main_~b~0#1.offset;assume { :begin_inline_init } true;havoc init_#t~post4#1, init_~i~0#1;havoc init_~i~0#1;init_~i~0#1 := 0; 1077#L19-3 assume !!(init_~i~0#1 < 2);call write~$Pointer$#1(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int#2(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4); 1069#L19-2 init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1; 1070#L19-3 assume !!(init_~i~0#1 < 2);call write~$Pointer$#1(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int#2(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4); 1100#L19-2 init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1; 1101#L19-3 assume !(init_~i~0#1 < 2); 1094#L17 havoc init_#t~post4#1, init_~i~0#1;assume { :end_inline_init } true;assume { :begin_inline_fake_malloc } true;fake_malloc_#in~size#1 := 4;havoc fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;fake_malloc_~size#1 := fake_malloc_#in~size#1;fake_malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + fake_malloc_#t~post10#1;fake_malloc_#res#1.base, fake_malloc_#res#1.offset := 0, fake_malloc_#t~post10#1;havoc fake_malloc_#t~post10#1; 1089#fake_malloc_returnLabel#1 main_#t~ret11#1.base, main_#t~ret11#1.offset := fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;havoc fake_malloc_#in~size#1;assume { :end_inline_fake_malloc } true;main_~a~0#1.base, main_~a~0#1.offset := main_#t~ret11#1.base, main_#t~ret11#1.offset;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset;assume { :begin_inline_fake_malloc } true;fake_malloc_#in~size#1 := 4;havoc fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;fake_malloc_~size#1 := fake_malloc_#in~size#1;fake_malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + fake_malloc_#t~post10#1;fake_malloc_#res#1.base, fake_malloc_#res#1.offset := 0, fake_malloc_#t~post10#1;havoc fake_malloc_#t~post10#1; 1090#fake_malloc_returnLabel#2 main_#t~ret12#1.base, main_#t~ret12#1.offset := fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;havoc fake_malloc_#in~size#1;assume { :end_inline_fake_malloc } true;main_~b~0#1.base, main_~b~0#1.offset := main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset; 1071#L59 assume !((main_~a~0#1.base == 0 && main_~a~0#1.offset == 0) || (main_~b~0#1.base == 0 && main_~b~0#1.offset == 0));assume { :begin_inline_f } true;f_#in~pointer#1.base, f_#in~pointer#1.offset := main_~a~0#1.base, main_~a~0#1.offset;havoc f_#t~mem6#1.base, f_#t~mem6#1.offset, f_#t~post5#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;f_~pointer#1.base, f_~pointer#1.offset := f_#in~pointer#1.base, f_#in~pointer#1.offset;havoc f_~i~1#1;f_~i~1#1 := 0; 1072#L27-3 assume !!(f_~i~1#1 < 2);call f_#t~mem6#1.base, f_#t~mem6#1.offset := read~$Pointer$#1(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4); 1096#L28 assume f_#t~mem6#1.base == 0 && f_#t~mem6#1.offset == 0;havoc f_#t~mem6#1.base, f_#t~mem6#1.offset;call write~$Pointer$#1(f_~pointer#1.base, f_~pointer#1.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4);call write~int#2(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1#1, 4); 1091#L25 havoc f_#t~mem6#1.base, f_#t~mem6#1.offset, f_#t~post5#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;havoc f_#in~pointer#1.base, f_#in~pointer#1.offset;assume { :end_inline_f } true;assume { :begin_inline_f } true;f_#in~pointer#1.base, f_#in~pointer#1.offset := main_~b~0#1.base, main_~b~0#1.offset;havoc f_#t~mem6#1.base, f_#t~mem6#1.offset, f_#t~post5#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;f_~pointer#1.base, f_~pointer#1.offset := f_#in~pointer#1.base, f_#in~pointer#1.offset;havoc f_~i~1#1;f_~i~1#1 := 0; 1092#L27-7 assume !!(f_~i~1#1 < 2);call f_#t~mem6#1.base, f_#t~mem6#1.offset := read~$Pointer$#1(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4); 1098#L28-1 assume !(f_#t~mem6#1.base == 0 && f_#t~mem6#1.offset == 0);havoc f_#t~mem6#1.base, f_#t~mem6#1.offset; 1102#L27-6 f_#t~post5#1 := f_~i~1#1;f_~i~1#1 := 1 + f_#t~post5#1;havoc f_#t~post5#1; 1099#L27-7 assume !!(f_~i~1#1 < 2);call f_#t~mem6#1.base, f_#t~mem6#1.offset := read~$Pointer$#1(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4); 1080#L28-1 assume f_#t~mem6#1.base == 0 && f_#t~mem6#1.offset == 0;havoc f_#t~mem6#1.base, f_#t~mem6#1.offset;call write~$Pointer$#1(f_~pointer#1.base, f_~pointer#1.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4);call write~int#2(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1#1, 4); 1081#L25-1 havoc f_#t~mem6#1.base, f_#t~mem6#1.offset, f_#t~post5#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;havoc f_#in~pointer#1.base, f_#in~pointer#1.offset;assume { :end_inline_f } true;assume { :begin_inline_g } true;g_#in~pointer#1.base, g_#in~pointer#1.offset := main_~a~0#1.base, main_~a~0#1.offset;havoc g_#t~mem8#1.base, g_#t~mem8#1.offset, g_#t~mem9#1, g_#t~post7#1, g_~pointer#1.base, g_~pointer#1.offset, g_~i~2#1;g_~pointer#1.base, g_~pointer#1.offset := g_#in~pointer#1.base, g_#in~pointer#1.offset;havoc g_~i~2#1;g_~i~2#1 := 0; 1073#L38-3 [2023-11-29 04:38:10,058 INFO L750 eck$LassoCheckResult]: Loop: 1073#L38-3 assume !!(g_~i~2#1 < 2);call g_#t~mem8#1.base, g_#t~mem8#1.offset := read~$Pointer$#1(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2#1, 4); 1075#L39 assume !(g_#t~mem8#1.base == g_~pointer#1.base && g_#t~mem8#1.offset == g_~pointer#1.offset);havoc g_#t~mem8#1.base, g_#t~mem8#1.offset; 1086#L38-2 g_#t~post7#1 := g_~i~2#1;g_~i~2#1 := 1 + g_#t~post7#1;havoc g_#t~post7#1; 1073#L38-3 [2023-11-29 04:38:10,059 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:38:10,059 INFO L85 PathProgramCache]: Analyzing trace with hash 1312987783, now seen corresponding path program 1 times [2023-11-29 04:38:10,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:38:10,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657560704] [2023-11-29 04:38:10,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:38:10,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:38:10,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 04:38:10,090 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 04:38:10,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 04:38:10,115 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 04:38:10,115 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:38:10,115 INFO L85 PathProgramCache]: Analyzing trace with hash 100872, now seen corresponding path program 4 times [2023-11-29 04:38:10,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:38:10,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452860624] [2023-11-29 04:38:10,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:38:10,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:38:10,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 04:38:10,120 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 04:38:10,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 04:38:10,123 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 04:38:10,124 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:38:10,124 INFO L85 PathProgramCache]: Analyzing trace with hash 951949762, now seen corresponding path program 1 times [2023-11-29 04:38:10,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:38:10,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253775241] [2023-11-29 04:38:10,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:38:10,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:38:10,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:38:11,114 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-29 04:38:11,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:38:11,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253775241] [2023-11-29 04:38:11,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253775241] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:38:11,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [974928188] [2023-11-29 04:38:11,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:38:11,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:38:11,115 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:38:11,116 INFO L229 MonitoredProcess]: Starting monitored process 49 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 04:38:11,125 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Waiting until timeout for monitored process [2023-11-29 04:38:11,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:38:11,239 INFO L262 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 54 conjunts are in the unsatisfiable core [2023-11-29 04:38:11,242 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:38:11,386 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 04:38:11,390 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 04:38:11,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:38:11,558 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-29 04:38:11,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:38:11,562 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-29 04:38:11,640 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-29 04:38:11,641 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:38:11,937 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 14 treesize of output 12 [2023-11-29 04:38:11,939 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 18 treesize of output 16 [2023-11-29 04:38:11,970 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-29 04:38:11,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [974928188] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 04:38:11,971 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 04:38:11,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10, 8] total 31 [2023-11-29 04:38:11,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116546534] [2023-11-29 04:38:11,971 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 04:38:12,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:38:12,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-11-29 04:38:12,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=808, Unknown=0, NotChecked=0, Total=930 [2023-11-29 04:38:12,017 INFO L87 Difference]: Start difference. First operand 34 states and 41 transitions. cyclomatic complexity: 11 Second operand has 31 states, 31 states have (on average 1.967741935483871) internal successors, (61), 31 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-29 04:38:12,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:38:12,714 INFO L93 Difference]: Finished difference Result 43 states and 50 transitions. [2023-11-29 04:38:12,714 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 50 transitions. [2023-11-29 04:38:12,714 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2023-11-29 04:38:12,715 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 43 states and 50 transitions. [2023-11-29 04:38:12,715 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2023-11-29 04:38:12,715 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2023-11-29 04:38:12,715 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 50 transitions. [2023-11-29 04:38:12,715 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-29 04:38:12,715 INFO L218 hiAutomatonCegarLoop]: Abstraction has 43 states and 50 transitions. [2023-11-29 04:38:12,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 50 transitions. [2023-11-29 04:38:12,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 36. [2023-11-29 04:38:12,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 1.1944444444444444) internal successors, (43), 35 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:38:12,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2023-11-29 04:38:12,718 INFO L240 hiAutomatonCegarLoop]: Abstraction has 36 states and 43 transitions. [2023-11-29 04:38:12,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-29 04:38:12,719 INFO L428 stractBuchiCegarLoop]: Abstraction has 36 states and 43 transitions. [2023-11-29 04:38:12,719 INFO L335 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2023-11-29 04:38:12,719 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 43 transitions. [2023-11-29 04:38:12,719 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2023-11-29 04:38:12,719 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 04:38:12,719 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 04:38:12,720 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:38:12,720 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2023-11-29 04:38:12,721 INFO L748 eck$LassoCheckResult]: Stem: 1367#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(8, 4);~#pp~0.base, ~#pp~0.offset := 4, 0;call write~init~$Pointer$#1(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$#1(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);call #Ultimate.allocInit(8, 5);~#pstate~0.base, ~#pstate~0.offset := 5, 0;call write~init~int#2(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int#2(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1; 1344#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset;havoc main_~a~0#1.base, main_~a~0#1.offset;havoc main_~b~0#1.base, main_~b~0#1.offset;assume { :begin_inline_init } true;havoc init_#t~post4#1, init_~i~0#1;havoc init_~i~0#1;init_~i~0#1 := 0; 1345#L19-3 assume !!(init_~i~0#1 < 2);call write~$Pointer$#1(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int#2(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4); 1338#L19-2 init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1; 1339#L19-3 assume !!(init_~i~0#1 < 2);call write~$Pointer$#1(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int#2(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4); 1370#L19-2 init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1; 1371#L19-3 assume !(init_~i~0#1 < 2); 1364#L17 havoc init_#t~post4#1, init_~i~0#1;assume { :end_inline_init } true;assume { :begin_inline_fake_malloc } true;fake_malloc_#in~size#1 := 4;havoc fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;fake_malloc_~size#1 := fake_malloc_#in~size#1;fake_malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + fake_malloc_#t~post10#1;fake_malloc_#res#1.base, fake_malloc_#res#1.offset := 0, fake_malloc_#t~post10#1;havoc fake_malloc_#t~post10#1; 1357#fake_malloc_returnLabel#1 main_#t~ret11#1.base, main_#t~ret11#1.offset := fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;havoc fake_malloc_#in~size#1;assume { :end_inline_fake_malloc } true;main_~a~0#1.base, main_~a~0#1.offset := main_#t~ret11#1.base, main_#t~ret11#1.offset;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset;assume { :begin_inline_fake_malloc } true;fake_malloc_#in~size#1 := 4;havoc fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;fake_malloc_~size#1 := fake_malloc_#in~size#1;fake_malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + fake_malloc_#t~post10#1;fake_malloc_#res#1.base, fake_malloc_#res#1.offset := 0, fake_malloc_#t~post10#1;havoc fake_malloc_#t~post10#1; 1358#fake_malloc_returnLabel#2 main_#t~ret12#1.base, main_#t~ret12#1.offset := fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;havoc fake_malloc_#in~size#1;assume { :end_inline_fake_malloc } true;main_~b~0#1.base, main_~b~0#1.offset := main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset; 1340#L59 assume !((main_~a~0#1.base == 0 && main_~a~0#1.offset == 0) || (main_~b~0#1.base == 0 && main_~b~0#1.offset == 0));assume { :begin_inline_f } true;f_#in~pointer#1.base, f_#in~pointer#1.offset := main_~a~0#1.base, main_~a~0#1.offset;havoc f_#t~mem6#1.base, f_#t~mem6#1.offset, f_#t~post5#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;f_~pointer#1.base, f_~pointer#1.offset := f_#in~pointer#1.base, f_#in~pointer#1.offset;havoc f_~i~1#1;f_~i~1#1 := 0; 1341#L27-3 assume !!(f_~i~1#1 < 2);call f_#t~mem6#1.base, f_#t~mem6#1.offset := read~$Pointer$#1(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4); 1366#L28 assume f_#t~mem6#1.base == 0 && f_#t~mem6#1.offset == 0;havoc f_#t~mem6#1.base, f_#t~mem6#1.offset;call write~$Pointer$#1(f_~pointer#1.base, f_~pointer#1.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4);call write~int#2(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1#1, 4); 1359#L25 havoc f_#t~mem6#1.base, f_#t~mem6#1.offset, f_#t~post5#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;havoc f_#in~pointer#1.base, f_#in~pointer#1.offset;assume { :end_inline_f } true;assume { :begin_inline_f } true;f_#in~pointer#1.base, f_#in~pointer#1.offset := main_~b~0#1.base, main_~b~0#1.offset;havoc f_#t~mem6#1.base, f_#t~mem6#1.offset, f_#t~post5#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;f_~pointer#1.base, f_~pointer#1.offset := f_#in~pointer#1.base, f_#in~pointer#1.offset;havoc f_~i~1#1;f_~i~1#1 := 0; 1360#L27-7 assume !!(f_~i~1#1 < 2);call f_#t~mem6#1.base, f_#t~mem6#1.offset := read~$Pointer$#1(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4); 1368#L28-1 assume !(f_#t~mem6#1.base == 0 && f_#t~mem6#1.offset == 0);havoc f_#t~mem6#1.base, f_#t~mem6#1.offset; 1373#L27-6 f_#t~post5#1 := f_~i~1#1;f_~i~1#1 := 1 + f_#t~post5#1;havoc f_#t~post5#1; 1369#L27-7 assume !!(f_~i~1#1 < 2);call f_#t~mem6#1.base, f_#t~mem6#1.offset := read~$Pointer$#1(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4); 1348#L28-1 assume f_#t~mem6#1.base == 0 && f_#t~mem6#1.offset == 0;havoc f_#t~mem6#1.base, f_#t~mem6#1.offset;call write~$Pointer$#1(f_~pointer#1.base, f_~pointer#1.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4);call write~int#2(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1#1, 4); 1349#L25-1 havoc f_#t~mem6#1.base, f_#t~mem6#1.offset, f_#t~post5#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;havoc f_#in~pointer#1.base, f_#in~pointer#1.offset;assume { :end_inline_f } true;assume { :begin_inline_g } true;g_#in~pointer#1.base, g_#in~pointer#1.offset := main_~a~0#1.base, main_~a~0#1.offset;havoc g_#t~mem8#1.base, g_#t~mem8#1.offset, g_#t~mem9#1, g_#t~post7#1, g_~pointer#1.base, g_~pointer#1.offset, g_~i~2#1;g_~pointer#1.base, g_~pointer#1.offset := g_#in~pointer#1.base, g_#in~pointer#1.offset;havoc g_~i~2#1;g_~i~2#1 := 0; 1342#L38-3 assume !!(g_~i~2#1 < 2);call g_#t~mem8#1.base, g_#t~mem8#1.offset := read~$Pointer$#1(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2#1, 4); 1343#L39 assume g_#t~mem8#1.base == g_~pointer#1.base && g_#t~mem8#1.offset == g_~pointer#1.offset;havoc g_#t~mem8#1.base, g_#t~mem8#1.offset;call g_#t~mem9#1 := read~int#2(~#pstate~0.base, ~#pstate~0.offset + 4 * g_~i~2#1, 4); 1355#L41 [2023-11-29 04:38:12,721 INFO L750 eck$LassoCheckResult]: Loop: 1355#L41 assume 1 == g_#t~mem9#1; 1353#L41-2 havoc g_#t~mem9#1;call write~int#2(2, ~#pstate~0.base, ~#pstate~0.offset + 4 * g_~i~2#1, 4); 1354#L38-2 g_#t~post7#1 := g_~i~2#1;g_~i~2#1 := 1 + g_#t~post7#1;havoc g_#t~post7#1; 1363#L38-3 assume !!(g_~i~2#1 < 2);call g_#t~mem8#1.base, g_#t~mem8#1.offset := read~$Pointer$#1(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2#1, 4); 1372#L39 assume g_#t~mem8#1.base == g_~pointer#1.base && g_#t~mem8#1.offset == g_~pointer#1.offset;havoc g_#t~mem8#1.base, g_#t~mem8#1.offset;call g_#t~mem9#1 := read~int#2(~#pstate~0.base, ~#pstate~0.offset + 4 * g_~i~2#1, 4); 1355#L41 [2023-11-29 04:38:12,721 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:38:12,721 INFO L85 PathProgramCache]: Analyzing trace with hash -939123286, now seen corresponding path program 1 times [2023-11-29 04:38:12,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:38:12,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324824188] [2023-11-29 04:38:12,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:38:12,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:38:12,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 04:38:12,754 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 04:38:12,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 04:38:12,781 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 04:38:12,781 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:38:12,782 INFO L85 PathProgramCache]: Analyzing trace with hash 102421811, now seen corresponding path program 1 times [2023-11-29 04:38:12,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:38:12,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046939317] [2023-11-29 04:38:12,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:38:12,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:38:12,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 04:38:12,787 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 04:38:12,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 04:38:12,792 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 04:38:12,793 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:38:12,793 INFO L85 PathProgramCache]: Analyzing trace with hash -289285846, now seen corresponding path program 1 times [2023-11-29 04:38:12,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:38:12,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550426886] [2023-11-29 04:38:12,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:38:12,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:38:12,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:38:13,289 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-29 04:38:13,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:38:13,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550426886] [2023-11-29 04:38:13,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550426886] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:38:13,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1569721914] [2023-11-29 04:38:13,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:38:13,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:38:13,290 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:38:13,291 INFO L229 MonitoredProcess]: Starting monitored process 50 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 04:38:13,293 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Waiting until timeout for monitored process [2023-11-29 04:38:13,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:38:13,428 INFO L262 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 40 conjunts are in the unsatisfiable core [2023-11-29 04:38:13,430 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:38:13,515 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 04:38:13,615 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-29 04:38:13,615 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:38:13,682 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 17 treesize of output 15 [2023-11-29 04:38:13,684 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 18 [2023-11-29 04:38:13,784 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-29 04:38:13,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1569721914] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 04:38:13,784 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 04:38:13,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 23 [2023-11-29 04:38:13,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588490103] [2023-11-29 04:38:13,784 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 04:38:13,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:38:13,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-11-29 04:38:13,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=494, Unknown=0, NotChecked=0, Total=552 [2023-11-29 04:38:13,974 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. cyclomatic complexity: 11 Second operand has 24 states, 23 states have (on average 2.5652173913043477) internal successors, (59), 24 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:38:14,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:38:14,557 INFO L93 Difference]: Finished difference Result 54 states and 63 transitions. [2023-11-29 04:38:14,558 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 63 transitions. [2023-11-29 04:38:14,558 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2023-11-29 04:38:14,559 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 54 states and 63 transitions. [2023-11-29 04:38:14,559 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 44 [2023-11-29 04:38:14,559 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 44 [2023-11-29 04:38:14,559 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 63 transitions. [2023-11-29 04:38:14,559 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-29 04:38:14,559 INFO L218 hiAutomatonCegarLoop]: Abstraction has 54 states and 63 transitions. [2023-11-29 04:38:14,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states and 63 transitions. [2023-11-29 04:38:14,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 46. [2023-11-29 04:38:14,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 46 states have (on average 1.173913043478261) internal successors, (54), 45 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:38:14,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 54 transitions. [2023-11-29 04:38:14,562 INFO L240 hiAutomatonCegarLoop]: Abstraction has 46 states and 54 transitions. [2023-11-29 04:38:14,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-29 04:38:14,563 INFO L428 stractBuchiCegarLoop]: Abstraction has 46 states and 54 transitions. [2023-11-29 04:38:14,563 INFO L335 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2023-11-29 04:38:14,563 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 54 transitions. [2023-11-29 04:38:14,564 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2023-11-29 04:38:14,564 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 04:38:14,564 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 04:38:14,565 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:38:14,565 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2023-11-29 04:38:14,565 INFO L748 eck$LassoCheckResult]: Stem: 1674#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(8, 4);~#pp~0.base, ~#pp~0.offset := 4, 0;call write~init~$Pointer$#1(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$#1(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);call #Ultimate.allocInit(8, 5);~#pstate~0.base, ~#pstate~0.offset := 5, 0;call write~init~int#2(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int#2(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1; 1647#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset;havoc main_~a~0#1.base, main_~a~0#1.offset;havoc main_~b~0#1.base, main_~b~0#1.offset;assume { :begin_inline_init } true;havoc init_#t~post4#1, init_~i~0#1;havoc init_~i~0#1;init_~i~0#1 := 0; 1648#L19-3 assume !!(init_~i~0#1 < 2);call write~$Pointer$#1(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int#2(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4); 1641#L19-2 init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1; 1642#L19-3 assume !!(init_~i~0#1 < 2);call write~$Pointer$#1(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int#2(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4); 1676#L19-2 init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1; 1677#L19-3 assume !(init_~i~0#1 < 2); 1669#L17 havoc init_#t~post4#1, init_~i~0#1;assume { :end_inline_init } true;assume { :begin_inline_fake_malloc } true;fake_malloc_#in~size#1 := 4;havoc fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;fake_malloc_~size#1 := fake_malloc_#in~size#1;fake_malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + fake_malloc_#t~post10#1;fake_malloc_#res#1.base, fake_malloc_#res#1.offset := 0, fake_malloc_#t~post10#1;havoc fake_malloc_#t~post10#1; 1660#fake_malloc_returnLabel#1 main_#t~ret11#1.base, main_#t~ret11#1.offset := fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;havoc fake_malloc_#in~size#1;assume { :end_inline_fake_malloc } true;main_~a~0#1.base, main_~a~0#1.offset := main_#t~ret11#1.base, main_#t~ret11#1.offset;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset;assume { :begin_inline_fake_malloc } true;fake_malloc_#in~size#1 := 4;havoc fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;fake_malloc_~size#1 := fake_malloc_#in~size#1;fake_malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + fake_malloc_#t~post10#1;fake_malloc_#res#1.base, fake_malloc_#res#1.offset := 0, fake_malloc_#t~post10#1;havoc fake_malloc_#t~post10#1; 1661#fake_malloc_returnLabel#2 main_#t~ret12#1.base, main_#t~ret12#1.offset := fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;havoc fake_malloc_#in~size#1;assume { :end_inline_fake_malloc } true;main_~b~0#1.base, main_~b~0#1.offset := main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset; 1643#L59 assume !((main_~a~0#1.base == 0 && main_~a~0#1.offset == 0) || (main_~b~0#1.base == 0 && main_~b~0#1.offset == 0));assume { :begin_inline_f } true;f_#in~pointer#1.base, f_#in~pointer#1.offset := main_~a~0#1.base, main_~a~0#1.offset;havoc f_#t~mem6#1.base, f_#t~mem6#1.offset, f_#t~post5#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;f_~pointer#1.base, f_~pointer#1.offset := f_#in~pointer#1.base, f_#in~pointer#1.offset;havoc f_~i~1#1;f_~i~1#1 := 0; 1644#L27-3 assume !!(f_~i~1#1 < 2);call f_#t~mem6#1.base, f_#t~mem6#1.offset := read~$Pointer$#1(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4); 1673#L28 assume f_#t~mem6#1.base == 0 && f_#t~mem6#1.offset == 0;havoc f_#t~mem6#1.base, f_#t~mem6#1.offset;call write~$Pointer$#1(f_~pointer#1.base, f_~pointer#1.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4);call write~int#2(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1#1, 4); 1662#L25 havoc f_#t~mem6#1.base, f_#t~mem6#1.offset, f_#t~post5#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;havoc f_#in~pointer#1.base, f_#in~pointer#1.offset;assume { :end_inline_f } true;assume { :begin_inline_f } true;f_#in~pointer#1.base, f_#in~pointer#1.offset := main_~b~0#1.base, main_~b~0#1.offset;havoc f_#t~mem6#1.base, f_#t~mem6#1.offset, f_#t~post5#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;f_~pointer#1.base, f_~pointer#1.offset := f_#in~pointer#1.base, f_#in~pointer#1.offset;havoc f_~i~1#1;f_~i~1#1 := 0; 1663#L27-7 assume !!(f_~i~1#1 < 2);call f_#t~mem6#1.base, f_#t~mem6#1.offset := read~$Pointer$#1(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4); 1653#L28-1 assume !(f_#t~mem6#1.base == 0 && f_#t~mem6#1.offset == 0);havoc f_#t~mem6#1.base, f_#t~mem6#1.offset; 1654#L27-6 f_#t~post5#1 := f_~i~1#1;f_~i~1#1 := 1 + f_#t~post5#1;havoc f_#t~post5#1; 1659#L27-7 assume !!(f_~i~1#1 < 2);call f_#t~mem6#1.base, f_#t~mem6#1.offset := read~$Pointer$#1(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4); 1675#L28-1 assume !(f_#t~mem6#1.base == 0 && f_#t~mem6#1.offset == 0);havoc f_#t~mem6#1.base, f_#t~mem6#1.offset; 1684#L27-6 f_#t~post5#1 := f_~i~1#1;f_~i~1#1 := 1 + f_#t~post5#1;havoc f_#t~post5#1; 1681#L27-7 assume !(f_~i~1#1 < 2); 1664#L25-1 havoc f_#t~mem6#1.base, f_#t~mem6#1.offset, f_#t~post5#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;havoc f_#in~pointer#1.base, f_#in~pointer#1.offset;assume { :end_inline_f } true;assume { :begin_inline_g } true;g_#in~pointer#1.base, g_#in~pointer#1.offset := main_~a~0#1.base, main_~a~0#1.offset;havoc g_#t~mem8#1.base, g_#t~mem8#1.offset, g_#t~mem9#1, g_#t~post7#1, g_~pointer#1.base, g_~pointer#1.offset, g_~i~2#1;g_~pointer#1.base, g_~pointer#1.offset := g_#in~pointer#1.base, g_#in~pointer#1.offset;havoc g_~i~2#1;g_~i~2#1 := 0; 1665#L38-3 assume !!(g_~i~2#1 < 2);call g_#t~mem8#1.base, g_#t~mem8#1.offset := read~$Pointer$#1(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2#1, 4); 1680#L39 assume g_#t~mem8#1.base == g_~pointer#1.base && g_#t~mem8#1.offset == g_~pointer#1.offset;havoc g_#t~mem8#1.base, g_#t~mem8#1.offset;call g_#t~mem9#1 := read~int#2(~#pstate~0.base, ~#pstate~0.offset + 4 * g_~i~2#1, 4); 1679#L41 [2023-11-29 04:38:14,565 INFO L750 eck$LassoCheckResult]: Loop: 1679#L41 assume 1 == g_#t~mem9#1; 1656#L41-2 havoc g_#t~mem9#1;call write~int#2(2, ~#pstate~0.base, ~#pstate~0.offset + 4 * g_~i~2#1, 4); 1657#L38-2 g_#t~post7#1 := g_~i~2#1;g_~i~2#1 := 1 + g_#t~post7#1;havoc g_#t~post7#1; 1682#L38-3 assume !!(g_~i~2#1 < 2);call g_#t~mem8#1.base, g_#t~mem8#1.offset := read~$Pointer$#1(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2#1, 4); 1683#L39 assume g_#t~mem8#1.base == g_~pointer#1.base && g_#t~mem8#1.offset == g_~pointer#1.offset;havoc g_#t~mem8#1.base, g_#t~mem8#1.offset;call g_#t~mem9#1 := read~int#2(~#pstate~0.base, ~#pstate~0.offset + 4 * g_~i~2#1, 4); 1679#L41 [2023-11-29 04:38:14,565 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:38:14,565 INFO L85 PathProgramCache]: Analyzing trace with hash -501415375, now seen corresponding path program 1 times [2023-11-29 04:38:14,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:38:14,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645091439] [2023-11-29 04:38:14,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:38:14,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:38:14,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:38:15,167 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:38:15,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:38:15,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645091439] [2023-11-29 04:38:15,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645091439] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:38:15,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1114887385] [2023-11-29 04:38:15,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:38:15,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:38:15,168 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:38:15,169 INFO L229 MonitoredProcess]: Starting monitored process 51 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 04:38:15,169 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Waiting until timeout for monitored process [2023-11-29 04:38:15,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:38:15,265 INFO L262 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 26 conjunts are in the unsatisfiable core [2023-11-29 04:38:15,267 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:38:15,292 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 04:38:15,297 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 04:38:15,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:38:15,361 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-29 04:38:15,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:38:15,365 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-29 04:38:15,425 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:38:15,425 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:38:15,608 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-29 04:38:15,610 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 16 treesize of output 12 [2023-11-29 04:38:15,637 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:38:15,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1114887385] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 04:38:15,637 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 04:38:15,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 9] total 24 [2023-11-29 04:38:15,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779938427] [2023-11-29 04:38:15,637 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 04:38:15,638 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-29 04:38:15,638 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:38:15,638 INFO L85 PathProgramCache]: Analyzing trace with hash 102421811, now seen corresponding path program 2 times [2023-11-29 04:38:15,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:38:15,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924022240] [2023-11-29 04:38:15,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:38:15,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:38:15,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 04:38:15,643 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 04:38:15,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 04:38:15,647 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 04:38:15,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:38:15,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-11-29 04:38:15,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=462, Unknown=0, NotChecked=0, Total=552 [2023-11-29 04:38:15,822 INFO L87 Difference]: Start difference. First operand 46 states and 54 transitions. cyclomatic complexity: 13 Second operand has 24 states, 24 states have (on average 2.25) internal successors, (54), 24 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:38:16,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:38:16,140 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2023-11-29 04:38:16,140 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 39 transitions. [2023-11-29 04:38:16,141 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2023-11-29 04:38:16,141 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 35 states and 38 transitions. [2023-11-29 04:38:16,141 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2023-11-29 04:38:16,141 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2023-11-29 04:38:16,141 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 38 transitions. [2023-11-29 04:38:16,142 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:38:16,142 INFO L218 hiAutomatonCegarLoop]: Abstraction has 35 states and 38 transitions. [2023-11-29 04:38:16,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 38 transitions. [2023-11-29 04:38:16,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2023-11-29 04:38:16,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 34 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:38:16,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2023-11-29 04:38:16,144 INFO L240 hiAutomatonCegarLoop]: Abstraction has 35 states and 38 transitions. [2023-11-29 04:38:16,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-29 04:38:16,145 INFO L428 stractBuchiCegarLoop]: Abstraction has 35 states and 38 transitions. [2023-11-29 04:38:16,145 INFO L335 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2023-11-29 04:38:16,145 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 38 transitions. [2023-11-29 04:38:16,146 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2023-11-29 04:38:16,146 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 04:38:16,146 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 04:38:16,146 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:38:16,146 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2023-11-29 04:38:16,147 INFO L748 eck$LassoCheckResult]: Stem: 1933#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(8, 4);~#pp~0.base, ~#pp~0.offset := 4, 0;call write~init~$Pointer$#1(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$#1(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);call #Ultimate.allocInit(8, 5);~#pstate~0.base, ~#pstate~0.offset := 5, 0;call write~init~int#2(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int#2(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1; 1912#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset;havoc main_~a~0#1.base, main_~a~0#1.offset;havoc main_~b~0#1.base, main_~b~0#1.offset;assume { :begin_inline_init } true;havoc init_#t~post4#1, init_~i~0#1;havoc init_~i~0#1;init_~i~0#1 := 0; 1913#L19-3 assume !!(init_~i~0#1 < 2);call write~$Pointer$#1(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int#2(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4); 1904#L19-2 init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1; 1905#L19-3 assume !!(init_~i~0#1 < 2);call write~$Pointer$#1(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int#2(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4); 1934#L19-2 init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1; 1935#L19-3 assume !(init_~i~0#1 < 2); 1929#L17 havoc init_#t~post4#1, init_~i~0#1;assume { :end_inline_init } true;assume { :begin_inline_fake_malloc } true;fake_malloc_#in~size#1 := 4;havoc fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;fake_malloc_~size#1 := fake_malloc_#in~size#1;fake_malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + fake_malloc_#t~post10#1;fake_malloc_#res#1.base, fake_malloc_#res#1.offset := 0, fake_malloc_#t~post10#1;havoc fake_malloc_#t~post10#1; 1922#fake_malloc_returnLabel#1 main_#t~ret11#1.base, main_#t~ret11#1.offset := fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;havoc fake_malloc_#in~size#1;assume { :end_inline_fake_malloc } true;main_~a~0#1.base, main_~a~0#1.offset := main_#t~ret11#1.base, main_#t~ret11#1.offset;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset;assume { :begin_inline_fake_malloc } true;fake_malloc_#in~size#1 := 4;havoc fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;fake_malloc_~size#1 := fake_malloc_#in~size#1;fake_malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + fake_malloc_#t~post10#1;fake_malloc_#res#1.base, fake_malloc_#res#1.offset := 0, fake_malloc_#t~post10#1;havoc fake_malloc_#t~post10#1; 1923#fake_malloc_returnLabel#2 main_#t~ret12#1.base, main_#t~ret12#1.offset := fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;havoc fake_malloc_#in~size#1;assume { :end_inline_fake_malloc } true;main_~b~0#1.base, main_~b~0#1.offset := main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset; 1906#L59 assume !((main_~a~0#1.base == 0 && main_~a~0#1.offset == 0) || (main_~b~0#1.base == 0 && main_~b~0#1.offset == 0));assume { :begin_inline_f } true;f_#in~pointer#1.base, f_#in~pointer#1.offset := main_~a~0#1.base, main_~a~0#1.offset;havoc f_#t~mem6#1.base, f_#t~mem6#1.offset, f_#t~post5#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;f_~pointer#1.base, f_~pointer#1.offset := f_#in~pointer#1.base, f_#in~pointer#1.offset;havoc f_~i~1#1;f_~i~1#1 := 0; 1907#L27-3 assume !!(f_~i~1#1 < 2);call f_#t~mem6#1.base, f_#t~mem6#1.offset := read~$Pointer$#1(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4); 1932#L28 assume f_#t~mem6#1.base == 0 && f_#t~mem6#1.offset == 0;havoc f_#t~mem6#1.base, f_#t~mem6#1.offset;call write~$Pointer$#1(f_~pointer#1.base, f_~pointer#1.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4);call write~int#2(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1#1, 4); 1924#L25 havoc f_#t~mem6#1.base, f_#t~mem6#1.offset, f_#t~post5#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;havoc f_#in~pointer#1.base, f_#in~pointer#1.offset;assume { :end_inline_f } true;assume { :begin_inline_f } true;f_#in~pointer#1.base, f_#in~pointer#1.offset := main_~b~0#1.base, main_~b~0#1.offset;havoc f_#t~mem6#1.base, f_#t~mem6#1.offset, f_#t~post5#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;f_~pointer#1.base, f_~pointer#1.offset := f_#in~pointer#1.base, f_#in~pointer#1.offset;havoc f_~i~1#1;f_~i~1#1 := 0; 1925#L27-7 assume !!(f_~i~1#1 < 2);call f_#t~mem6#1.base, f_#t~mem6#1.offset := read~$Pointer$#1(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4); 1937#L28-1 assume !(f_#t~mem6#1.base == 0 && f_#t~mem6#1.offset == 0);havoc f_#t~mem6#1.base, f_#t~mem6#1.offset; 1920#L27-6 f_#t~post5#1 := f_~i~1#1;f_~i~1#1 := 1 + f_#t~post5#1;havoc f_#t~post5#1; 1921#L27-7 assume !!(f_~i~1#1 < 2);call f_#t~mem6#1.base, f_#t~mem6#1.offset := read~$Pointer$#1(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4); 1914#L28-1 assume f_#t~mem6#1.base == 0 && f_#t~mem6#1.offset == 0;havoc f_#t~mem6#1.base, f_#t~mem6#1.offset;call write~$Pointer$#1(f_~pointer#1.base, f_~pointer#1.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4);call write~int#2(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1#1, 4); 1915#L25-1 havoc f_#t~mem6#1.base, f_#t~mem6#1.offset, f_#t~post5#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;havoc f_#in~pointer#1.base, f_#in~pointer#1.offset;assume { :end_inline_f } true;assume { :begin_inline_g } true;g_#in~pointer#1.base, g_#in~pointer#1.offset := main_~a~0#1.base, main_~a~0#1.offset;havoc g_#t~mem8#1.base, g_#t~mem8#1.offset, g_#t~mem9#1, g_#t~post7#1, g_~pointer#1.base, g_~pointer#1.offset, g_~i~2#1;g_~pointer#1.base, g_~pointer#1.offset := g_#in~pointer#1.base, g_#in~pointer#1.offset;havoc g_~i~2#1;g_~i~2#1 := 0; 1926#L38-3 assume !!(g_~i~2#1 < 2);call g_#t~mem8#1.base, g_#t~mem8#1.offset := read~$Pointer$#1(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2#1, 4); 1936#L39 assume g_#t~mem8#1.base == g_~pointer#1.base && g_#t~mem8#1.offset == g_~pointer#1.offset;havoc g_#t~mem8#1.base, g_#t~mem8#1.offset;call g_#t~mem9#1 := read~int#2(~#pstate~0.base, ~#pstate~0.offset + 4 * g_~i~2#1, 4); 1930#L41 assume 1 == g_#t~mem9#1; 1917#L41-2 havoc g_#t~mem9#1;call write~int#2(2, ~#pstate~0.base, ~#pstate~0.offset + 4 * g_~i~2#1, 4); 1918#L38-2 g_#t~post7#1 := g_~i~2#1;g_~i~2#1 := 1 + g_#t~post7#1;havoc g_#t~post7#1; 1908#L38-3 assume !!(g_~i~2#1 < 2);call g_#t~mem8#1.base, g_#t~mem8#1.offset := read~$Pointer$#1(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2#1, 4); 1909#L39 [2023-11-29 04:38:16,147 INFO L750 eck$LassoCheckResult]: Loop: 1909#L39 assume !(g_#t~mem8#1.base == g_~pointer#1.base && g_#t~mem8#1.offset == g_~pointer#1.offset);havoc g_#t~mem8#1.base, g_#t~mem8#1.offset; 1919#L38-2 g_#t~post7#1 := g_~i~2#1;g_~i~2#1 := 1 + g_#t~post7#1;havoc g_#t~post7#1; 1938#L38-3 assume !!(g_~i~2#1 < 2);call g_#t~mem8#1.base, g_#t~mem8#1.offset := read~$Pointer$#1(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2#1, 4); 1909#L39 [2023-11-29 04:38:16,147 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:38:16,147 INFO L85 PathProgramCache]: Analyzing trace with hash -147879136, now seen corresponding path program 2 times [2023-11-29 04:38:16,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:38:16,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88660980] [2023-11-29 04:38:16,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:38:16,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:38:16,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 04:38:16,176 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 04:38:16,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 04:38:16,202 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 04:38:16,203 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:38:16,203 INFO L85 PathProgramCache]: Analyzing trace with hash 118212, now seen corresponding path program 5 times [2023-11-29 04:38:16,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:38:16,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834029003] [2023-11-29 04:38:16,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:38:16,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:38:16,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 04:38:16,207 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 04:38:16,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 04:38:16,210 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 04:38:16,211 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:38:16,211 INFO L85 PathProgramCache]: Analyzing trace with hash 1169193541, now seen corresponding path program 1 times [2023-11-29 04:38:16,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:38:16,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524281175] [2023-11-29 04:38:16,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:38:16,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:38:16,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:38:16,289 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-29 04:38:16,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:38:16,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524281175] [2023-11-29 04:38:16,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524281175] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:38:16,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1446523809] [2023-11-29 04:38:16,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:38:16,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:38:16,290 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:38:16,293 INFO L229 MonitoredProcess]: Starting monitored process 52 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 04:38:16,313 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Waiting until timeout for monitored process [2023-11-29 04:38:16,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:38:16,468 INFO L262 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 04:38:16,470 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:38:16,491 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-29 04:38:16,491 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:38:16,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1446523809] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:38:16,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 04:38:16,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2023-11-29 04:38:16,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312938058] [2023-11-29 04:38:16,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:38:16,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:38:16,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 04:38:16,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-29 04:38:16,552 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. cyclomatic complexity: 6 Second operand has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 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-29 04:38:16,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:38:16,578 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2023-11-29 04:38:16,578 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 43 transitions. [2023-11-29 04:38:16,579 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2023-11-29 04:38:16,579 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 0 states and 0 transitions. [2023-11-29 04:38:16,579 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2023-11-29 04:38:16,579 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2023-11-29 04:38:16,579 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2023-11-29 04:38:16,579 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:38:16,579 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-29 04:38:16,579 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-29 04:38:16,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 04:38:16,580 INFO L428 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-29 04:38:16,580 INFO L335 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2023-11-29 04:38:16,580 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2023-11-29 04:38:16,580 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2023-11-29 04:38:16,580 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2023-11-29 04:38:16,585 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.11 04:38:16 BoogieIcfgContainer [2023-11-29 04:38:16,585 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-11-29 04:38:16,586 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 04:38:16,586 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 04:38:16,586 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 04:38:16,586 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:37:39" (3/4) ... [2023-11-29 04:38:16,588 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-29 04:38:16,589 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 04:38:16,590 INFO L158 Benchmark]: Toolchain (without parser) took 38030.59ms. Allocated memory was 153.1MB in the beginning and 203.4MB in the end (delta: 50.3MB). Free memory was 119.9MB in the beginning and 134.8MB in the end (delta: -14.9MB). Peak memory consumption was 37.9MB. Max. memory is 16.1GB. [2023-11-29 04:38:16,590 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 153.1MB. Free memory is still 127.7MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 04:38:16,590 INFO L158 Benchmark]: CACSL2BoogieTranslator took 223.63ms. Allocated memory is still 153.1MB. Free memory was 119.9MB in the beginning and 109.2MB in the end (delta: 10.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-29 04:38:16,591 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.56ms. Allocated memory is still 153.1MB. Free memory was 109.2MB in the beginning and 107.4MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 04:38:16,591 INFO L158 Benchmark]: Boogie Preprocessor took 41.82ms. Allocated memory is still 153.1MB. Free memory was 107.4MB in the beginning and 104.5MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 04:38:16,591 INFO L158 Benchmark]: RCFGBuilder took 401.71ms. Allocated memory is still 153.1MB. Free memory was 104.5MB in the beginning and 86.9MB in the end (delta: 17.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2023-11-29 04:38:16,592 INFO L158 Benchmark]: BuchiAutomizer took 37318.59ms. Allocated memory was 153.1MB in the beginning and 203.4MB in the end (delta: 50.3MB). Free memory was 86.5MB in the beginning and 134.8MB in the end (delta: -48.3MB). Peak memory consumption was 4.3MB. Max. memory is 16.1GB. [2023-11-29 04:38:16,592 INFO L158 Benchmark]: Witness Printer took 3.44ms. Allocated memory is still 203.4MB. Free memory is still 134.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 04:38:16,594 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.19ms. Allocated memory is still 153.1MB. Free memory is still 127.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 223.63ms. Allocated memory is still 153.1MB. Free memory was 119.9MB in the beginning and 109.2MB in the end (delta: 10.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.56ms. Allocated memory is still 153.1MB. Free memory was 109.2MB in the beginning and 107.4MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.82ms. Allocated memory is still 153.1MB. Free memory was 107.4MB in the beginning and 104.5MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 401.71ms. Allocated memory is still 153.1MB. Free memory was 104.5MB in the beginning and 86.9MB in the end (delta: 17.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * BuchiAutomizer took 37318.59ms. Allocated memory was 153.1MB in the beginning and 203.4MB in the end (delta: 50.3MB). Free memory was 86.5MB in the beginning and 134.8MB in the end (delta: -48.3MB). Peak memory consumption was 4.3MB. Max. memory is 16.1GB. * Witness Printer took 3.44ms. Allocated memory is still 203.4MB. Free memory is still 134.8MB. 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[~#pp~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 12 terminating modules (10 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 ((-2 * i) + 3) and consists of 4 locations. 10 modules have a trivial ranking function, the largest among these consists of 31 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 37.2s and 13 iterations. TraceHistogramMax:2. Analysis of lassos took 34.7s. Construction of modules took 0.9s. Büchi inclusion checks took 1.5s. Highest rank in rank-based complementation 3. Minimization of det autom 6. Minimization of nondet autom 6. Automata minimization 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 36 StatesRemovedByMinimization, 7 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: 0 mSolverCounterUnknown, 630 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 628 mSDsluCounter, 1026 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 772 mSDsCounter, 87 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1189 IncrementalHoareTripleChecker+Invalid, 1276 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 87 mSolverCounterUnsat, 254 mSDtfsCounter, 1189 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc4 concLT0 SILN0 SILU6 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital313 mio100 ax100 hnf100 lsp73 ukn63 mio100 lsp39 div100 bol100 ite100 ukn100 eq165 hnf91 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 27ms 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-29 04:38:16,609 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Ended with exit code 0 [2023-11-29 04:38:16,808 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Ended with exit code 0 [2023-11-29 04:38:17,008 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Forceful destruction successful, exit code 0 [2023-11-29 04:38:17,208 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Forceful destruction successful, exit code 0 [2023-11-29 04:38:17,408 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Ended with exit code 0 [2023-11-29 04:38:17,609 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-11-29 04:38:17,808 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2023-11-29 04:38:18,011 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eac3bfb-3bcd-47ef-a1e3-793ada19f4a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE