./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-simple/dll2c_remove_all.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_236090ff-e4ca-496c-a63a-c6269e01657e/bin/uautomizer-verify-VRDe98Ueme/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_236090ff-e4ca-496c-a63a-c6269e01657e/bin/uautomizer-verify-VRDe98Ueme/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_236090ff-e4ca-496c-a63a-c6269e01657e/bin/uautomizer-verify-VRDe98Ueme/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_236090ff-e4ca-496c-a63a-c6269e01657e/bin/uautomizer-verify-VRDe98Ueme/config/AutomizerReach.xml -i ../../sv-benchmarks/c/list-simple/dll2c_remove_all.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_236090ff-e4ca-496c-a63a-c6269e01657e/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_236090ff-e4ca-496c-a63a-c6269e01657e/bin/uautomizer-verify-VRDe98Ueme --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6c2ed91303515fb47ae50633bb4ba0c83e07781b13d03a95e0e32251f9fc3016 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-26 11:50:48,753 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-26 11:50:48,828 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_236090ff-e4ca-496c-a63a-c6269e01657e/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-26 11:50:48,834 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-26 11:50:48,834 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-26 11:50:48,860 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-26 11:50:48,861 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-26 11:50:48,861 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-26 11:50:48,862 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-26 11:50:48,863 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-26 11:50:48,863 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-26 11:50:48,864 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-26 11:50:48,865 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-26 11:50:48,866 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-26 11:50:48,866 INFO L153 SettingsManager]: * Use SBE=true [2023-11-26 11:50:48,867 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-26 11:50:48,868 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-26 11:50:48,868 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-26 11:50:48,869 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-26 11:50:48,869 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-26 11:50:48,870 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-26 11:50:48,871 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-26 11:50:48,871 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-26 11:50:48,872 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-26 11:50:48,872 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-26 11:50:48,873 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-26 11:50:48,873 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-26 11:50:48,874 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-26 11:50:48,874 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-26 11:50:48,875 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-26 11:50:48,889 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-26 11:50:48,890 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 11:50:48,890 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-26 11:50:48,891 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-26 11:50:48,891 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-26 11:50:48,891 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-26 11:50:48,892 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-26 11:50:48,892 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-26 11:50:48,893 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-26 11:50:48,893 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-26 11:50:48,894 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-26 11:50:48,895 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-26 11:50:48,895 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_236090ff-e4ca-496c-a63a-c6269e01657e/bin/uautomizer-verify-VRDe98Ueme/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_236090ff-e4ca-496c-a63a-c6269e01657e/bin/uautomizer-verify-VRDe98Ueme Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) 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 -> 6c2ed91303515fb47ae50633bb4ba0c83e07781b13d03a95e0e32251f9fc3016 [2023-11-26 11:50:49,226 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-26 11:50:49,249 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-26 11:50:49,252 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-26 11:50:49,253 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-26 11:50:49,254 INFO L274 PluginConnector]: CDTParser initialized [2023-11-26 11:50:49,255 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_236090ff-e4ca-496c-a63a-c6269e01657e/bin/uautomizer-verify-VRDe98Ueme/../../sv-benchmarks/c/list-simple/dll2c_remove_all.i [2023-11-26 11:50:52,467 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-26 11:50:52,748 INFO L384 CDTParser]: Found 1 translation units. [2023-11-26 11:50:52,750 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_236090ff-e4ca-496c-a63a-c6269e01657e/sv-benchmarks/c/list-simple/dll2c_remove_all.i [2023-11-26 11:50:52,780 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_236090ff-e4ca-496c-a63a-c6269e01657e/bin/uautomizer-verify-VRDe98Ueme/data/fc0b9d6fb/fa9ce0ad71164efc8e4affd0dd905d16/FLAGc0bc86151 [2023-11-26 11:50:52,797 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_236090ff-e4ca-496c-a63a-c6269e01657e/bin/uautomizer-verify-VRDe98Ueme/data/fc0b9d6fb/fa9ce0ad71164efc8e4affd0dd905d16 [2023-11-26 11:50:52,801 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-26 11:50:52,802 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-26 11:50:52,804 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-26 11:50:52,804 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-26 11:50:52,812 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-26 11:50:52,813 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 11:50:52" (1/1) ... [2023-11-26 11:50:52,815 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@619cba2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:50:52, skipping insertion in model container [2023-11-26 11:50:52,815 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 11:50:52" (1/1) ... [2023-11-26 11:50:52,884 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-26 11:50:53,303 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_236090ff-e4ca-496c-a63a-c6269e01657e/sv-benchmarks/c/list-simple/dll2c_remove_all.i[24169,24182] [2023-11-26 11:50:53,309 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 11:50:53,320 INFO L202 MainTranslator]: Completed pre-run [2023-11-26 11:50:53,394 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_236090ff-e4ca-496c-a63a-c6269e01657e/sv-benchmarks/c/list-simple/dll2c_remove_all.i[24169,24182] [2023-11-26 11:50:53,397 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 11:50:53,434 INFO L206 MainTranslator]: Completed translation [2023-11-26 11:50:53,435 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:50:53 WrapperNode [2023-11-26 11:50:53,435 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-26 11:50:53,437 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-26 11:50:53,437 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-26 11:50:53,438 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-26 11:50:53,445 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:50:53" (1/1) ... [2023-11-26 11:50:53,474 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:50:53" (1/1) ... [2023-11-26 11:50:53,510 INFO L138 Inliner]: procedures = 126, calls = 38, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 106 [2023-11-26 11:50:53,511 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-26 11:50:53,512 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-26 11:50:53,512 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-26 11:50:53,512 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-26 11:50:53,525 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:50:53" (1/1) ... [2023-11-26 11:50:53,525 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:50:53" (1/1) ... [2023-11-26 11:50:53,544 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:50:53" (1/1) ... [2023-11-26 11:50:53,577 INFO L175 MemorySlicer]: Split 22 memory accesses to 3 slices as follows [2, 11, 9]. 50 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 11 writes are split as follows [0, 9, 2]. [2023-11-26 11:50:53,579 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:50:53" (1/1) ... [2023-11-26 11:50:53,579 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:50:53" (1/1) ... [2023-11-26 11:50:53,592 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:50:53" (1/1) ... [2023-11-26 11:50:53,598 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:50:53" (1/1) ... [2023-11-26 11:50:53,605 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:50:53" (1/1) ... [2023-11-26 11:50:53,607 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:50:53" (1/1) ... [2023-11-26 11:50:53,614 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-26 11:50:53,618 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-26 11:50:53,618 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-26 11:50:53,618 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-26 11:50:53,619 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:50:53" (1/1) ... [2023-11-26 11:50:53,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 11:50:53,638 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_236090ff-e4ca-496c-a63a-c6269e01657e/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 11:50:53,660 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_236090ff-e4ca-496c-a63a-c6269e01657e/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-26 11:50:53,693 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_236090ff-e4ca-496c-a63a-c6269e01657e/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-26 11:50:53,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-26 11:50:53,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-26 11:50:53,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-26 11:50:53,714 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-11-26 11:50:53,714 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-11-26 11:50:53,714 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-26 11:50:53,714 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-26 11:50:53,714 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-26 11:50:53,716 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-26 11:50:53,717 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-26 11:50:53,717 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-11-26 11:50:53,717 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-26 11:50:53,717 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-26 11:50:53,717 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-11-26 11:50:53,718 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-26 11:50:53,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-11-26 11:50:53,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-11-26 11:50:53,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2023-11-26 11:50:53,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-26 11:50:53,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-26 11:50:53,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-26 11:50:53,719 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-26 11:50:53,719 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-26 11:50:53,946 INFO L241 CfgBuilder]: Building ICFG [2023-11-26 11:50:53,948 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-26 11:50:54,184 INFO L282 CfgBuilder]: Performing block encoding [2023-11-26 11:50:54,216 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-26 11:50:54,217 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-26 11:50:54,217 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 11:50:54 BoogieIcfgContainer [2023-11-26 11:50:54,217 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-26 11:50:54,220 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-26 11:50:54,221 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-26 11:50:54,224 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-26 11:50:54,224 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 11:50:52" (1/3) ... [2023-11-26 11:50:54,225 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25b46c15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 11:50:54, skipping insertion in model container [2023-11-26 11:50:54,225 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:50:53" (2/3) ... [2023-11-26 11:50:54,226 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25b46c15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 11:50:54, skipping insertion in model container [2023-11-26 11:50:54,226 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 11:50:54" (3/3) ... [2023-11-26 11:50:54,227 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_remove_all.i [2023-11-26 11:50:54,247 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-26 11:50:54,248 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-26 11:50:54,297 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-26 11:50:54,304 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@180b3cc2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-26 11:50:54,304 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-26 11:50:54,309 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-26 11:50:54,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-26 11:50:54,316 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:50:54,316 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:50:54,317 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:50:54,322 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:50:54,323 INFO L85 PathProgramCache]: Analyzing trace with hash -1122641969, now seen corresponding path program 1 times [2023-11-26 11:50:54,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:50:54,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915104837] [2023-11-26 11:50:54,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:50:54,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:50:54,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:50:54,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-26 11:50:54,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:50:54,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:50:54,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:50:54,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915104837] [2023-11-26 11:50:54,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915104837] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:50:54,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:50:54,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-26 11:50:54,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448519879] [2023-11-26 11:50:54,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:50:54,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:50:54,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:50:54,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:50:54,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:50:54,782 INFO L87 Difference]: Start difference. First operand has 22 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-26 11:50:54,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:50:54,848 INFO L93 Difference]: Finished difference Result 32 states and 43 transitions. [2023-11-26 11:50:54,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:50:54,850 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2023-11-26 11:50:54,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:50:54,858 INFO L225 Difference]: With dead ends: 32 [2023-11-26 11:50:54,858 INFO L226 Difference]: Without dead ends: 19 [2023-11-26 11:50:54,861 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:50:54,864 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 0 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-26 11:50:54,866 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 36 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-26 11:50:54,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2023-11-26 11:50:54,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2023-11-26 11:50:54,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-26 11:50:54,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2023-11-26 11:50:54,904 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 12 [2023-11-26 11:50:54,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:50:54,905 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2023-11-26 11:50:54,906 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-26 11:50:54,906 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2023-11-26 11:50:54,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-26 11:50:54,907 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:50:54,908 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:50:54,908 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-26 11:50:54,908 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:50:54,909 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:50:54,909 INFO L85 PathProgramCache]: Analyzing trace with hash -1494820932, now seen corresponding path program 1 times [2023-11-26 11:50:54,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:50:54,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639231650] [2023-11-26 11:50:54,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:50:54,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:50:54,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:50:55,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-26 11:50:55,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:50:55,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:50:55,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:50:55,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639231650] [2023-11-26 11:50:55,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639231650] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:50:55,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:50:55,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-26 11:50:55,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584863982] [2023-11-26 11:50:55,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:50:55,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-26 11:50:55,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:50:55,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-26 11:50:55,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-26 11:50:55,217 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-26 11:50:55,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:50:55,305 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2023-11-26 11:50:55,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-26 11:50:55,306 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2023-11-26 11:50:55,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:50:55,308 INFO L225 Difference]: With dead ends: 32 [2023-11-26 11:50:55,309 INFO L226 Difference]: Without dead ends: 24 [2023-11-26 11:50:55,309 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-26 11:50:55,311 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 4 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-26 11:50:55,312 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 41 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-26 11:50:55,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2023-11-26 11:50:55,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 20. [2023-11-26 11:50:55,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-26 11:50:55,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2023-11-26 11:50:55,325 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 12 [2023-11-26 11:50:55,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:50:55,326 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2023-11-26 11:50:55,326 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-26 11:50:55,327 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2023-11-26 11:50:55,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-11-26 11:50:55,329 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:50:55,330 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:50:55,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-26 11:50:55,331 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:50:55,333 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:50:55,333 INFO L85 PathProgramCache]: Analyzing trace with hash 597595060, now seen corresponding path program 1 times [2023-11-26 11:50:55,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:50:55,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124527920] [2023-11-26 11:50:55,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:50:55,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:50:55,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:50:55,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-26 11:50:55,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:50:55,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-26 11:50:55,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:50:55,699 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-26 11:50:55,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:50:55,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124527920] [2023-11-26 11:50:55,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124527920] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:50:55,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:50:55,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 11:50:55,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189846019] [2023-11-26 11:50:55,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:50:55,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-26 11:50:55,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:50:55,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-26 11:50:55,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-26 11:50:55,717 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-26 11:50:55,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:50:55,811 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2023-11-26 11:50:55,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-26 11:50:55,812 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2023-11-26 11:50:55,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:50:55,815 INFO L225 Difference]: With dead ends: 27 [2023-11-26 11:50:55,815 INFO L226 Difference]: Without dead ends: 23 [2023-11-26 11:50:55,816 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-26 11:50:55,820 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 13 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-26 11:50:55,821 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 42 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-26 11:50:55,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-11-26 11:50:55,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2023-11-26 11:50:55,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-26 11:50:55,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2023-11-26 11:50:55,832 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 20 [2023-11-26 11:50:55,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:50:55,833 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2023-11-26 11:50:55,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-26 11:50:55,834 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2023-11-26 11:50:55,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-11-26 11:50:55,836 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:50:55,837 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:50:55,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-26 11:50:55,837 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:50:55,842 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:50:55,843 INFO L85 PathProgramCache]: Analyzing trace with hash 1853951991, now seen corresponding path program 1 times [2023-11-26 11:50:55,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:50:55,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157091710] [2023-11-26 11:50:55,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:50:55,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:50:55,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:50:56,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-26 11:50:56,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:50:56,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-26 11:50:56,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:50:56,084 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-26 11:50:56,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:50:56,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157091710] [2023-11-26 11:50:56,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157091710] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-26 11:50:56,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1659962672] [2023-11-26 11:50:56,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:50:56,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 11:50:56,085 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_236090ff-e4ca-496c-a63a-c6269e01657e/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 11:50:56,089 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_236090ff-e4ca-496c-a63a-c6269e01657e/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-26 11:50:56,110 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_236090ff-e4ca-496c-a63a-c6269e01657e/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-26 11:50:56,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:50:56,275 INFO L262 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-26 11:50:56,282 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 11:50:56,382 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-26 11:50:56,382 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-26 11:50:56,471 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-26 11:50:56,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1659962672] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-26 11:50:56,474 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-26 11:50:56,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2023-11-26 11:50:56,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462306765] [2023-11-26 11:50:56,476 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-26 11:50:56,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-26 11:50:56,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:50:56,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-26 11:50:56,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2023-11-26 11:50:56,479 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 10 states have internal predecessors, (35), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-26 11:50:56,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:50:56,581 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. [2023-11-26 11:50:56,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-26 11:50:56,582 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 10 states have internal predecessors, (35), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 23 [2023-11-26 11:50:56,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:50:56,583 INFO L225 Difference]: With dead ends: 28 [2023-11-26 11:50:56,584 INFO L226 Difference]: Without dead ends: 24 [2023-11-26 11:50:56,584 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2023-11-26 11:50:56,585 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 18 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-26 11:50:56,586 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 70 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-26 11:50:56,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2023-11-26 11:50:56,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2023-11-26 11:50:56,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-26 11:50:56,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2023-11-26 11:50:56,592 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 29 transitions. Word has length 23 [2023-11-26 11:50:56,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:50:56,592 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 29 transitions. [2023-11-26 11:50:56,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 10 states have internal predecessors, (35), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-26 11:50:56,593 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2023-11-26 11:50:56,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-26 11:50:56,594 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:50:56,594 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:50:56,603 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_236090ff-e4ca-496c-a63a-c6269e01657e/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-26 11:50:56,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_236090ff-e4ca-496c-a63a-c6269e01657e/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 11:50:56,801 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:50:56,801 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:50:56,801 INFO L85 PathProgramCache]: Analyzing trace with hash -656701228, now seen corresponding path program 2 times [2023-11-26 11:50:56,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:50:56,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751962892] [2023-11-26 11:50:56,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:50:56,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:50:56,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:50:57,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-26 11:50:57,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:50:57,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-26 11:50:57,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:50:57,187 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-26 11:50:57,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:50:57,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751962892] [2023-11-26 11:50:57,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751962892] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:50:57,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:50:57,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-26 11:50:57,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662237702] [2023-11-26 11:50:57,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:50:57,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 11:50:57,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:50:57,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 11:50:57,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-26 11:50:57,191 INFO L87 Difference]: Start difference. First operand 24 states and 29 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-26 11:50:57,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:50:57,385 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2023-11-26 11:50:57,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-26 11:50:57,386 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2023-11-26 11:50:57,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:50:57,387 INFO L225 Difference]: With dead ends: 33 [2023-11-26 11:50:57,387 INFO L226 Difference]: Without dead ends: 29 [2023-11-26 11:50:57,387 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-26 11:50:57,388 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 4 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-26 11:50:57,388 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 71 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-26 11:50:57,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-11-26 11:50:57,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 24. [2023-11-26 11:50:57,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-26 11:50:57,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2023-11-26 11:50:57,393 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 29 transitions. Word has length 26 [2023-11-26 11:50:57,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:50:57,393 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 29 transitions. [2023-11-26 11:50:57,394 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-26 11:50:57,394 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2023-11-26 11:50:57,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-26 11:50:57,398 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:50:57,398 INFO L195 NwaCegarLoop]: trace 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-26 11:50:57,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-26 11:50:57,399 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:50:57,399 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:50:57,399 INFO L85 PathProgramCache]: Analyzing trace with hash -599442926, now seen corresponding path program 1 times [2023-11-26 11:50:57,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:50:57,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364528700] [2023-11-26 11:50:57,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:50:57,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:50:57,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:50:58,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-26 11:50:58,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:50:58,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-26 11:50:58,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:50:58,646 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-26 11:50:58,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:50:58,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364528700] [2023-11-26 11:50:58,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364528700] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-26 11:50:58,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [671791557] [2023-11-26 11:50:58,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:50:58,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 11:50:58,648 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_236090ff-e4ca-496c-a63a-c6269e01657e/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 11:50:58,651 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_236090ff-e4ca-496c-a63a-c6269e01657e/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-26 11:50:58,670 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_236090ff-e4ca-496c-a63a-c6269e01657e/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-26 11:50:58,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:50:58,866 INFO L262 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 61 conjunts are in the unsatisfiable core [2023-11-26 11:50:58,871 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 11:50:58,921 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-26 11:50:59,091 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-26 11:50:59,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-26 11:50:59,136 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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-26 11:50:59,212 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-26 11:50:59,213 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 31 [2023-11-26 11:50:59,350 INFO L349 Elim1Store]: treesize reduction 96, result has 22.0 percent of original size [2023-11-26 11:50:59,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 130 treesize of output 55 [2023-11-26 11:50:59,460 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 99 treesize of output 67 [2023-11-26 11:50:59,473 INFO L349 Elim1Store]: treesize reduction 34, result has 2.9 percent of original size [2023-11-26 11:50:59,474 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 17 [2023-11-26 11:50:59,526 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-26 11:50:59,526 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-26 11:50:59,564 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 55 treesize of output 43 [2023-11-26 11:50:59,570 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 34 treesize of output 26 [2023-11-26 11:50:59,767 WARN L854 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| Int) (v_ArrVal_652 (Array Int Int))) (not (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_652))) (store .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) is different from false [2023-11-26 11:50:59,787 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-26 11:50:59,787 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 31 [2023-11-26 11:50:59,800 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-26 11:50:59,801 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 147 treesize of output 145 [2023-11-26 11:50:59,815 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 142 treesize of output 134 [2023-11-26 11:50:59,904 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 6 treesize of output 4 [2023-11-26 11:50:59,912 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 36 treesize of output 32 [2023-11-26 11:51:00,267 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-26 11:51:00,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [671791557] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-26 11:51:00,267 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-26 11:51:00,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 15] total 36 [2023-11-26 11:51:00,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391451259] [2023-11-26 11:51:00,268 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-26 11:51:00,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-11-26 11:51:00,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:51:00,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-11-26 11:51:00,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=1091, Unknown=1, NotChecked=66, Total=1260 [2023-11-26 11:51:00,270 INFO L87 Difference]: Start difference. First operand 24 states and 29 transitions. Second operand has 36 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 27 states have internal predecessors, (45), 5 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-11-26 11:51:01,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:51:01,139 INFO L93 Difference]: Finished difference Result 42 states and 53 transitions. [2023-11-26 11:51:01,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-26 11:51:01,140 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 27 states have internal predecessors, (45), 5 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 26 [2023-11-26 11:51:01,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:51:01,142 INFO L225 Difference]: With dead ends: 42 [2023-11-26 11:51:01,142 INFO L226 Difference]: Without dead ends: 33 [2023-11-26 11:51:01,143 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 269 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=144, Invalid=1419, Unknown=1, NotChecked=76, Total=1640 [2023-11-26 11:51:01,144 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 31 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 31 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-26 11:51:01,144 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 225 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 332 Invalid, 0 Unknown, 31 Unchecked, 0.5s Time] [2023-11-26 11:51:01,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2023-11-26 11:51:01,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2023-11-26 11:51:01,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 27 states have internal predecessors, (34), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-26 11:51:01,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 40 transitions. [2023-11-26 11:51:01,161 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 40 transitions. Word has length 26 [2023-11-26 11:51:01,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:51:01,162 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 40 transitions. [2023-11-26 11:51:01,162 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 27 states have internal predecessors, (45), 5 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-11-26 11:51:01,162 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2023-11-26 11:51:01,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-26 11:51:01,163 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:51:01,164 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:51:01,174 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_236090ff-e4ca-496c-a63a-c6269e01657e/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-26 11:51:01,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_236090ff-e4ca-496c-a63a-c6269e01657e/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 11:51:01,370 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:51:01,371 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:51:01,371 INFO L85 PathProgramCache]: Analyzing trace with hash 80615444, now seen corresponding path program 1 times [2023-11-26 11:51:01,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:51:01,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361091894] [2023-11-26 11:51:01,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:51:01,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:51:01,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:03,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-26 11:51:03,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:03,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-26 11:51:03,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:03,257 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-26 11:51:03,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:51:03,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361091894] [2023-11-26 11:51:03,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361091894] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-26 11:51:03,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [932985950] [2023-11-26 11:51:03,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:51:03,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 11:51:03,258 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_236090ff-e4ca-496c-a63a-c6269e01657e/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 11:51:03,259 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_236090ff-e4ca-496c-a63a-c6269e01657e/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-26 11:51:03,282 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_236090ff-e4ca-496c-a63a-c6269e01657e/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-26 11:51:03,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:03,490 INFO L262 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 107 conjunts are in the unsatisfiable core [2023-11-26 11:51:03,497 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 11:51:03,523 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-26 11:51:03,782 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-26 11:51:03,782 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-26 11:51:03,837 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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-26 11:51:03,844 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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-26 11:51:03,927 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-26 11:51:03,928 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 43 [2023-11-26 11:51:03,939 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 24 treesize of output 11 [2023-11-26 11:51:04,128 INFO L349 Elim1Store]: treesize reduction 96, result has 22.0 percent of original size [2023-11-26 11:51:04,129 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 185 treesize of output 86 [2023-11-26 11:51:04,146 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-26 11:51:04,149 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 58 treesize of output 47 [2023-11-26 11:51:04,155 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 28 treesize of output 36 [2023-11-26 11:51:04,459 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 282 treesize of output 206 [2023-11-26 11:51:04,497 INFO L349 Elim1Store]: treesize reduction 148, result has 3.3 percent of original size [2023-11-26 11:51:04,497 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 255 treesize of output 231 [2023-11-26 11:51:04,511 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 267 treesize of output 231 [2023-11-26 11:51:04,529 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 239 treesize of output 163 [2023-11-26 11:51:04,539 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-26 11:51:04,545 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 39 treesize of output 30 [2023-11-26 11:51:04,558 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2023-11-26 11:51:04,569 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-26 11:51:04,570 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 51 treesize of output 9 [2023-11-26 11:51:04,583 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2023-11-26 11:51:04,591 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 9 treesize of output 7 [2023-11-26 11:51:04,831 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 33 [2023-11-26 11:51:04,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-26 11:51:04,844 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-26 11:51:04,852 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 13 [2023-11-26 11:51:04,861 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-26 11:51:04,877 INFO L349 Elim1Store]: treesize reduction 66, result has 4.3 percent of original size [2023-11-26 11:51:04,878 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 59 treesize of output 23 [2023-11-26 11:51:04,964 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:51:04,965 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-26 11:51:05,271 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 772 treesize of output 696 [2023-11-26 11:51:05,276 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 496 treesize of output 420 [2023-11-26 11:51:05,293 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (let ((.cse4 (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (.cse0 (select .cse3 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (and (forall ((v_ArrVal_889 (Array Int Int)) (v_ArrVal_893 (Array Int Int))) (= .cse0 (select (select (let ((.cse1 (store .cse3 .cse4 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse1) .cse0 v_ArrVal_893) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store (store .cse2 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse1) .cse0 v_ArrVal_893) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| .cse0))) .cse0) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_889) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))) (forall ((v_prenex_1 (Array Int Int)) (v_ArrVal_894 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1))) (let ((.cse8 (select .cse7 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (let ((.cse5 (select .cse8 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (= .cse5 (select (select (let ((.cse6 (store .cse8 .cse4 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset|))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse6) .cse0 v_ArrVal_894) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store (store .cse7 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse6) .cse0 v_ArrVal_894) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| .cse5))) .cse0) .cse5)))))))))) is different from false [2023-11-26 11:51:05,326 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (let ((.cse4 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4)) (.cse1 (select .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (and (forall ((v_ArrVal_889 (Array Int Int)) (v_ArrVal_893 (Array Int Int))) (= (select (select (let ((.cse0 (store .cse3 .cse4 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse0) .cse1 v_ArrVal_893) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store (store .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse0) .cse1 v_ArrVal_893) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| .cse1))) .cse1) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_889) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) .cse1)) (forall ((v_prenex_1 (Array Int Int)) (v_ArrVal_894 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1))) (let ((.cse8 (select .cse6 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (let ((.cse7 (select .cse8 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (= (select (select (let ((.cse5 (store .cse8 .cse4 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset|))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse5) .cse1 v_ArrVal_894) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store (store .cse6 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse5) .cse1 v_ArrVal_894) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| .cse7))) .cse1) .cse7) .cse7))))))))) is different from false [2023-11-26 11:51:05,358 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4))) (and (forall ((v_ArrVal_886 (Array Int Int)) (v_ArrVal_889 (Array Int Int)) (v_ArrVal_893 (Array Int Int)) (v_ArrVal_885 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_886))) (let ((.cse3 (store .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) (let ((.cse4 (select .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (let ((.cse0 (select .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (= .cse0 (select (select (let ((.cse2 (store .cse4 .cse5 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (store (store (store .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse2) .cse0 v_ArrVal_893) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store (store .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse2) .cse0 v_ArrVal_893) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| .cse0))) .cse0) (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_885) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_889) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))))))) (forall ((v_ArrVal_886 (Array Int Int)) (v_prenex_1 (Array Int Int)) (v_ArrVal_894 (Array Int Int)) (v_ArrVal_885 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_885))) (let ((.cse9 (store .cse6 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1))) (let ((.cse11 (select .cse9 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (let ((.cse10 (select .cse11 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (= (select (let ((.cse8 (select (select (let ((.cse12 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_886))) (store .cse12 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse12 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (select (let ((.cse7 (store .cse11 .cse5 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset|))) (store (store (store .cse6 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse7) .cse8 v_ArrVal_894) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store (store .cse9 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse7) .cse8 v_ArrVal_894) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| .cse10))) .cse8)) .cse10) .cse10)))))))) is different from false [2023-11-26 11:51:05,379 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-26 11:51:05,380 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 554 treesize of output 442 [2023-11-26 11:51:05,386 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 350 treesize of output 314 [2023-11-26 11:51:05,397 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 220 treesize of output 200 [2023-11-26 11:51:05,402 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 200 treesize of output 190 [2023-11-26 11:51:05,428 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-26 11:51:05,429 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 214 treesize of output 222 [2023-11-26 11:51:05,444 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-26 11:51:05,445 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 178 treesize of output 154 [2023-11-26 11:51:05,471 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-26 11:51:05,471 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 378 treesize of output 368 [2023-11-26 11:51:05,493 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 396 treesize of output 380 [2023-11-26 11:51:05,964 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 41 treesize of output 37 [2023-11-26 11:51:05,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-26 11:51:05,987 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-26 11:51:05,993 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-26 11:51:05,994 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 414 treesize of output 1 [2023-11-26 11:51:06,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [932985950] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-26 11:51:06,164 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-26 11:51:06,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18] total 33 [2023-11-26 11:51:06,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113292393] [2023-11-26 11:51:06,165 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-26 11:51:06,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-11-26 11:51:06,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:51:06,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-11-26 11:51:06,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=1231, Unknown=5, NotChecked=216, Total=1560 [2023-11-26 11:51:06,167 INFO L87 Difference]: Start difference. First operand 32 states and 40 transitions. Second operand has 33 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 27 states have internal predecessors, (39), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-26 11:51:07,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:51:07,542 INFO L93 Difference]: Finished difference Result 45 states and 56 transitions. [2023-11-26 11:51:07,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-26 11:51:07,545 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 27 states have internal predecessors, (39), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 26 [2023-11-26 11:51:07,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:51:07,546 INFO L225 Difference]: With dead ends: 45 [2023-11-26 11:51:07,547 INFO L226 Difference]: Without dead ends: 36 [2023-11-26 11:51:07,548 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=189, Invalid=1980, Unknown=5, NotChecked=276, Total=2450 [2023-11-26 11:51:07,549 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 29 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 436 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-26 11:51:07,550 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 242 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 436 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-26 11:51:07,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2023-11-26 11:51:07,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2023-11-26 11:51:07,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 30 states have internal predecessors, (37), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-26 11:51:07,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 43 transitions. [2023-11-26 11:51:07,558 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 43 transitions. Word has length 26 [2023-11-26 11:51:07,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:51:07,558 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 43 transitions. [2023-11-26 11:51:07,558 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 27 states have internal predecessors, (39), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-26 11:51:07,559 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 43 transitions. [2023-11-26 11:51:07,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-11-26 11:51:07,560 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:51:07,560 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:51:07,571 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_236090ff-e4ca-496c-a63a-c6269e01657e/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-26 11:51:07,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_236090ff-e4ca-496c-a63a-c6269e01657e/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 11:51:07,771 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:51:07,771 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:51:07,772 INFO L85 PathProgramCache]: Analyzing trace with hash 1644135123, now seen corresponding path program 2 times [2023-11-26 11:51:07,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:51:07,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632574289] [2023-11-26 11:51:07,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:51:07,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:51:07,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:07,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-26 11:51:07,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:07,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-26 11:51:07,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:07,967 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-26 11:51:07,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:51:07,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632574289] [2023-11-26 11:51:07,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632574289] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-26 11:51:07,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1563706948] [2023-11-26 11:51:07,968 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-26 11:51:07,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 11:51:07,968 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_236090ff-e4ca-496c-a63a-c6269e01657e/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 11:51:07,969 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_236090ff-e4ca-496c-a63a-c6269e01657e/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-26 11:51:07,994 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_236090ff-e4ca-496c-a63a-c6269e01657e/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-26 11:51:08,300 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-26 11:51:08,300 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-26 11:51:08,304 INFO L262 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-26 11:51:08,307 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 11:51:08,394 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-26 11:51:08,394 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-26 11:51:08,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1563706948] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:51:08,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-26 11:51:08,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 11 [2023-11-26 11:51:08,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404780964] [2023-11-26 11:51:08,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:51:08,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 11:51:08,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:51:08,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 11:51:08,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2023-11-26 11:51:08,398 INFO L87 Difference]: Start difference. First operand 35 states and 43 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-26 11:51:08,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:51:08,446 INFO L93 Difference]: Finished difference Result 46 states and 55 transitions. [2023-11-26 11:51:08,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-26 11:51:08,446 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 29 [2023-11-26 11:51:08,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:51:08,448 INFO L225 Difference]: With dead ends: 46 [2023-11-26 11:51:08,449 INFO L226 Difference]: Without dead ends: 29 [2023-11-26 11:51:08,449 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2023-11-26 11:51:08,451 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 15 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-26 11:51:08,451 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 35 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-26 11:51:08,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-11-26 11:51:08,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2023-11-26 11:51:08,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-26 11:51:08,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2023-11-26 11:51:08,461 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 29 [2023-11-26 11:51:08,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:51:08,462 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2023-11-26 11:51:08,462 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-26 11:51:08,463 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2023-11-26 11:51:08,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-11-26 11:51:08,466 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:51:08,466 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:51:08,479 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_236090ff-e4ca-496c-a63a-c6269e01657e/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-26 11:51:08,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_236090ff-e4ca-496c-a63a-c6269e01657e/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 11:51:08,674 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:51:08,675 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:51:08,675 INFO L85 PathProgramCache]: Analyzing trace with hash -1612143606, now seen corresponding path program 3 times [2023-11-26 11:51:08,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:51:08,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490048649] [2023-11-26 11:51:08,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:51:08,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:51:08,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:08,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-26 11:51:08,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:08,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-26 11:51:08,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:08,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-26 11:51:08,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:08,834 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-11-26 11:51:08,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:51:08,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490048649] [2023-11-26 11:51:08,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490048649] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-26 11:51:08,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1137447590] [2023-11-26 11:51:08,835 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-26 11:51:08,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 11:51:08,835 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_236090ff-e4ca-496c-a63a-c6269e01657e/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 11:51:08,836 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_236090ff-e4ca-496c-a63a-c6269e01657e/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-26 11:51:08,852 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_236090ff-e4ca-496c-a63a-c6269e01657e/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-26 11:51:09,184 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-11-26 11:51:09,185 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-26 11:51:09,187 INFO L262 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-26 11:51:09,190 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 11:51:09,213 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-26 11:51:09,213 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-26 11:51:09,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1137447590] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:51:09,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-26 11:51:09,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2023-11-26 11:51:09,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937893188] [2023-11-26 11:51:09,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:51:09,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-26 11:51:09,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:51:09,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-26 11:51:09,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-26 11:51:09,216 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-26 11:51:09,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:51:09,241 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2023-11-26 11:51:09,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-26 11:51:09,247 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 34 [2023-11-26 11:51:09,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:51:09,247 INFO L225 Difference]: With dead ends: 32 [2023-11-26 11:51:09,247 INFO L226 Difference]: Without dead ends: 0 [2023-11-26 11:51:09,250 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-26 11:51:09,253 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 1 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-26 11:51:09,253 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 19 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-26 11:51:09,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-26 11:51:09,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-26 11:51:09,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:51:09,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-26 11:51:09,255 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 34 [2023-11-26 11:51:09,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:51:09,255 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-26 11:51:09,255 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-26 11:51:09,255 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-26 11:51:09,255 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-26 11:51:09,258 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-26 11:51:09,266 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_236090ff-e4ca-496c-a63a-c6269e01657e/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-26 11:51:09,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_236090ff-e4ca-496c-a63a-c6269e01657e/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 11:51:09,461 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-26 11:51:09,807 INFO L899 garLoopResultBuilder]: For program point L601(lines 601 613) no Hoare annotation was computed. [2023-11-26 11:51:09,807 INFO L895 garLoopResultBuilder]: At program point L589(line 589) the Hoare annotation is: (and (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (<= |ULTIMATE.start_dll_circular_create_~len#1| 2) (= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|)) [2023-11-26 11:51:09,807 INFO L899 garLoopResultBuilder]: For program point L589-1(line 589) no Hoare annotation was computed. [2023-11-26 11:51:09,807 INFO L899 garLoopResultBuilder]: For program point main_returnLabel#1(lines 614 629) no Hoare annotation was computed. [2023-11-26 11:51:09,807 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 627) no Hoare annotation was computed. [2023-11-26 11:51:09,807 INFO L899 garLoopResultBuilder]: For program point L623(lines 623 625) no Hoare annotation was computed. [2023-11-26 11:51:09,808 INFO L895 garLoopResultBuilder]: At program point L586(line 586) the Hoare annotation is: (and (= 2 |ULTIMATE.start_dll_circular_create_~len#1|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2)) [2023-11-26 11:51:09,808 INFO L899 garLoopResultBuilder]: For program point L586-1(line 586) no Hoare annotation was computed. [2023-11-26 11:51:09,808 INFO L895 garLoopResultBuilder]: At program point L619-2(lines 619 622) the Hoare annotation is: (let ((.cse10 (select (select |#memory_$Pointer$#2.base| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse14 (select |#memory_$Pointer$#1.base| .cse10))) (let ((.cse13 (select |#memory_$Pointer$#1.offset| .cse10)) (.cse12 (select .cse14 4))) (let ((.cse1 (= .cse12 (select .cse14 0))) (.cse2 (select .cse13 0)) (.cse3 (select .cse13 4)) (.cse0 (= (select (select |#memory_$Pointer$#2.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0)) (.cse4 (= |ULTIMATE.start_main_~#s~0#1.offset| 0)) (.cse5 (= |ULTIMATE.start_main_~len~0#1| 2))) (or (and (= |ULTIMATE.start_main_~i~0#1| 1) .cse0 .cse1 (= .cse2 .cse3) .cse4 .cse5 (exists ((v_arrayElimCell_27 Int) (v_arrayElimCell_26 Int)) (let ((.cse11 (select |#memory_$Pointer$#1.base| v_arrayElimCell_26)) (.cse9 (+ 4 v_arrayElimCell_27))) (let ((.cse6 (select |#memory_$Pointer$#1.offset| v_arrayElimCell_26)) (.cse8 (select .cse11 .cse9)) (.cse7 (select .cse11 v_arrayElimCell_27))) (and (= (select .cse6 v_arrayElimCell_27) 0) (= .cse7 .cse8) (= 0 (select (select |#memory_$Pointer$#1.offset| .cse7) 0)) (= (select .cse6 .cse9) 0) (not (= v_arrayElimCell_26 .cse8)) (= .cse7 (select (select |#memory_$Pointer$#1.base| .cse8) 0)) (= .cse7 .cse10)))))) (and (= |ULTIMATE.start_main_~i~0#1| 0) .cse0 .cse1 (= .cse2 0) .cse4 .cse5 (= .cse3 0) (not (= .cse10 .cse12)) (= (select (select |#memory_$Pointer$#1.base| .cse12) 0) .cse10)) (and .cse0 (<= 2 |ULTIMATE.start_main_~i~0#1|) .cse4 .cse5 (= .cse10 0))))))) [2023-11-26 11:51:09,809 INFO L899 garLoopResultBuilder]: For program point L619-3(lines 619 622) no Hoare annotation was computed. [2023-11-26 11:51:09,809 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-26 11:51:09,809 INFO L899 garLoopResultBuilder]: For program point L603(lines 603 612) no Hoare annotation was computed. [2023-11-26 11:51:09,809 INFO L899 garLoopResultBuilder]: For program point L591(lines 591 593) no Hoare annotation was computed. [2023-11-26 11:51:09,809 INFO L899 garLoopResultBuilder]: For program point L591-2(lines 591 593) no Hoare annotation was computed. [2023-11-26 11:51:09,809 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-26 11:51:09,809 INFO L899 garLoopResultBuilder]: For program point main_ERROR#1(lines 614 629) no Hoare annotation was computed. [2023-11-26 11:51:09,810 INFO L895 garLoopResultBuilder]: At program point L588-2(lines 588 596) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0)) (.cse1 (= |ULTIMATE.start_main_~#s~0#1.offset| 0)) (.cse2 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse3 (= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0)) (.cse4 (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (or (and .cse0 (= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= 2 |ULTIMATE.start_dll_circular_create_~len#1|) .cse1 .cse2 .cse3 .cse4) (and .cse0 (= (select (select |#memory_$Pointer$#1.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= (select (select |#memory_$Pointer$#1.offset| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) 0) .cse1 .cse2 .cse3 (<= |ULTIMATE.start_dll_circular_create_~len#1| 1) (not .cse4)))) [2023-11-26 11:51:09,810 INFO L899 garLoopResultBuilder]: For program point L588-3(lines 588 596) no Hoare annotation was computed. [2023-11-26 11:51:09,810 INFO L899 garLoopResultBuilder]: For program point L577(lines 577 579) no Hoare annotation was computed. [2023-11-26 11:51:09,810 INFO L899 garLoopResultBuilder]: For program point L573(line 573) no Hoare annotation was computed. [2023-11-26 11:51:09,810 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 575 584) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |old(#memory_$Pointer$#1.base)| |#memory_$Pointer$#1.base|) (= |#memory_int#1| |old(#memory_int#1)|) (= |old(#memory_$Pointer$#1.offset)| |#memory_$Pointer$#1.offset|) (= |old(#valid)| |#valid|)) [2023-11-26 11:51:09,810 INFO L899 garLoopResultBuilder]: For program point node_createEXIT(lines 575 584) no Hoare annotation was computed. [2023-11-26 11:51:09,814 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1] [2023-11-26 11:51:09,822 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-26 11:51:09,846 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.offset[~#s~0!base][0] could not be translated [2023-11-26 11:51:09,847 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#2.base[~#s~0!base][0]][4] could not be translated [2023-11-26 11:51:09,848 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#2.base[~#s~0!base][0]][0] could not be translated [2023-11-26 11:51:09,848 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[#memory_$Pointer$#2.base[~#s~0!base][0]][0] could not be translated [2023-11-26 11:51:09,848 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[#memory_$Pointer$#2.base[~#s~0!base][0]][4] could not be translated [2023-11-26 11:51:09,849 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_arrayElimCell_27 : int, v_arrayElimCell_26 : int :: (((((#memory_$Pointer$#1.offset[v_arrayElimCell_26][v_arrayElimCell_27] == 0 && #memory_$Pointer$#1.base[v_arrayElimCell_26][v_arrayElimCell_27] == #memory_$Pointer$#1.base[v_arrayElimCell_26][4 + v_arrayElimCell_27]) && 0 == #memory_$Pointer$#1.offset[#memory_$Pointer$#1.base[v_arrayElimCell_26][v_arrayElimCell_27]][0]) && #memory_$Pointer$#1.offset[v_arrayElimCell_26][4 + v_arrayElimCell_27] == 0) && !(v_arrayElimCell_26 == #memory_$Pointer$#1.base[v_arrayElimCell_26][4 + v_arrayElimCell_27])) && #memory_$Pointer$#1.base[v_arrayElimCell_26][v_arrayElimCell_27] == #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[v_arrayElimCell_26][4 + v_arrayElimCell_27]][0]) && #memory_$Pointer$#1.base[v_arrayElimCell_26][v_arrayElimCell_27] == #memory_$Pointer$#2.base[~#s~0!base][0]) could not be translated [2023-11-26 11:51:09,849 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.offset[~#s~0!base][0] could not be translated [2023-11-26 11:51:09,849 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#2.base[~#s~0!base][0]][4] could not be translated [2023-11-26 11:51:09,849 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#2.base[~#s~0!base][0]][0] could not be translated [2023-11-26 11:51:09,850 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[#memory_$Pointer$#2.base[~#s~0!base][0]][0] could not be translated [2023-11-26 11:51:09,850 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[#memory_$Pointer$#2.base[~#s~0!base][0]][4] could not be translated [2023-11-26 11:51:09,850 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[~#s~0!base][0] could not be translated [2023-11-26 11:51:09,851 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#2.base[~#s~0!base][0]][4] could not be translated [2023-11-26 11:51:09,851 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[#memory_$Pointer$#2.base[~#s~0!base][0]][4]][0] could not be translated [2023-11-26 11:51:09,851 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[~#s~0!base][0] could not be translated [2023-11-26 11:51:09,851 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.offset[~#s~0!base][0] could not be translated [2023-11-26 11:51:09,852 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[~#s~0!base][0] could not be translated [2023-11-26 11:51:09,854 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #valid[~head~0!base] could not be translated [2023-11-26 11:51:09,863 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~head~0!base][0] could not be translated [2023-11-26 11:51:09,863 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~head~0!base][0] could not be translated [2023-11-26 11:51:09,865 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 11:51:09 BoogieIcfgContainer [2023-11-26 11:51:09,865 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-26 11:51:09,866 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-26 11:51:09,866 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-26 11:51:09,866 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-26 11:51:09,867 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 11:50:54" (3/4) ... [2023-11-26 11:51:09,869 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-26 11:51:09,873 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure node_create [2023-11-26 11:51:09,880 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2023-11-26 11:51:09,881 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2023-11-26 11:51:09,881 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-26 11:51:09,881 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-26 11:51:09,999 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_236090ff-e4ca-496c-a63a-c6269e01657e/bin/uautomizer-verify-VRDe98Ueme/witness.graphml [2023-11-26 11:51:09,999 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_236090ff-e4ca-496c-a63a-c6269e01657e/bin/uautomizer-verify-VRDe98Ueme/witness.yml [2023-11-26 11:51:09,999 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-26 11:51:10,000 INFO L158 Benchmark]: Toolchain (without parser) took 17198.06ms. Allocated memory was 123.7MB in the beginning and 295.7MB in the end (delta: 172.0MB). Free memory was 78.8MB in the beginning and 223.2MB in the end (delta: -144.4MB). Peak memory consumption was 28.9MB. Max. memory is 16.1GB. [2023-11-26 11:51:10,000 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 123.7MB. Free memory is still 94.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-26 11:51:10,001 INFO L158 Benchmark]: CACSL2BoogieTranslator took 631.94ms. Allocated memory is still 123.7MB. Free memory was 78.8MB in the beginning and 59.9MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2023-11-26 11:51:10,001 INFO L158 Benchmark]: Boogie Procedure Inliner took 74.41ms. Allocated memory is still 123.7MB. Free memory was 59.9MB in the beginning and 57.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-26 11:51:10,003 INFO L158 Benchmark]: Boogie Preprocessor took 104.27ms. Allocated memory is still 123.7MB. Free memory was 57.8MB in the beginning and 54.9MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-26 11:51:10,003 INFO L158 Benchmark]: RCFGBuilder took 599.95ms. Allocated memory was 123.7MB in the beginning and 203.4MB in the end (delta: 79.7MB). Free memory was 54.9MB in the beginning and 164.3MB in the end (delta: -109.4MB). Peak memory consumption was 17.6MB. Max. memory is 16.1GB. [2023-11-26 11:51:10,004 INFO L158 Benchmark]: TraceAbstraction took 15645.09ms. Allocated memory was 203.4MB in the beginning and 295.7MB in the end (delta: 92.3MB). Free memory was 163.4MB in the beginning and 228.4MB in the end (delta: -65.1MB). Peak memory consumption was 28.1MB. Max. memory is 16.1GB. [2023-11-26 11:51:10,004 INFO L158 Benchmark]: Witness Printer took 133.69ms. Allocated memory is still 295.7MB. Free memory was 228.4MB in the beginning and 223.2MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-26 11:51:10,007 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.30ms. Allocated memory is still 123.7MB. Free memory is still 94.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 631.94ms. Allocated memory is still 123.7MB. Free memory was 78.8MB in the beginning and 59.9MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 74.41ms. Allocated memory is still 123.7MB. Free memory was 59.9MB in the beginning and 57.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 104.27ms. Allocated memory is still 123.7MB. Free memory was 57.8MB in the beginning and 54.9MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 599.95ms. Allocated memory was 123.7MB in the beginning and 203.4MB in the end (delta: 79.7MB). Free memory was 54.9MB in the beginning and 164.3MB in the end (delta: -109.4MB). Peak memory consumption was 17.6MB. Max. memory is 16.1GB. * TraceAbstraction took 15645.09ms. Allocated memory was 203.4MB in the beginning and 295.7MB in the end (delta: 92.3MB). Free memory was 163.4MB in the beginning and 228.4MB in the end (delta: -65.1MB). Peak memory consumption was 28.1MB. Max. memory is 16.1GB. * Witness Printer took 133.69ms. Allocated memory is still 295.7MB. Free memory was 228.4MB in the beginning and 223.2MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.offset[~#s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#2.base[~#s~0!base][0]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#2.base[~#s~0!base][0]][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[#memory_$Pointer$#2.base[~#s~0!base][0]][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[#memory_$Pointer$#2.base[~#s~0!base][0]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_arrayElimCell_27 : int, v_arrayElimCell_26 : int :: (((((#memory_$Pointer$#1.offset[v_arrayElimCell_26][v_arrayElimCell_27] == 0 && #memory_$Pointer$#1.base[v_arrayElimCell_26][v_arrayElimCell_27] == #memory_$Pointer$#1.base[v_arrayElimCell_26][4 + v_arrayElimCell_27]) && 0 == #memory_$Pointer$#1.offset[#memory_$Pointer$#1.base[v_arrayElimCell_26][v_arrayElimCell_27]][0]) && #memory_$Pointer$#1.offset[v_arrayElimCell_26][4 + v_arrayElimCell_27] == 0) && !(v_arrayElimCell_26 == #memory_$Pointer$#1.base[v_arrayElimCell_26][4 + v_arrayElimCell_27])) && #memory_$Pointer$#1.base[v_arrayElimCell_26][v_arrayElimCell_27] == #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[v_arrayElimCell_26][4 + v_arrayElimCell_27]][0]) && #memory_$Pointer$#1.base[v_arrayElimCell_26][v_arrayElimCell_27] == #memory_$Pointer$#2.base[~#s~0!base][0]) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.offset[~#s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#2.base[~#s~0!base][0]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#2.base[~#s~0!base][0]][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[#memory_$Pointer$#2.base[~#s~0!base][0]][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[#memory_$Pointer$#2.base[~#s~0!base][0]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[~#s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#2.base[~#s~0!base][0]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[#memory_$Pointer$#2.base[~#s~0!base][0]][4]][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[~#s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.offset[~#s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[~#s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #valid[~head~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~head~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~head~0!base][0] could not be translated * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 627]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 22 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 15.5s, OverallIterations: 9, TraceHistogramMax: 3, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 118 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 115 mSDsluCounter, 781 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 31 IncrementalHoareTripleChecker+Unchecked, 642 mSDsCounter, 25 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 956 IncrementalHoareTripleChecker+Invalid, 1012 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 25 mSolverCounterUnsat, 139 mSDtfsCounter, 956 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 299 GetRequests, 175 SyntacticMatches, 3 SemanticMatches, 121 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 628 ImplicationChecksByTransitivity, 3.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=35occurred in iteration=7, InterpolantAutomatonStates: 64, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 13 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 7 PreInvPairs, 13 NumberOfFragments, 362 HoareAnnotationTreeSize, 7 FomulaSimplifications, 135 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 5 FomulaSimplificationsInter, 61 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 9.0s InterpolantComputationTime, 346 NumberOfCodeBlocks, 337 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 379 ConstructedInterpolants, 8 QuantifiedInterpolants, 2502 SizeOfPredicates, 45 NumberOfNonLiveVariables, 1738 ConjunctsInSsa, 182 ConjunctsInUnsatCore, 16 InterpolantComputations, 6 PerfectInterpolantSequences, 120/147 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 619]: Loop Invariant Derived loop invariant: ((((i == 1) && (len == 2)) || ((i == 0) && (len == 2))) || ((2 <= i) && (len == 2))) - InvariantResult [Line: 588]: Loop Invariant Derived loop invariant: (((2 == len) && (len == 2)) || ((len == 2) && (len <= 1))) RESULT: Ultimate proved your program to be correct! [2023-11-26 11:51:10,043 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_236090ff-e4ca-496c-a63a-c6269e01657e/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (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