./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-simple/dll2c_insert_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47823c6b-fb08-4fab-877e-81796d5f37a8/bin/uautomizer-verify-VRDe98Ueme/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47823c6b-fb08-4fab-877e-81796d5f37a8/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_47823c6b-fb08-4fab-877e-81796d5f37a8/bin/uautomizer-verify-VRDe98Ueme/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47823c6b-fb08-4fab-877e-81796d5f37a8/bin/uautomizer-verify-VRDe98Ueme/config/AutomizerReach.xml -i ../../sv-benchmarks/c/list-simple/dll2c_insert_unequal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47823c6b-fb08-4fab-877e-81796d5f37a8/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_47823c6b-fb08-4fab-877e-81796d5f37a8/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 1b81f923e96224472f8219a473f794261ff02356a47c6b09b527f0fc600725a8 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-26 11:52:46,438 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-26 11:52:46,552 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47823c6b-fb08-4fab-877e-81796d5f37a8/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-26 11:52:46,560 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-26 11:52:46,561 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-26 11:52:46,604 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-26 11:52:46,605 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-26 11:52:46,606 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-26 11:52:46,607 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-26 11:52:46,612 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-26 11:52:46,613 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-26 11:52:46,614 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-26 11:52:46,615 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-26 11:52:46,617 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-26 11:52:46,617 INFO L153 SettingsManager]: * Use SBE=true [2023-11-26 11:52:46,618 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-26 11:52:46,618 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-26 11:52:46,619 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-26 11:52:46,619 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-26 11:52:46,620 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-26 11:52:46,620 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-26 11:52:46,621 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-26 11:52:46,621 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-26 11:52:46,622 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-26 11:52:46,622 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-26 11:52:46,623 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-26 11:52:46,623 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-26 11:52:46,624 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-26 11:52:46,625 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-26 11:52:46,625 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-26 11:52:46,627 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-26 11:52:46,627 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 11:52:46,628 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-26 11:52:46,628 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-26 11:52:46,628 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-26 11:52:46,628 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-26 11:52:46,629 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-26 11:52:46,629 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-26 11:52:46,629 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-26 11:52:46,630 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-26 11:52:46,630 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-26 11:52:46,630 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-26 11:52:46,631 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_47823c6b-fb08-4fab-877e-81796d5f37a8/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_47823c6b-fb08-4fab-877e-81796d5f37a8/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 -> 1b81f923e96224472f8219a473f794261ff02356a47c6b09b527f0fc600725a8 [2023-11-26 11:52:46,956 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-26 11:52:46,986 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-26 11:52:46,989 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-26 11:52:46,990 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-26 11:52:46,991 INFO L274 PluginConnector]: CDTParser initialized [2023-11-26 11:52:46,992 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47823c6b-fb08-4fab-877e-81796d5f37a8/bin/uautomizer-verify-VRDe98Ueme/../../sv-benchmarks/c/list-simple/dll2c_insert_unequal.i [2023-11-26 11:52:50,147 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-26 11:52:50,440 INFO L384 CDTParser]: Found 1 translation units. [2023-11-26 11:52:50,440 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47823c6b-fb08-4fab-877e-81796d5f37a8/sv-benchmarks/c/list-simple/dll2c_insert_unequal.i [2023-11-26 11:52:50,459 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47823c6b-fb08-4fab-877e-81796d5f37a8/bin/uautomizer-verify-VRDe98Ueme/data/1a6601e49/7efce173ba714a0f99e85b3b249b883b/FLAGc7cbcc4d3 [2023-11-26 11:52:50,478 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47823c6b-fb08-4fab-877e-81796d5f37a8/bin/uautomizer-verify-VRDe98Ueme/data/1a6601e49/7efce173ba714a0f99e85b3b249b883b [2023-11-26 11:52:50,484 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-26 11:52:50,486 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-26 11:52:50,490 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-26 11:52:50,491 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-26 11:52:50,496 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-26 11:52:50,497 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 11:52:50" (1/1) ... [2023-11-26 11:52:50,498 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b2443dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:52:50, skipping insertion in model container [2023-11-26 11:52:50,499 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 11:52:50" (1/1) ... [2023-11-26 11:52:50,573 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-26 11:52:50,939 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_47823c6b-fb08-4fab-877e-81796d5f37a8/sv-benchmarks/c/list-simple/dll2c_insert_unequal.i[25148,25161] [2023-11-26 11:52:50,944 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 11:52:50,954 INFO L202 MainTranslator]: Completed pre-run [2023-11-26 11:52:51,027 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_47823c6b-fb08-4fab-877e-81796d5f37a8/sv-benchmarks/c/list-simple/dll2c_insert_unequal.i[25148,25161] [2023-11-26 11:52:51,029 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 11:52:51,090 INFO L206 MainTranslator]: Completed translation [2023-11-26 11:52:51,091 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:52:51 WrapperNode [2023-11-26 11:52:51,091 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-26 11:52:51,092 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-26 11:52:51,111 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-26 11:52:51,111 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-26 11:52:51,119 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:52:51" (1/1) ... [2023-11-26 11:52:51,137 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:52:51" (1/1) ... [2023-11-26 11:52:51,167 INFO L138 Inliner]: procedures = 127, calls = 58, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 187 [2023-11-26 11:52:51,167 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-26 11:52:51,168 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-26 11:52:51,168 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-26 11:52:51,169 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-26 11:52:51,180 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:52:51" (1/1) ... [2023-11-26 11:52:51,181 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:52:51" (1/1) ... [2023-11-26 11:52:51,186 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:52:51" (1/1) ... [2023-11-26 11:52:51,211 INFO L175 MemorySlicer]: Split 40 memory accesses to 3 slices as follows [2, 26, 12]. 65 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 18 writes are split as follows [0, 17, 1]. [2023-11-26 11:52:51,211 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:52:51" (1/1) ... [2023-11-26 11:52:51,212 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:52:51" (1/1) ... [2023-11-26 11:52:51,224 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:52:51" (1/1) ... [2023-11-26 11:52:51,229 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:52:51" (1/1) ... [2023-11-26 11:52:51,231 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:52:51" (1/1) ... [2023-11-26 11:52:51,234 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:52:51" (1/1) ... [2023-11-26 11:52:51,239 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-26 11:52:51,240 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-26 11:52:51,240 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-26 11:52:51,240 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-26 11:52:51,241 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:52:51" (1/1) ... [2023-11-26 11:52:51,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 11:52:51,263 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47823c6b-fb08-4fab-877e-81796d5f37a8/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 11:52:51,274 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47823c6b-fb08-4fab-877e-81796d5f37a8/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:52:51,280 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47823c6b-fb08-4fab-877e-81796d5f37a8/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:52:51,311 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-26 11:52:51,311 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-26 11:52:51,311 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-11-26 11:52:51,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-26 11:52:51,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-26 11:52:51,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-26 11:52:51,312 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-11-26 11:52:51,312 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-11-26 11:52:51,313 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-26 11:52:51,313 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-26 11:52:51,313 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-26 11:52:51,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-26 11:52:51,314 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-26 11:52:51,314 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-11-26 11:52:51,314 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-26 11:52:51,314 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-26 11:52:51,314 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-11-26 11:52:51,315 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-26 11:52:51,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-11-26 11:52:51,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-11-26 11:52:51,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2023-11-26 11:52:51,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-26 11:52:51,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-26 11:52:51,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-26 11:52:51,316 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-26 11:52:51,316 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-26 11:52:51,481 INFO L241 CfgBuilder]: Building ICFG [2023-11-26 11:52:51,483 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-26 11:52:51,830 INFO L282 CfgBuilder]: Performing block encoding [2023-11-26 11:52:51,909 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-26 11:52:51,909 INFO L309 CfgBuilder]: Removed 5 assume(true) statements. [2023-11-26 11:52:51,909 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 11:52:51 BoogieIcfgContainer [2023-11-26 11:52:51,910 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-26 11:52:51,912 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-26 11:52:51,912 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-26 11:52:51,916 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-26 11:52:51,916 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 11:52:50" (1/3) ... [2023-11-26 11:52:51,917 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67ec7694 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 11:52:51, skipping insertion in model container [2023-11-26 11:52:51,917 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:52:51" (2/3) ... [2023-11-26 11:52:51,918 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67ec7694 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 11:52:51, skipping insertion in model container [2023-11-26 11:52:51,918 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 11:52:51" (3/3) ... [2023-11-26 11:52:51,919 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_insert_unequal.i [2023-11-26 11:52:51,939 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-26 11:52:51,940 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-26 11:52:51,987 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-26 11:52:51,993 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;@7e77720d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-26 11:52:51,993 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-26 11:52:51,997 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 31 states have (on average 1.6451612903225807) internal successors, (51), 32 states have internal predecessors, (51), 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:52:52,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-26 11:52:52,004 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:52:52,005 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:52:52,005 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:52:52,010 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:52:52,011 INFO L85 PathProgramCache]: Analyzing trace with hash -1280970562, now seen corresponding path program 1 times [2023-11-26 11:52:52,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:52:52,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397305138] [2023-11-26 11:52:52,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:52:52,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:52:52,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:52:52,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-26 11:52:52,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:52:52,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-26 11:52:52,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:52:52,507 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-26 11:52:52,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:52:52,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397305138] [2023-11-26 11:52:52,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397305138] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:52:52,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:52:52,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-26 11:52:52,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976145896] [2023-11-26 11:52:52,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:52:52,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:52:52,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:52:52,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:52:52,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:52:52,562 INFO L87 Difference]: Start difference. First operand has 37 states, 31 states have (on average 1.6451612903225807) internal successors, (51), 32 states have internal predecessors, (51), 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) Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 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:52:52,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:52:52,680 INFO L93 Difference]: Finished difference Result 66 states and 101 transitions. [2023-11-26 11:52:52,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:52:52,682 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 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) Word has length 19 [2023-11-26 11:52:52,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:52:52,688 INFO L225 Difference]: With dead ends: 66 [2023-11-26 11:52:52,688 INFO L226 Difference]: Without dead ends: 30 [2023-11-26 11:52:52,690 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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:52:52,693 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 0 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-26 11:52:52,694 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 71 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-26 11:52:52,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2023-11-26 11:52:52,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2023-11-26 11:52:52,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.4) internal successors, (35), 25 states have internal predecessors, (35), 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:52:52,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 41 transitions. [2023-11-26 11:52:52,735 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 41 transitions. Word has length 19 [2023-11-26 11:52:52,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:52:52,737 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 41 transitions. [2023-11-26 11:52:52,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 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:52:52,737 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 41 transitions. [2023-11-26 11:52:52,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-26 11:52:52,739 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:52:52,739 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:52:52,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-26 11:52:52,740 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:52:52,740 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:52:52,741 INFO L85 PathProgramCache]: Analyzing trace with hash -1761698767, now seen corresponding path program 1 times [2023-11-26 11:52:52,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:52:52,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813587568] [2023-11-26 11:52:52,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:52:52,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:52:52,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:52:52,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-26 11:52:52,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:52:52,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-26 11:52:52,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:52:53,012 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-26 11:52:53,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:52:53,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813587568] [2023-11-26 11:52:53,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813587568] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:52:53,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:52:53,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-26 11:52:53,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990456994] [2023-11-26 11:52:53,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:52:53,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-26 11:52:53,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:52:53,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-26 11:52:53,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-26 11:52:53,024 INFO L87 Difference]: Start difference. First operand 30 states and 41 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 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:52:53,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:52:53,131 INFO L93 Difference]: Finished difference Result 45 states and 62 transitions. [2023-11-26 11:52:53,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-26 11:52:53,132 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 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 19 [2023-11-26 11:52:53,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:52:53,134 INFO L225 Difference]: With dead ends: 45 [2023-11-26 11:52:53,134 INFO L226 Difference]: Without dead ends: 33 [2023-11-26 11:52:53,134 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 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:52:53,136 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 4 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-26 11:52:53,136 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 84 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-26 11:52:53,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2023-11-26 11:52:53,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2023-11-26 11:52:53,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 27 states have internal predecessors, (38), 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:52:53,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 44 transitions. [2023-11-26 11:52:53,144 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 44 transitions. Word has length 19 [2023-11-26 11:52:53,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:52:53,145 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 44 transitions. [2023-11-26 11:52:53,145 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 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:52:53,145 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 44 transitions. [2023-11-26 11:52:53,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-11-26 11:52:53,146 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:52:53,147 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:52:53,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-26 11:52:53,147 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:52:53,148 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:52:53,148 INFO L85 PathProgramCache]: Analyzing trace with hash -1537362706, now seen corresponding path program 1 times [2023-11-26 11:52:53,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:52:53,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698473126] [2023-11-26 11:52:53,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:52:53,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:52:53,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:52:53,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-26 11:52:53,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:52:53,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-26 11:52:53,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:52:53,367 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:52:53,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:52:53,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698473126] [2023-11-26 11:52:53,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698473126] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:52:53,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:52:53,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-26 11:52:53,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789826954] [2023-11-26 11:52:53,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:52:53,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-26 11:52:53,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:52:53,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-26 11:52:53,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-26 11:52:53,373 INFO L87 Difference]: Start difference. First operand 32 states and 44 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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:52:53,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:52:53,483 INFO L93 Difference]: Finished difference Result 57 states and 78 transitions. [2023-11-26 11:52:53,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-26 11:52:53,484 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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) Word has length 20 [2023-11-26 11:52:53,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:52:53,484 INFO L225 Difference]: With dead ends: 57 [2023-11-26 11:52:53,485 INFO L226 Difference]: Without dead ends: 33 [2023-11-26 11:52:53,485 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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:52:53,486 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 4 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-26 11:52:53,487 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 79 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-26 11:52:53,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2023-11-26 11:52:53,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2023-11-26 11:52:53,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 28 states have internal predecessors, (39), 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:52:53,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 45 transitions. [2023-11-26 11:52:53,494 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 45 transitions. Word has length 20 [2023-11-26 11:52:53,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:52:53,494 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 45 transitions. [2023-11-26 11:52:53,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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:52:53,495 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 45 transitions. [2023-11-26 11:52:53,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-26 11:52:53,496 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:52:53,496 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:52:53,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-26 11:52:53,496 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:52:53,497 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:52:53,497 INFO L85 PathProgramCache]: Analyzing trace with hash 434779626, now seen corresponding path program 1 times [2023-11-26 11:52:53,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:52:53,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167963284] [2023-11-26 11:52:53,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:52:53,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:52:53,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:52:56,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-26 11:52:56,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:52:56,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-26 11:52:56,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:52:56,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-26 11:52:56,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:52:57,182 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-26 11:52:57,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:52:57,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167963284] [2023-11-26 11:52:57,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167963284] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-26 11:52:57,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [900786465] [2023-11-26 11:52:57,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:52:57,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 11:52:57,184 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47823c6b-fb08-4fab-877e-81796d5f37a8/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 11:52:57,195 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47823c6b-fb08-4fab-877e-81796d5f37a8/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-26 11:52:57,203 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47823c6b-fb08-4fab-877e-81796d5f37a8/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-26 11:52:57,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:52:57,685 INFO L262 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 123 conjunts are in the unsatisfiable core [2023-11-26 11:52:57,697 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 11:52:57,834 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:52:58,110 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-26 11:52:58,225 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-26 11:52:58,227 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-11-26 11:52:58,341 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:52:58,352 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-26 11:52:58,469 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 16 treesize of output 11 [2023-11-26 11:52:58,484 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 16 treesize of output 11 [2023-11-26 11:52:58,751 INFO L349 Elim1Store]: treesize reduction 66, result has 14.3 percent of original size [2023-11-26 11:52:58,751 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 183 treesize of output 163 [2023-11-26 11:52:58,761 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-26 11:52:58,765 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 44 treesize of output 33 [2023-11-26 11:52:58,774 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 98 treesize of output 75 [2023-11-26 11:52:58,805 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 26 treesize of output 15 [2023-11-26 11:52:58,985 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-26 11:52:58,986 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 100 treesize of output 55 [2023-11-26 11:52:58,994 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2023-11-26 11:52:59,003 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 11 treesize of output 3 [2023-11-26 11:52:59,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-11-26 11:52:59,283 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-11-26 11:52:59,284 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 23 [2023-11-26 11:52:59,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-26 11:52:59,314 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2023-11-26 11:52:59,315 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 108 treesize of output 69 [2023-11-26 11:52:59,340 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-11-26 11:52:59,340 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2023-11-26 11:52:59,626 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 40 treesize of output 16 [2023-11-26 11:52:59,838 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 15 [2023-11-26 11:52:59,847 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 15 [2023-11-26 11:52:59,941 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-11-26 11:53:00,053 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:53:00,053 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-26 11:53:00,177 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_562 (Array Int Int)) (v_ArrVal_564 (Array Int Int)) (v_ArrVal_563 (Array Int Int))) (or (not (= v_ArrVal_564 (store (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| (select v_ArrVal_564 |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset|)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_564) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_563) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_562) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 8 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) is different from false [2023-11-26 11:53:00,240 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_562 (Array Int Int)) (v_ArrVal_564 (Array Int Int)) (v_ArrVal_563 (Array Int Int))) (or (not (= (store (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| (select v_ArrVal_564 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset|)) v_ArrVal_564)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_564) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_563) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset|) v_ArrVal_562) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 8 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) is different from false [2023-11-26 11:53:00,264 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_562 (Array Int Int)) (v_ArrVal_564 (Array Int Int)) (v_ArrVal_563 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (or (= (select (select (store (store (store |c_#memory_int#1| .cse0 v_ArrVal_564) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_563) (select (select |c_#memory_$Pointer$#1.base| .cse0) .cse1) v_ArrVal_562) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 8 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) |c_ULTIMATE.start_main_~data~0#1|) (not (= v_ArrVal_564 (store (select |c_#memory_int#1| .cse0) .cse1 (select v_ArrVal_564 .cse1))))))) is different from false [2023-11-26 11:53:00,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [900786465] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-26 11:53:00,495 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-26 11:53:00,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 24] total 43 [2023-11-26 11:53:00,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684901568] [2023-11-26 11:53:00,496 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-26 11:53:00,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2023-11-26 11:53:00,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:53:00,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2023-11-26 11:53:00,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=1925, Unknown=3, NotChecked=270, Total=2352 [2023-11-26 11:53:00,500 INFO L87 Difference]: Start difference. First operand 33 states and 45 transitions. Second operand has 43 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 33 states have internal predecessors, (42), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-26 11:53:04,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:53:04,255 INFO L93 Difference]: Finished difference Result 79 states and 109 transitions. [2023-11-26 11:53:04,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-11-26 11:53:04,262 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 33 states have internal predecessors, (42), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 28 [2023-11-26 11:53:04,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:53:04,263 INFO L225 Difference]: With dead ends: 79 [2023-11-26 11:53:04,264 INFO L226 Difference]: Without dead ends: 77 [2023-11-26 11:53:04,266 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1115 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=352, Invalid=4213, Unknown=3, NotChecked=402, Total=4970 [2023-11-26 11:53:04,267 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 108 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 1201 mSolverCounterSat, 54 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 1256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 1201 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2023-11-26 11:53:04,268 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 434 Invalid, 1256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 1201 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2023-11-26 11:53:04,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2023-11-26 11:53:04,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 41. [2023-11-26 11:53:04,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 35 states have (on average 1.3714285714285714) internal successors, (48), 35 states have internal predecessors, (48), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-26 11:53:04,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 54 transitions. [2023-11-26 11:53:04,300 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 54 transitions. Word has length 28 [2023-11-26 11:53:04,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:53:04,300 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 54 transitions. [2023-11-26 11:53:04,300 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 33 states have internal predecessors, (42), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-26 11:53:04,301 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 54 transitions. [2023-11-26 11:53:04,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-11-26 11:53:04,302 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:53:04,302 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:53:04,311 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47823c6b-fb08-4fab-877e-81796d5f37a8/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-11-26 11:53:04,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47823c6b-fb08-4fab-877e-81796d5f37a8/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 11:53:04,503 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:53:04,503 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:53:04,503 INFO L85 PathProgramCache]: Analyzing trace with hash 1828890171, now seen corresponding path program 1 times [2023-11-26 11:53:04,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:53:04,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975239721] [2023-11-26 11:53:04,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:53:04,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:53:04,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:53:04,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-26 11:53:04,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:53:04,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-26 11:53:04,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:53:04,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-26 11:53:04,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:53:04,730 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-26 11:53:04,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:53:04,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975239721] [2023-11-26 11:53:04,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975239721] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:53:04,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:53:04,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 11:53:04,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158917677] [2023-11-26 11:53:04,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:53:04,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-26 11:53:04,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:53:04,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-26 11:53:04,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-26 11:53:04,733 INFO L87 Difference]: Start difference. First operand 41 states and 54 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-26 11:53:04,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:53:04,833 INFO L93 Difference]: Finished difference Result 55 states and 73 transitions. [2023-11-26 11:53:04,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-26 11:53:04,833 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29 [2023-11-26 11:53:04,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:53:04,834 INFO L225 Difference]: With dead ends: 55 [2023-11-26 11:53:04,834 INFO L226 Difference]: Without dead ends: 40 [2023-11-26 11:53:04,835 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 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:53:04,836 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 27 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-26 11:53:04,836 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 86 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-26 11:53:04,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2023-11-26 11:53:04,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2023-11-26 11:53:04,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 34 states have (on average 1.3529411764705883) internal successors, (46), 34 states have internal predecessors, (46), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-26 11:53:04,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 52 transitions. [2023-11-26 11:53:04,845 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 52 transitions. Word has length 29 [2023-11-26 11:53:04,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:53:04,845 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 52 transitions. [2023-11-26 11:53:04,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-26 11:53:04,846 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 52 transitions. [2023-11-26 11:53:04,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-11-26 11:53:04,847 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:53:04,847 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:53:04,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-26 11:53:04,847 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:53:04,848 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:53:04,848 INFO L85 PathProgramCache]: Analyzing trace with hash 2128958037, now seen corresponding path program 2 times [2023-11-26 11:53:04,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:53:04,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263796288] [2023-11-26 11:53:04,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:53:04,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:53:04,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:53:05,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-26 11:53:05,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:53:05,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-26 11:53:05,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:53:05,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-26 11:53:05,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:53:05,102 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-26 11:53:05,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:53:05,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263796288] [2023-11-26 11:53:05,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263796288] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:53:05,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:53:05,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-26 11:53:05,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125228812] [2023-11-26 11:53:05,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:53:05,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 11:53:05,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:53:05,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 11:53:05,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-26 11:53:05,105 INFO L87 Difference]: Start difference. First operand 40 states and 52 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-26 11:53:05,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:53:05,189 INFO L93 Difference]: Finished difference Result 54 states and 71 transitions. [2023-11-26 11:53:05,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-26 11:53:05,190 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29 [2023-11-26 11:53:05,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:53:05,191 INFO L225 Difference]: With dead ends: 54 [2023-11-26 11:53:05,191 INFO L226 Difference]: Without dead ends: 38 [2023-11-26 11:53:05,191 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-11-26 11:53:05,192 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 38 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-26 11:53:05,192 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 80 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-26 11:53:05,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2023-11-26 11:53:05,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2023-11-26 11:53:05,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 32 states have (on average 1.28125) internal successors, (41), 32 states have internal predecessors, (41), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-26 11:53:05,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 47 transitions. [2023-11-26 11:53:05,202 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 47 transitions. Word has length 29 [2023-11-26 11:53:05,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:53:05,203 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 47 transitions. [2023-11-26 11:53:05,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-26 11:53:05,203 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 47 transitions. [2023-11-26 11:53:05,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-11-26 11:53:05,204 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:53:05,204 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:53:05,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-26 11:53:05,205 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:53:05,205 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:53:05,205 INFO L85 PathProgramCache]: Analyzing trace with hash -1486153936, now seen corresponding path program 1 times [2023-11-26 11:53:05,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:53:05,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331915669] [2023-11-26 11:53:05,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:53:05,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:53:05,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:53:05,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-26 11:53:05,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:53:05,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-26 11:53:05,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:53:05,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-26 11:53:05,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:53:05,617 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-26 11:53:05,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:53:05,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331915669] [2023-11-26 11:53:05,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331915669] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-26 11:53:05,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [981832277] [2023-11-26 11:53:05,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:53:05,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 11:53:05,622 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47823c6b-fb08-4fab-877e-81796d5f37a8/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 11:53:05,623 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47823c6b-fb08-4fab-877e-81796d5f37a8/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-26 11:53:05,657 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47823c6b-fb08-4fab-877e-81796d5f37a8/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-26 11:53:05,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:53:05,873 INFO L262 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 17 conjunts are in the unsatisfiable core [2023-11-26 11:53:05,878 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 11:53:05,957 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-26 11:53:05,957 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-26 11:53:06,058 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-26 11:53:06,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [981832277] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-26 11:53:06,058 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-26 11:53:06,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 5, 5] total 16 [2023-11-26 11:53:06,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358515107] [2023-11-26 11:53:06,058 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-26 11:53:06,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-26 11:53:06,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:53:06,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-26 11:53:06,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2023-11-26 11:53:06,062 INFO L87 Difference]: Start difference. First operand 38 states and 47 transitions. Second operand has 16 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-26 11:53:06,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:53:06,414 INFO L93 Difference]: Finished difference Result 73 states and 91 transitions. [2023-11-26 11:53:06,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-26 11:53:06,415 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 30 [2023-11-26 11:53:06,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:53:06,416 INFO L225 Difference]: With dead ends: 73 [2023-11-26 11:53:06,416 INFO L226 Difference]: Without dead ends: 39 [2023-11-26 11:53:06,416 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2023-11-26 11:53:06,417 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 12 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-26 11:53:06,418 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 324 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-26 11:53:06,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2023-11-26 11:53:06,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2023-11-26 11:53:06,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 31 states have internal predecessors, (38), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-26 11:53:06,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2023-11-26 11:53:06,427 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 46 transitions. Word has length 30 [2023-11-26 11:53:06,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:53:06,427 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 46 transitions. [2023-11-26 11:53:06,428 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-26 11:53:06,428 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2023-11-26 11:53:06,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-11-26 11:53:06,429 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:53:06,429 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:53:06,441 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47823c6b-fb08-4fab-877e-81796d5f37a8/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-26 11:53:06,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47823c6b-fb08-4fab-877e-81796d5f37a8/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 11:53:06,637 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:53:06,637 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:53:06,637 INFO L85 PathProgramCache]: Analyzing trace with hash -1022802718, now seen corresponding path program 1 times [2023-11-26 11:53:06,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:53:06,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17103081] [2023-11-26 11:53:06,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:53:06,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:53:06,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:53:09,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-26 11:53:09,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:53:09,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-26 11:53:09,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:53:09,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-26 11:53:09,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:53:09,638 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-26 11:53:09,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:53:09,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17103081] [2023-11-26 11:53:09,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17103081] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-26 11:53:09,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [853440039] [2023-11-26 11:53:09,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:53:09,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 11:53:09,639 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47823c6b-fb08-4fab-877e-81796d5f37a8/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 11:53:09,643 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47823c6b-fb08-4fab-877e-81796d5f37a8/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-26 11:53:09,666 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47823c6b-fb08-4fab-877e-81796d5f37a8/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-26 11:53:10,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:53:10,199 INFO L262 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 131 conjunts are in the unsatisfiable core [2023-11-26 11:53:10,206 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 11:53:10,241 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:53:10,444 WARN L854 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_8| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_8| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_8| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_8| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_8| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 1)) is different from false [2023-11-26 11:53:10,446 WARN L876 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_8| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_8| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_8| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_8| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_8| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 1)) is different from true [2023-11-26 11:53:10,478 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-26 11:53:10,485 WARN L854 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0)) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_8| (Array Int Int))) (and (= 0 (select |v_old(#valid)_AFTER_CALL_8| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_8| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_8| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_8| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1)))) is different from false [2023-11-26 11:53:10,488 WARN L876 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0)) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_8| (Array Int Int))) (and (= 0 (select |v_old(#valid)_AFTER_CALL_8| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_8| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_8| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_8| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1)))) is different from true [2023-11-26 11:53:10,521 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-26 11:53:10,521 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2023-11-26 11:53:10,529 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 5 treesize of output 3 [2023-11-26 11:53:10,539 WARN L854 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0)) (= |c_ULTIMATE.start_dll_circular_create_~last~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| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_8| (Array Int Int))) (and (= 0 (select |v_old(#valid)_AFTER_CALL_8| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_8| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_8| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_8| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1)))) is different from false [2023-11-26 11:53:10,542 WARN L876 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0)) (= |c_ULTIMATE.start_dll_circular_create_~last~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| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_8| (Array Int Int))) (and (= 0 (select |v_old(#valid)_AFTER_CALL_8| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_8| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_8| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_8| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1)))) is different from true [2023-11-26 11:53:10,573 WARN L854 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (exists ((|v_old(#valid)_AFTER_CALL_8| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_8| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_8| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_8| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_8| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1)) is different from false [2023-11-26 11:53:10,576 WARN L876 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (exists ((|v_old(#valid)_AFTER_CALL_8| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_8| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_8| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_8| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_8| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1)) is different from true [2023-11-26 11:53:10,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-26 11:53:10,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-26 11:53:10,643 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 50 treesize of output 39 [2023-11-26 11:53:10,651 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 34 treesize of output 23 [2023-11-26 11:53:10,677 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (select |c_#valid| .cse0) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~uneq~0#1| |c_ULTIMATE.start_dll_circular_insert_~data#1|) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_8| (Array Int Int))) (and (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_8| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_8| .cse1 (select |c_#valid| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_8| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_8| (select (select |c_#memory_$Pointer$#1.base| .cse0) 0)) 1))))) is different from false [2023-11-26 11:53:10,679 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (select |c_#valid| .cse0) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~uneq~0#1| |c_ULTIMATE.start_dll_circular_insert_~data#1|) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_8| (Array Int Int))) (and (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_8| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_8| .cse1 (select |c_#valid| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_8| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_8| (select (select |c_#memory_$Pointer$#1.base| .cse0) 0)) 1))))) is different from true [2023-11-26 11:53:10,693 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 13 treesize of output 5 [2023-11-26 11:53:10,713 WARN L854 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (exists ((v_arrayElimCell_30 Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2| Int) (|v_old(#valid)_AFTER_CALL_8| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2|) 0))) (and (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_8| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_8| .cse0 (select |v_#valid_BEFORE_CALL_7| .cse0))) |v_#valid_BEFORE_CALL_7|) (= (select |v_old(#valid)_AFTER_CALL_8| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_8| v_arrayElimCell_30) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2|) 0) 0)))) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) is different from false [2023-11-26 11:53:10,716 WARN L876 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (exists ((v_arrayElimCell_30 Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2| Int) (|v_old(#valid)_AFTER_CALL_8| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2|) 0))) (and (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_8| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_8| .cse0 (select |v_#valid_BEFORE_CALL_7| .cse0))) |v_#valid_BEFORE_CALL_7|) (= (select |v_old(#valid)_AFTER_CALL_8| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_8| v_arrayElimCell_30) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2|) 0) 0)))) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) is different from true [2023-11-26 11:53:10,752 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_30 Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2| Int) (|v_old(#valid)_AFTER_CALL_8| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2|) 0))) (and (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_8| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_8| .cse0 (select |v_#valid_BEFORE_CALL_7| .cse0))) |v_#valid_BEFORE_CALL_7|) (= (select |v_old(#valid)_AFTER_CALL_8| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_8| v_arrayElimCell_30) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2|) 0) 0)))) (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_node_create_~temp~0#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) is different from false [2023-11-26 11:53:10,755 WARN L876 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_30 Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2| Int) (|v_old(#valid)_AFTER_CALL_8| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2|) 0))) (and (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_8| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_8| .cse0 (select |v_#valid_BEFORE_CALL_7| .cse0))) |v_#valid_BEFORE_CALL_7|) (= (select |v_old(#valid)_AFTER_CALL_8| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_8| v_arrayElimCell_30) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2|) 0) 0)))) (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_node_create_~temp~0#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) is different from true [2023-11-26 11:53:10,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-26 11:53:10,798 WARN L854 $PredicateComparison]: unable to prove that (and (= |c_node_create_#res#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= |c_node_create_#in~data#1| (select (select |c_#memory_int#1| |c_node_create_#res#1.base|) 8)) (exists ((v_arrayElimCell_30 Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2| Int) (|v_old(#valid)_AFTER_CALL_8| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2|) 0))) (and (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_8| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_8| .cse0 (select |v_#valid_BEFORE_CALL_7| .cse0))) |v_#valid_BEFORE_CALL_7|) (= (select |v_old(#valid)_AFTER_CALL_8| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_8| v_arrayElimCell_30) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2|) 0) 0)))) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#1.base| |c_node_create_#res#1.base|)))) is different from false [2023-11-26 11:53:10,800 WARN L876 $PredicateComparison]: unable to prove that (and (= |c_node_create_#res#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= |c_node_create_#in~data#1| (select (select |c_#memory_int#1| |c_node_create_#res#1.base|) 8)) (exists ((v_arrayElimCell_30 Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2| Int) (|v_old(#valid)_AFTER_CALL_8| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2|) 0))) (and (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_8| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_8| .cse0 (select |v_#valid_BEFORE_CALL_7| .cse0))) |v_#valid_BEFORE_CALL_7|) (= (select |v_old(#valid)_AFTER_CALL_8| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_8| v_arrayElimCell_30) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2|) 0) 0)))) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#1.base| |c_node_create_#res#1.base|)))) is different from true [2023-11-26 11:53:10,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-26 11:53:10,863 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 22 treesize of output 17 [2023-11-26 11:53:10,899 WARN L854 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_8| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_9| |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) 0) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_8| |v_old(#valid)_AFTER_CALL_9|))) (store |v_old(#valid)_AFTER_CALL_8| .cse0 (select |v_old(#valid)_AFTER_CALL_9| .cse0))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_old(#valid)_AFTER_CALL_9| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_8| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_8| (select (select |c_#memory_$Pointer$#1.base| .cse1) 0)) 1)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) 8)) (= |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((v_arrayElimCell_30 Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_10| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2| Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_10| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_10| v_arrayElimCell_30) 1) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_10| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_10| .cse3 (select |v_#valid_BEFORE_CALL_7| .cse3))) |v_#valid_BEFORE_CALL_7|) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2|) 0) 0)))) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.offset| 0)) is different from false [2023-11-26 11:53:10,903 WARN L876 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_8| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_9| |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) 0) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_8| |v_old(#valid)_AFTER_CALL_9|))) (store |v_old(#valid)_AFTER_CALL_8| .cse0 (select |v_old(#valid)_AFTER_CALL_9| .cse0))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_old(#valid)_AFTER_CALL_9| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_8| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_8| (select (select |c_#memory_$Pointer$#1.base| .cse1) 0)) 1)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) 8)) (= |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((v_arrayElimCell_30 Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_10| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2| Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_10| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_10| v_arrayElimCell_30) 1) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_10| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_10| .cse3 (select |v_#valid_BEFORE_CALL_7| .cse3))) |v_#valid_BEFORE_CALL_7|) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2|) 0) 0)))) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.offset| 0)) is different from true [2023-11-26 11:53:11,031 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_8| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_8| |v_old(#valid)_AFTER_CALL_9|))) (store |v_old(#valid)_AFTER_CALL_8| .cse0 (select |v_old(#valid)_AFTER_CALL_9| .cse0))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_old(#valid)_AFTER_CALL_9| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_9| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_8| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_8| (select (select |c_#memory_$Pointer$#1.base| .cse1) 0)) 1))) (exists ((v_arrayElimCell_30 Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_10| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2| Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_10| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_10| v_arrayElimCell_30) 1) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_10| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_10| .cse3 (select |v_#valid_BEFORE_CALL_7| .cse3))) |v_#valid_BEFORE_CALL_7|) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2|) 0) 0)))) (= .cse1 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 8)))) is different from false [2023-11-26 11:53:11,035 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_8| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_8| |v_old(#valid)_AFTER_CALL_9|))) (store |v_old(#valid)_AFTER_CALL_8| .cse0 (select |v_old(#valid)_AFTER_CALL_9| .cse0))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_old(#valid)_AFTER_CALL_9| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_9| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_8| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_8| (select (select |c_#memory_$Pointer$#1.base| .cse1) 0)) 1))) (exists ((v_arrayElimCell_30 Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_10| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2| Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_10| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_10| v_arrayElimCell_30) 1) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_10| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_10| .cse3 (select |v_#valid_BEFORE_CALL_7| .cse3))) |v_#valid_BEFORE_CALL_7|) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2|) 0) 0)))) (= .cse1 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 8)))) is different from true [2023-11-26 11:53:11,141 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| .cse0) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= .cse0 |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| .cse1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_8| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_8| |v_old(#valid)_AFTER_CALL_9|))) (store |v_old(#valid)_AFTER_CALL_8| .cse2 (select |v_old(#valid)_AFTER_CALL_9| .cse2))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_old(#valid)_AFTER_CALL_9| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_9| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_8| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_8| .cse1) 1))) (= |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| 0) (exists ((v_arrayElimCell_30 Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_10| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_10| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_10| v_arrayElimCell_30) 1) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_10| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_10| .cse4 (select |v_#valid_BEFORE_CALL_7| .cse4))) |v_#valid_BEFORE_CALL_7|) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2|) 0) 0)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 8))))) is different from false [2023-11-26 11:53:11,146 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| .cse0) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= .cse0 |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| .cse1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_8| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_8| |v_old(#valid)_AFTER_CALL_9|))) (store |v_old(#valid)_AFTER_CALL_8| .cse2 (select |v_old(#valid)_AFTER_CALL_9| .cse2))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_old(#valid)_AFTER_CALL_9| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_9| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_8| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_8| .cse1) 1))) (= |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| 0) (exists ((v_arrayElimCell_30 Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_10| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_10| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_10| v_arrayElimCell_30) 1) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_10| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_10| .cse4 (select |v_#valid_BEFORE_CALL_7| .cse4))) |v_#valid_BEFORE_CALL_7|) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2|) 0) 0)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 8))))) is different from true [2023-11-26 11:53:11,284 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 0 case distinctions, treesize of input 183 treesize of output 90 [2023-11-26 11:53:11,292 WARN L214 Elim1Store]: Array PQE input equivalent to false [2023-11-26 11:53:11,298 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 0 case distinctions, treesize of input 169 treesize of output 76 [2023-11-26 11:53:11,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-26 11:53:11,313 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-26 11:53:11,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-26 11:53:11,316 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 26 [2023-11-26 11:53:11,328 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 0 case distinctions, treesize of input 45 treesize of output 41 [2023-11-26 11:53:11,337 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 0 case distinctions, treesize of input 100 treesize of output 47 [2023-11-26 11:53:11,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-26 11:53:11,360 INFO L349 Elim1Store]: treesize reduction 56, result has 13.8 percent of original size [2023-11-26 11:53:11,360 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 127 treesize of output 70 [2023-11-26 11:53:11,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-26 11:53:11,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-26 11:53:11,372 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 15 [2023-11-26 11:53:11,402 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 19 [2023-11-26 11:53:11,425 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse2) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| .cse0) 8)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((v_arrayElimCell_35 Int) (|v_old(#valid)_AFTER_CALL_8| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_9| .cse0) 0) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_8| |v_old(#valid)_AFTER_CALL_9|))) (store |v_old(#valid)_AFTER_CALL_8| .cse1 (select |v_old(#valid)_AFTER_CALL_9| .cse1))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_old(#valid)_AFTER_CALL_9| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_8| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_8| v_arrayElimCell_35) 1))) (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 0) 0) (exists ((v_arrayElimCell_30 Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_10| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_10| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_10| v_arrayElimCell_30) 1) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_10| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_10| .cse4 (select |v_#valid_BEFORE_CALL_7| .cse4))) |v_#valid_BEFORE_CALL_7|) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2|) 0) 0))))))) is different from false [2023-11-26 11:53:11,430 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse2) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| .cse0) 8)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((v_arrayElimCell_35 Int) (|v_old(#valid)_AFTER_CALL_8| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_9| .cse0) 0) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_8| |v_old(#valid)_AFTER_CALL_9|))) (store |v_old(#valid)_AFTER_CALL_8| .cse1 (select |v_old(#valid)_AFTER_CALL_9| .cse1))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_old(#valid)_AFTER_CALL_9| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_8| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_8| v_arrayElimCell_35) 1))) (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 0) 0) (exists ((v_arrayElimCell_30 Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_10| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_10| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_10| v_arrayElimCell_30) 1) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_10| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_10| .cse4 (select |v_#valid_BEFORE_CALL_7| .cse4))) |v_#valid_BEFORE_CALL_7|) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2|) 0) 0))))))) is different from true [2023-11-26 11:53:11,471 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-26 11:53:11,472 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 83 treesize of output 59 [2023-11-26 11:53:11,610 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| .cse0) 8)) (exists ((v_arrayElimCell_35 Int) (|v_old(#valid)_AFTER_CALL_8| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_8| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_8| |v_old(#valid)_AFTER_CALL_9|))) (store |v_old(#valid)_AFTER_CALL_8| .cse1 (select |v_old(#valid)_AFTER_CALL_9| .cse1))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_old(#valid)_AFTER_CALL_9| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_9| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_8| v_arrayElimCell_35) 1))) (or (exists ((|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2| Int)) (and (not (= |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2|) 0) 0))) (and (exists ((v_arrayElimCell_30 Int) (|v_old(#valid)_AFTER_CALL_10| (Array Int Int)) (|v_#valid_BEFORE_CALL_7| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_7| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_10| v_arrayElimCell_30) 1) (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_10| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_10| .cse2 (select |v_#valid_BEFORE_CALL_7| .cse2))) |v_#valid_BEFORE_CALL_7|) (= (select |v_old(#valid)_AFTER_CALL_10| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0))) (exists ((|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2| Int)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2|) 0) 0)))))) is different from false [2023-11-26 11:53:11,614 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| .cse0) 8)) (exists ((v_arrayElimCell_35 Int) (|v_old(#valid)_AFTER_CALL_8| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_8| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_8| |v_old(#valid)_AFTER_CALL_9|))) (store |v_old(#valid)_AFTER_CALL_8| .cse1 (select |v_old(#valid)_AFTER_CALL_9| .cse1))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_old(#valid)_AFTER_CALL_9| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_9| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_8| v_arrayElimCell_35) 1))) (or (exists ((|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2| Int)) (and (not (= |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2|) 0) 0))) (and (exists ((v_arrayElimCell_30 Int) (|v_old(#valid)_AFTER_CALL_10| (Array Int Int)) (|v_#valid_BEFORE_CALL_7| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_7| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_10| v_arrayElimCell_30) 1) (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_10| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_10| .cse2 (select |v_#valid_BEFORE_CALL_7| .cse2))) |v_#valid_BEFORE_CALL_7|) (= (select |v_old(#valid)_AFTER_CALL_10| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0))) (exists ((|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2| Int)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2|) 0) 0)))))) is different from true [2023-11-26 11:53:11,745 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 28 treesize of output 16 [2023-11-26 11:53:11,790 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-26 11:53:11,790 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 68 [2023-11-26 11:53:11,807 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 7 treesize of output 3 [2023-11-26 11:53:11,919 WARN L854 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~ptr~0#1.base|) 8)) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_31| Int) (v_arrayElimCell_35 Int) (|v_old(#valid)_AFTER_CALL_8| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= 0 (select |v_old(#valid)_AFTER_CALL_9| |c_ULTIMATE.start_main_~ptr~0#1.base|)) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_8| |v_old(#valid)_AFTER_CALL_9|))) (store |v_old(#valid)_AFTER_CALL_8| .cse0 (select |v_old(#valid)_AFTER_CALL_9| .cse0))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_old(#valid)_AFTER_CALL_9| |v_ULTIMATE.start_main_~ptr~0#1.base_31|) 1) (= (select |v_old(#valid)_AFTER_CALL_8| |v_ULTIMATE.start_main_~ptr~0#1.base_31|) 0) (= (select |v_old(#valid)_AFTER_CALL_8| v_arrayElimCell_35) 1)))) is different from false [2023-11-26 11:53:11,921 WARN L876 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~ptr~0#1.base|) 8)) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_31| Int) (v_arrayElimCell_35 Int) (|v_old(#valid)_AFTER_CALL_8| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= 0 (select |v_old(#valid)_AFTER_CALL_9| |c_ULTIMATE.start_main_~ptr~0#1.base|)) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_8| |v_old(#valid)_AFTER_CALL_9|))) (store |v_old(#valid)_AFTER_CALL_8| .cse0 (select |v_old(#valid)_AFTER_CALL_9| .cse0))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_old(#valid)_AFTER_CALL_9| |v_ULTIMATE.start_main_~ptr~0#1.base_31|) 1) (= (select |v_old(#valid)_AFTER_CALL_8| |v_ULTIMATE.start_main_~ptr~0#1.base_31|) 0) (= (select |v_old(#valid)_AFTER_CALL_8| v_arrayElimCell_35) 1)))) is different from true [2023-11-26 11:53:11,979 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-11-26 11:53:11,990 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2023-11-26 11:53:11,990 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-26 11:53:12,142 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-26 11:53:12,143 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 83 treesize of output 84 [2023-11-26 11:53:12,157 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-26 11:53:12,158 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 320 treesize of output 323 [2023-11-26 11:53:12,173 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 152 treesize of output 146 [2023-11-26 11:53:12,187 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 294 treesize of output 282 [2023-11-26 11:53:12,608 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse6 (+ |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 4)) (.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|))) (.cse2 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse10 (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| .cse1))) (let ((.cse8 (or (forall ((v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1376 Int) (v_ArrVal_1375 Int) (v_ArrVal_1366 (Array Int Int)) (v_ArrVal_1364 (Array Int Int)) (v_arrayElimCell_49 Int) (v_ArrVal_1373 (Array Int Int))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (let ((.cse20 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1373))) (store .cse20 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse20 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse6 v_ArrVal_1376) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1375))) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1366) (select (select (store (store .cse7 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1368) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1364) .cse1) .cse2)) (+ 8 v_arrayElimCell_49)))) (not .cse10))) (.cse9 (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| .cse1))) (let ((.cse0 (and (or (and (or (forall ((v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1376 Int) (v_ArrVal_1375 Int) (v_ArrVal_1366 (Array Int Int)) (v_ArrVal_1364 (Array Int Int)) (v_ArrVal_1373 (Array Int Int)) (v_arrayElimCell_48 Int)) (= (select (select (store (let ((.cse15 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1373))) (store .cse15 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse15 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse6 v_ArrVal_1376) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1375))) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1366) (select (select (store (store .cse7 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1368) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1364) .cse1) .cse2)) (+ 8 v_arrayElimCell_48)) |c_ULTIMATE.start_main_~uneq~0#1|)) .cse9) (forall ((v_arrayElimCell_50 Int) (v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1376 Int) (v_ArrVal_1375 Int) (v_ArrVal_1366 (Array Int Int)) (v_ArrVal_1364 (Array Int Int)) (v_arrayElimCell_48 Int) (v_ArrVal_1373 (Array Int Int))) (let ((.cse16 (select (store (let ((.cse17 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1373))) (store .cse17 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse17 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse6 v_ArrVal_1376) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1375))) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1366) (select (select (store (store .cse7 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1368) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1364) .cse1) .cse2)))) (or (= (select .cse16 (+ 8 v_arrayElimCell_48)) |c_ULTIMATE.start_main_~uneq~0#1|) (= (select .cse16 (+ 8 v_arrayElimCell_50)) |c_ULTIMATE.start_main_~uneq~0#1|))))) .cse10) (or (and .cse8 (forall ((v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1376 Int) (v_ArrVal_1375 Int) (v_ArrVal_1366 (Array Int Int)) (v_ArrVal_1364 (Array Int Int)) (v_arrayElimCell_49 Int) (v_arrayElimCell_48 Int) (v_ArrVal_1373 (Array Int Int))) (let ((.cse18 (select (store (let ((.cse19 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1373))) (store .cse19 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse19 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse6 v_ArrVal_1376) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1375))) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1366) (select (select (store (store .cse7 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1368) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1364) .cse1) .cse2)))) (or (= (select .cse18 (+ 8 v_arrayElimCell_48)) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse18 (+ 8 v_arrayElimCell_49))))))) .cse9))) (.cse4 (+ |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 8))) (and (or .cse0 (= |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| .cse1)) (or .cse0 (= |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| .cse2)) (or (and (forall ((v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1376 Int) (v_ArrVal_1375 Int) (v_ArrVal_1366 (Array Int Int)) (v_ArrVal_1364 (Array Int Int)) (v_arrayElimCell_49 Int) (v_ArrVal_1373 (Array Int Int))) (let ((.cse3 (select (store (let ((.cse5 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1373))) (store .cse5 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse5 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse6 v_ArrVal_1376) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1375))) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1366) (select (select (store (store .cse7 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1368) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1364) .cse1) .cse2)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse3 .cse4)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse3 (+ 8 v_arrayElimCell_49)))))) .cse8) .cse9) (or .cse10 (and (forall ((v_arrayElimCell_50 Int) (v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1376 Int) (v_ArrVal_1375 Int) (v_ArrVal_1366 (Array Int Int)) (v_ArrVal_1364 (Array Int Int)) (v_ArrVal_1373 (Array Int Int))) (let ((.cse11 (select (store (let ((.cse12 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1373))) (store .cse12 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse12 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse6 v_ArrVal_1376) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1375))) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1366) (select (select (store (store .cse7 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1368) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1364) .cse1) .cse2)))) (or (= (select .cse11 (+ 8 v_arrayElimCell_50)) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse11 .cse4))))) (or (forall ((v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1376 Int) (v_ArrVal_1375 Int) (v_ArrVal_1366 (Array Int Int)) (v_ArrVal_1364 (Array Int Int)) (v_ArrVal_1373 (Array Int Int))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (let ((.cse13 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1373))) (store .cse13 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse13 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse6 v_ArrVal_1376) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1375))) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1366) (select (select (store (store .cse7 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1368) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1364) .cse1) .cse2)) .cse4))) .cse9))) (or (not .cse9) (forall ((v_arrayElimCell_50 Int) (v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1376 Int) (v_ArrVal_1375 Int) (v_ArrVal_1366 (Array Int Int)) (v_ArrVal_1364 (Array Int Int)) (v_ArrVal_1373 (Array Int Int))) (= (select (select (store (let ((.cse14 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1373))) (store .cse14 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse14 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse6 v_ArrVal_1376) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1375))) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1366) (select (select (store (store .cse7 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1368) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1364) .cse1) .cse2)) (+ 8 v_arrayElimCell_50)) |c_ULTIMATE.start_main_~uneq~0#1|)))))))) is different from false [2023-11-26 11:53:13,217 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse22 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|))) (let ((.cse6 (+ |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 4)) (.cse8 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store .cse22 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|))) (.cse7 (select .cse22 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| .cse1))) (let ((.cse12 (or (forall ((v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1376 Int) (v_ArrVal_1375 Int) (v_ArrVal_1366 (Array Int Int)) (v_ArrVal_1364 (Array Int Int)) (v_arrayElimCell_49 Int) (v_ArrVal_1373 (Array Int Int))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (let ((.cse21 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1373))) (store .cse21 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse21 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse6 v_ArrVal_1376) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1375))) .cse7 v_ArrVal_1366) (select (select (store (store .cse8 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1368) .cse7 v_ArrVal_1364) .cse1) .cse2)) (+ 8 v_arrayElimCell_49)))) (not .cse3))) (.cse4 (= .cse7 .cse1))) (let ((.cse0 (and (or .cse4 (and (forall ((v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1376 Int) (v_ArrVal_1375 Int) (v_ArrVal_1366 (Array Int Int)) (v_ArrVal_1364 (Array Int Int)) (v_arrayElimCell_49 Int) (v_arrayElimCell_48 Int) (v_ArrVal_1373 (Array Int Int))) (let ((.cse16 (select (store (let ((.cse17 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1373))) (store .cse17 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse17 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse6 v_ArrVal_1376) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1375))) .cse7 v_ArrVal_1366) (select (select (store (store .cse8 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1368) .cse7 v_ArrVal_1364) .cse1) .cse2)))) (or (= (select .cse16 (+ 8 v_arrayElimCell_48)) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse16 (+ 8 v_arrayElimCell_49)))))) .cse12)) (or .cse3 (and (forall ((v_arrayElimCell_50 Int) (v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1376 Int) (v_ArrVal_1375 Int) (v_ArrVal_1366 (Array Int Int)) (v_ArrVal_1364 (Array Int Int)) (v_arrayElimCell_48 Int) (v_ArrVal_1373 (Array Int Int))) (let ((.cse18 (select (store (let ((.cse19 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1373))) (store .cse19 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse19 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse6 v_ArrVal_1376) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1375))) .cse7 v_ArrVal_1366) (select (select (store (store .cse8 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1368) .cse7 v_ArrVal_1364) .cse1) .cse2)))) (or (= (select .cse18 (+ 8 v_arrayElimCell_48)) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse18 (+ 8 v_arrayElimCell_50)))))) (or .cse4 (forall ((v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1376 Int) (v_ArrVal_1375 Int) (v_ArrVal_1366 (Array Int Int)) (v_ArrVal_1364 (Array Int Int)) (v_ArrVal_1373 (Array Int Int)) (v_arrayElimCell_48 Int)) (= (select (select (store (let ((.cse20 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1373))) (store .cse20 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse20 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse6 v_ArrVal_1376) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1375))) .cse7 v_ArrVal_1366) (select (select (store (store .cse8 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1368) .cse7 v_ArrVal_1364) .cse1) .cse2)) (+ 8 v_arrayElimCell_48)) |c_ULTIMATE.start_main_~uneq~0#1|))))))) (.cse9 (+ |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 8))) (and (or .cse0 (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| .cse1)) (or .cse0 (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| .cse2)) (or .cse3 (and (or .cse4 (forall ((v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1376 Int) (v_ArrVal_1375 Int) (v_ArrVal_1366 (Array Int Int)) (v_ArrVal_1364 (Array Int Int)) (v_ArrVal_1373 (Array Int Int))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (let ((.cse5 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1373))) (store .cse5 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse5 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse6 v_ArrVal_1376) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1375))) .cse7 v_ArrVal_1366) (select (select (store (store .cse8 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1368) .cse7 v_ArrVal_1364) .cse1) .cse2)) .cse9)))) (forall ((v_arrayElimCell_50 Int) (v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1376 Int) (v_ArrVal_1375 Int) (v_ArrVal_1366 (Array Int Int)) (v_ArrVal_1364 (Array Int Int)) (v_ArrVal_1373 (Array Int Int))) (let ((.cse10 (select (store (let ((.cse11 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1373))) (store .cse11 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse11 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse6 v_ArrVal_1376) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1375))) .cse7 v_ArrVal_1366) (select (select (store (store .cse8 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1368) .cse7 v_ArrVal_1364) .cse1) .cse2)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse10 (+ 8 v_arrayElimCell_50))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse10 .cse9))))))) (or .cse4 (and .cse12 (forall ((v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1376 Int) (v_ArrVal_1375 Int) (v_ArrVal_1366 (Array Int Int)) (v_ArrVal_1364 (Array Int Int)) (v_arrayElimCell_49 Int) (v_ArrVal_1373 (Array Int Int))) (let ((.cse13 (select (store (let ((.cse14 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1373))) (store .cse14 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse14 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse6 v_ArrVal_1376) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1375))) .cse7 v_ArrVal_1366) (select (select (store (store .cse8 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1368) .cse7 v_ArrVal_1364) .cse1) .cse2)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse13 .cse9)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse13 (+ 8 v_arrayElimCell_49)))))))) (or (not .cse4) (forall ((v_arrayElimCell_50 Int) (v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1376 Int) (v_ArrVal_1375 Int) (v_ArrVal_1366 (Array Int Int)) (v_ArrVal_1364 (Array Int Int)) (v_ArrVal_1373 (Array Int Int))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (let ((.cse15 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1373))) (store .cse15 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse15 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse6 v_ArrVal_1376) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1375))) .cse7 v_ArrVal_1366) (select (select (store (store .cse8 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1368) .cse7 v_ArrVal_1364) .cse1) .cse2)) (+ 8 v_arrayElimCell_50)))))))))) is different from false [2023-11-26 11:53:13,570 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (let ((.cse8 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse24 (select |c_#memory_$Pointer$#1.base| .cse5)) (.cse11 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (let ((.cse4 (+ |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| 4)) (.cse7 (store |c_#memory_$Pointer$#1.base| .cse5 (store .cse24 .cse11 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|))) (.cse9 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse13 (= .cse8 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|)) (.cse6 (select .cse24 .cse11))) (let ((.cse0 (= .cse6 .cse8)) (.cse10 (or (forall ((v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1376 Int) (v_ArrVal_1375 Int) (v_ArrVal_1366 (Array Int Int)) (v_ArrVal_1364 (Array Int Int)) (v_arrayElimCell_49 Int) (v_ArrVal_1373 (Array Int Int))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (let ((.cse23 (store |c_#memory_int#1| .cse5 v_ArrVal_1373))) (store .cse23 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse23 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse4 v_ArrVal_1376) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_1375))) .cse6 v_ArrVal_1366) (select (select (store (store .cse7 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1368) .cse6 v_ArrVal_1364) .cse8) .cse9)) (+ 8 v_arrayElimCell_49)))) (not .cse13)))) (let ((.cse2 (+ |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| 8)) (.cse12 (and (or .cse13 (and (forall ((v_arrayElimCell_50 Int) (v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1376 Int) (v_ArrVal_1375 Int) (v_ArrVal_1366 (Array Int Int)) (v_ArrVal_1364 (Array Int Int)) (v_arrayElimCell_48 Int) (v_ArrVal_1373 (Array Int Int))) (let ((.cse18 (select (store (let ((.cse19 (store |c_#memory_int#1| .cse5 v_ArrVal_1373))) (store .cse19 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse19 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse4 v_ArrVal_1376) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_1375))) .cse6 v_ArrVal_1366) (select (select (store (store .cse7 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1368) .cse6 v_ArrVal_1364) .cse8) .cse9)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse18 (+ 8 v_arrayElimCell_50))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse18 (+ 8 v_arrayElimCell_48)))))) (or .cse0 (forall ((v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1376 Int) (v_ArrVal_1375 Int) (v_ArrVal_1366 (Array Int Int)) (v_ArrVal_1364 (Array Int Int)) (v_ArrVal_1373 (Array Int Int)) (v_arrayElimCell_48 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (let ((.cse20 (store |c_#memory_int#1| .cse5 v_ArrVal_1373))) (store .cse20 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse20 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse4 v_ArrVal_1376) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_1375))) .cse6 v_ArrVal_1366) (select (select (store (store .cse7 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1368) .cse6 v_ArrVal_1364) .cse8) .cse9)) (+ 8 v_arrayElimCell_48))))))) (or .cse0 (and (forall ((v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1376 Int) (v_ArrVal_1375 Int) (v_ArrVal_1366 (Array Int Int)) (v_ArrVal_1364 (Array Int Int)) (v_arrayElimCell_49 Int) (v_arrayElimCell_48 Int) (v_ArrVal_1373 (Array Int Int))) (let ((.cse21 (select (store (let ((.cse22 (store |c_#memory_int#1| .cse5 v_ArrVal_1373))) (store .cse22 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse22 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse4 v_ArrVal_1376) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_1375))) .cse6 v_ArrVal_1366) (select (select (store (store .cse7 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1368) .cse6 v_ArrVal_1364) .cse8) .cse9)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse21 (+ 8 v_arrayElimCell_49))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse21 (+ 8 v_arrayElimCell_48)))))) .cse10))))) (and (or .cse0 (and (forall ((v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1376 Int) (v_ArrVal_1375 Int) (v_ArrVal_1366 (Array Int Int)) (v_ArrVal_1364 (Array Int Int)) (v_arrayElimCell_49 Int) (v_ArrVal_1373 (Array Int Int))) (let ((.cse1 (select (store (let ((.cse3 (store |c_#memory_int#1| .cse5 v_ArrVal_1373))) (store .cse3 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse3 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse4 v_ArrVal_1376) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_1375))) .cse6 v_ArrVal_1366) (select (select (store (store .cse7 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1368) .cse6 v_ArrVal_1364) .cse8) .cse9)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse1 (+ 8 v_arrayElimCell_49))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse1 .cse2))))) .cse10)) (or (= .cse11 .cse9) .cse12) (or .cse13 (and (or .cse0 (forall ((v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1376 Int) (v_ArrVal_1375 Int) (v_ArrVal_1366 (Array Int Int)) (v_ArrVal_1364 (Array Int Int)) (v_ArrVal_1373 (Array Int Int))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (let ((.cse14 (store |c_#memory_int#1| .cse5 v_ArrVal_1373))) (store .cse14 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse14 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse4 v_ArrVal_1376) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_1375))) .cse6 v_ArrVal_1366) (select (select (store (store .cse7 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1368) .cse6 v_ArrVal_1364) .cse8) .cse9)) .cse2)))) (forall ((v_arrayElimCell_50 Int) (v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1376 Int) (v_ArrVal_1375 Int) (v_ArrVal_1366 (Array Int Int)) (v_ArrVal_1364 (Array Int Int)) (v_ArrVal_1373 (Array Int Int))) (let ((.cse15 (select (store (let ((.cse16 (store |c_#memory_int#1| .cse5 v_ArrVal_1373))) (store .cse16 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse16 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse4 v_ArrVal_1376) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_1375))) .cse6 v_ArrVal_1366) (select (select (store (store .cse7 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1368) .cse6 v_ArrVal_1364) .cse8) .cse9)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse15 (+ 8 v_arrayElimCell_50))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse15 .cse2))))))) (or (not .cse0) (forall ((v_arrayElimCell_50 Int) (v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1376 Int) (v_ArrVal_1375 Int) (v_ArrVal_1366 (Array Int Int)) (v_ArrVal_1364 (Array Int Int)) (v_ArrVal_1373 (Array Int Int))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (let ((.cse17 (store |c_#memory_int#1| .cse5 v_ArrVal_1373))) (store .cse17 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse17 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse4 v_ArrVal_1376) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_1375))) .cse6 v_ArrVal_1366) (select (select (store (store .cse7 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1368) .cse6 v_ArrVal_1364) .cse8) .cse9)) (+ 8 v_arrayElimCell_50))))) (or (= .cse5 .cse8) .cse12))))))) is different from false