./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ldv-sets/test_mutex_unlock_at_exit.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6497de01 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4336887-efc5-4c82-a8da-6cc2f8e77c5b/bin/uautomizer-verify-LYvppIcaGC/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4336887-efc5-4c82-a8da-6cc2f8e77c5b/bin/uautomizer-verify-LYvppIcaGC/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4336887-efc5-4c82-a8da-6cc2f8e77c5b/bin/uautomizer-verify-LYvppIcaGC/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4336887-efc5-4c82-a8da-6cc2f8e77c5b/bin/uautomizer-verify-LYvppIcaGC/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-sets/test_mutex_unlock_at_exit.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4336887-efc5-4c82-a8da-6cc2f8e77c5b/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4336887-efc5-4c82-a8da-6cc2f8e77c5b/bin/uautomizer-verify-LYvppIcaGC --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 fd310154a8f082280317f3bf1f868dbee13522304c8e13d29736e7fb8b36c7cf --- Real Ultimate output --- This is Ultimate 0.3.0-dev-6497de0 [2024-11-23 23:36:23,773 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-23 23:36:23,875 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4336887-efc5-4c82-a8da-6cc2f8e77c5b/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-23 23:36:23,884 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-23 23:36:23,886 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-23 23:36:23,920 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-23 23:36:23,921 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-23 23:36:23,921 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-23 23:36:23,922 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-23 23:36:23,923 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-23 23:36:23,924 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-23 23:36:23,924 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-23 23:36:23,924 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-23 23:36:23,925 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-23 23:36:23,925 INFO L153 SettingsManager]: * Use SBE=true [2024-11-23 23:36:23,925 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-23 23:36:23,926 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-23 23:36:23,926 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-23 23:36:23,926 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-23 23:36:23,926 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-23 23:36:23,927 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-23 23:36:23,927 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-23 23:36:23,927 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-23 23:36:23,927 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-23 23:36:23,927 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-23 23:36:23,927 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-23 23:36:23,927 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-23 23:36:23,927 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-23 23:36:23,928 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-23 23:36:23,928 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-23 23:36:23,929 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-23 23:36:23,929 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-23 23:36:23,929 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-23 23:36:23,929 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-23 23:36:23,929 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-23 23:36:23,929 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-23 23:36:23,930 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-23 23:36:23,930 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-23 23:36:23,930 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-23 23:36:23,930 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-23 23:36:23,930 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-23 23:36:23,930 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-23 23:36:23,930 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-23 23:36:23,930 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-23 23:36:23,930 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-23 23:36:23,930 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-23 23:36:23,931 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-23 23:36:23,931 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-23 23:36:23,931 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_d4336887-efc5-4c82-a8da-6cc2f8e77c5b/bin/uautomizer-verify-LYvppIcaGC 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 -> fd310154a8f082280317f3bf1f868dbee13522304c8e13d29736e7fb8b36c7cf [2024-11-23 23:36:24,261 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-23 23:36:24,275 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-23 23:36:24,281 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-23 23:36:24,283 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-23 23:36:24,283 INFO L274 PluginConnector]: CDTParser initialized [2024-11-23 23:36:24,285 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4336887-efc5-4c82-a8da-6cc2f8e77c5b/bin/uautomizer-verify-LYvppIcaGC/../../sv-benchmarks/c/ldv-sets/test_mutex_unlock_at_exit.i [2024-11-23 23:36:27,208 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4336887-efc5-4c82-a8da-6cc2f8e77c5b/bin/uautomizer-verify-LYvppIcaGC/data/a83356e3e/2915aa753070462a82e30978ee8ad90c/FLAG511c941b0 [2024-11-23 23:36:27,575 INFO L384 CDTParser]: Found 1 translation units. [2024-11-23 23:36:27,575 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4336887-efc5-4c82-a8da-6cc2f8e77c5b/sv-benchmarks/c/ldv-sets/test_mutex_unlock_at_exit.i [2024-11-23 23:36:27,597 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4336887-efc5-4c82-a8da-6cc2f8e77c5b/bin/uautomizer-verify-LYvppIcaGC/data/a83356e3e/2915aa753070462a82e30978ee8ad90c/FLAG511c941b0 [2024-11-23 23:36:27,623 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4336887-efc5-4c82-a8da-6cc2f8e77c5b/bin/uautomizer-verify-LYvppIcaGC/data/a83356e3e/2915aa753070462a82e30978ee8ad90c [2024-11-23 23:36:27,626 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-23 23:36:27,628 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-23 23:36:27,630 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-23 23:36:27,631 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-23 23:36:27,636 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-23 23:36:27,640 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:36:27" (1/1) ... [2024-11-23 23:36:27,641 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b8ec58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:36:27, skipping insertion in model container [2024-11-23 23:36:27,642 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:36:27" (1/1) ... [2024-11-23 23:36:27,685 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-23 23:36:28,136 WARN L250 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_d4336887-efc5-4c82-a8da-6cc2f8e77c5b/sv-benchmarks/c/ldv-sets/test_mutex_unlock_at_exit.i[25842,25855] [2024-11-23 23:36:28,141 WARN L250 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_d4336887-efc5-4c82-a8da-6cc2f8e77c5b/sv-benchmarks/c/ldv-sets/test_mutex_unlock_at_exit.i[25967,25980] [2024-11-23 23:36:28,144 WARN L250 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_d4336887-efc5-4c82-a8da-6cc2f8e77c5b/sv-benchmarks/c/ldv-sets/test_mutex_unlock_at_exit.i[26082,26095] [2024-11-23 23:36:28,147 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-23 23:36:28,160 INFO L200 MainTranslator]: Completed pre-run [2024-11-23 23:36:28,217 WARN L250 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_d4336887-efc5-4c82-a8da-6cc2f8e77c5b/sv-benchmarks/c/ldv-sets/test_mutex_unlock_at_exit.i[25842,25855] [2024-11-23 23:36:28,218 WARN L250 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_d4336887-efc5-4c82-a8da-6cc2f8e77c5b/sv-benchmarks/c/ldv-sets/test_mutex_unlock_at_exit.i[25967,25980] [2024-11-23 23:36:28,219 WARN L250 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_d4336887-efc5-4c82-a8da-6cc2f8e77c5b/sv-benchmarks/c/ldv-sets/test_mutex_unlock_at_exit.i[26082,26095] [2024-11-23 23:36:28,220 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-23 23:36:28,251 INFO L204 MainTranslator]: Completed translation [2024-11-23 23:36:28,252 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:36:28 WrapperNode [2024-11-23 23:36:28,254 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-23 23:36:28,256 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-23 23:36:28,256 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-23 23:36:28,256 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-23 23:36:28,264 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:36:28" (1/1) ... [2024-11-23 23:36:28,285 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:36:28" (1/1) ... [2024-11-23 23:36:28,322 INFO L138 Inliner]: procedures = 139, calls = 56, calls flagged for inlining = 15, calls inlined = 14, statements flattened = 138 [2024-11-23 23:36:28,323 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-23 23:36:28,324 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-23 23:36:28,324 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-23 23:36:28,324 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-23 23:36:28,334 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:36:28" (1/1) ... [2024-11-23 23:36:28,335 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:36:28" (1/1) ... [2024-11-23 23:36:28,340 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:36:28" (1/1) ... [2024-11-23 23:36:28,395 INFO L175 MemorySlicer]: Split 22 memory accesses to 2 slices as follows [2, 20]. 91 percent of accesses are in the largest equivalence class. The 4 initializations are split as follows [2, 2]. The 7 writes are split as follows [0, 7]. [2024-11-23 23:36:28,395 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:36:28" (1/1) ... [2024-11-23 23:36:28,395 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:36:28" (1/1) ... [2024-11-23 23:36:28,413 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:36:28" (1/1) ... [2024-11-23 23:36:28,414 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:36:28" (1/1) ... [2024-11-23 23:36:28,419 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:36:28" (1/1) ... [2024-11-23 23:36:28,425 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:36:28" (1/1) ... [2024-11-23 23:36:28,427 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:36:28" (1/1) ... [2024-11-23 23:36:28,433 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-23 23:36:28,434 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-23 23:36:28,434 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-23 23:36:28,434 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-23 23:36:28,435 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:36:28" (1/1) ... [2024-11-23 23:36:28,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-23 23:36:28,462 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4336887-efc5-4c82-a8da-6cc2f8e77c5b/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:36:28,479 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4336887-efc5-4c82-a8da-6cc2f8e77c5b/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-23 23:36:28,485 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4336887-efc5-4c82-a8da-6cc2f8e77c5b/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-23 23:36:28,519 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2024-11-23 23:36:28,519 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2024-11-23 23:36:28,519 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-23 23:36:28,519 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock [2024-11-23 23:36:28,520 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock [2024-11-23 23:36:28,520 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-23 23:36:28,520 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-23 23:36:28,520 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-23 23:36:28,520 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_in_set [2024-11-23 23:36:28,521 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_in_set [2024-11-23 23:36:28,521 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-23 23:36:28,521 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-23 23:36:28,521 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-23 23:36:28,521 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-23 23:36:28,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-23 23:36:28,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-23 23:36:28,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-23 23:36:28,522 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_successful_malloc [2024-11-23 23:36:28,522 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_successful_malloc [2024-11-23 23:36:28,522 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-23 23:36:28,523 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-23 23:36:28,723 INFO L234 CfgBuilder]: Building ICFG [2024-11-23 23:36:28,726 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-23 23:36:29,073 INFO L? ?]: Removed 77 outVars from TransFormulas that were not future-live. [2024-11-23 23:36:29,074 INFO L283 CfgBuilder]: Performing block encoding [2024-11-23 23:36:29,090 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-23 23:36:29,091 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-23 23:36:29,091 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:36:29 BoogieIcfgContainer [2024-11-23 23:36:29,091 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-23 23:36:29,094 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-23 23:36:29,094 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-23 23:36:29,100 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-23 23:36:29,100 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:36:27" (1/3) ... [2024-11-23 23:36:29,101 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51308f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:36:29, skipping insertion in model container [2024-11-23 23:36:29,101 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:36:28" (2/3) ... [2024-11-23 23:36:29,101 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51308f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:36:29, skipping insertion in model container [2024-11-23 23:36:29,101 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:36:29" (3/3) ... [2024-11-23 23:36:29,102 INFO L128 eAbstractionObserver]: Analyzing ICFG test_mutex_unlock_at_exit.i [2024-11-23 23:36:29,118 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-23 23:36:29,119 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG test_mutex_unlock_at_exit.i that has 5 procedures, 67 locations, 1 initial locations, 2 loop locations, and 3 error locations. [2024-11-23 23:36:29,181 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-23 23:36:29,195 INFO L333 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, 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;@4da793b5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-23 23:36:29,195 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-11-23 23:36:29,199 INFO L276 IsEmpty]: Start isEmpty. Operand has 67 states, 50 states have (on average 1.28) internal successors, (64), 53 states have internal predecessors, (64), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-23 23:36:29,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-23 23:36:29,206 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:36:29,207 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:36:29,207 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 23:36:29,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:36:29,213 INFO L85 PathProgramCache]: Analyzing trace with hash 2035133580, now seen corresponding path program 1 times [2024-11-23 23:36:29,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:36:29,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903601645] [2024-11-23 23:36:29,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:36:29,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:36:29,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:36:29,421 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-23 23:36:29,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:36:29,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903601645] [2024-11-23 23:36:29,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903601645] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 23:36:29,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [820605824] [2024-11-23 23:36:29,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:36:29,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:36:29,423 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4336887-efc5-4c82-a8da-6cc2f8e77c5b/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:36:29,428 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4336887-efc5-4c82-a8da-6cc2f8e77c5b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 23:36:29,430 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4336887-efc5-4c82-a8da-6cc2f8e77c5b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-23 23:36:29,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:36:29,609 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-23 23:36:29,616 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 23:36:29,629 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-23 23:36:29,629 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-23 23:36:29,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [820605824] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:36:29,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-23 23:36:29,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-23 23:36:29,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100581342] [2024-11-23 23:36:29,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:36:29,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-23 23:36:29,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:36:29,664 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-23 23:36:29,665 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-23 23:36:29,667 INFO L87 Difference]: Start difference. First operand has 67 states, 50 states have (on average 1.28) internal successors, (64), 53 states have internal predecessors, (64), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-23 23:36:29,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:36:29,699 INFO L93 Difference]: Finished difference Result 130 states and 167 transitions. [2024-11-23 23:36:29,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-23 23:36:29,702 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 28 [2024-11-23 23:36:29,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:36:29,712 INFO L225 Difference]: With dead ends: 130 [2024-11-23 23:36:29,713 INFO L226 Difference]: Without dead ends: 62 [2024-11-23 23:36:29,719 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-23 23:36:29,724 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-23 23:36:29,725 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-23 23:36:29,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-11-23 23:36:29,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2024-11-23 23:36:29,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 46 states have (on average 1.1521739130434783) internal successors, (53), 48 states have internal predecessors, (53), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-23 23:36:29,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 71 transitions. [2024-11-23 23:36:29,772 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 71 transitions. Word has length 28 [2024-11-23 23:36:29,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:36:29,772 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 71 transitions. [2024-11-23 23:36:29,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-23 23:36:29,773 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 71 transitions. [2024-11-23 23:36:29,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-23 23:36:29,775 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:36:29,775 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:36:29,785 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4336887-efc5-4c82-a8da-6cc2f8e77c5b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-23 23:36:29,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4336887-efc5-4c82-a8da-6cc2f8e77c5b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-23 23:36:29,976 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 23:36:29,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:36:29,977 INFO L85 PathProgramCache]: Analyzing trace with hash -791373108, now seen corresponding path program 1 times [2024-11-23 23:36:29,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:36:29,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205771082] [2024-11-23 23:36:29,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:36:29,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:36:30,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:36:30,169 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-23 23:36:30,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:36:30,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205771082] [2024-11-23 23:36:30,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205771082] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:36:30,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:36:30,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-23 23:36:30,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321256038] [2024-11-23 23:36:30,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:36:30,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-23 23:36:30,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:36:30,171 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-23 23:36:30,171 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-23 23:36:30,171 INFO L87 Difference]: Start difference. First operand 62 states and 71 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-23 23:36:30,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:36:30,193 INFO L93 Difference]: Finished difference Result 68 states and 79 transitions. [2024-11-23 23:36:30,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-23 23:36:30,193 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 28 [2024-11-23 23:36:30,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:36:30,196 INFO L225 Difference]: With dead ends: 68 [2024-11-23 23:36:30,196 INFO L226 Difference]: Without dead ends: 66 [2024-11-23 23:36:30,196 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-23 23:36:30,197 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 0 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-23 23:36:30,197 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 204 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-23 23:36:30,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-11-23 23:36:30,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2024-11-23 23:36:30,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 49 states have (on average 1.1428571428571428) internal successors, (56), 51 states have internal predecessors, (56), 9 states have call successors, (9), 4 states have call predecessors, (9), 5 states have return successors, (12), 10 states have call predecessors, (12), 9 states have call successors, (12) [2024-11-23 23:36:30,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 77 transitions. [2024-11-23 23:36:30,214 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 77 transitions. Word has length 28 [2024-11-23 23:36:30,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:36:30,215 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 77 transitions. [2024-11-23 23:36:30,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-23 23:36:30,215 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 77 transitions. [2024-11-23 23:36:30,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-23 23:36:30,216 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:36:30,217 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:36:30,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-23 23:36:30,217 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 23:36:30,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:36:30,218 INFO L85 PathProgramCache]: Analyzing trace with hash -928676978, now seen corresponding path program 1 times [2024-11-23 23:36:30,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:36:30,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076408745] [2024-11-23 23:36:30,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:36:30,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:36:30,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:36:30,818 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-23 23:36:30,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:36:30,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076408745] [2024-11-23 23:36:30,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076408745] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:36:30,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:36:30,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-23 23:36:30,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968120283] [2024-11-23 23:36:30,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:36:30,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-23 23:36:30,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:36:30,822 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-23 23:36:30,824 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-23 23:36:30,824 INFO L87 Difference]: Start difference. First operand 66 states and 77 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-23 23:36:31,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:36:31,301 INFO L93 Difference]: Finished difference Result 186 states and 229 transitions. [2024-11-23 23:36:31,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-23 23:36:31,302 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 29 [2024-11-23 23:36:31,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:36:31,304 INFO L225 Difference]: With dead ends: 186 [2024-11-23 23:36:31,304 INFO L226 Difference]: Without dead ends: 128 [2024-11-23 23:36:31,305 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-23 23:36:31,306 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 73 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-23 23:36:31,306 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 193 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-23 23:36:31,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-11-23 23:36:31,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 97. [2024-11-23 23:36:31,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 71 states have (on average 1.1549295774647887) internal successors, (82), 75 states have internal predecessors, (82), 14 states have call successors, (14), 7 states have call predecessors, (14), 9 states have return successors, (20), 14 states have call predecessors, (20), 14 states have call successors, (20) [2024-11-23 23:36:31,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 116 transitions. [2024-11-23 23:36:31,329 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 116 transitions. Word has length 29 [2024-11-23 23:36:31,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:36:31,329 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 116 transitions. [2024-11-23 23:36:31,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-23 23:36:31,329 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 116 transitions. [2024-11-23 23:36:31,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-23 23:36:31,335 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:36:31,335 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:36:31,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-23 23:36:31,335 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 23:36:31,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:36:31,336 INFO L85 PathProgramCache]: Analyzing trace with hash 381810359, now seen corresponding path program 1 times [2024-11-23 23:36:31,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:36:31,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99085493] [2024-11-23 23:36:31,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:36:31,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:36:31,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:36:31,578 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2024-11-23 23:36:31,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:36:31,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99085493] [2024-11-23 23:36:31,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99085493] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 23:36:31,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1808847462] [2024-11-23 23:36:31,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:36:31,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:36:31,579 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4336887-efc5-4c82-a8da-6cc2f8e77c5b/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:36:31,584 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4336887-efc5-4c82-a8da-6cc2f8e77c5b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 23:36:31,586 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4336887-efc5-4c82-a8da-6cc2f8e77c5b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-23 23:36:31,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:36:31,793 INFO L256 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-23 23:36:31,800 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 23:36:31,846 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-23 23:36:31,847 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-23 23:36:31,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1808847462] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:36:31,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-23 23:36:31,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2024-11-23 23:36:31,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383233552] [2024-11-23 23:36:31,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:36:31,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-23 23:36:31,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:36:31,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-23 23:36:31,853 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-23 23:36:31,853 INFO L87 Difference]: Start difference. First operand 97 states and 116 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-23 23:36:31,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:36:31,905 INFO L93 Difference]: Finished difference Result 173 states and 206 transitions. [2024-11-23 23:36:31,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-23 23:36:31,907 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 71 [2024-11-23 23:36:31,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:36:31,909 INFO L225 Difference]: With dead ends: 173 [2024-11-23 23:36:31,909 INFO L226 Difference]: Without dead ends: 103 [2024-11-23 23:36:31,913 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-23 23:36:31,914 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 0 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-23 23:36:31,915 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 202 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-23 23:36:31,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-23 23:36:31,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2024-11-23 23:36:31,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 76 states have (on average 1.144736842105263) internal successors, (87), 79 states have internal predecessors, (87), 14 states have call successors, (14), 7 states have call predecessors, (14), 10 states have return successors, (21), 16 states have call predecessors, (21), 14 states have call successors, (21) [2024-11-23 23:36:31,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 122 transitions. [2024-11-23 23:36:31,952 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 122 transitions. Word has length 71 [2024-11-23 23:36:31,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:36:31,955 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 122 transitions. [2024-11-23 23:36:31,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-23 23:36:31,956 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 122 transitions. [2024-11-23 23:36:31,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-23 23:36:31,961 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:36:31,961 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:36:31,973 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4336887-efc5-4c82-a8da-6cc2f8e77c5b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-23 23:36:32,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4336887-efc5-4c82-a8da-6cc2f8e77c5b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:36:32,164 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 23:36:32,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:36:32,164 INFO L85 PathProgramCache]: Analyzing trace with hash 1799657849, now seen corresponding path program 1 times [2024-11-23 23:36:32,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:36:32,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194571062] [2024-11-23 23:36:32,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:36:32,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:36:32,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:36:32,901 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 3 proven. 22 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-23 23:36:32,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:36:32,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194571062] [2024-11-23 23:36:32,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194571062] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 23:36:32,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1126386462] [2024-11-23 23:36:32,902 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:36:32,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:36:32,902 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4336887-efc5-4c82-a8da-6cc2f8e77c5b/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:36:32,904 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4336887-efc5-4c82-a8da-6cc2f8e77c5b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 23:36:32,907 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4336887-efc5-4c82-a8da-6cc2f8e77c5b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-23 23:36:33,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:36:33,086 INFO L256 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-23 23:36:33,110 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 23:36:33,926 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-23 23:36:33,926 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-23 23:36:33,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1126386462] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:36:33,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-23 23:36:33,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 15 [2024-11-23 23:36:33,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205453874] [2024-11-23 23:36:33,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:36:33,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-23 23:36:33,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:36:33,928 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-23 23:36:33,928 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2024-11-23 23:36:33,928 INFO L87 Difference]: Start difference. First operand 103 states and 122 transitions. Second operand has 9 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 4 states have call successors, (9), 4 states have call predecessors, (9), 5 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2024-11-23 23:36:34,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:36:34,832 INFO L93 Difference]: Finished difference Result 233 states and 278 transitions. [2024-11-23 23:36:34,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-23 23:36:34,833 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 4 states have call successors, (9), 4 states have call predecessors, (9), 5 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 73 [2024-11-23 23:36:34,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:36:34,835 INFO L225 Difference]: With dead ends: 233 [2024-11-23 23:36:34,835 INFO L226 Difference]: Without dead ends: 126 [2024-11-23 23:36:34,840 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=159, Invalid=491, Unknown=0, NotChecked=0, Total=650 [2024-11-23 23:36:34,841 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 154 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-23 23:36:34,841 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 223 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-23 23:36:34,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-11-23 23:36:34,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 108. [2024-11-23 23:36:34,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 81 states have (on average 1.123456790123457) internal successors, (91), 85 states have internal predecessors, (91), 13 states have call successors, (13), 8 states have call predecessors, (13), 11 states have return successors, (21), 14 states have call predecessors, (21), 13 states have call successors, (21) [2024-11-23 23:36:34,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 125 transitions. [2024-11-23 23:36:34,876 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 125 transitions. Word has length 73 [2024-11-23 23:36:34,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:36:34,876 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 125 transitions. [2024-11-23 23:36:34,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 4 states have call successors, (9), 4 states have call predecessors, (9), 5 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2024-11-23 23:36:34,876 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 125 transitions. [2024-11-23 23:36:34,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-23 23:36:34,878 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:36:34,878 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:36:34,888 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4336887-efc5-4c82-a8da-6cc2f8e77c5b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-23 23:36:35,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4336887-efc5-4c82-a8da-6cc2f8e77c5b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:36:35,082 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 23:36:35,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:36:35,083 INFO L85 PathProgramCache]: Analyzing trace with hash 1466228273, now seen corresponding path program 1 times [2024-11-23 23:36:35,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:36:35,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900394417] [2024-11-23 23:36:35,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:36:35,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:36:35,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:36:42,078 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 11 proven. 17 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-23 23:36:42,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:36:42,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900394417] [2024-11-23 23:36:42,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900394417] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 23:36:42,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1296612943] [2024-11-23 23:36:42,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:36:42,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:36:42,080 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4336887-efc5-4c82-a8da-6cc2f8e77c5b/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:36:42,081 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4336887-efc5-4c82-a8da-6cc2f8e77c5b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 23:36:42,086 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4336887-efc5-4c82-a8da-6cc2f8e77c5b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-23 23:36:42,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:36:42,265 INFO L256 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 156 conjuncts are in the unsatisfiable core [2024-11-23 23:36:42,276 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 23:36:42,685 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-23 23:36:42,686 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 [2024-11-23 23:36:43,188 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2024-11-23 23:36:43,188 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 24 treesize of output 28 [2024-11-23 23:36:44,719 INFO L349 Elim1Store]: treesize reduction 117, result has 35.4 percent of original size [2024-11-23 23:36:44,719 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 92 treesize of output 184 [2024-11-23 23:36:44,747 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 8 treesize of output 7 [2024-11-23 23:36:44,842 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 8 treesize of output 7 [2024-11-23 23:36:44,870 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 8 treesize of output 7 [2024-11-23 23:36:44,900 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 8 treesize of output 7 [2024-11-23 23:36:44,986 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 23:36:44,996 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 23:36:45,018 INFO L349 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2024-11-23 23:36:45,018 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 118 treesize of output 98 [2024-11-23 23:36:45,072 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 [2024-11-23 23:36:45,141 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 23:36:45,147 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 23:36:45,149 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 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 81 treesize of output 55 [2024-11-23 23:36:45,157 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 [2024-11-23 23:36:45,306 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 23:36:45,306 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 23:36:45,307 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 5 [2024-11-23 23:36:45,312 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 [2024-11-23 23:36:45,518 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 23:36:45,519 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 12 [2024-11-23 23:36:48,011 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-23 23:36:48,019 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-23 23:36:48,031 INFO L349 Elim1Store]: treesize reduction 203, result has 0.5 percent of original size [2024-11-23 23:36:48,031 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 4 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 7 new quantified variables, introduced 2 case distinctions, treesize of input 713 treesize of output 623 [2024-11-23 23:36:48,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-23 23:36:48,061 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 214 treesize of output 194 [2024-11-23 23:36:48,114 INFO L349 Elim1Store]: treesize reduction 44, result has 38.0 percent of original size [2024-11-23 23:36:48,115 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 129 [2024-11-23 23:36:48,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-23 23:36:48,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-23 23:36:48,140 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 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 212 treesize of output 172 [2024-11-23 23:36:48,174 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 153 treesize of output 105 [2024-11-23 23:36:48,210 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 7 [2024-11-23 23:36:48,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-23 23:36:48,225 INFO L349 Elim1Store]: treesize reduction 4, result has 80.0 percent of original size [2024-11-23 23:36:48,225 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 26 [2024-11-23 23:36:50,008 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 10 proven. 16 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-23 23:36:50,008 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 23:36:51,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1296612943] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 23:36:51,713 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-23 23:36:51,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 30] total 61 [2024-11-23 23:36:51,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612198709] [2024-11-23 23:36:51,714 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-23 23:36:51,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2024-11-23 23:36:51,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:36:51,715 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2024-11-23 23:36:51,721 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=258, Invalid=4423, Unknown=11, NotChecked=0, Total=4692 [2024-11-23 23:36:51,722 INFO L87 Difference]: Start difference. First operand 108 states and 125 transitions. Second operand has 61 states, 50 states have (on average 1.74) internal successors, (87), 44 states have internal predecessors, (87), 17 states have call successors, (18), 11 states have call predecessors, (18), 15 states have return successors, (16), 15 states have call predecessors, (16), 15 states have call successors, (16) [2024-11-23 23:36:58,490 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-23 23:37:05,008 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-23 23:37:07,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:37:07,286 INFO L93 Difference]: Finished difference Result 225 states and 258 transitions. [2024-11-23 23:37:07,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2024-11-23 23:37:07,287 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 50 states have (on average 1.74) internal successors, (87), 44 states have internal predecessors, (87), 17 states have call successors, (18), 11 states have call predecessors, (18), 15 states have return successors, (16), 15 states have call predecessors, (16), 15 states have call successors, (16) Word has length 64 [2024-11-23 23:37:07,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:37:07,289 INFO L225 Difference]: With dead ends: 225 [2024-11-23 23:37:07,289 INFO L226 Difference]: Without dead ends: 142 [2024-11-23 23:37:07,295 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2165 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=702, Invalid=9998, Unknown=12, NotChecked=0, Total=10712 [2024-11-23 23:37:07,296 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 261 mSDsluCounter, 1412 mSDsCounter, 0 mSdLazyCounter, 2510 mSolverCounterSat, 64 mSolverCounterUnsat, 39 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 1460 SdHoareTripleChecker+Invalid, 2613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 2510 IncrementalHoareTripleChecker+Invalid, 39 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.2s IncrementalHoareTripleChecker+Time [2024-11-23 23:37:07,296 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 1460 Invalid, 2613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 2510 Invalid, 39 Unknown, 0 Unchecked, 12.2s Time] [2024-11-23 23:37:07,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-11-23 23:37:07,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 118. [2024-11-23 23:37:07,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 90 states have (on average 1.1333333333333333) internal successors, (102), 94 states have internal predecessors, (102), 13 states have call successors, (13), 9 states have call predecessors, (13), 12 states have return successors, (17), 14 states have call predecessors, (17), 13 states have call successors, (17) [2024-11-23 23:37:07,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 132 transitions. [2024-11-23 23:37:07,326 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 132 transitions. Word has length 64 [2024-11-23 23:37:07,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:37:07,328 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 132 transitions. [2024-11-23 23:37:07,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 50 states have (on average 1.74) internal successors, (87), 44 states have internal predecessors, (87), 17 states have call successors, (18), 11 states have call predecessors, (18), 15 states have return successors, (16), 15 states have call predecessors, (16), 15 states have call successors, (16) [2024-11-23 23:37:07,329 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 132 transitions. [2024-11-23 23:37:07,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-23 23:37:07,333 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:37:07,334 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:37:07,342 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4336887-efc5-4c82-a8da-6cc2f8e77c5b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-23 23:37:07,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4336887-efc5-4c82-a8da-6cc2f8e77c5b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-23 23:37:07,537 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 23:37:07,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:37:07,538 INFO L85 PathProgramCache]: Analyzing trace with hash -404451340, now seen corresponding path program 1 times [2024-11-23 23:37:07,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:37:07,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640787179] [2024-11-23 23:37:07,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:37:07,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:37:07,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:37:12,089 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 12 proven. 20 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-23 23:37:12,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:37:12,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640787179] [2024-11-23 23:37:12,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640787179] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 23:37:12,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1962911568] [2024-11-23 23:37:12,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:37:12,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:37:12,090 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4336887-efc5-4c82-a8da-6cc2f8e77c5b/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:37:12,092 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4336887-efc5-4c82-a8da-6cc2f8e77c5b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 23:37:12,094 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4336887-efc5-4c82-a8da-6cc2f8e77c5b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-23 23:37:12,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:37:12,261 INFO L256 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 143 conjuncts are in the unsatisfiable core [2024-11-23 23:37:12,268 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 23:37:12,767 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-23 23:37:12,767 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-11-23 23:37:13,208 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-23 23:37:13,209 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 19 treesize of output 16 [2024-11-23 23:37:14,569 INFO L349 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2024-11-23 23:37:14,569 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 71 [2024-11-23 23:37:14,600 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 160 treesize of output 126 [2024-11-23 23:37:14,765 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 56 [2024-11-23 23:37:14,774 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 61 [2024-11-23 23:37:14,782 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 23:37:14,783 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 23:37:14,784 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 29 [2024-11-23 23:37:14,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-23 23:37:14,797 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 22 treesize of output 21 [2024-11-23 23:37:14,841 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 52 [2024-11-23 23:37:14,877 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 13 [2024-11-23 23:37:14,951 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 56 [2024-11-23 23:37:14,961 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 23:37:14,961 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 23:37:14,963 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 54 [2024-11-23 23:37:14,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-23 23:37:14,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-23 23:37:14,996 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 1 [2024-11-23 23:37:15,117 INFO L349 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2024-11-23 23:37:15,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 71 [2024-11-23 23:37:15,156 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2024-11-23 23:37:16,242 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 56 [2024-11-23 23:37:16,252 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 23:37:16,253 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 23:37:16,254 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 54 [2024-11-23 23:37:16,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-23 23:37:16,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-23 23:37:16,274 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-23 23:37:16,304 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 28 [2024-11-23 23:37:16,316 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 23:37:16,317 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 23:37:16,318 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 32 [2024-11-23 23:37:16,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-23 23:37:16,334 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-23 23:37:16,348 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 39 [2024-11-23 23:37:16,434 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 56 [2024-11-23 23:37:16,447 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 23:37:16,448 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 23:37:16,449 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 54 [2024-11-23 23:37:16,460 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 23:37:16,461 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 23:37:16,462 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 29 [2024-11-23 23:37:16,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-23 23:37:16,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2024-11-23 23:37:16,680 INFO L349 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2024-11-23 23:37:16,681 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 67 treesize of output 71 [2024-11-23 23:37:16,732 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2024-11-23 23:37:17,302 INFO L349 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2024-11-23 23:37:17,302 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 71 [2024-11-23 23:37:17,328 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-23 23:37:17,329 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 273 treesize of output 248 [2024-11-23 23:37:17,369 INFO L349 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2024-11-23 23:37:17,370 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 271 treesize of output 229 [2024-11-23 23:37:17,399 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 38 [2024-11-23 23:37:17,432 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2024-11-23 23:37:17,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-23 23:37:17,478 INFO L349 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2024-11-23 23:37:17,478 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 39 [2024-11-23 23:37:17,569 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 56 [2024-11-23 23:37:17,588 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 23:37:17,589 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 59 [2024-11-23 23:37:17,610 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 23:37:17,611 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 32 [2024-11-23 23:37:17,648 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 15 treesize of output 19 [2024-11-23 23:37:17,905 INFO L349 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2024-11-23 23:37:17,906 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 67 treesize of output 71 [2024-11-23 23:37:17,940 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 23:37:17,958 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-23 23:37:17,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 71 treesize of output 67 [2024-11-23 23:37:18,046 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 31 treesize of output 28 [2024-11-23 23:37:18,437 INFO L349 Elim1Store]: treesize reduction 33, result has 38.9 percent of original size [2024-11-23 23:37:18,437 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 79 treesize of output 79 [2024-11-23 23:37:18,460 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 23:37:18,472 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-23 23:37:18,473 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 79 treesize of output 75 [2024-11-23 23:37:18,527 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 35 treesize of output 30 [2024-11-23 23:37:22,761 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_~#mutexes~0.offset| 0) (let ((.cse7 (select |c_#memory_$Pointer$#1.offset| |c___ldv_list_add_#in~prev.base|))) (let ((.cse73 (select .cse7 |c___ldv_list_add_#in~prev.offset|))) (let ((.cse93 (+ |c___ldv_list_add_#in~prev.offset| (- 4))) (.cse4 (select |c_#memory_$Pointer$#1.base| |c___ldv_list_add_#in~new.base|)) (.cse74 (+ .cse73 4)) (.cse71 (= |c___ldv_list_add_#in~prev.base| |c___ldv_list_add_#in~new.base|)) (.cse2 (+ |c___ldv_list_add_#in~next.offset| 4))) (let ((.cse25 (= .cse2 |c___ldv_list_add_#in~prev.offset|)) (.cse9 (= |c___ldv_list_add_#in~next.base| |c___ldv_list_add_#in~prev.base|)) (.cse33 (select |c_#memory_$Pointer$#1.offset| |c___ldv_list_add_#in~new.base|)) (.cse40 (not .cse71)) (.cse11 (select |c_#memory_$Pointer$#1.offset| |c___ldv_list_add_#in~next.base|)) (.cse75 (select .cse4 .cse74)) (.cse68 (= .cse74 |c___ldv_list_add_#in~prev.offset|)) (.cse14 (= |c___ldv_list_add_#in~next.base| |c___ldv_list_add_#in~new.base|)) (.cse1 (select |c_old(#memory_$Pointer$#1.base)| |c___ldv_list_add_#in~new.base|)) (.cse69 (= |c___ldv_list_add_#in~next.offset| (select .cse7 .cse93))) (.cse70 (= (+ (select .cse7 .cse2) 4) |c___ldv_list_add_#in~prev.offset|))) (or (let ((.cse3 (+ |c___ldv_list_add_#in~next.offset| 8))) (and (= (let ((.cse0 (store |c_old(#memory_$Pointer$#1.base)| |c___ldv_list_add_#in~new.base| (store (store .cse1 .cse2 |c___ldv_list_add_#in~next.base|) .cse3 (select .cse4 .cse3))))) (store .cse0 |c___ldv_list_add_#in~prev.base| (store (select .cse0 |c___ldv_list_add_#in~prev.base|) |c___ldv_list_add_#in~prev.offset| |c___ldv_list_add_#in~new.base|))) |c_#memory_$Pointer$#1.base|) (or (and (exists ((v_DerPreprocessor_37 (Array Int Int)) (v_DerPreprocessor_35 (Array Int Int)) (v_DerPreprocessor_36 (Array Int Int))) (let ((.cse8 (store (store (store |c_#memory_$Pointer$#1.offset| |c___ldv_list_add_#in~next.base| v_DerPreprocessor_35) |c___ldv_list_add_#in~prev.base| v_DerPreprocessor_36) |c___ldv_list_add_#in~new.base| v_DerPreprocessor_37))) (let ((.cse5 (select .cse8 |c___ldv_list_add_#in~next.base|)) (.cse6 (select .cse8 |c___ldv_list_add_#in~prev.base|))) (and (= |c___ldv_list_add_#in~next.offset| (select .cse5 .cse2)) (= v_DerPreprocessor_36 .cse6) (= (select .cse5 .cse3) |c___ldv_list_add_#in~prev.offset|) (= .cse5 v_DerPreprocessor_35) (= (store .cse6 |c___ldv_list_add_#in~prev.offset| .cse2) .cse7))))) .cse9) (exists ((v_DerPreprocessor_37 (Array Int Int)) (v_DerPreprocessor_35 (Array Int Int)) (v_DerPreprocessor_36 (Array Int Int))) (let ((.cse13 (store (store (store |c_#memory_$Pointer$#1.offset| |c___ldv_list_add_#in~next.base| v_DerPreprocessor_35) |c___ldv_list_add_#in~prev.base| v_DerPreprocessor_36) |c___ldv_list_add_#in~new.base| v_DerPreprocessor_37))) (let ((.cse10 (select .cse13 |c___ldv_list_add_#in~next.base|)) (.cse12 (select .cse13 |c___ldv_list_add_#in~prev.base|))) (and (= |c___ldv_list_add_#in~next.offset| (select .cse10 .cse2)) (= .cse10 .cse11) (= v_DerPreprocessor_36 .cse12) (= (select .cse10 .cse3) |c___ldv_list_add_#in~prev.offset|) (= .cse10 v_DerPreprocessor_35) (= (store .cse12 |c___ldv_list_add_#in~prev.offset| .cse2) .cse7)))))) .cse14)) (and (or (and .cse9 (exists ((v_DerPreprocessor_32 (Array Int Int)) (v_DerPreprocessor_33 (Array Int Int)) (v_DerPreprocessor_34 (Array Int Int))) (let ((.cse17 (store (store (store |c_#memory_$Pointer$#1.offset| |c___ldv_list_add_#in~next.base| v_DerPreprocessor_32) |c___ldv_list_add_#in~prev.base| v_DerPreprocessor_33) |c___ldv_list_add_#in~new.base| v_DerPreprocessor_34))) (let ((.cse15 (select .cse17 |c___ldv_list_add_#in~prev.base|)) (.cse16 (select .cse17 |c___ldv_list_add_#in~next.base|))) (and (= (store .cse15 |c___ldv_list_add_#in~prev.offset| |c___ldv_list_add_#in~next.offset|) .cse7) (= v_DerPreprocessor_32 .cse16) (= v_DerPreprocessor_33 .cse15) (= (select .cse16 .cse2) |c___ldv_list_add_#in~prev.offset|) (= |c___ldv_list_add_#in~next.offset| (select .cse16 |c___ldv_list_add_#in~next.offset|))))))) (exists ((v_DerPreprocessor_32 (Array Int Int)) (v_DerPreprocessor_33 (Array Int Int)) (v_DerPreprocessor_34 (Array Int Int))) (let ((.cse20 (store (store (store |c_#memory_$Pointer$#1.offset| |c___ldv_list_add_#in~next.base| v_DerPreprocessor_32) |c___ldv_list_add_#in~prev.base| v_DerPreprocessor_33) |c___ldv_list_add_#in~new.base| v_DerPreprocessor_34))) (let ((.cse18 (select .cse20 |c___ldv_list_add_#in~prev.base|)) (.cse19 (select .cse20 |c___ldv_list_add_#in~next.base|))) (and (= (store .cse18 |c___ldv_list_add_#in~prev.offset| |c___ldv_list_add_#in~next.offset|) .cse7) (= v_DerPreprocessor_32 .cse19) (= .cse19 .cse11) (= v_DerPreprocessor_33 .cse18) (= (select .cse19 .cse2) |c___ldv_list_add_#in~prev.offset|) (= |c___ldv_list_add_#in~next.offset| (select .cse19 |c___ldv_list_add_#in~next.offset|))))))) .cse14 (let ((.cse22 (store .cse1 |c___ldv_list_add_#in~next.offset| |c___ldv_list_add_#in~next.base|))) (or (= |c_#memory_$Pointer$#1.base| (let ((.cse21 (store |c_old(#memory_$Pointer$#1.base)| |c___ldv_list_add_#in~new.base| .cse22))) (store .cse21 |c___ldv_list_add_#in~prev.base| (store (select .cse21 |c___ldv_list_add_#in~prev.base|) |c___ldv_list_add_#in~prev.offset| |c___ldv_list_add_#in~new.base|)))) (= (let ((.cse23 (store |c_old(#memory_$Pointer$#1.base)| |c___ldv_list_add_#in~new.base| (store .cse22 .cse2 (select .cse4 .cse2))))) (store .cse23 |c___ldv_list_add_#in~prev.base| (store (select .cse23 |c___ldv_list_add_#in~prev.base|) |c___ldv_list_add_#in~prev.offset| |c___ldv_list_add_#in~new.base|))) |c_#memory_$Pointer$#1.base|)))) (let ((.cse24 (not .cse9))) (and (or .cse24 (not .cse25)) (let ((.cse30 (store |c_old(#memory_$Pointer$#1.base)| |c___ldv_list_add_#in~next.base| (store (select |c_old(#memory_$Pointer$#1.base)| |c___ldv_list_add_#in~next.base|) .cse2 (select (select |c_#memory_$Pointer$#1.base| |c___ldv_list_add_#in~next.base|) .cse2))))) (let ((.cse31 (select .cse30 |c___ldv_list_add_#in~new.base|))) (let ((.cse39 (not .cse14)) (.cse67 (= (let ((.cse92 (store .cse30 |c___ldv_list_add_#in~new.base| (store .cse31 .cse93 |c___ldv_list_add_#in~next.base|)))) (store .cse92 |c___ldv_list_add_#in~prev.base| (store (select .cse92 |c___ldv_list_add_#in~prev.base|) |c___ldv_list_add_#in~prev.offset| |c___ldv_list_add_#in~new.base|))) |c_#memory_$Pointer$#1.base|))) (or (and (or (and (or (exists ((v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_27 (Array Int Int)) (v_DerPreprocessor_25 (Array Int Int))) (let ((.cse27 (select v_DerPreprocessor_27 .cse2))) (let ((.cse32 (store (store (store |c_#memory_$Pointer$#1.offset| |c___ldv_list_add_#in~new.base| v_DerPreprocessor_25) |c___ldv_list_add_#in~prev.base| v_DerPreprocessor_26) |c___ldv_list_add_#in~next.base| v_DerPreprocessor_27)) (.cse28 (+ .cse27 4))) (let ((.cse26 (store (store (select .cse32 |c___ldv_list_add_#in~new.base|) .cse27 |c___ldv_list_add_#in~next.offset|) .cse28 |c___ldv_list_add_#in~prev.offset|))) (and (= (store (select (store (store (store |c_#memory_$Pointer$#1.offset| |c___ldv_list_add_#in~prev.base| v_DerPreprocessor_26) |c___ldv_list_add_#in~next.base| v_DerPreprocessor_27) |c___ldv_list_add_#in~new.base| .cse26) |c___ldv_list_add_#in~prev.base|) |c___ldv_list_add_#in~prev.offset| .cse27) .cse11) (not (= .cse28 |c___ldv_list_add_#in~prev.offset|)) (= |c_#memory_$Pointer$#1.base| (let ((.cse29 (store .cse30 |c___ldv_list_add_#in~new.base| (store (store .cse31 .cse27 |c___ldv_list_add_#in~next.base|) .cse28 (select .cse4 .cse28))))) (store .cse29 |c___ldv_list_add_#in~prev.base| (store (select .cse29 |c___ldv_list_add_#in~prev.base|) |c___ldv_list_add_#in~prev.offset| |c___ldv_list_add_#in~new.base|)))) (= (select .cse32 |c___ldv_list_add_#in~prev.base|) v_DerPreprocessor_26) (= .cse26 .cse33)))))) (exists ((v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_27 (Array Int Int)) (v_DerPreprocessor_25 (Array Int Int))) (let ((.cse35 (select v_DerPreprocessor_27 .cse2))) (let ((.cse38 (store (store (store |c_#memory_$Pointer$#1.offset| |c___ldv_list_add_#in~new.base| v_DerPreprocessor_25) |c___ldv_list_add_#in~prev.base| v_DerPreprocessor_26) |c___ldv_list_add_#in~next.base| v_DerPreprocessor_27)) (.cse37 (+ .cse35 4))) (let ((.cse34 (store (store (select .cse38 |c___ldv_list_add_#in~new.base|) .cse35 |c___ldv_list_add_#in~next.offset|) .cse37 |c___ldv_list_add_#in~prev.offset|))) (and (= (store (select (store (store (store |c_#memory_$Pointer$#1.offset| |c___ldv_list_add_#in~prev.base| v_DerPreprocessor_26) |c___ldv_list_add_#in~next.base| v_DerPreprocessor_27) |c___ldv_list_add_#in~new.base| .cse34) |c___ldv_list_add_#in~prev.base|) |c___ldv_list_add_#in~prev.offset| .cse35) .cse11) (= |c_#memory_$Pointer$#1.base| (let ((.cse36 (store .cse30 |c___ldv_list_add_#in~new.base| (store (store .cse31 .cse35 |c___ldv_list_add_#in~next.base|) .cse37 (select .cse4 .cse37))))) (store .cse36 |c___ldv_list_add_#in~prev.base| (store (select .cse36 |c___ldv_list_add_#in~prev.base|) |c___ldv_list_add_#in~prev.offset| |c___ldv_list_add_#in~new.base|)))) (= (select .cse38 |c___ldv_list_add_#in~prev.base|) v_DerPreprocessor_26) (= .cse34 .cse33))))))) .cse39) (and .cse40 (exists ((v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_27 (Array Int Int)) (v_DerPreprocessor_25 (Array Int Int))) (let ((.cse42 (select v_DerPreprocessor_27 .cse2))) (let ((.cse45 (store (store (store |c_#memory_$Pointer$#1.offset| |c___ldv_list_add_#in~new.base| v_DerPreprocessor_25) |c___ldv_list_add_#in~prev.base| v_DerPreprocessor_26) |c___ldv_list_add_#in~next.base| v_DerPreprocessor_27)) (.cse44 (+ .cse42 4))) (let ((.cse41 (store (store (select .cse45 |c___ldv_list_add_#in~new.base|) .cse42 |c___ldv_list_add_#in~next.offset|) .cse44 |c___ldv_list_add_#in~prev.offset|))) (and (= (store (select (store (store (store |c_#memory_$Pointer$#1.offset| |c___ldv_list_add_#in~prev.base| v_DerPreprocessor_26) |c___ldv_list_add_#in~next.base| v_DerPreprocessor_27) |c___ldv_list_add_#in~new.base| .cse41) |c___ldv_list_add_#in~prev.base|) |c___ldv_list_add_#in~prev.offset| .cse42) .cse11) (not (= .cse42 |c___ldv_list_add_#in~next.offset|)) (= |c_#memory_$Pointer$#1.base| (let ((.cse43 (store .cse30 |c___ldv_list_add_#in~new.base| (store (store .cse31 .cse42 |c___ldv_list_add_#in~next.base|) .cse44 (select .cse4 .cse44))))) (store .cse43 |c___ldv_list_add_#in~prev.base| (store (select .cse43 |c___ldv_list_add_#in~prev.base|) |c___ldv_list_add_#in~prev.offset| |c___ldv_list_add_#in~new.base|)))) (= (select .cse45 |c___ldv_list_add_#in~prev.base|) v_DerPreprocessor_26) (= .cse41 .cse33) (not (= .cse42 .cse2)))))))) (exists ((v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_27 (Array Int Int)) (v_DerPreprocessor_25 (Array Int Int))) (let ((.cse47 (select v_DerPreprocessor_27 .cse2)) (.cse51 (store (store (store |c_#memory_$Pointer$#1.offset| |c___ldv_list_add_#in~new.base| v_DerPreprocessor_25) |c___ldv_list_add_#in~prev.base| v_DerPreprocessor_26) |c___ldv_list_add_#in~next.base| v_DerPreprocessor_27))) (let ((.cse48 (select .cse51 |c___ldv_list_add_#in~new.base|)) (.cse49 (+ .cse47 4))) (let ((.cse46 (store (store .cse48 .cse47 |c___ldv_list_add_#in~next.offset|) .cse49 |c___ldv_list_add_#in~prev.offset|))) (and (= (store (select (store (store (store |c_#memory_$Pointer$#1.offset| |c___ldv_list_add_#in~prev.base| v_DerPreprocessor_26) |c___ldv_list_add_#in~next.base| v_DerPreprocessor_27) |c___ldv_list_add_#in~new.base| .cse46) |c___ldv_list_add_#in~prev.base|) |c___ldv_list_add_#in~prev.offset| .cse47) .cse11) (= v_DerPreprocessor_25 .cse48) (not (= .cse47 |c___ldv_list_add_#in~next.offset|)) (not (= .cse49 |c___ldv_list_add_#in~prev.offset|)) (= |c_#memory_$Pointer$#1.base| (let ((.cse50 (store .cse30 |c___ldv_list_add_#in~new.base| (store (store .cse31 .cse47 |c___ldv_list_add_#in~next.base|) .cse49 (select .cse4 .cse49))))) (store .cse50 |c___ldv_list_add_#in~prev.base| (store (select .cse50 |c___ldv_list_add_#in~prev.base|) |c___ldv_list_add_#in~prev.offset| |c___ldv_list_add_#in~new.base|)))) (= (select .cse51 |c___ldv_list_add_#in~prev.base|) v_DerPreprocessor_26) (= .cse46 .cse33) (not (= .cse47 .cse2))))))) (and .cse14 (exists ((v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_27 (Array Int Int)) (v_DerPreprocessor_25 (Array Int Int))) (let ((.cse53 (select v_DerPreprocessor_27 .cse2)) (.cse56 (store (store (store |c_#memory_$Pointer$#1.offset| |c___ldv_list_add_#in~new.base| v_DerPreprocessor_25) |c___ldv_list_add_#in~prev.base| v_DerPreprocessor_26) |c___ldv_list_add_#in~next.base| v_DerPreprocessor_27))) (let ((.cse52 (select .cse56 |c___ldv_list_add_#in~new.base|)) (.cse54 (+ .cse53 4))) (and (= (store (select (store (store (store |c_#memory_$Pointer$#1.offset| |c___ldv_list_add_#in~prev.base| v_DerPreprocessor_26) |c___ldv_list_add_#in~next.base| v_DerPreprocessor_27) |c___ldv_list_add_#in~new.base| (store (store .cse52 .cse53 |c___ldv_list_add_#in~next.offset|) .cse54 |c___ldv_list_add_#in~prev.offset|)) |c___ldv_list_add_#in~prev.base|) |c___ldv_list_add_#in~prev.offset| .cse53) .cse11) (= v_DerPreprocessor_25 .cse52) (not (= .cse53 |c___ldv_list_add_#in~next.offset|)) (not (= .cse54 |c___ldv_list_add_#in~prev.offset|)) (= |c_#memory_$Pointer$#1.base| (let ((.cse55 (store .cse30 |c___ldv_list_add_#in~new.base| (store (store .cse31 .cse53 |c___ldv_list_add_#in~next.base|) .cse54 (select .cse4 .cse54))))) (store .cse55 |c___ldv_list_add_#in~prev.base| (store (select .cse55 |c___ldv_list_add_#in~prev.base|) |c___ldv_list_add_#in~prev.offset| |c___ldv_list_add_#in~new.base|)))) (= (select .cse56 |c___ldv_list_add_#in~prev.base|) v_DerPreprocessor_26) (not (= .cse53 .cse2))))))) (and .cse39 (or (exists ((v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_27 (Array Int Int)) (v_DerPreprocessor_25 (Array Int Int))) (let ((.cse58 (select v_DerPreprocessor_27 .cse2))) (let ((.cse61 (store (store (store |c_#memory_$Pointer$#1.offset| |c___ldv_list_add_#in~new.base| v_DerPreprocessor_25) |c___ldv_list_add_#in~prev.base| v_DerPreprocessor_26) |c___ldv_list_add_#in~next.base| v_DerPreprocessor_27)) (.cse60 (+ .cse58 4))) (let ((.cse57 (store (store (select .cse61 |c___ldv_list_add_#in~new.base|) .cse58 |c___ldv_list_add_#in~next.offset|) .cse60 |c___ldv_list_add_#in~prev.offset|))) (and (= (store (select (store (store (store |c_#memory_$Pointer$#1.offset| |c___ldv_list_add_#in~prev.base| v_DerPreprocessor_26) |c___ldv_list_add_#in~next.base| v_DerPreprocessor_27) |c___ldv_list_add_#in~new.base| .cse57) |c___ldv_list_add_#in~prev.base|) |c___ldv_list_add_#in~prev.offset| .cse58) .cse11) (= |c_#memory_$Pointer$#1.base| (let ((.cse59 (store .cse30 |c___ldv_list_add_#in~new.base| (store (store .cse31 .cse58 |c___ldv_list_add_#in~next.base|) .cse60 (select .cse4 .cse60))))) (store .cse59 |c___ldv_list_add_#in~prev.base| (store (select .cse59 |c___ldv_list_add_#in~prev.base|) |c___ldv_list_add_#in~prev.offset| |c___ldv_list_add_#in~new.base|)))) (= (select .cse61 |c___ldv_list_add_#in~prev.base|) v_DerPreprocessor_26) (= .cse57 .cse33) (not (= .cse58 .cse2))))))) (exists ((v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_27 (Array Int Int)) (v_DerPreprocessor_25 (Array Int Int))) (let ((.cse63 (select v_DerPreprocessor_27 .cse2))) (let ((.cse66 (store (store (store |c_#memory_$Pointer$#1.offset| |c___ldv_list_add_#in~new.base| v_DerPreprocessor_25) |c___ldv_list_add_#in~prev.base| v_DerPreprocessor_26) |c___ldv_list_add_#in~next.base| v_DerPreprocessor_27)) (.cse64 (+ .cse63 4))) (let ((.cse62 (store (store (select .cse66 |c___ldv_list_add_#in~new.base|) .cse63 |c___ldv_list_add_#in~next.offset|) .cse64 |c___ldv_list_add_#in~prev.offset|))) (and (= (store (select (store (store (store |c_#memory_$Pointer$#1.offset| |c___ldv_list_add_#in~prev.base| v_DerPreprocessor_26) |c___ldv_list_add_#in~next.base| v_DerPreprocessor_27) |c___ldv_list_add_#in~new.base| .cse62) |c___ldv_list_add_#in~prev.base|) |c___ldv_list_add_#in~prev.offset| .cse63) .cse11) (not (= .cse64 |c___ldv_list_add_#in~prev.offset|)) (= |c_#memory_$Pointer$#1.base| (let ((.cse65 (store .cse30 |c___ldv_list_add_#in~new.base| (store (store .cse31 .cse63 |c___ldv_list_add_#in~next.base|) .cse64 (select .cse4 .cse64))))) (store .cse65 |c___ldv_list_add_#in~prev.base| (store (select .cse65 |c___ldv_list_add_#in~prev.base|) |c___ldv_list_add_#in~prev.offset| |c___ldv_list_add_#in~new.base|)))) (= (select .cse66 |c___ldv_list_add_#in~prev.base|) v_DerPreprocessor_26) (= .cse62 .cse33) (not (= .cse63 .cse2))))))))) (and .cse67 .cse68 .cse69 .cse70 .cse71)) .cse9) (and .cse24 .cse39 (or (and (= |c_#memory_$Pointer$#1.base| (let ((.cse72 (store .cse30 |c___ldv_list_add_#in~new.base| (store (store .cse31 .cse73 |c___ldv_list_add_#in~next.base|) .cse74 .cse75)))) (store .cse72 |c___ldv_list_add_#in~prev.base| (store (select .cse72 |c___ldv_list_add_#in~prev.base|) |c___ldv_list_add_#in~prev.offset| |c___ldv_list_add_#in~new.base|)))) (or (and (or (= |c___ldv_list_add_#in~next.offset| (select .cse7 .cse73)) (= |c___ldv_list_add_#in~prev.offset| .cse73)) (= (select .cse7 .cse74) |c___ldv_list_add_#in~prev.offset|) .cse71) (and (= |c___ldv_list_add_#in~next.offset| (select .cse33 .cse73)) (= |c___ldv_list_add_#in~prev.offset| (select .cse33 .cse74))))) (and .cse67 .cse68 .cse69 .cse71))) (and (or (exists ((v_DerPreprocessor_30 (Array Int Int))) (let ((.cse77 (select v_DerPreprocessor_30 .cse2))) (let ((.cse78 (+ .cse77 4))) (and (= |c_#memory_$Pointer$#1.base| (let ((.cse76 (store .cse30 |c___ldv_list_add_#in~new.base| (store (store .cse31 .cse77 |c___ldv_list_add_#in~next.base|) .cse78 (select .cse4 .cse78))))) (store .cse76 |c___ldv_list_add_#in~prev.base| (store (select .cse76 |c___ldv_list_add_#in~prev.base|) |c___ldv_list_add_#in~prev.offset| |c___ldv_list_add_#in~new.base|)))) (not (= |c___ldv_list_add_#in~next.offset| .cse77)) (not (= .cse2 .cse77)) (exists ((v_DerPreprocessor_28 (Array Int Int)) (v_DerPreprocessor_29 (Array Int Int))) (let ((.cse80 (store (store (store |c_#memory_$Pointer$#1.offset| |c___ldv_list_add_#in~new.base| v_DerPreprocessor_28) |c___ldv_list_add_#in~prev.base| v_DerPreprocessor_29) |c___ldv_list_add_#in~next.base| v_DerPreprocessor_30))) (let ((.cse81 (select .cse80 |c___ldv_list_add_#in~new.base|))) (let ((.cse79 (store (store .cse81 .cse77 |c___ldv_list_add_#in~next.offset|) .cse78 |c___ldv_list_add_#in~prev.offset|))) (and (= .cse79 .cse11) (= (store (select (store (store (store |c_#memory_$Pointer$#1.offset| |c___ldv_list_add_#in~prev.base| v_DerPreprocessor_29) |c___ldv_list_add_#in~next.base| v_DerPreprocessor_30) |c___ldv_list_add_#in~new.base| .cse79) |c___ldv_list_add_#in~prev.base|) |c___ldv_list_add_#in~prev.offset| .cse77) .cse7) (= v_DerPreprocessor_29 (select .cse80 |c___ldv_list_add_#in~prev.base|)) (= v_DerPreprocessor_28 .cse81)))))) (not (= .cse78 |c___ldv_list_add_#in~prev.offset|)))))) (and (exists ((v_DerPreprocessor_30 (Array Int Int)) (v_DerPreprocessor_28 (Array Int Int)) (v_DerPreprocessor_29 (Array Int Int))) (let ((.cse86 (store (store (store |c_#memory_$Pointer$#1.offset| |c___ldv_list_add_#in~new.base| v_DerPreprocessor_28) |c___ldv_list_add_#in~prev.base| v_DerPreprocessor_29) |c___ldv_list_add_#in~next.base| v_DerPreprocessor_30)) (.cse83 (select v_DerPreprocessor_30 .cse2))) (let ((.cse84 (+ .cse83 4)) (.cse85 (select .cse86 |c___ldv_list_add_#in~new.base|))) (and (= |c_#memory_$Pointer$#1.base| (let ((.cse82 (store .cse30 |c___ldv_list_add_#in~new.base| (store (store .cse31 .cse83 |c___ldv_list_add_#in~next.base|) .cse84 (select .cse4 .cse84))))) (store .cse82 |c___ldv_list_add_#in~prev.base| (store (select .cse82 |c___ldv_list_add_#in~prev.base|) |c___ldv_list_add_#in~prev.offset| |c___ldv_list_add_#in~new.base|)))) (= (store (select (store (store (store |c_#memory_$Pointer$#1.offset| |c___ldv_list_add_#in~prev.base| v_DerPreprocessor_29) |c___ldv_list_add_#in~next.base| v_DerPreprocessor_30) |c___ldv_list_add_#in~new.base| (store (store .cse85 .cse83 |c___ldv_list_add_#in~next.offset|) .cse84 |c___ldv_list_add_#in~prev.offset|)) |c___ldv_list_add_#in~prev.base|) |c___ldv_list_add_#in~prev.offset| .cse83) .cse7) (= v_DerPreprocessor_29 (select .cse86 |c___ldv_list_add_#in~prev.base|)) (not (= |c___ldv_list_add_#in~next.offset| .cse83)) (not (= .cse2 .cse83)) (= v_DerPreprocessor_28 .cse85))))) .cse9) (and .cse40 (exists ((v_DerPreprocessor_30 (Array Int Int))) (let ((.cse88 (select v_DerPreprocessor_30 .cse2))) (let ((.cse89 (+ .cse88 4))) (and (= |c_#memory_$Pointer$#1.base| (let ((.cse87 (store .cse30 |c___ldv_list_add_#in~new.base| (store (store .cse31 .cse88 |c___ldv_list_add_#in~next.base|) .cse89 (select .cse4 .cse89))))) (store .cse87 |c___ldv_list_add_#in~prev.base| (store (select .cse87 |c___ldv_list_add_#in~prev.base|) |c___ldv_list_add_#in~prev.offset| |c___ldv_list_add_#in~new.base|)))) (exists ((v_DerPreprocessor_28 (Array Int Int)) (v_DerPreprocessor_29 (Array Int Int))) (let ((.cse91 (select (store (store (store |c_#memory_$Pointer$#1.offset| |c___ldv_list_add_#in~new.base| v_DerPreprocessor_28) |c___ldv_list_add_#in~prev.base| v_DerPreprocessor_29) |c___ldv_list_add_#in~next.base| v_DerPreprocessor_30) |c___ldv_list_add_#in~new.base|))) (let ((.cse90 (store (store .cse91 .cse88 |c___ldv_list_add_#in~next.offset|) .cse89 |c___ldv_list_add_#in~prev.offset|))) (and (= .cse90 .cse11) (= (store (select (store (store (store |c_#memory_$Pointer$#1.offset| |c___ldv_list_add_#in~prev.base| v_DerPreprocessor_29) |c___ldv_list_add_#in~next.base| v_DerPreprocessor_30) |c___ldv_list_add_#in~new.base| .cse90) |c___ldv_list_add_#in~prev.base|) |c___ldv_list_add_#in~prev.offset| .cse88) .cse7) (= v_DerPreprocessor_28 .cse91))))) (not (= |c___ldv_list_add_#in~next.offset| .cse88)) (not (= .cse2 .cse88)))))))) .cse14))))))) (and .cse25 .cse9 (or (let ((.cse95 (select .cse11 |c___ldv_list_add_#in~prev.offset|))) (let ((.cse96 (+ .cse95 4))) (and (or (and (exists ((v_arrayElimArr_11 (Array Int Int)) (v_DerPreprocessor_16 (Array Int Int)) (v_DerPreprocessor_17 (Array Int Int))) (let ((.cse97 (store (store (store |c_#memory_$Pointer$#1.offset| |c___ldv_list_add_#in~new.base| v_DerPreprocessor_16) |c___ldv_list_add_#in~prev.base| v_DerPreprocessor_17) |c___ldv_list_add_#in~next.base| v_arrayElimArr_11))) (let ((.cse94 (select .cse97 |c___ldv_list_add_#in~new.base|))) (and (= (store (select (store (store (store |c_#memory_$Pointer$#1.offset| |c___ldv_list_add_#in~prev.base| v_DerPreprocessor_17) |c___ldv_list_add_#in~next.base| v_arrayElimArr_11) |c___ldv_list_add_#in~new.base| (store (store .cse94 .cse95 |c___ldv_list_add_#in~next.offset|) .cse96 |c___ldv_list_add_#in~prev.offset|)) |c___ldv_list_add_#in~prev.base|) |c___ldv_list_add_#in~prev.offset| .cse95) .cse11) (= .cse95 (select v_arrayElimArr_11 .cse2)) (= .cse94 v_DerPreprocessor_16) (= v_DerPreprocessor_17 (select .cse97 |c___ldv_list_add_#in~prev.base|)))))) .cse14) (exists ((v_arrayElimArr_11 (Array Int Int))) (and (= .cse95 (select v_arrayElimArr_11 .cse2)) (exists ((v_DerPreprocessor_16 (Array Int Int)) (v_DerPreprocessor_17 (Array Int Int))) (let ((.cse100 (store (store (store |c_#memory_$Pointer$#1.offset| |c___ldv_list_add_#in~new.base| v_DerPreprocessor_16) |c___ldv_list_add_#in~prev.base| v_DerPreprocessor_17) |c___ldv_list_add_#in~next.base| v_arrayElimArr_11))) (let ((.cse99 (select .cse100 |c___ldv_list_add_#in~new.base|))) (let ((.cse98 (store (store .cse99 .cse95 |c___ldv_list_add_#in~next.offset|) .cse96 |c___ldv_list_add_#in~prev.offset|))) (and (= (store (select (store (store (store |c_#memory_$Pointer$#1.offset| |c___ldv_list_add_#in~prev.base| v_DerPreprocessor_17) |c___ldv_list_add_#in~next.base| v_arrayElimArr_11) |c___ldv_list_add_#in~new.base| .cse98) |c___ldv_list_add_#in~prev.base|) |c___ldv_list_add_#in~prev.offset| .cse95) .cse11) (= .cse98 .cse33) (= .cse99 v_DerPreprocessor_16) (= v_DerPreprocessor_17 (select .cse100 |c___ldv_list_add_#in~prev.base|)))))))))) (= |c_#memory_$Pointer$#1.base| (let ((.cse101 (store |c_old(#memory_$Pointer$#1.base)| |c___ldv_list_add_#in~new.base| (store (store .cse1 .cse95 |c___ldv_list_add_#in~next.base|) .cse96 (select .cse4 .cse96))))) (store .cse101 |c___ldv_list_add_#in~prev.base| (store (select .cse101 |c___ldv_list_add_#in~prev.base|) |c___ldv_list_add_#in~prev.offset| |c___ldv_list_add_#in~new.base|)))) (or (not (= |c___ldv_list_add_#in~prev.offset| .cse96)) .cse40)))) (and (exists ((v_DerPreprocessor_20 (Array Int Int)) (v_DerPreprocessor_21 (Array Int Int)) (v_DerPreprocessor_19 (Array Int Int))) (let ((.cse104 (store (store (store |c_#memory_$Pointer$#1.offset| |c___ldv_list_add_#in~new.base| v_DerPreprocessor_19) |c___ldv_list_add_#in~prev.base| v_DerPreprocessor_20) |c___ldv_list_add_#in~next.base| v_DerPreprocessor_21))) (let ((.cse103 (select .cse104 |c___ldv_list_add_#in~new.base|)) (.cse102 (select .cse104 |c___ldv_list_add_#in~prev.base|))) (and (= .cse73 (select .cse102 .cse2)) (= v_DerPreprocessor_19 .cse103) (= (store (select (store (store (store |c_#memory_$Pointer$#1.offset| |c___ldv_list_add_#in~prev.base| v_DerPreprocessor_20) |c___ldv_list_add_#in~next.base| v_DerPreprocessor_21) |c___ldv_list_add_#in~new.base| (store (store .cse103 .cse73 |c___ldv_list_add_#in~next.offset|) .cse74 |c___ldv_list_add_#in~prev.offset|)) |c___ldv_list_add_#in~prev.base|) |c___ldv_list_add_#in~prev.offset| .cse73) .cse7) (= v_DerPreprocessor_20 .cse102))))) (= |c_#memory_$Pointer$#1.base| (let ((.cse105 (store |c_old(#memory_$Pointer$#1.base)| |c___ldv_list_add_#in~new.base| (store (store .cse1 .cse73 |c___ldv_list_add_#in~next.base|) .cse74 .cse75)))) (store .cse105 |c___ldv_list_add_#in~prev.base| (store (select .cse105 |c___ldv_list_add_#in~prev.base|) |c___ldv_list_add_#in~prev.offset| |c___ldv_list_add_#in~new.base|)))) (not .cse68) .cse14) (and (= (let ((.cse106 (store |c_old(#memory_$Pointer$#1.base)| |c___ldv_list_add_#in~new.base| (store .cse1 .cse93 |c___ldv_list_add_#in~next.base|)))) (store .cse106 |c___ldv_list_add_#in~prev.base| (store (select .cse106 |c___ldv_list_add_#in~prev.base|) |c___ldv_list_add_#in~prev.offset| |c___ldv_list_add_#in~new.base|))) |c_#memory_$Pointer$#1.base|) .cse69 .cse70 .cse71)))))))) (= 3 |c_~#mutexes~0.base|)) is different from false [2024-11-23 23:37:29,804 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_~#mutexes~0.offset| 0) (let ((.cse7 (select |c_#memory_$Pointer$#1.offset| |c___ldv_list_add_#in~prev.base|))) (let ((.cse87 (select .cse7 |c___ldv_list_add_#in~prev.offset|))) (let ((.cse91 (+ |c___ldv_list_add_#in~prev.offset| (- 4))) (.cse4 (select |c_#memory_$Pointer$#1.base| |c___ldv_list_add_#in~new.base|)) (.cse88 (+ .cse87 4)) (.cse69 (= |c___ldv_list_add_#in~prev.base| |c___ldv_list_add_#in~new.base|)) (.cse2 (+ |c___ldv_list_add_#in~next.offset| 4))) (let ((.cse23 (= .cse2 |c___ldv_list_add_#in~prev.offset|)) (.cse9 (= |c___ldv_list_add_#in~next.base| |c___ldv_list_add_#in~prev.base|)) (.cse36 (select |c_#memory_$Pointer$#1.offset| |c___ldv_list_add_#in~new.base|)) (.cse43 (not .cse69)) (.cse11 (select |c_#memory_$Pointer$#1.offset| |c___ldv_list_add_#in~next.base|)) (.cse89 (select .cse4 .cse88)) (.cse66 (= .cse88 |c___ldv_list_add_#in~prev.offset|)) (.cse14 (= |c___ldv_list_add_#in~next.base| |c___ldv_list_add_#in~new.base|)) (.cse1 (select |c_old(#memory_$Pointer$#1.base)| |c___ldv_list_add_#in~new.base|)) (.cse67 (= |c___ldv_list_add_#in~next.offset| (select .cse7 .cse91))) (.cse68 (= (+ (select .cse7 .cse2) 4) |c___ldv_list_add_#in~prev.offset|))) (or (let ((.cse3 (+ |c___ldv_list_add_#in~next.offset| 8))) (and (= (let ((.cse0 (store |c_old(#memory_$Pointer$#1.base)| |c___ldv_list_add_#in~new.base| (store (store .cse1 .cse2 |c___ldv_list_add_#in~next.base|) .cse3 (select .cse4 .cse3))))) (store .cse0 |c___ldv_list_add_#in~prev.base| (store (select .cse0 |c___ldv_list_add_#in~prev.base|) |c___ldv_list_add_#in~prev.offset| |c___ldv_list_add_#in~new.base|))) |c_#memory_$Pointer$#1.base|) (or (and (exists ((v_DerPreprocessor_37 (Array Int Int)) (v_DerPreprocessor_35 (Array Int Int)) (v_DerPreprocessor_36 (Array Int Int))) (let ((.cse8 (store (store (store |c_#memory_$Pointer$#1.offset| |c___ldv_list_add_#in~next.base| v_DerPreprocessor_35) |c___ldv_list_add_#in~prev.base| v_DerPreprocessor_36) |c___ldv_list_add_#in~new.base| v_DerPreprocessor_37))) (let ((.cse5 (select .cse8 |c___ldv_list_add_#in~next.base|)) (.cse6 (select .cse8 |c___ldv_list_add_#in~prev.base|))) (and (= |c___ldv_list_add_#in~next.offset| (select .cse5 .cse2)) (= v_DerPreprocessor_36 .cse6) (= (select .cse5 .cse3) |c___ldv_list_add_#in~prev.offset|) (= .cse5 v_DerPreprocessor_35) (= (store .cse6 |c___ldv_list_add_#in~prev.offset| .cse2) .cse7))))) .cse9) (exists ((v_DerPreprocessor_37 (Array Int Int)) (v_DerPreprocessor_35 (Array Int Int)) (v_DerPreprocessor_36 (Array Int Int))) (let ((.cse13 (store (store (store |c_#memory_$Pointer$#1.offset| |c___ldv_list_add_#in~next.base| v_DerPreprocessor_35) |c___ldv_list_add_#in~prev.base| v_DerPreprocessor_36) |c___ldv_list_add_#in~new.base| v_DerPreprocessor_37))) (let ((.cse10 (select .cse13 |c___ldv_list_add_#in~next.base|)) (.cse12 (select .cse13 |c___ldv_list_add_#in~prev.base|))) (and (= |c___ldv_list_add_#in~next.offset| (select .cse10 .cse2)) (= .cse10 .cse11) (= v_DerPreprocessor_36 .cse12) (= (select .cse10 .cse3) |c___ldv_list_add_#in~prev.offset|) (= .cse10 v_DerPreprocessor_35) (= (store .cse12 |c___ldv_list_add_#in~prev.offset| .cse2) .cse7)))))) .cse14)) (and (or (and .cse9 (exists ((v_DerPreprocessor_32 (Array Int Int)) (v_DerPreprocessor_33 (Array Int Int)) (v_DerPreprocessor_34 (Array Int Int))) (let ((.cse17 (store (store (store |c_#memory_$Pointer$#1.offset| |c___ldv_list_add_#in~next.base| v_DerPreprocessor_32) |c___ldv_list_add_#in~prev.base| v_DerPreprocessor_33) |c___ldv_list_add_#in~new.base| v_DerPreprocessor_34))) (let ((.cse15 (select .cse17 |c___ldv_list_add_#in~prev.base|)) (.cse16 (select .cse17 |c___ldv_list_add_#in~next.base|))) (and (= (store .cse15 |c___ldv_list_add_#in~prev.offset| |c___ldv_list_add_#in~next.offset|) .cse7) (= v_DerPreprocessor_32 .cse16) (= v_DerPreprocessor_33 .cse15) (= (select .cse16 .cse2) |c___ldv_list_add_#in~prev.offset|) (= |c___ldv_list_add_#in~next.offset| (select .cse16 |c___ldv_list_add_#in~next.offset|))))))) (exists ((v_DerPreprocessor_32 (Array Int Int)) (v_DerPreprocessor_33 (Array Int Int)) (v_DerPreprocessor_34 (Array Int Int))) (let ((.cse20 (store (store (store |c_#memory_$Pointer$#1.offset| |c___ldv_list_add_#in~next.base| v_DerPreprocessor_32) |c___ldv_list_add_#in~prev.base| v_DerPreprocessor_33) |c___ldv_list_add_#in~new.base| v_DerPreprocessor_34))) (let ((.cse18 (select .cse20 |c___ldv_list_add_#in~prev.base|)) (.cse19 (select .cse20 |c___ldv_list_add_#in~next.base|))) (and (= (store .cse18 |c___ldv_list_add_#in~prev.offset| |c___ldv_list_add_#in~next.offset|) .cse7) (= v_DerPreprocessor_32 .cse19) (= .cse19 .cse11) (= v_DerPreprocessor_33 .cse18) (= (select .cse19 .cse2) |c___ldv_list_add_#in~prev.offset|) (= |c___ldv_list_add_#in~next.offset| (select .cse19 |c___ldv_list_add_#in~next.offset|))))))) (= (let ((.cse21 (store |c_old(#memory_$Pointer$#1.base)| |c___ldv_list_add_#in~new.base| (store (store .cse1 |c___ldv_list_add_#in~next.offset| |c___ldv_list_add_#in~next.base|) .cse2 (select .cse4 .cse2))))) (store .cse21 |c___ldv_list_add_#in~prev.base| (store (select .cse21 |c___ldv_list_add_#in~prev.base|) |c___ldv_list_add_#in~prev.offset| |c___ldv_list_add_#in~new.base|))) |c_#memory_$Pointer$#1.base|) .cse14) (let ((.cse22 (not .cse9))) (and (or .cse22 (not .cse23)) (let ((.cse28 (store |c_old(#memory_$Pointer$#1.base)| |c___ldv_list_add_#in~next.base| (store (select |c_old(#memory_$Pointer$#1.base)| |c___ldv_list_add_#in~next.base|) .cse2 (select (select |c_#memory_$Pointer$#1.base| |c___ldv_list_add_#in~next.base|) .cse2))))) (let ((.cse29 (select .cse28 |c___ldv_list_add_#in~new.base|))) (let ((.cse42 (not .cse14)) (.cse65 (= (let ((.cse90 (store .cse28 |c___ldv_list_add_#in~new.base| (store .cse29 .cse91 |c___ldv_list_add_#in~next.base|)))) (store .cse90 |c___ldv_list_add_#in~prev.base| (store (select .cse90 |c___ldv_list_add_#in~prev.base|) |c___ldv_list_add_#in~prev.offset| |c___ldv_list_add_#in~new.base|))) |c_#memory_$Pointer$#1.base|))) (or (and (or (and .cse14 (exists ((v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_27 (Array Int Int)) (v_DerPreprocessor_25 (Array Int Int))) (let ((.cse25 (select v_DerPreprocessor_27 .cse2)) (.cse30 (store (store (store |c_#memory_$Pointer$#1.offset| |c___ldv_list_add_#in~new.base| v_DerPreprocessor_25) |c___ldv_list_add_#in~prev.base| v_DerPreprocessor_26) |c___ldv_list_add_#in~next.base| v_DerPreprocessor_27))) (let ((.cse24 (select .cse30 |c___ldv_list_add_#in~new.base|)) (.cse26 (+ .cse25 4))) (and (= (store (select (store (store (store |c_#memory_$Pointer$#1.offset| |c___ldv_list_add_#in~prev.base| v_DerPreprocessor_26) |c___ldv_list_add_#in~next.base| v_DerPreprocessor_27) |c___ldv_list_add_#in~new.base| (store (store .cse24 .cse25 |c___ldv_list_add_#in~next.offset|) .cse26 |c___ldv_list_add_#in~prev.offset|)) |c___ldv_list_add_#in~prev.base|) |c___ldv_list_add_#in~prev.offset| .cse25) .cse11) (= v_DerPreprocessor_25 .cse24) (not (= .cse25 |c___ldv_list_add_#in~next.offset|)) (= |c_#memory_$Pointer$#1.base| (let ((.cse27 (store .cse28 |c___ldv_list_add_#in~new.base| (store (store .cse29 .cse25 |c___ldv_list_add_#in~next.base|) .cse26 (select .cse4 .cse26))))) (store .cse27 |c___ldv_list_add_#in~prev.base| (store (select .cse27 |c___ldv_list_add_#in~prev.base|) |c___ldv_list_add_#in~prev.offset| |c___ldv_list_add_#in~new.base|)))) (= (select .cse30 |c___ldv_list_add_#in~prev.base|) v_DerPreprocessor_26) (not (= .cse25 .cse2))))))) (and (or (exists ((v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_27 (Array Int Int)) (v_DerPreprocessor_25 (Array Int Int))) (let ((.cse32 (select v_DerPreprocessor_27 .cse2))) (let ((.cse35 (store (store (store |c_#memory_$Pointer$#1.offset| |c___ldv_list_add_#in~new.base| v_DerPreprocessor_25) |c___ldv_list_add_#in~prev.base| v_DerPreprocessor_26) |c___ldv_list_add_#in~next.base| v_DerPreprocessor_27)) (.cse33 (+ .cse32 4))) (let ((.cse31 (store (store (select .cse35 |c___ldv_list_add_#in~new.base|) .cse32 |c___ldv_list_add_#in~next.offset|) .cse33 |c___ldv_list_add_#in~prev.offset|))) (and (= (store (select (store (store (store |c_#memory_$Pointer$#1.offset| |c___ldv_list_add_#in~prev.base| v_DerPreprocessor_26) |c___ldv_list_add_#in~next.base| v_DerPreprocessor_27) |c___ldv_list_add_#in~new.base| .cse31) |c___ldv_list_add_#in~prev.base|) |c___ldv_list_add_#in~prev.offset| .cse32) .cse11) (not (= .cse33 |c___ldv_list_add_#in~prev.offset|)) (= |c_#memory_$Pointer$#1.base| (let ((.cse34 (store .cse28 |c___ldv_list_add_#in~new.base| (store (store .cse29 .cse32 |c___ldv_list_add_#in~next.base|) .cse33 (select .cse4 .cse33))))) (store .cse34 |c___ldv_list_add_#in~prev.base| (store (select .cse34 |c___ldv_list_add_#in~prev.base|) |c___ldv_list_add_#in~prev.offset| |c___ldv_list_add_#in~new.base|)))) (= (select .cse35 |c___ldv_list_add_#in~prev.base|) v_DerPreprocessor_26) (= .cse31 .cse36)))))) (exists ((v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_27 (Array Int Int)) (v_DerPreprocessor_25 (Array Int Int))) (let ((.cse38 (select v_DerPreprocessor_27 .cse2))) (let ((.cse41 (store (store (store |c_#memory_$Pointer$#1.offset| |c___ldv_list_add_#in~new.base| v_DerPreprocessor_25) |c___ldv_list_add_#in~prev.base| v_DerPreprocessor_26) |c___ldv_list_add_#in~next.base| v_DerPreprocessor_27)) (.cse40 (+ .cse38 4))) (let ((.cse37 (store (store (select .cse41 |c___ldv_list_add_#in~new.base|) .cse38 |c___ldv_list_add_#in~next.offset|) .cse40 |c___ldv_list_add_#in~prev.offset|))) (and (= (store (select (store (store (store |c_#memory_$Pointer$#1.offset| |c___ldv_list_add_#in~prev.base| v_DerPreprocessor_26) |c___ldv_list_add_#in~next.base| v_DerPreprocessor_27) |c___ldv_list_add_#in~new.base| .cse37) |c___ldv_list_add_#in~prev.base|) |c___ldv_list_add_#in~prev.offset| .cse38) .cse11) (= |c_#memory_$Pointer$#1.base| (let ((.cse39 (store .cse28 |c___ldv_list_add_#in~new.base| (store (store .cse29 .cse38 |c___ldv_list_add_#in~next.base|) .cse40 (select .cse4 .cse40))))) (store .cse39 |c___ldv_list_add_#in~prev.base| (store (select .cse39 |c___ldv_list_add_#in~prev.base|) |c___ldv_list_add_#in~prev.offset| |c___ldv_list_add_#in~new.base|)))) (= (select .cse41 |c___ldv_list_add_#in~prev.base|) v_DerPreprocessor_26) (= .cse37 .cse36))))))) .cse42) (and .cse43 (exists ((v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_27 (Array Int Int)) (v_DerPreprocessor_25 (Array Int Int))) (let ((.cse45 (select v_DerPreprocessor_27 .cse2))) (let ((.cse48 (store (store (store |c_#memory_$Pointer$#1.offset| |c___ldv_list_add_#in~new.base| v_DerPreprocessor_25) |c___ldv_list_add_#in~prev.base| v_DerPreprocessor_26) |c___ldv_list_add_#in~next.base| v_DerPreprocessor_27)) (.cse47 (+ .cse45 4))) (let ((.cse44 (store (store (select .cse48 |c___ldv_list_add_#in~new.base|) .cse45 |c___ldv_list_add_#in~next.offset|) .cse47 |c___ldv_list_add_#in~prev.offset|))) (and (= (store (select (store (store (store |c_#memory_$Pointer$#1.offset| |c___ldv_list_add_#in~prev.base| v_DerPreprocessor_26) |c___ldv_list_add_#in~next.base| v_DerPreprocessor_27) |c___ldv_list_add_#in~new.base| .cse44) |c___ldv_list_add_#in~prev.base|) |c___ldv_list_add_#in~prev.offset| .cse45) .cse11) (not (= .cse45 |c___ldv_list_add_#in~next.offset|)) (= |c_#memory_$Pointer$#1.base| (let ((.cse46 (store .cse28 |c___ldv_list_add_#in~new.base| (store (store .cse29 .cse45 |c___ldv_list_add_#in~next.base|) .cse47 (select .cse4 .cse47))))) (store .cse46 |c___ldv_list_add_#in~prev.base| (store (select .cse46 |c___ldv_list_add_#in~prev.base|) |c___ldv_list_add_#in~prev.offset| |c___ldv_list_add_#in~new.base|)))) (= (select .cse48 |c___ldv_list_add_#in~prev.base|) v_DerPreprocessor_26) (= .cse44 .cse36) (not (= .cse45 .cse2)))))))) (exists ((v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_27 (Array Int Int)) (v_DerPreprocessor_25 (Array Int Int))) (let ((.cse50 (select v_DerPreprocessor_27 .cse2)) (.cse54 (store (store (store |c_#memory_$Pointer$#1.offset| |c___ldv_list_add_#in~new.base| v_DerPreprocessor_25) |c___ldv_list_add_#in~prev.base| v_DerPreprocessor_26) |c___ldv_list_add_#in~next.base| v_DerPreprocessor_27))) (let ((.cse51 (select .cse54 |c___ldv_list_add_#in~new.base|)) (.cse52 (+ .cse50 4))) (let ((.cse49 (store (store .cse51 .cse50 |c___ldv_list_add_#in~next.offset|) .cse52 |c___ldv_list_add_#in~prev.offset|))) (and (= (store (select (store (store (store |c_#memory_$Pointer$#1.offset| |c___ldv_list_add_#in~prev.base| v_DerPreprocessor_26) |c___ldv_list_add_#in~next.base| v_DerPreprocessor_27) |c___ldv_list_add_#in~new.base| .cse49) |c___ldv_list_add_#in~prev.base|) |c___ldv_list_add_#in~prev.offset| .cse50) .cse11) (= v_DerPreprocessor_25 .cse51) (not (= .cse50 |c___ldv_list_add_#in~next.offset|)) (not (= .cse52 |c___ldv_list_add_#in~prev.offset|)) (= |c_#memory_$Pointer$#1.base| (let ((.cse53 (store .cse28 |c___ldv_list_add_#in~new.base| (store (store .cse29 .cse50 |c___ldv_list_add_#in~next.base|) .cse52 (select .cse4 .cse52))))) (store .cse53 |c___ldv_list_add_#in~prev.base| (store (select .cse53 |c___ldv_list_add_#in~prev.base|) |c___ldv_list_add_#in~prev.offset| |c___ldv_list_add_#in~new.base|)))) (= (select .cse54 |c___ldv_list_add_#in~prev.base|) v_DerPreprocessor_26) (= .cse49 .cse36) (not (= .cse50 .cse2))))))) (and .cse42 (or (exists ((v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_27 (Array Int Int)) (v_DerPreprocessor_25 (Array Int Int))) (let ((.cse56 (select v_DerPreprocessor_27 .cse2))) (let ((.cse59 (store (store (store |c_#memory_$Pointer$#1.offset| |c___ldv_list_add_#in~new.base| v_DerPreprocessor_25) |c___ldv_list_add_#in~prev.base| v_DerPreprocessor_26) |c___ldv_list_add_#in~next.base| v_DerPreprocessor_27)) (.cse58 (+ .cse56 4))) (let ((.cse55 (store (store (select .cse59 |c___ldv_list_add_#in~new.base|) .cse56 |c___ldv_list_add_#in~next.offset|) .cse58 |c___ldv_list_add_#in~prev.offset|))) (and (= (store (select (store (store (store |c_#memory_$Pointer$#1.offset| |c___ldv_list_add_#in~prev.base| v_DerPreprocessor_26) |c___ldv_list_add_#in~next.base| v_DerPreprocessor_27) |c___ldv_list_add_#in~new.base| .cse55) |c___ldv_list_add_#in~prev.base|) |c___ldv_list_add_#in~prev.offset| .cse56) .cse11) (= |c_#memory_$Pointer$#1.base| (let ((.cse57 (store .cse28 |c___ldv_list_add_#in~new.base| (store (store .cse29 .cse56 |c___ldv_list_add_#in~next.base|) .cse58 (select .cse4 .cse58))))) (store .cse57 |c___ldv_list_add_#in~prev.base| (store (select .cse57 |c___ldv_list_add_#in~prev.base|) |c___ldv_list_add_#in~prev.offset| |c___ldv_list_add_#in~new.base|)))) (= (select .cse59 |c___ldv_list_add_#in~prev.base|) v_DerPreprocessor_26) (= .cse55 .cse36) (not (= .cse56 .cse2))))))) (exists ((v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_27 (Array Int Int)) (v_DerPreprocessor_25 (Array Int Int))) (let ((.cse61 (select v_DerPreprocessor_27 .cse2))) (let ((.cse64 (store (store (store |c_#memory_$Pointer$#1.offset| |c___ldv_list_add_#in~new.base| v_DerPreprocessor_25) |c___ldv_list_add_#in~prev.base| v_DerPreprocessor_26) |c___ldv_list_add_#in~next.base| v_DerPreprocessor_27)) (.cse62 (+ .cse61 4))) (let ((.cse60 (store (store (select .cse64 |c___ldv_list_add_#in~new.base|) .cse61 |c___ldv_list_add_#in~next.offset|) .cse62 |c___ldv_list_add_#in~prev.offset|))) (and (= (store (select (store (store (store |c_#memory_$Pointer$#1.offset| |c___ldv_list_add_#in~prev.base| v_DerPreprocessor_26) |c___ldv_list_add_#in~next.base| v_DerPreprocessor_27) |c___ldv_list_add_#in~new.base| .cse60) |c___ldv_list_add_#in~prev.base|) |c___ldv_list_add_#in~prev.offset| .cse61) .cse11) (not (= .cse62 |c___ldv_list_add_#in~prev.offset|)) (= |c_#memory_$Pointer$#1.base| (let ((.cse63 (store .cse28 |c___ldv_list_add_#in~new.base| (store (store .cse29 .cse61 |c___ldv_list_add_#in~next.base|) .cse62 (select .cse4 .cse62))))) (store .cse63 |c___ldv_list_add_#in~prev.base| (store (select .cse63 |c___ldv_list_add_#in~prev.base|) |c___ldv_list_add_#in~prev.offset| |c___ldv_list_add_#in~new.base|)))) (= (select .cse64 |c___ldv_list_add_#in~prev.base|) v_DerPreprocessor_26) (= .cse60 .cse36) (not (= .cse61 .cse2))))))))) (and .cse65 .cse66 .cse67 .cse68 .cse69)) .cse9) (and (or (exists ((v_DerPreprocessor_30 (Array Int Int))) (let ((.cse71 (select v_DerPreprocessor_30 .cse2))) (let ((.cse72 (+ .cse71 4))) (and (= |c_#memory_$Pointer$#1.base| (let ((.cse70 (store .cse28 |c___ldv_list_add_#in~new.base| (store (store .cse29 .cse71 |c___ldv_list_add_#in~next.base|) .cse72 (select .cse4 .cse72))))) (store .cse70 |c___ldv_list_add_#in~prev.base| (store (select .cse70 |c___ldv_list_add_#in~prev.base|) |c___ldv_list_add_#in~prev.offset| |c___ldv_list_add_#in~new.base|)))) (not (= |c___ldv_list_add_#in~next.offset| .cse71)) (not (= .cse2 .cse71)) (exists ((v_DerPreprocessor_28 (Array Int Int)) (v_DerPreprocessor_29 (Array Int Int))) (let ((.cse74 (store (store (store |c_#memory_$Pointer$#1.offset| |c___ldv_list_add_#in~new.base| v_DerPreprocessor_28) |c___ldv_list_add_#in~prev.base| v_DerPreprocessor_29) |c___ldv_list_add_#in~next.base| v_DerPreprocessor_30))) (let ((.cse75 (select .cse74 |c___ldv_list_add_#in~new.base|))) (let ((.cse73 (store (store .cse75 .cse71 |c___ldv_list_add_#in~next.offset|) .cse72 |c___ldv_list_add_#in~prev.offset|))) (and (= .cse73 .cse11) (= (store (select (store (store (store |c_#memory_$Pointer$#1.offset| |c___ldv_list_add_#in~prev.base| v_DerPreprocessor_29) |c___ldv_list_add_#in~next.base| v_DerPreprocessor_30) |c___ldv_list_add_#in~new.base| .cse73) |c___ldv_list_add_#in~prev.base|) |c___ldv_list_add_#in~prev.offset| .cse71) .cse7) (= v_DerPreprocessor_29 (select .cse74 |c___ldv_list_add_#in~prev.base|)) (= v_DerPreprocessor_28 .cse75)))))) (not (= .cse72 |c___ldv_list_add_#in~prev.offset|)))))) (and (exists ((v_DerPreprocessor_30 (Array Int Int)) (v_DerPreprocessor_28 (Array Int Int)) (v_DerPreprocessor_29 (Array Int Int))) (let ((.cse80 (store (store (store |c_#memory_$Pointer$#1.offset| |c___ldv_list_add_#in~new.base| v_DerPreprocessor_28) |c___ldv_list_add_#in~prev.base| v_DerPreprocessor_29) |c___ldv_list_add_#in~next.base| v_DerPreprocessor_30)) (.cse77 (select v_DerPreprocessor_30 .cse2))) (let ((.cse78 (+ .cse77 4)) (.cse79 (select .cse80 |c___ldv_list_add_#in~new.base|))) (and (= |c_#memory_$Pointer$#1.base| (let ((.cse76 (store .cse28 |c___ldv_list_add_#in~new.base| (store (store .cse29 .cse77 |c___ldv_list_add_#in~next.base|) .cse78 (select .cse4 .cse78))))) (store .cse76 |c___ldv_list_add_#in~prev.base| (store (select .cse76 |c___ldv_list_add_#in~prev.base|) |c___ldv_list_add_#in~prev.offset| |c___ldv_list_add_#in~new.base|)))) (= (store (select (store (store (store |c_#memory_$Pointer$#1.offset| |c___ldv_list_add_#in~prev.base| v_DerPreprocessor_29) |c___ldv_list_add_#in~next.base| v_DerPreprocessor_30) |c___ldv_list_add_#in~new.base| (store (store .cse79 .cse77 |c___ldv_list_add_#in~next.offset|) .cse78 |c___ldv_list_add_#in~prev.offset|)) |c___ldv_list_add_#in~prev.base|) |c___ldv_list_add_#in~prev.offset| .cse77) .cse7) (= v_DerPreprocessor_29 (select .cse80 |c___ldv_list_add_#in~prev.base|)) (not (= |c___ldv_list_add_#in~next.offset| .cse77)) (not (= .cse2 .cse77)) (= v_DerPreprocessor_28 .cse79))))) .cse9) (and .cse43 (exists ((v_DerPreprocessor_30 (Array Int Int))) (let ((.cse82 (select v_DerPreprocessor_30 .cse2))) (let ((.cse83 (+ .cse82 4))) (and (= |c_#memory_$Pointer$#1.base| (let ((.cse81 (store .cse28 |c___ldv_list_add_#in~new.base| (store (store .cse29 .cse82 |c___ldv_list_add_#in~next.base|) .cse83 (select .cse4 .cse83))))) (store .cse81 |c___ldv_list_add_#in~prev.base| (store (select .cse81 |c___ldv_list_add_#in~prev.base|) |c___ldv_list_add_#in~prev.offset| |c___ldv_list_add_#in~new.base|)))) (exists ((v_DerPreprocessor_28 (Array Int Int)) (v_DerPreprocessor_29 (Array Int Int))) (let ((.cse85 (select (store (store (store |c_#memory_$Pointer$#1.offset| |c___ldv_list_add_#in~new.base| v_DerPreprocessor_28) |c___ldv_list_add_#in~prev.base| v_DerPreprocessor_29) |c___ldv_list_add_#in~next.base| v_DerPreprocessor_30) |c___ldv_list_add_#in~new.base|))) (let ((.cse84 (store (store .cse85 .cse82 |c___ldv_list_add_#in~next.offset|) .cse83 |c___ldv_list_add_#in~prev.offset|))) (and (= .cse84 .cse11) (= (store (select (store (store (store |c_#memory_$Pointer$#1.offset| |c___ldv_list_add_#in~prev.base| v_DerPreprocessor_29) |c___ldv_list_add_#in~next.base| v_DerPreprocessor_30) |c___ldv_list_add_#in~new.base| .cse84) |c___ldv_list_add_#in~prev.base|) |c___ldv_list_add_#in~prev.offset| .cse82) .cse7) (= v_DerPreprocessor_28 .cse85))))) (not (= |c___ldv_list_add_#in~next.offset| .cse82)) (not (= .cse2 .cse82)))))))) .cse14) (and .cse22 .cse42 (or (and .cse65 .cse66 .cse67 .cse69) (and (= |c_#memory_$Pointer$#1.base| (let ((.cse86 (store .cse28 |c___ldv_list_add_#in~new.base| (store (store .cse29 .cse87 |c___ldv_list_add_#in~next.base|) .cse88 .cse89)))) (store .cse86 |c___ldv_list_add_#in~prev.base| (store (select .cse86 |c___ldv_list_add_#in~prev.base|) |c___ldv_list_add_#in~prev.offset| |c___ldv_list_add_#in~new.base|)))) (or (and (= |c___ldv_list_add_#in~next.offset| (select .cse36 .cse87)) (= |c___ldv_list_add_#in~prev.offset| (select .cse36 .cse88))) (and (= (select .cse7 .cse88) |c___ldv_list_add_#in~prev.offset|) (= |c___ldv_list_add_#in~prev.offset| .cse87) .cse69))))))))))) (and .cse23 .cse9 (or (let ((.cse93 (select .cse11 |c___ldv_list_add_#in~prev.offset|))) (let ((.cse94 (+ .cse93 4))) (and (or (and (exists ((v_arrayElimArr_11 (Array Int Int)) (v_DerPreprocessor_16 (Array Int Int)) (v_DerPreprocessor_17 (Array Int Int))) (let ((.cse95 (store (store (store |c_#memory_$Pointer$#1.offset| |c___ldv_list_add_#in~new.base| v_DerPreprocessor_16) |c___ldv_list_add_#in~prev.base| v_DerPreprocessor_17) |c___ldv_list_add_#in~next.base| v_arrayElimArr_11))) (let ((.cse92 (select .cse95 |c___ldv_list_add_#in~new.base|))) (and (= (store (select (store (store (store |c_#memory_$Pointer$#1.offset| |c___ldv_list_add_#in~prev.base| v_DerPreprocessor_17) |c___ldv_list_add_#in~next.base| v_arrayElimArr_11) |c___ldv_list_add_#in~new.base| (store (store .cse92 .cse93 |c___ldv_list_add_#in~next.offset|) .cse94 |c___ldv_list_add_#in~prev.offset|)) |c___ldv_list_add_#in~prev.base|) |c___ldv_list_add_#in~prev.offset| .cse93) .cse11) (= .cse93 (select v_arrayElimArr_11 .cse2)) (= .cse92 v_DerPreprocessor_16) (= v_DerPreprocessor_17 (select .cse95 |c___ldv_list_add_#in~prev.base|)))))) .cse14) (exists ((v_arrayElimArr_11 (Array Int Int))) (and (= .cse93 (select v_arrayElimArr_11 .cse2)) (exists ((v_DerPreprocessor_16 (Array Int Int)) (v_DerPreprocessor_17 (Array Int Int))) (let ((.cse98 (store (store (store |c_#memory_$Pointer$#1.offset| |c___ldv_list_add_#in~new.base| v_DerPreprocessor_16) |c___ldv_list_add_#in~prev.base| v_DerPreprocessor_17) |c___ldv_list_add_#in~next.base| v_arrayElimArr_11))) (let ((.cse97 (select .cse98 |c___ldv_list_add_#in~new.base|))) (let ((.cse96 (store (store .cse97 .cse93 |c___ldv_list_add_#in~next.offset|) .cse94 |c___ldv_list_add_#in~prev.offset|))) (and (= (store (select (store (store (store |c_#memory_$Pointer$#1.offset| |c___ldv_list_add_#in~prev.base| v_DerPreprocessor_17) |c___ldv_list_add_#in~next.base| v_arrayElimArr_11) |c___ldv_list_add_#in~new.base| .cse96) |c___ldv_list_add_#in~prev.base|) |c___ldv_list_add_#in~prev.offset| .cse93) .cse11) (= .cse96 .cse36) (= .cse97 v_DerPreprocessor_16) (= v_DerPreprocessor_17 (select .cse98 |c___ldv_list_add_#in~prev.base|)))))))))) (= |c_#memory_$Pointer$#1.base| (let ((.cse99 (store |c_old(#memory_$Pointer$#1.base)| |c___ldv_list_add_#in~new.base| (store (store .cse1 .cse93 |c___ldv_list_add_#in~next.base|) .cse94 (select .cse4 .cse94))))) (store .cse99 |c___ldv_list_add_#in~prev.base| (store (select .cse99 |c___ldv_list_add_#in~prev.base|) |c___ldv_list_add_#in~prev.offset| |c___ldv_list_add_#in~new.base|)))) (or (not (= |c___ldv_list_add_#in~prev.offset| .cse94)) .cse43)))) (and (exists ((v_DerPreprocessor_20 (Array Int Int)) (v_DerPreprocessor_21 (Array Int Int)) (v_DerPreprocessor_19 (Array Int Int))) (let ((.cse102 (store (store (store |c_#memory_$Pointer$#1.offset| |c___ldv_list_add_#in~new.base| v_DerPreprocessor_19) |c___ldv_list_add_#in~prev.base| v_DerPreprocessor_20) |c___ldv_list_add_#in~next.base| v_DerPreprocessor_21))) (let ((.cse101 (select .cse102 |c___ldv_list_add_#in~new.base|)) (.cse100 (select .cse102 |c___ldv_list_add_#in~prev.base|))) (and (= .cse87 (select .cse100 .cse2)) (= v_DerPreprocessor_19 .cse101) (= (store (select (store (store (store |c_#memory_$Pointer$#1.offset| |c___ldv_list_add_#in~prev.base| v_DerPreprocessor_20) |c___ldv_list_add_#in~next.base| v_DerPreprocessor_21) |c___ldv_list_add_#in~new.base| (store (store .cse101 .cse87 |c___ldv_list_add_#in~next.offset|) .cse88 |c___ldv_list_add_#in~prev.offset|)) |c___ldv_list_add_#in~prev.base|) |c___ldv_list_add_#in~prev.offset| .cse87) .cse7) (= v_DerPreprocessor_20 .cse100))))) (= |c_#memory_$Pointer$#1.base| (let ((.cse103 (store |c_old(#memory_$Pointer$#1.base)| |c___ldv_list_add_#in~new.base| (store (store .cse1 .cse87 |c___ldv_list_add_#in~next.base|) .cse88 .cse89)))) (store .cse103 |c___ldv_list_add_#in~prev.base| (store (select .cse103 |c___ldv_list_add_#in~prev.base|) |c___ldv_list_add_#in~prev.offset| |c___ldv_list_add_#in~new.base|)))) (not .cse66) .cse14) (and (= (let ((.cse104 (store |c_old(#memory_$Pointer$#1.base)| |c___ldv_list_add_#in~new.base| (store .cse1 .cse91 |c___ldv_list_add_#in~next.base|)))) (store .cse104 |c___ldv_list_add_#in~prev.base| (store (select .cse104 |c___ldv_list_add_#in~prev.base|) |c___ldv_list_add_#in~prev.offset| |c___ldv_list_add_#in~new.base|))) |c_#memory_$Pointer$#1.base|) .cse67 .cse68 .cse69)))))))) (= 3 |c_~#mutexes~0.base|)) is different from false [2024-11-23 23:37:30,768 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-23 23:37:30,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-23 23:37:30,810 INFO L349 Elim1Store]: treesize reduction 25, result has 45.7 percent of original size [2024-11-23 23:37:30,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 42 [2024-11-23 23:37:30,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-23 23:37:30,893 INFO L349 Elim1Store]: treesize reduction 45, result has 2.2 percent of original size [2024-11-23 23:37:30,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 1 [2024-11-23 23:37:31,099 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 60 treesize of output 50 [2024-11-23 23:37:31,279 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 129 treesize of output 101 [2024-11-23 23:37:31,287 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-23 23:37:31,418 INFO L349 Elim1Store]: treesize reduction 94, result has 23.0 percent of original size [2024-11-23 23:37:31,419 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 95 treesize of output 89 [2024-11-23 23:37:32,093 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 91 treesize of output 81 [2024-11-23 23:37:32,117 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 96 treesize of output 84 [2024-11-23 23:37:32,829 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 82 treesize of output 74 [2024-11-23 23:37:32,933 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 88 treesize of output 78 [2024-11-23 23:37:36,754 INFO L349 Elim1Store]: treesize reduction 46, result has 38.7 percent of original size [2024-11-23 23:37:36,755 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 46 [2024-11-23 23:37:36,765 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 71 treesize of output 55 [2024-11-23 23:37:39,492 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 129 treesize of output 101 [2024-11-23 23:37:39,521 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-23 23:37:39,724 INFO L349 Elim1Store]: treesize reduction 94, result has 23.0 percent of original size [2024-11-23 23:37:39,724 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 95 treesize of output 89 [2024-11-23 23:37:42,320 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 66 treesize of output 52 [2024-11-23 23:37:42,448 INFO L349 Elim1Store]: treesize reduction 60, result has 36.8 percent of original size [2024-11-23 23:37:42,449 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 47 [2024-11-23 23:37:46,542 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_~#mutexes~0.offset| 0) (= 3 |c_~#mutexes~0.base|) (let ((.cse5 (select |c_#memory_$Pointer$#1.base| 3))) (let ((.cse17 (select .cse5 0))) (let ((.cse2 (select |c_#memory_$Pointer$#1.offset| 3)) (.cse42 (store (select |c_old(#memory_$Pointer$#1.base)| .cse17) 0 |c_mutex_lock_#in~m#1.base|))) (let ((.cse20 (store |c_old(#memory_$Pointer$#1.base)| .cse17 .cse42)) (.cse4 (select |c_old(#memory_$Pointer$#1.base)| 3)) (.cse12 (select .cse2 0))) (let ((.cse51 (+ .cse12 4)) (.cse107 (store |c_old(#memory_$Pointer$#1.base)| 3 (store .cse4 0 |c_mutex_lock_#in~m#1.base|))) (.cse18 (select (select .cse20 3) 0))) (let ((.cse48 (= .cse18 3)) (.cse45 (select .cse4 0)) (.cse1 (= |c_mutex_lock_#in~m#1.base| 3)) (.cse32 (= .cse18 .cse17)) (.cse23 (select |c_#memory_$Pointer$#1.base| .cse17)) (.cse50 (select |c_#memory_$Pointer$#1.offset| .cse17)) (.cse53 (= .cse17 3)) (.cse108 (select .cse107 |c_mutex_lock_#in~m#1.base|)) (.cse110 (select |c_#memory_$Pointer$#1.base| |c_mutex_lock_#in~m#1.base|)) (.cse101 (+ (select .cse2 (- 4)) 4)) (.cse14 (select .cse2 .cse12)) (.cse52 (= 0 (select .cse2 .cse51))) (.cse35 (= .cse51 0))) (let ((.cse13 (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| 3 (store (store (store .cse4 .cse12 3) .cse51 (select .cse5 .cse51)) 0 3)))) (.cse15 (or .cse52 .cse35)) (.cse46 (+ .cse14 4)) (.cse36 (= |c_#memory_$Pointer$#1.base| (let ((.cse164 (store .cse108 .cse101 (select .cse110 .cse101)))) (store (store |c_old(#memory_$Pointer$#1.base)| |c_mutex_lock_#in~m#1.base| .cse164) 3 (store (store (select (store .cse107 |c_mutex_lock_#in~m#1.base| .cse164) 3) (- 4) |c_mutex_lock_#in~m#1.base|) 0 3))))) (.cse47 (not .cse53)) (.cse37 (not (= .cse101 0))) (.cse94 (= (select .cse50 .cse51) 0)) (.cse95 (select .cse50 .cse12)) (.cse55 (select .cse23 .cse51)) (.cse24 (select .cse20 .cse18)) (.cse26 (select |c_#memory_$Pointer$#1.base| .cse18)) (.cse100 (not .cse32)) (.cse28 (select |c_#memory_$Pointer$#1.offset| .cse18)) (.cse34 (not .cse1)) (.cse0 (= (select |c_old(#valid)| 3) 0)) (.cse6 (select .cse5 4)) (.cse7 (= .cse12 0)) (.cse8 (= (select .cse2 4) 0)) (.cse85 (= .cse45 3)) (.cse73 (select .cse20 .cse45)) (.cse74 (select |c_#memory_$Pointer$#1.base| .cse45)) (.cse44 (select |c_#memory_$Pointer$#1.offset| .cse45)) (.cse76 (not .cse48)) (.cse33 (= (select |c_old(#valid)| .cse17) 0))) (or (and .cse0 .cse1 (or (and (exists ((v_arrayElimCell_70 Int)) (let ((.cse3 (+ 4 v_arrayElimCell_70))) (and (= (select .cse2 .cse3) 0) (not (= .cse3 0)) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| 3 (store (store (store .cse4 .cse3 (select .cse5 .cse3)) 4 .cse6) 0 3))) (not (= v_arrayElimCell_70 0))))) .cse7 .cse8) (exists ((v_arrayElimCell_70 Int)) (let ((.cse9 (+ 4 v_arrayElimCell_70))) (let ((.cse11 (select .cse2 .cse9))) (let ((.cse10 (+ .cse11 4))) (and (not (= .cse9 0)) (= (select .cse2 .cse10) 0) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| 3 (store (store (store (store .cse4 .cse9 (select .cse5 .cse9)) .cse11 3) .cse10 (select .cse5 .cse10)) 0 3))) (not (= .cse11 v_arrayElimCell_70)) (= (select .cse2 .cse11) v_arrayElimCell_70) (= .cse11 .cse12)))))))) (and .cse13 .cse0 .cse1 (= .cse14 .cse12) .cse15) (and (exists ((v_DerPreprocessor_30 (Array Int Int)) (v_DerPreprocessor_15 (Array Int Int)) (v_DerPreprocessor_28 (Array Int Int)) (v_DerPreprocessor_29 (Array Int Int))) (let ((.cse30 (select (select (store |c_old(#memory_$Pointer$#1.offset)| .cse17 v_DerPreprocessor_15) 3) 0))) (let ((.cse25 (+ .cse30 4))) (let ((.cse21 (select v_DerPreprocessor_30 .cse25)) (.cse29 (store (store (store |c_#memory_$Pointer$#1.offset| .cse17 v_DerPreprocessor_28) 3 v_DerPreprocessor_29) .cse18 v_DerPreprocessor_30))) (let ((.cse31 (select .cse29 .cse17)) (.cse22 (+ .cse21 4))) (let ((.cse27 (store (store .cse31 .cse21 .cse30) .cse22 0))) (and (= (let ((.cse16 (let ((.cse19 (store .cse24 .cse25 (select .cse26 .cse25)))) (store (store |c_old(#memory_$Pointer$#1.base)| .cse18 .cse19) .cse17 (store (store (select (store .cse20 .cse18 .cse19) .cse17) .cse21 .cse18) .cse22 (select .cse23 .cse22)))))) (store .cse16 3 (store (select .cse16 3) 0 .cse17))) |c_#memory_$Pointer$#1.base|) (= .cse27 .cse28) (= v_DerPreprocessor_29 (select .cse29 3)) (not (= .cse21 .cse30)) (not (= .cse22 0)) (not (= .cse21 .cse25)) (not (= .cse25 0)) (= v_DerPreprocessor_28 .cse31) (= .cse2 (store (select (store (store (store |c_#memory_$Pointer$#1.offset| 3 v_DerPreprocessor_29) .cse18 v_DerPreprocessor_30) .cse17 .cse27) 3) 0 .cse21))))))))) .cse32 .cse33) (and .cse34 .cse0 .cse35 .cse36 .cse37) (and .cse32 (exists ((v_DerPreprocessor_32 (Array Int Int)) (v_DerPreprocessor_15 (Array Int Int)) (v_DerPreprocessor_33 (Array Int Int)) (v_DerPreprocessor_34 (Array Int Int))) (let ((.cse38 (store (store (store |c_#memory_$Pointer$#1.offset| .cse18 v_DerPreprocessor_32) 3 v_DerPreprocessor_33) .cse17 v_DerPreprocessor_34)) (.cse39 (select (select (store |c_old(#memory_$Pointer$#1.offset)| .cse17 v_DerPreprocessor_15) 3) 0))) (let ((.cse43 (+ .cse39 4)) (.cse40 (select .cse38 .cse18))) (and (= (store (select .cse38 3) 0 .cse39) .cse2) (= (select .cse40 .cse39) .cse39) (= |c_#memory_$Pointer$#1.base| (let ((.cse41 (store |c_old(#memory_$Pointer$#1.base)| .cse17 (store (store .cse42 .cse39 .cse18) .cse43 (select .cse23 .cse43))))) (store .cse41 3 (store (select .cse41 3) 0 .cse17)))) (= (select .cse40 .cse43) 0) (= .cse44 (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse45 v_DerPreprocessor_32) 3 v_DerPreprocessor_33) .cse17 v_DerPreprocessor_34) .cse45)) (= .cse40 v_DerPreprocessor_32))))) .cse33) (and .cse13 .cse0 .cse1 (= .cse46 .cse12) .cse15) (and (or .cse47 (not .cse35)) .cse48 (or (exists ((v_DerPreprocessor_16 (Array Int Int)) (v_DerPreprocessor_17 (Array Int Int))) (let ((.cse49 (store (store (select (store (store |c_#memory_$Pointer$#1.offset| .cse17 v_DerPreprocessor_16) 3 v_DerPreprocessor_17) .cse17) .cse12 (- 4)) .cse51 0))) (and (= .cse12 (select v_DerPreprocessor_17 0)) (= .cse2 (store (select (store (store |c_#memory_$Pointer$#1.offset| 3 v_DerPreprocessor_17) .cse17 .cse49) 3) 0 .cse12)) (= .cse50 .cse49)))) (and .cse52 (= .cse46 0) .cse53)) (exists ((v_DerPreprocessor_15 (Array Int Int))) (= (+ (select (select (store |c_old(#memory_$Pointer$#1.offset)| .cse17 v_DerPreprocessor_15) 3) 0) 4) 0)) .cse33 (= |c_#memory_$Pointer$#1.base| (let ((.cse54 (store |c_old(#memory_$Pointer$#1.base)| .cse17 (store (store .cse42 .cse12 3) .cse51 .cse55)))) (store .cse54 3 (store (select .cse54 3) 0 .cse17))))) (exists ((|mutex_lock_ldv_list_add_~new#1.base| Int)) (let ((.cse63 (store |c_old(#memory_$Pointer$#1.base)| |mutex_lock_ldv_list_add_~new#1.base| (store (select |c_old(#memory_$Pointer$#1.base)| |mutex_lock_ldv_list_add_~new#1.base|) 0 |c_mutex_lock_#in~m#1.base|)))) (let ((.cse56 (select .cse63 3))) (and (= (select |c_old(#valid)| |mutex_lock_ldv_list_add_~new#1.base|) 0) (= (select .cse56 0) 3) (exists ((v_DerPreprocessor_15 (Array Int Int))) (let ((.cse65 (select (select (store |c_old(#memory_$Pointer$#1.offset)| |mutex_lock_ldv_list_add_~new#1.base| v_DerPreprocessor_15) 3) 0))) (let ((.cse57 (+ .cse65 4))) (and (not (= .cse57 0)) (exists ((v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_25 (Array Int Int))) (let ((.cse64 (select v_DerPreprocessor_26 .cse57))) (let ((.cse58 (select (store (store |c_#memory_$Pointer$#1.offset| |mutex_lock_ldv_list_add_~new#1.base| v_DerPreprocessor_25) 3 v_DerPreprocessor_26) |mutex_lock_ldv_list_add_~new#1.base|)) (.cse60 (+ .cse64 4))) (let ((.cse59 (store (store .cse58 .cse64 .cse65) .cse60 0))) (and (= v_DerPreprocessor_25 .cse58) (= (select |c_#memory_$Pointer$#1.offset| |mutex_lock_ldv_list_add_~new#1.base|) .cse59) (not (= .cse60 0)) (= |c_#memory_$Pointer$#1.base| (let ((.cse62 (store .cse56 .cse57 (select .cse5 .cse57)))) (let ((.cse61 (store (store (select (store .cse63 3 .cse62) |mutex_lock_ldv_list_add_~new#1.base|) .cse64 3) .cse60 (select (select |c_#memory_$Pointer$#1.base| |mutex_lock_ldv_list_add_~new#1.base|) .cse60)))) (store (store |c_old(#memory_$Pointer$#1.base)| |mutex_lock_ldv_list_add_~new#1.base| .cse61) 3 (store (select (store (store |c_old(#memory_$Pointer$#1.base)| 3 .cse62) |mutex_lock_ldv_list_add_~new#1.base| .cse61) 3) 0 |mutex_lock_ldv_list_add_~new#1.base|))))) (not (= .cse65 .cse64)) (= .cse2 (store (select (store (store |c_#memory_$Pointer$#1.offset| 3 v_DerPreprocessor_26) |mutex_lock_ldv_list_add_~new#1.base| .cse59) 3) 0 .cse64)) (not (= .cse64 .cse57))))))))))))))) (and .cse34 .cse0 .cse35 .cse36) (and (exists ((v_DerPreprocessor_30 (Array Int Int)) (v_DerPreprocessor_15 (Array Int Int)) (v_DerPreprocessor_28 (Array Int Int)) (v_DerPreprocessor_29 (Array Int Int))) (let ((.cse67 (select (select (store |c_old(#memory_$Pointer$#1.offset)| .cse17 v_DerPreprocessor_15) 3) 0))) (let ((.cse68 (+ .cse67 4))) (let ((.cse66 (select v_DerPreprocessor_30 .cse68)) (.cse75 (store (store |c_#memory_$Pointer$#1.offset| .cse17 v_DerPreprocessor_28) 3 v_DerPreprocessor_29))) (let ((.cse69 (select (store .cse75 .cse18 v_DerPreprocessor_30) .cse17)) (.cse72 (+ .cse66 4))) (and (not (= .cse66 .cse67)) (not (= .cse66 .cse68)) (= v_DerPreprocessor_28 .cse69) (= |c_#memory_$Pointer$#1.base| (let ((.cse70 (let ((.cse71 (store .cse73 .cse68 (select .cse74 .cse68)))) (store (store |c_old(#memory_$Pointer$#1.base)| .cse45 .cse71) .cse17 (store (store (select (store .cse20 .cse45 .cse71) .cse17) .cse66 .cse45) .cse72 (select .cse23 .cse72)))))) (store .cse70 3 (store (select .cse70 3) 0 .cse17)))) (= (store (store (select (store .cse75 .cse45 v_DerPreprocessor_30) .cse17) .cse66 .cse67) .cse72 0) .cse44) (= .cse2 (store (select (store (store (store |c_#memory_$Pointer$#1.offset| 3 v_DerPreprocessor_29) .cse18 v_DerPreprocessor_30) .cse17 (store (store .cse69 .cse66 .cse67) .cse72 0)) 3) 0 .cse66)))))))) .cse32 .cse76 .cse33) (exists ((|mutex_lock_ldv_list_add_~new#1.base| Int)) (and (= (select |c_old(#valid)| |mutex_lock_ldv_list_add_~new#1.base|) 0) (exists ((v_DerPreprocessor_15 (Array Int Int))) (let ((.cse84 (select (select (store |c_old(#memory_$Pointer$#1.offset)| |mutex_lock_ldv_list_add_~new#1.base| v_DerPreprocessor_15) 3) 0))) (let ((.cse83 (+ .cse84 4))) (and (exists ((v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_25 (Array Int Int))) (let ((.cse81 (select v_DerPreprocessor_26 .cse83))) (let ((.cse82 (+ .cse81 4))) (let ((.cse77 (store (store (select (store (store |c_#memory_$Pointer$#1.offset| |mutex_lock_ldv_list_add_~new#1.base| v_DerPreprocessor_25) 3 v_DerPreprocessor_26) |mutex_lock_ldv_list_add_~new#1.base|) .cse81 .cse84) .cse82 0))) (and (= (select |c_#memory_$Pointer$#1.offset| |mutex_lock_ldv_list_add_~new#1.base|) .cse77) (= |c_#memory_$Pointer$#1.base| (let ((.cse80 (store |c_old(#memory_$Pointer$#1.base)| |mutex_lock_ldv_list_add_~new#1.base| (store (select |c_old(#memory_$Pointer$#1.base)| |mutex_lock_ldv_list_add_~new#1.base|) 0 |c_mutex_lock_#in~m#1.base|)))) (let ((.cse79 (store (select .cse80 3) .cse83 (select .cse5 .cse83)))) (let ((.cse78 (store (store (select (store .cse80 3 .cse79) |mutex_lock_ldv_list_add_~new#1.base|) .cse81 3) .cse82 (select (select |c_#memory_$Pointer$#1.base| |mutex_lock_ldv_list_add_~new#1.base|) .cse82)))) (store (store |c_old(#memory_$Pointer$#1.base)| |mutex_lock_ldv_list_add_~new#1.base| .cse78) 3 (store (select (store (store |c_old(#memory_$Pointer$#1.base)| 3 .cse79) |mutex_lock_ldv_list_add_~new#1.base| .cse78) 3) 0 |mutex_lock_ldv_list_add_~new#1.base|)))))) (= .cse2 (store (select (store (store |c_#memory_$Pointer$#1.offset| 3 v_DerPreprocessor_26) |mutex_lock_ldv_list_add_~new#1.base| .cse77) 3) 0 .cse81))))))) (not (= .cse83 0)))))) .cse85 (not (= |mutex_lock_ldv_list_add_~new#1.base| 3)))) (and (exists ((v_DerPreprocessor_30 (Array Int Int)) (v_DerPreprocessor_15 (Array Int Int)) (v_DerPreprocessor_28 (Array Int Int)) (v_DerPreprocessor_29 (Array Int Int))) (let ((.cse87 (select (select (store |c_old(#memory_$Pointer$#1.offset)| .cse17 v_DerPreprocessor_15) 3) 0))) (let ((.cse88 (+ .cse87 4))) (let ((.cse86 (select v_DerPreprocessor_30 .cse88)) (.cse93 (store (store |c_#memory_$Pointer$#1.offset| .cse17 v_DerPreprocessor_28) 3 v_DerPreprocessor_29))) (let ((.cse89 (select (store .cse93 .cse18 v_DerPreprocessor_30) .cse17)) (.cse92 (+ .cse86 4))) (and (not (= .cse86 .cse87)) (not (= .cse86 .cse88)) (not (= .cse88 0)) (= v_DerPreprocessor_28 .cse89) (= |c_#memory_$Pointer$#1.base| (let ((.cse90 (let ((.cse91 (store .cse73 .cse88 (select .cse74 .cse88)))) (store (store |c_old(#memory_$Pointer$#1.base)| .cse45 .cse91) .cse17 (store (store (select (store .cse20 .cse45 .cse91) .cse17) .cse86 .cse45) .cse92 (select .cse23 .cse92)))))) (store .cse90 3 (store (select .cse90 3) 0 .cse17)))) (= (store (store (select (store .cse93 .cse45 v_DerPreprocessor_30) .cse17) .cse86 .cse87) .cse92 0) .cse44) (= .cse2 (store (select (store (store (store |c_#memory_$Pointer$#1.offset| 3 v_DerPreprocessor_29) .cse18 v_DerPreprocessor_30) .cse17 (store (store .cse89 .cse86 .cse87) .cse92 0)) 3) 0 .cse86)))))))) (= .cse45 .cse17) .cse47 .cse33) (and .cse94 (exists ((v_DerPreprocessor_15 (Array Int Int))) (let ((.cse96 (select (select (store |c_old(#memory_$Pointer$#1.offset)| .cse17 v_DerPreprocessor_15) 3) 0))) (let ((.cse99 (+ .cse96 4))) (and (= .cse95 .cse96) (= |c_#memory_$Pointer$#1.base| (let ((.cse97 (let ((.cse98 (store .cse24 .cse99 (select .cse26 .cse99)))) (store (store |c_old(#memory_$Pointer$#1.base)| .cse18 .cse98) .cse17 (store (store (select (store .cse20 .cse18 .cse98) .cse17) .cse12 .cse18) .cse51 .cse55))))) (store .cse97 3 (store (select .cse97 3) 0 .cse17)))) (not (= .cse99 0)))))) .cse100 .cse76 .cse33) (and .cse0 (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| 3 (store (store (store .cse4 .cse101 (select .cse5 .cse101)) (- 4) 3) 0 3))) (= (+ (select .cse2 .cse101) 4) 0) .cse35 .cse1 .cse37) (and .cse94 (exists ((v_DerPreprocessor_15 (Array Int Int))) (let ((.cse102 (select (select (store |c_old(#memory_$Pointer$#1.offset)| .cse17 v_DerPreprocessor_15) 3) 0))) (and (= .cse95 .cse102) (= |c_#memory_$Pointer$#1.base| (let ((.cse103 (let ((.cse104 (let ((.cse105 (+ .cse102 4))) (store .cse24 .cse105 (select .cse26 .cse105))))) (store (store |c_old(#memory_$Pointer$#1.base)| .cse18 .cse104) .cse17 (store (store (select (store .cse20 .cse18 .cse104) .cse17) .cse12 .cse18) .cse51 .cse55))))) (store .cse103 3 (store (select .cse103 3) 0 .cse17))))))) .cse100 .cse76 .cse33) (and .cse34 .cse0 .cse7 .cse8 (exists ((v_arrayElimCell_74 Int)) (= |c_#memory_$Pointer$#1.base| (let ((.cse106 (let ((.cse109 (+ 4 v_arrayElimCell_74))) (store .cse108 .cse109 (select .cse110 .cse109))))) (store (store |c_old(#memory_$Pointer$#1.base)| |c_mutex_lock_#in~m#1.base| .cse106) 3 (store (store (select (store .cse107 |c_mutex_lock_#in~m#1.base| .cse106) 3) 4 .cse6) 0 3)))))) (exists ((|mutex_lock_ldv_list_add_~new#1.base| Int)) (and (= (select |c_old(#valid)| |mutex_lock_ldv_list_add_~new#1.base|) 0) .cse85 (not (= |mutex_lock_ldv_list_add_~new#1.base| 3)) (exists ((v_DerPreprocessor_15 (Array Int Int)) (v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_25 (Array Int Int))) (let ((.cse118 (select (select (store |c_old(#memory_$Pointer$#1.offset)| |mutex_lock_ldv_list_add_~new#1.base| v_DerPreprocessor_15) 3) 0))) (let ((.cse112 (+ .cse118 4))) (let ((.cse116 (select v_DerPreprocessor_26 .cse112))) (let ((.cse117 (+ .cse116 4))) (let ((.cse111 (store (store (select (store (store |c_#memory_$Pointer$#1.offset| |mutex_lock_ldv_list_add_~new#1.base| v_DerPreprocessor_25) 3 v_DerPreprocessor_26) |mutex_lock_ldv_list_add_~new#1.base|) .cse116 .cse118) .cse117 0))) (and (= (select |c_#memory_$Pointer$#1.offset| |mutex_lock_ldv_list_add_~new#1.base|) .cse111) (not (= .cse112 0)) (= |c_#memory_$Pointer$#1.base| (let ((.cse115 (store |c_old(#memory_$Pointer$#1.base)| |mutex_lock_ldv_list_add_~new#1.base| (store (select |c_old(#memory_$Pointer$#1.base)| |mutex_lock_ldv_list_add_~new#1.base|) 0 |c_mutex_lock_#in~m#1.base|)))) (let ((.cse114 (store (select .cse115 3) .cse112 (select .cse5 .cse112)))) (let ((.cse113 (store (store (select (store .cse115 3 .cse114) |mutex_lock_ldv_list_add_~new#1.base|) .cse116 3) .cse117 (select (select |c_#memory_$Pointer$#1.base| |mutex_lock_ldv_list_add_~new#1.base|) .cse117)))) (store (store |c_old(#memory_$Pointer$#1.base)| |mutex_lock_ldv_list_add_~new#1.base| .cse113) 3 (store (select (store (store |c_old(#memory_$Pointer$#1.base)| 3 .cse114) |mutex_lock_ldv_list_add_~new#1.base| .cse113) 3) 0 |mutex_lock_ldv_list_add_~new#1.base|)))))) (not (= .cse118 .cse116)) (= .cse2 (store (select (store (store |c_#memory_$Pointer$#1.offset| 3 v_DerPreprocessor_26) |mutex_lock_ldv_list_add_~new#1.base| .cse111) 3) 0 .cse116)) (not (= .cse116 .cse112))))))))))) (and .cse32 (exists ((v_DerPreprocessor_37 (Array Int Int)) (v_DerPreprocessor_15 (Array Int Int)) (v_DerPreprocessor_35 (Array Int Int)) (v_DerPreprocessor_36 (Array Int Int))) (let ((.cse125 (store (store (store |c_#memory_$Pointer$#1.offset| .cse18 v_DerPreprocessor_35) 3 v_DerPreprocessor_36) .cse17 v_DerPreprocessor_37)) (.cse124 (select (select (store |c_old(#memory_$Pointer$#1.offset)| .cse17 v_DerPreprocessor_15) 3) 0))) (let ((.cse120 (+ .cse124 8)) (.cse121 (select .cse125 3)) (.cse122 (+ .cse124 4)) (.cse119 (select .cse125 .cse18))) (and (= (select .cse119 .cse120) 0) (= .cse2 (store .cse121 0 .cse122)) (= (let ((.cse123 (store |c_old(#memory_$Pointer$#1.base)| .cse17 (store (store .cse42 .cse122 .cse18) .cse120 (select .cse23 .cse120))))) (store .cse123 3 (store (select .cse123 3) 0 .cse17))) |c_#memory_$Pointer$#1.base|) (= .cse121 v_DerPreprocessor_36) (= .cse119 v_DerPreprocessor_35) (= .cse124 (select .cse119 .cse122)) (= .cse119 .cse28))))) .cse33) (and .cse34 (exists ((v_arrayElimCell_72 Int)) (let ((.cse126 (+ 4 v_arrayElimCell_72))) (and (not (= .cse126 0)) (= |c_#memory_$Pointer$#1.base| (let ((.cse127 (store .cse108 .cse126 (select .cse110 .cse126)))) (store (store |c_old(#memory_$Pointer$#1.base)| |c_mutex_lock_#in~m#1.base| .cse127) 3 (store (store (select (store .cse107 |c_mutex_lock_#in~m#1.base| .cse127) 3) 4 .cse6) 0 3))))))) .cse0 .cse7 .cse8) (exists ((|mutex_lock_ldv_list_add_~new#1.base| Int)) (and (= (select |c_old(#valid)| |mutex_lock_ldv_list_add_~new#1.base|) 0) .cse85 (not (= |mutex_lock_ldv_list_add_~new#1.base| 3)) (exists ((v_DerPreprocessor_15 (Array Int Int))) (let ((.cse135 (select (select (store |c_old(#memory_$Pointer$#1.offset)| |mutex_lock_ldv_list_add_~new#1.base| v_DerPreprocessor_15) 3) 0))) (let ((.cse128 (+ .cse135 4))) (and (not (= .cse128 0)) (exists ((v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_25 (Array Int Int))) (let ((.cse134 (select v_DerPreprocessor_26 .cse128))) (let ((.cse130 (+ .cse134 4))) (let ((.cse129 (store (store (select (store (store |c_#memory_$Pointer$#1.offset| |mutex_lock_ldv_list_add_~new#1.base| v_DerPreprocessor_25) 3 v_DerPreprocessor_26) |mutex_lock_ldv_list_add_~new#1.base|) .cse134 .cse135) .cse130 0))) (and (= (select |c_#memory_$Pointer$#1.offset| |mutex_lock_ldv_list_add_~new#1.base|) .cse129) (not (= .cse130 0)) (= |c_#memory_$Pointer$#1.base| (let ((.cse133 (store |c_old(#memory_$Pointer$#1.base)| |mutex_lock_ldv_list_add_~new#1.base| (store (select |c_old(#memory_$Pointer$#1.base)| |mutex_lock_ldv_list_add_~new#1.base|) 0 |c_mutex_lock_#in~m#1.base|)))) (let ((.cse132 (store (select .cse133 3) .cse128 (select .cse5 .cse128)))) (let ((.cse131 (store (store (select (store .cse133 3 .cse132) |mutex_lock_ldv_list_add_~new#1.base|) .cse134 3) .cse130 (select (select |c_#memory_$Pointer$#1.base| |mutex_lock_ldv_list_add_~new#1.base|) .cse130)))) (store (store |c_old(#memory_$Pointer$#1.base)| |mutex_lock_ldv_list_add_~new#1.base| .cse131) 3 (store (select (store (store |c_old(#memory_$Pointer$#1.base)| 3 .cse132) |mutex_lock_ldv_list_add_~new#1.base| .cse131) 3) 0 |mutex_lock_ldv_list_add_~new#1.base|)))))) (= .cse2 (store (select (store (store |c_#memory_$Pointer$#1.offset| 3 v_DerPreprocessor_26) |mutex_lock_ldv_list_add_~new#1.base| .cse129) 3) 0 .cse134)) (not (= .cse134 .cse128))))))))))))) (and .cse0 (or (exists ((v_arrayElimCell_79 Int)) (let ((.cse136 (+ 4 v_arrayElimCell_79))) (let ((.cse137 (select .cse2 .cse136))) (let ((.cse138 (+ .cse137 4))) (and (not (= .cse136 0)) (= .cse12 .cse137) (= (store |c_old(#memory_$Pointer$#1.base)| 3 (store (store (store (store .cse4 .cse136 (select .cse5 .cse136)) .cse137 3) .cse138 (select .cse5 .cse138)) 0 3)) |c_#memory_$Pointer$#1.base|) (= (select .cse2 .cse137) v_arrayElimCell_79) (= (select .cse2 .cse138) 0)))))) (and (exists ((v_arrayElimCell_79 Int)) (let ((.cse139 (+ 4 v_arrayElimCell_79))) (and (= (select .cse2 .cse139) 0) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| 3 (store (store (store .cse4 .cse139 (select .cse5 .cse139)) 4 .cse6) 0 3)))))) .cse7 .cse8)) .cse1) (exists ((|mutex_lock_ldv_list_add_~new#1.base| Int)) (and (= (select |c_old(#valid)| |mutex_lock_ldv_list_add_~new#1.base|) 0) (exists ((v_DerPreprocessor_15 (Array Int Int))) (let ((.cse147 (select (select (store |c_old(#memory_$Pointer$#1.offset)| |mutex_lock_ldv_list_add_~new#1.base| v_DerPreprocessor_15) 3) 0))) (let ((.cse140 (+ .cse147 4))) (and (not (= .cse140 0)) (exists ((v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_25 (Array Int Int))) (let ((.cse145 (select v_DerPreprocessor_26 .cse140))) (let ((.cse146 (+ .cse145 4))) (let ((.cse141 (store (store (select (store (store |c_#memory_$Pointer$#1.offset| |mutex_lock_ldv_list_add_~new#1.base| v_DerPreprocessor_25) 3 v_DerPreprocessor_26) |mutex_lock_ldv_list_add_~new#1.base|) .cse145 .cse147) .cse146 0))) (and (= (select |c_#memory_$Pointer$#1.offset| |mutex_lock_ldv_list_add_~new#1.base|) .cse141) (= |c_#memory_$Pointer$#1.base| (let ((.cse144 (store |c_old(#memory_$Pointer$#1.base)| |mutex_lock_ldv_list_add_~new#1.base| (store (select |c_old(#memory_$Pointer$#1.base)| |mutex_lock_ldv_list_add_~new#1.base|) 0 |c_mutex_lock_#in~m#1.base|)))) (let ((.cse143 (store (select .cse144 3) .cse140 (select .cse5 .cse140)))) (let ((.cse142 (store (store (select (store .cse144 3 .cse143) |mutex_lock_ldv_list_add_~new#1.base|) .cse145 3) .cse146 (select (select |c_#memory_$Pointer$#1.base| |mutex_lock_ldv_list_add_~new#1.base|) .cse146)))) (store (store |c_old(#memory_$Pointer$#1.base)| |mutex_lock_ldv_list_add_~new#1.base| .cse142) 3 (store (select (store (store |c_old(#memory_$Pointer$#1.base)| 3 .cse143) |mutex_lock_ldv_list_add_~new#1.base| .cse142) 3) 0 |mutex_lock_ldv_list_add_~new#1.base|)))))) (= .cse2 (store (select (store (store |c_#memory_$Pointer$#1.offset| 3 v_DerPreprocessor_26) |mutex_lock_ldv_list_add_~new#1.base| .cse141) 3) 0 .cse145)) (not (= .cse145 .cse140))))))))))) .cse85 (not (= |mutex_lock_ldv_list_add_~new#1.base| 3)))) (exists ((|mutex_lock_ldv_list_add_~new#1.base| Int)) (and (exists ((v_DerPreprocessor_15 (Array Int Int))) (let ((.cse155 (select (select (store |c_old(#memory_$Pointer$#1.offset)| |mutex_lock_ldv_list_add_~new#1.base| v_DerPreprocessor_15) 3) 0))) (let ((.cse148 (+ .cse155 4))) (and (not (= .cse148 0)) (exists ((v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_25 (Array Int Int))) (let ((.cse154 (select v_DerPreprocessor_26 .cse148))) (let ((.cse150 (+ .cse154 4))) (let ((.cse149 (store (store (select (store (store |c_#memory_$Pointer$#1.offset| |mutex_lock_ldv_list_add_~new#1.base| v_DerPreprocessor_25) 3 v_DerPreprocessor_26) |mutex_lock_ldv_list_add_~new#1.base|) .cse154 .cse155) .cse150 0))) (and (= (select |c_#memory_$Pointer$#1.offset| |mutex_lock_ldv_list_add_~new#1.base|) .cse149) (not (= .cse150 0)) (= |c_#memory_$Pointer$#1.base| (let ((.cse153 (store |c_old(#memory_$Pointer$#1.base)| |mutex_lock_ldv_list_add_~new#1.base| (store (select |c_old(#memory_$Pointer$#1.base)| |mutex_lock_ldv_list_add_~new#1.base|) 0 |c_mutex_lock_#in~m#1.base|)))) (let ((.cse152 (store (select .cse153 3) .cse148 (select .cse5 .cse148)))) (let ((.cse151 (store (store (select (store .cse153 3 .cse152) |mutex_lock_ldv_list_add_~new#1.base|) .cse154 3) .cse150 (select (select |c_#memory_$Pointer$#1.base| |mutex_lock_ldv_list_add_~new#1.base|) .cse150)))) (store (store |c_old(#memory_$Pointer$#1.base)| |mutex_lock_ldv_list_add_~new#1.base| .cse151) 3 (store (select (store (store |c_old(#memory_$Pointer$#1.base)| 3 .cse152) |mutex_lock_ldv_list_add_~new#1.base| .cse151) 3) 0 |mutex_lock_ldv_list_add_~new#1.base|)))))) (= .cse2 (store (select (store (store |c_#memory_$Pointer$#1.offset| 3 v_DerPreprocessor_26) |mutex_lock_ldv_list_add_~new#1.base| .cse149) 3) 0 .cse154))))))))))) (= (select |c_old(#valid)| |mutex_lock_ldv_list_add_~new#1.base|) 0) .cse85 (not (= |mutex_lock_ldv_list_add_~new#1.base| 3)))) (and (exists ((v_DerPreprocessor_30 (Array Int Int)) (v_DerPreprocessor_15 (Array Int Int)) (v_DerPreprocessor_28 (Array Int Int)) (v_DerPreprocessor_29 (Array Int Int))) (let ((.cse157 (select (select (store |c_old(#memory_$Pointer$#1.offset)| .cse17 v_DerPreprocessor_15) 3) 0))) (let ((.cse159 (+ .cse157 4))) (let ((.cse156 (select v_DerPreprocessor_30 .cse159)) (.cse163 (store (store |c_#memory_$Pointer$#1.offset| .cse17 v_DerPreprocessor_28) 3 v_DerPreprocessor_29))) (let ((.cse160 (select (store .cse163 .cse18 v_DerPreprocessor_30) .cse17)) (.cse158 (+ .cse156 4))) (and (not (= .cse156 .cse157)) (not (= .cse158 0)) (not (= .cse156 .cse159)) (= v_DerPreprocessor_28 .cse160) (= |c_#memory_$Pointer$#1.base| (let ((.cse161 (let ((.cse162 (store .cse73 .cse159 (select .cse74 .cse159)))) (store (store |c_old(#memory_$Pointer$#1.base)| .cse45 .cse162) .cse17 (store (store (select (store .cse20 .cse45 .cse162) .cse17) .cse156 .cse45) .cse158 (select .cse23 .cse158)))))) (store .cse161 3 (store (select .cse161 3) 0 .cse17)))) (= (store (store (select (store .cse163 .cse45 v_DerPreprocessor_30) .cse17) .cse156 .cse157) .cse158 0) .cse44) (= .cse2 (store (select (store (store (store |c_#memory_$Pointer$#1.offset| 3 v_DerPreprocessor_29) .cse18 v_DerPreprocessor_30) .cse17 (store (store .cse160 .cse156 .cse157) .cse158 0)) 3) 0 .cse156)))))))) .cse32 .cse76 .cse33)))))))))) is different from false [2024-11-23 23:38:07,253 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_~#mutexes~0.offset| 0) (let ((.cse31 (select |c_#memory_$Pointer$#1.base| 3))) (let ((.cse7 (select .cse31 0))) (let ((.cse38 (store (select |c_old(#memory_$Pointer$#1.base)| .cse7) 0 |c_mutex_lock_#in~m#1.base|))) (let ((.cse10 (store |c_old(#memory_$Pointer$#1.base)| .cse7 .cse38)) (.cse21 (select |c_#memory_$Pointer$#1.offset| 3))) (let ((.cse5 (select .cse21 0)) (.cse64 (select |c_old(#memory_$Pointer$#1.base)| 3)) (.cse8 (select (select .cse10 3) 0))) (let ((.cse45 (= .cse8 3)) (.cse41 (select .cse64 0)) (.cse72 (store |c_old(#memory_$Pointer$#1.base)| 3 (store .cse64 0 |c_mutex_lock_#in~m#1.base|))) (.cse3 (= |c_mutex_lock_#in~m#1.base| 3)) (.cse22 (= .cse8 .cse7)) (.cse13 (select |c_#memory_$Pointer$#1.base| .cse7)) (.cse47 (select |c_#memory_$Pointer$#1.offset| .cse7)) (.cse49 (= .cse7 3)) (.cse4 (select .cse21 .cse5)) (.cse48 (+ .cse5 4))) (let ((.cse1 (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| 3 (store (store (store .cse64 .cse5 3) .cse48 (select .cse31 .cse48)) 0 3)))) (.cse0 (= 0 (select .cse21 .cse48))) (.cse42 (+ .cse4 4)) (.cse44 (not .cse49)) (.cse74 (+ (select .cse21 (- 4)) 4)) (.cse43 (= .cse48 0)) (.cse95 (= (select .cse47 .cse48) 0)) (.cse96 (select .cse47 .cse5)) (.cse51 (select .cse13 .cse48)) (.cse14 (select .cse10 .cse8)) (.cse16 (select |c_#memory_$Pointer$#1.base| .cse8)) (.cse101 (not .cse22)) (.cse70 (not .cse3)) (.cse73 (select .cse72 |c_mutex_lock_#in~m#1.base|)) (.cse75 (select |c_#memory_$Pointer$#1.base| |c_mutex_lock_#in~m#1.base|)) (.cse2 (= (select |c_old(#valid)| 3) 0)) (.cse67 (select .cse31 4)) (.cse68 (= .cse5 0)) (.cse69 (= (select .cse21 4) 0)) (.cse33 (= .cse41 3)) (.cse83 (select .cse10 .cse41)) (.cse84 (select |c_#memory_$Pointer$#1.base| .cse41)) (.cse40 (select |c_#memory_$Pointer$#1.offset| .cse41)) (.cse86 (not .cse45)) (.cse23 (= (select |c_old(#valid)| .cse7) 0))) (or (and .cse0 .cse1 .cse2 .cse3 (= .cse4 .cse5)) (and (exists ((v_DerPreprocessor_30 (Array Int Int)) (v_DerPreprocessor_15 (Array Int Int)) (v_DerPreprocessor_28 (Array Int Int)) (v_DerPreprocessor_29 (Array Int Int))) (let ((.cse19 (select (select (store |c_old(#memory_$Pointer$#1.offset)| .cse7 v_DerPreprocessor_15) 3) 0))) (let ((.cse15 (+ .cse19 4))) (let ((.cse11 (select v_DerPreprocessor_30 .cse15)) (.cse18 (store (store (store |c_#memory_$Pointer$#1.offset| .cse7 v_DerPreprocessor_28) 3 v_DerPreprocessor_29) .cse8 v_DerPreprocessor_30))) (let ((.cse20 (select .cse18 .cse7)) (.cse12 (+ .cse11 4))) (let ((.cse17 (store (store .cse20 .cse11 .cse19) .cse12 0))) (and (= (let ((.cse6 (let ((.cse9 (store .cse14 .cse15 (select .cse16 .cse15)))) (store (store |c_old(#memory_$Pointer$#1.base)| .cse8 .cse9) .cse7 (store (store (select (store .cse10 .cse8 .cse9) .cse7) .cse11 .cse8) .cse12 (select .cse13 .cse12)))))) (store .cse6 3 (store (select .cse6 3) 0 .cse7))) |c_#memory_$Pointer$#1.base|) (= .cse17 (select |c_#memory_$Pointer$#1.offset| .cse8)) (= v_DerPreprocessor_29 (select .cse18 3)) (not (= .cse11 .cse19)) (not (= .cse12 0)) (not (= .cse11 .cse15)) (not (= .cse15 0)) (= v_DerPreprocessor_28 .cse20) (= .cse21 (store (select (store (store (store |c_#memory_$Pointer$#1.offset| 3 v_DerPreprocessor_29) .cse8 v_DerPreprocessor_30) .cse7 .cse17) 3) 0 .cse11))))))))) .cse22 .cse23) (and (exists ((|mutex_lock_ldv_list_add_~new#1.base| Int) (v_DerPreprocessor_15 (Array Int Int)) (v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_25 (Array Int Int))) (let ((.cse32 (select (select (store |c_old(#memory_$Pointer$#1.offset)| |mutex_lock_ldv_list_add_~new#1.base| v_DerPreprocessor_15) 3) 0))) (let ((.cse25 (+ .cse32 4))) (let ((.cse29 (select v_DerPreprocessor_26 .cse25))) (let ((.cse30 (+ .cse29 4))) (let ((.cse24 (store (store (select (store (store |c_#memory_$Pointer$#1.offset| |mutex_lock_ldv_list_add_~new#1.base| v_DerPreprocessor_25) 3 v_DerPreprocessor_26) |mutex_lock_ldv_list_add_~new#1.base|) .cse29 .cse32) .cse30 0))) (and (= (select |c_old(#valid)| |mutex_lock_ldv_list_add_~new#1.base|) 0) (= (select |c_#memory_$Pointer$#1.offset| |mutex_lock_ldv_list_add_~new#1.base|) .cse24) (not (= .cse25 0)) (= |c_#memory_$Pointer$#1.base| (let ((.cse28 (store |c_old(#memory_$Pointer$#1.base)| |mutex_lock_ldv_list_add_~new#1.base| (store (select |c_old(#memory_$Pointer$#1.base)| |mutex_lock_ldv_list_add_~new#1.base|) 0 |c_mutex_lock_#in~m#1.base|)))) (let ((.cse27 (store (select .cse28 3) .cse25 (select .cse31 .cse25)))) (let ((.cse26 (store (store (select (store .cse28 3 .cse27) |mutex_lock_ldv_list_add_~new#1.base|) .cse29 3) .cse30 (select (select |c_#memory_$Pointer$#1.base| |mutex_lock_ldv_list_add_~new#1.base|) .cse30)))) (store (store |c_old(#memory_$Pointer$#1.base)| |mutex_lock_ldv_list_add_~new#1.base| .cse26) 3 (store (select (store (store |c_old(#memory_$Pointer$#1.base)| 3 .cse27) |mutex_lock_ldv_list_add_~new#1.base| .cse26) 3) 0 |mutex_lock_ldv_list_add_~new#1.base|)))))) (not (= |mutex_lock_ldv_list_add_~new#1.base| 3)) (= .cse21 (store (select (store (store |c_#memory_$Pointer$#1.offset| 3 v_DerPreprocessor_26) |mutex_lock_ldv_list_add_~new#1.base| .cse24) 3) 0 .cse29)) (not (= .cse29 .cse25))))))))) .cse33) (and .cse22 (exists ((v_DerPreprocessor_32 (Array Int Int)) (v_DerPreprocessor_15 (Array Int Int)) (v_DerPreprocessor_33 (Array Int Int)) (v_DerPreprocessor_34 (Array Int Int))) (let ((.cse34 (store (store (store |c_#memory_$Pointer$#1.offset| .cse8 v_DerPreprocessor_32) 3 v_DerPreprocessor_33) .cse7 v_DerPreprocessor_34)) (.cse35 (select (select (store |c_old(#memory_$Pointer$#1.offset)| .cse7 v_DerPreprocessor_15) 3) 0))) (let ((.cse39 (+ .cse35 4)) (.cse36 (select .cse34 .cse8))) (and (= (store (select .cse34 3) 0 .cse35) .cse21) (= (select .cse36 .cse35) .cse35) (= |c_#memory_$Pointer$#1.base| (let ((.cse37 (store |c_old(#memory_$Pointer$#1.base)| .cse7 (store (store .cse38 .cse35 .cse8) .cse39 (select .cse13 .cse39))))) (store .cse37 3 (store (select .cse37 3) 0 .cse7)))) (= (select .cse36 .cse39) 0) (= .cse40 (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse41 v_DerPreprocessor_32) 3 v_DerPreprocessor_33) .cse7 v_DerPreprocessor_34) .cse41)) (= .cse36 v_DerPreprocessor_32))))) .cse23) (and .cse1 .cse2 .cse3 (= .cse42 .cse5) (or .cse0 .cse43)) (and (or .cse44 (not .cse43)) .cse45 (or (exists ((v_DerPreprocessor_16 (Array Int Int)) (v_DerPreprocessor_17 (Array Int Int))) (let ((.cse46 (store (store (select (store (store |c_#memory_$Pointer$#1.offset| .cse7 v_DerPreprocessor_16) 3 v_DerPreprocessor_17) .cse7) .cse5 (- 4)) .cse48 0))) (and (= .cse5 (select v_DerPreprocessor_17 0)) (= .cse21 (store (select (store (store |c_#memory_$Pointer$#1.offset| 3 v_DerPreprocessor_17) .cse7 .cse46) 3) 0 .cse5)) (= .cse47 .cse46)))) (and .cse0 (= .cse42 0) .cse49)) (exists ((v_DerPreprocessor_15 (Array Int Int))) (= (+ (select (select (store |c_old(#memory_$Pointer$#1.offset)| .cse7 v_DerPreprocessor_15) 3) 0) 4) 0)) .cse23 (= |c_#memory_$Pointer$#1.base| (let ((.cse50 (store |c_old(#memory_$Pointer$#1.base)| .cse7 (store (store .cse38 .cse5 3) .cse48 .cse51)))) (store .cse50 3 (store (select .cse50 3) 0 .cse7))))) (exists ((|mutex_lock_ldv_list_add_~new#1.base| Int)) (let ((.cse59 (store |c_old(#memory_$Pointer$#1.base)| |mutex_lock_ldv_list_add_~new#1.base| (store (select |c_old(#memory_$Pointer$#1.base)| |mutex_lock_ldv_list_add_~new#1.base|) 0 |c_mutex_lock_#in~m#1.base|)))) (let ((.cse52 (select .cse59 3))) (and (= (select |c_old(#valid)| |mutex_lock_ldv_list_add_~new#1.base|) 0) (= (select .cse52 0) 3) (exists ((v_DerPreprocessor_15 (Array Int Int))) (let ((.cse61 (select (select (store |c_old(#memory_$Pointer$#1.offset)| |mutex_lock_ldv_list_add_~new#1.base| v_DerPreprocessor_15) 3) 0))) (let ((.cse53 (+ .cse61 4))) (and (not (= .cse53 0)) (exists ((v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_25 (Array Int Int))) (let ((.cse60 (select v_DerPreprocessor_26 .cse53))) (let ((.cse54 (select (store (store |c_#memory_$Pointer$#1.offset| |mutex_lock_ldv_list_add_~new#1.base| v_DerPreprocessor_25) 3 v_DerPreprocessor_26) |mutex_lock_ldv_list_add_~new#1.base|)) (.cse56 (+ .cse60 4))) (let ((.cse55 (store (store .cse54 .cse60 .cse61) .cse56 0))) (and (= v_DerPreprocessor_25 .cse54) (= (select |c_#memory_$Pointer$#1.offset| |mutex_lock_ldv_list_add_~new#1.base|) .cse55) (not (= .cse56 0)) (= |c_#memory_$Pointer$#1.base| (let ((.cse58 (store .cse52 .cse53 (select .cse31 .cse53)))) (let ((.cse57 (store (store (select (store .cse59 3 .cse58) |mutex_lock_ldv_list_add_~new#1.base|) .cse60 3) .cse56 (select (select |c_#memory_$Pointer$#1.base| |mutex_lock_ldv_list_add_~new#1.base|) .cse56)))) (store (store |c_old(#memory_$Pointer$#1.base)| |mutex_lock_ldv_list_add_~new#1.base| .cse57) 3 (store (select (store (store |c_old(#memory_$Pointer$#1.base)| 3 .cse58) |mutex_lock_ldv_list_add_~new#1.base| .cse57) 3) 0 |mutex_lock_ldv_list_add_~new#1.base|))))) (not (= .cse61 .cse60)) (= .cse21 (store (select (store (store |c_#memory_$Pointer$#1.offset| 3 v_DerPreprocessor_26) |mutex_lock_ldv_list_add_~new#1.base| .cse55) 3) 0 .cse60)) (not (= .cse60 .cse53))))))))))))))) (and .cse2 (or (exists ((v_arrayElimCell_70 Int)) (let ((.cse62 (+ 4 v_arrayElimCell_70))) (let ((.cse65 (select .cse21 .cse62))) (let ((.cse63 (+ .cse65 4))) (and (not (= .cse62 0)) (= (select .cse21 .cse63) 0) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| 3 (store (store (store (store .cse64 .cse62 (select .cse31 .cse62)) .cse65 3) .cse63 (select .cse31 .cse63)) 0 3))) (= (select .cse21 .cse65) v_arrayElimCell_70) (= .cse65 .cse5)))))) (and (exists ((v_arrayElimCell_70 Int)) (let ((.cse66 (+ 4 v_arrayElimCell_70))) (and (= (select .cse21 .cse66) 0) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| 3 (store (store (store .cse64 .cse66 (select .cse31 .cse66)) 4 .cse67) 0 3)))))) .cse68 .cse69)) .cse3) (and .cse70 .cse2 .cse43 (= |c_#memory_$Pointer$#1.base| (let ((.cse71 (store .cse73 .cse74 (select .cse75 .cse74)))) (store (store |c_old(#memory_$Pointer$#1.base)| |c_mutex_lock_#in~m#1.base| .cse71) 3 (store (store (select (store .cse72 |c_mutex_lock_#in~m#1.base| .cse71) 3) (- 4) |c_mutex_lock_#in~m#1.base|) 0 3))))) (and (exists ((v_DerPreprocessor_30 (Array Int Int)) (v_DerPreprocessor_15 (Array Int Int)) (v_DerPreprocessor_28 (Array Int Int)) (v_DerPreprocessor_29 (Array Int Int))) (let ((.cse77 (select (select (store |c_old(#memory_$Pointer$#1.offset)| .cse7 v_DerPreprocessor_15) 3) 0))) (let ((.cse78 (+ .cse77 4))) (let ((.cse76 (select v_DerPreprocessor_30 .cse78)) (.cse85 (store (store |c_#memory_$Pointer$#1.offset| .cse7 v_DerPreprocessor_28) 3 v_DerPreprocessor_29))) (let ((.cse79 (select (store .cse85 .cse8 v_DerPreprocessor_30) .cse7)) (.cse82 (+ .cse76 4))) (and (not (= .cse76 .cse77)) (not (= .cse76 .cse78)) (= v_DerPreprocessor_28 .cse79) (= |c_#memory_$Pointer$#1.base| (let ((.cse80 (let ((.cse81 (store .cse83 .cse78 (select .cse84 .cse78)))) (store (store |c_old(#memory_$Pointer$#1.base)| .cse41 .cse81) .cse7 (store (store (select (store .cse10 .cse41 .cse81) .cse7) .cse76 .cse41) .cse82 (select .cse13 .cse82)))))) (store .cse80 3 (store (select .cse80 3) 0 .cse7)))) (= (store (store (select (store .cse85 .cse41 v_DerPreprocessor_30) .cse7) .cse76 .cse77) .cse82 0) .cse40) (= .cse21 (store (select (store (store (store |c_#memory_$Pointer$#1.offset| 3 v_DerPreprocessor_29) .cse8 v_DerPreprocessor_30) .cse7 (store (store .cse79 .cse76 .cse77) .cse82 0)) 3) 0 .cse76)))))))) .cse22 .cse86 .cse23) (and (exists ((v_DerPreprocessor_30 (Array Int Int)) (v_DerPreprocessor_15 (Array Int Int)) (v_DerPreprocessor_28 (Array Int Int)) (v_DerPreprocessor_29 (Array Int Int))) (let ((.cse88 (select (select (store |c_old(#memory_$Pointer$#1.offset)| .cse7 v_DerPreprocessor_15) 3) 0))) (let ((.cse89 (+ .cse88 4))) (let ((.cse87 (select v_DerPreprocessor_30 .cse89)) (.cse94 (store (store |c_#memory_$Pointer$#1.offset| .cse7 v_DerPreprocessor_28) 3 v_DerPreprocessor_29))) (let ((.cse90 (select (store .cse94 .cse8 v_DerPreprocessor_30) .cse7)) (.cse93 (+ .cse87 4))) (and (not (= .cse87 .cse88)) (not (= .cse87 .cse89)) (not (= .cse89 0)) (= v_DerPreprocessor_28 .cse90) (= |c_#memory_$Pointer$#1.base| (let ((.cse91 (let ((.cse92 (store .cse83 .cse89 (select .cse84 .cse89)))) (store (store |c_old(#memory_$Pointer$#1.base)| .cse41 .cse92) .cse7 (store (store (select (store .cse10 .cse41 .cse92) .cse7) .cse87 .cse41) .cse93 (select .cse13 .cse93)))))) (store .cse91 3 (store (select .cse91 3) 0 .cse7)))) (= (store (store (select (store .cse94 .cse41 v_DerPreprocessor_30) .cse7) .cse87 .cse88) .cse93 0) .cse40) (= .cse21 (store (select (store (store (store |c_#memory_$Pointer$#1.offset| 3 v_DerPreprocessor_29) .cse8 v_DerPreprocessor_30) .cse7 (store (store .cse90 .cse87 .cse88) .cse93 0)) 3) 0 .cse87)))))))) (= .cse41 .cse7) .cse44 .cse23) (and .cse95 (exists ((v_DerPreprocessor_15 (Array Int Int))) (let ((.cse97 (select (select (store |c_old(#memory_$Pointer$#1.offset)| .cse7 v_DerPreprocessor_15) 3) 0))) (let ((.cse100 (+ .cse97 4))) (and (= .cse96 .cse97) (= |c_#memory_$Pointer$#1.base| (let ((.cse98 (let ((.cse99 (store .cse14 .cse100 (select .cse16 .cse100)))) (store (store |c_old(#memory_$Pointer$#1.base)| .cse8 .cse99) .cse7 (store (store (select (store .cse10 .cse8 .cse99) .cse7) .cse5 .cse8) .cse48 .cse51))))) (store .cse98 3 (store (select .cse98 3) 0 .cse7)))) (not (= .cse100 0)))))) .cse101 .cse86 .cse23) (and .cse2 (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| 3 (store (store (store .cse64 .cse74 (select .cse31 .cse74)) (- 4) 3) 0 3))) (= (+ (select .cse21 .cse74) 4) 0) .cse43 .cse3) (and (exists ((|mutex_lock_ldv_list_add_~new#1.base| Int) (v_DerPreprocessor_15 (Array Int Int)) (v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_25 (Array Int Int))) (let ((.cse109 (select (select (store |c_old(#memory_$Pointer$#1.offset)| |mutex_lock_ldv_list_add_~new#1.base| v_DerPreprocessor_15) 3) 0))) (let ((.cse103 (+ .cse109 4))) (let ((.cse107 (select v_DerPreprocessor_26 .cse103))) (let ((.cse108 (+ .cse107 4))) (let ((.cse102 (store (store (select (store (store |c_#memory_$Pointer$#1.offset| |mutex_lock_ldv_list_add_~new#1.base| v_DerPreprocessor_25) 3 v_DerPreprocessor_26) |mutex_lock_ldv_list_add_~new#1.base|) .cse107 .cse109) .cse108 0))) (and (= (select |c_old(#valid)| |mutex_lock_ldv_list_add_~new#1.base|) 0) (= (select |c_#memory_$Pointer$#1.offset| |mutex_lock_ldv_list_add_~new#1.base|) .cse102) (not (= .cse103 0)) (= |c_#memory_$Pointer$#1.base| (let ((.cse106 (store |c_old(#memory_$Pointer$#1.base)| |mutex_lock_ldv_list_add_~new#1.base| (store (select |c_old(#memory_$Pointer$#1.base)| |mutex_lock_ldv_list_add_~new#1.base|) 0 |c_mutex_lock_#in~m#1.base|)))) (let ((.cse105 (store (select .cse106 3) .cse103 (select .cse31 .cse103)))) (let ((.cse104 (store (store (select (store .cse106 3 .cse105) |mutex_lock_ldv_list_add_~new#1.base|) .cse107 3) .cse108 (select (select |c_#memory_$Pointer$#1.base| |mutex_lock_ldv_list_add_~new#1.base|) .cse108)))) (store (store |c_old(#memory_$Pointer$#1.base)| |mutex_lock_ldv_list_add_~new#1.base| .cse104) 3 (store (select (store (store |c_old(#memory_$Pointer$#1.base)| 3 .cse105) |mutex_lock_ldv_list_add_~new#1.base| .cse104) 3) 0 |mutex_lock_ldv_list_add_~new#1.base|)))))) (not (= |mutex_lock_ldv_list_add_~new#1.base| 3)) (= .cse21 (store (select (store (store |c_#memory_$Pointer$#1.offset| 3 v_DerPreprocessor_26) |mutex_lock_ldv_list_add_~new#1.base| .cse102) 3) 0 .cse107))))))))) .cse33) (and .cse22 (exists ((v_DerPreprocessor_37 (Array Int Int)) (v_DerPreprocessor_15 (Array Int Int)) (v_DerPreprocessor_35 (Array Int Int)) (v_DerPreprocessor_36 (Array Int Int))) (let ((.cse112 (store (store (store |c_#memory_$Pointer$#1.offset| .cse8 v_DerPreprocessor_35) 3 v_DerPreprocessor_36) .cse7 v_DerPreprocessor_37)) (.cse115 (select (select (store |c_old(#memory_$Pointer$#1.offset)| .cse7 v_DerPreprocessor_15) 3) 0))) (let ((.cse111 (+ .cse115 8)) (.cse110 (select .cse112 .cse8)) (.cse113 (+ .cse115 4))) (and (= (select .cse110 .cse111) 0) (= .cse21 (store (select .cse112 3) 0 .cse113)) (= (let ((.cse114 (store |c_old(#memory_$Pointer$#1.base)| .cse7 (store (store .cse38 .cse113 .cse8) .cse111 (select .cse13 .cse111))))) (store .cse114 3 (store (select .cse114 3) 0 .cse7))) |c_#memory_$Pointer$#1.base|) (= (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse41 v_DerPreprocessor_35) 3 v_DerPreprocessor_36) .cse7 v_DerPreprocessor_37) .cse41) .cse40) (= .cse110 v_DerPreprocessor_35) (= .cse115 (select .cse110 .cse113)))))) .cse23) (and (exists ((|mutex_lock_ldv_list_add_~new#1.base| Int) (v_DerPreprocessor_15 (Array Int Int)) (v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_25 (Array Int Int))) (let ((.cse123 (select (select (store |c_old(#memory_$Pointer$#1.offset)| |mutex_lock_ldv_list_add_~new#1.base| v_DerPreprocessor_15) 3) 0))) (let ((.cse117 (+ .cse123 4))) (let ((.cse121 (select v_DerPreprocessor_26 .cse117))) (let ((.cse122 (+ .cse121 4))) (let ((.cse116 (store (store (select (store (store |c_#memory_$Pointer$#1.offset| |mutex_lock_ldv_list_add_~new#1.base| v_DerPreprocessor_25) 3 v_DerPreprocessor_26) |mutex_lock_ldv_list_add_~new#1.base|) .cse121 .cse123) .cse122 0))) (and (= (select |c_old(#valid)| |mutex_lock_ldv_list_add_~new#1.base|) 0) (= (select |c_#memory_$Pointer$#1.offset| |mutex_lock_ldv_list_add_~new#1.base|) .cse116) (not (= .cse117 0)) (= |c_#memory_$Pointer$#1.base| (let ((.cse120 (store |c_old(#memory_$Pointer$#1.base)| |mutex_lock_ldv_list_add_~new#1.base| (store (select |c_old(#memory_$Pointer$#1.base)| |mutex_lock_ldv_list_add_~new#1.base|) 0 |c_mutex_lock_#in~m#1.base|)))) (let ((.cse119 (store (select .cse120 3) .cse117 (select .cse31 .cse117)))) (let ((.cse118 (store (store (select (store .cse120 3 .cse119) |mutex_lock_ldv_list_add_~new#1.base|) .cse121 3) .cse122 (select (select |c_#memory_$Pointer$#1.base| |mutex_lock_ldv_list_add_~new#1.base|) .cse122)))) (store (store |c_old(#memory_$Pointer$#1.base)| |mutex_lock_ldv_list_add_~new#1.base| .cse118) 3 (store (select (store (store |c_old(#memory_$Pointer$#1.base)| 3 .cse119) |mutex_lock_ldv_list_add_~new#1.base| .cse118) 3) 0 |mutex_lock_ldv_list_add_~new#1.base|)))))) (not (= .cse123 .cse121)) (not (= |mutex_lock_ldv_list_add_~new#1.base| 3)) (= .cse21 (store (select (store (store |c_#memory_$Pointer$#1.offset| 3 v_DerPreprocessor_26) |mutex_lock_ldv_list_add_~new#1.base| .cse116) 3) 0 .cse121)) (not (= .cse121 .cse117))))))))) .cse33) (and .cse95 (exists ((v_DerPreprocessor_15 (Array Int Int))) (let ((.cse124 (select (select (store |c_old(#memory_$Pointer$#1.offset)| .cse7 v_DerPreprocessor_15) 3) 0))) (and (= .cse96 .cse124) (= |c_#memory_$Pointer$#1.base| (let ((.cse125 (let ((.cse126 (let ((.cse127 (+ .cse124 4))) (store .cse14 .cse127 (select .cse16 .cse127))))) (store (store |c_old(#memory_$Pointer$#1.base)| .cse8 .cse126) .cse7 (store (store (select (store .cse10 .cse8 .cse126) .cse7) .cse5 .cse8) .cse48 .cse51))))) (store .cse125 3 (store (select .cse125 3) 0 .cse7))))))) .cse101 .cse86 .cse23) (and .cse70 .cse2 .cse68 .cse69 (exists ((v_arrayElimCell_74 Int)) (= |c_#memory_$Pointer$#1.base| (let ((.cse128 (let ((.cse129 (+ 4 v_arrayElimCell_74))) (store .cse73 .cse129 (select .cse75 .cse129))))) (store (store |c_old(#memory_$Pointer$#1.base)| |c_mutex_lock_#in~m#1.base| .cse128) 3 (store (store (select (store .cse72 |c_mutex_lock_#in~m#1.base| .cse128) 3) 4 .cse67) 0 3)))))) (and .cse70 (exists ((v_arrayElimCell_72 Int)) (let ((.cse130 (+ 4 v_arrayElimCell_72))) (and (not (= .cse130 0)) (= |c_#memory_$Pointer$#1.base| (let ((.cse131 (store .cse73 .cse130 (select .cse75 .cse130)))) (store (store |c_old(#memory_$Pointer$#1.base)| |c_mutex_lock_#in~m#1.base| .cse131) 3 (store (store (select (store .cse72 |c_mutex_lock_#in~m#1.base| .cse131) 3) 4 .cse67) 0 3))))))) .cse2 .cse68 .cse69) (and .cse33 (exists ((|mutex_lock_ldv_list_add_~new#1.base| Int) (v_DerPreprocessor_15 (Array Int Int)) (v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_25 (Array Int Int))) (let ((.cse139 (select (select (store |c_old(#memory_$Pointer$#1.offset)| |mutex_lock_ldv_list_add_~new#1.base| v_DerPreprocessor_15) 3) 0))) (let ((.cse134 (+ .cse139 4))) (let ((.cse138 (select v_DerPreprocessor_26 .cse134))) (let ((.cse133 (+ .cse138 4))) (let ((.cse132 (store (store (select (store (store |c_#memory_$Pointer$#1.offset| |mutex_lock_ldv_list_add_~new#1.base| v_DerPreprocessor_25) 3 v_DerPreprocessor_26) |mutex_lock_ldv_list_add_~new#1.base|) .cse138 .cse139) .cse133 0))) (and (= (select |c_old(#valid)| |mutex_lock_ldv_list_add_~new#1.base|) 0) (= (select |c_#memory_$Pointer$#1.offset| |mutex_lock_ldv_list_add_~new#1.base|) .cse132) (not (= .cse133 0)) (not (= .cse134 0)) (= |c_#memory_$Pointer$#1.base| (let ((.cse137 (store |c_old(#memory_$Pointer$#1.base)| |mutex_lock_ldv_list_add_~new#1.base| (store (select |c_old(#memory_$Pointer$#1.base)| |mutex_lock_ldv_list_add_~new#1.base|) 0 |c_mutex_lock_#in~m#1.base|)))) (let ((.cse136 (store (select .cse137 3) .cse134 (select .cse31 .cse134)))) (let ((.cse135 (store (store (select (store .cse137 3 .cse136) |mutex_lock_ldv_list_add_~new#1.base|) .cse138 3) .cse133 (select (select |c_#memory_$Pointer$#1.base| |mutex_lock_ldv_list_add_~new#1.base|) .cse133)))) (store (store |c_old(#memory_$Pointer$#1.base)| |mutex_lock_ldv_list_add_~new#1.base| .cse135) 3 (store (select (store (store |c_old(#memory_$Pointer$#1.base)| 3 .cse136) |mutex_lock_ldv_list_add_~new#1.base| .cse135) 3) 0 |mutex_lock_ldv_list_add_~new#1.base|)))))) (not (= |mutex_lock_ldv_list_add_~new#1.base| 3)) (= .cse21 (store (select (store (store |c_#memory_$Pointer$#1.offset| 3 v_DerPreprocessor_26) |mutex_lock_ldv_list_add_~new#1.base| .cse132) 3) 0 .cse138)) (not (= .cse138 .cse134)))))))))) (and .cse2 (or (exists ((v_arrayElimCell_79 Int)) (let ((.cse140 (+ 4 v_arrayElimCell_79))) (let ((.cse141 (select .cse21 .cse140))) (let ((.cse142 (+ .cse141 4))) (and (not (= .cse140 0)) (= .cse5 .cse141) (= (store |c_old(#memory_$Pointer$#1.base)| 3 (store (store (store (store .cse64 .cse140 (select .cse31 .cse140)) .cse141 3) .cse142 (select .cse31 .cse142)) 0 3)) |c_#memory_$Pointer$#1.base|) (= (select .cse21 .cse141) v_arrayElimCell_79) (= (select .cse21 .cse142) 0)))))) (and (exists ((v_arrayElimCell_79 Int)) (let ((.cse143 (+ 4 v_arrayElimCell_79))) (and (= (select .cse21 .cse143) 0) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| 3 (store (store (store .cse64 .cse143 (select .cse31 .cse143)) 4 .cse67) 0 3)))))) .cse68 .cse69)) .cse3) (and (exists ((|mutex_lock_ldv_list_add_~new#1.base| Int) (v_DerPreprocessor_15 (Array Int Int)) (v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_25 (Array Int Int))) (let ((.cse151 (select (select (store |c_old(#memory_$Pointer$#1.offset)| |mutex_lock_ldv_list_add_~new#1.base| v_DerPreprocessor_15) 3) 0))) (let ((.cse146 (+ .cse151 4))) (let ((.cse150 (select v_DerPreprocessor_26 .cse146))) (let ((.cse145 (+ .cse150 4))) (let ((.cse144 (store (store (select (store (store |c_#memory_$Pointer$#1.offset| |mutex_lock_ldv_list_add_~new#1.base| v_DerPreprocessor_25) 3 v_DerPreprocessor_26) |mutex_lock_ldv_list_add_~new#1.base|) .cse150 .cse151) .cse145 0))) (and (= (select |c_old(#valid)| |mutex_lock_ldv_list_add_~new#1.base|) 0) (= (select |c_#memory_$Pointer$#1.offset| |mutex_lock_ldv_list_add_~new#1.base|) .cse144) (not (= .cse145 0)) (not (= .cse146 0)) (= |c_#memory_$Pointer$#1.base| (let ((.cse149 (store |c_old(#memory_$Pointer$#1.base)| |mutex_lock_ldv_list_add_~new#1.base| (store (select |c_old(#memory_$Pointer$#1.base)| |mutex_lock_ldv_list_add_~new#1.base|) 0 |c_mutex_lock_#in~m#1.base|)))) (let ((.cse148 (store (select .cse149 3) .cse146 (select .cse31 .cse146)))) (let ((.cse147 (store (store (select (store .cse149 3 .cse148) |mutex_lock_ldv_list_add_~new#1.base|) .cse150 3) .cse145 (select (select |c_#memory_$Pointer$#1.base| |mutex_lock_ldv_list_add_~new#1.base|) .cse145)))) (store (store |c_old(#memory_$Pointer$#1.base)| |mutex_lock_ldv_list_add_~new#1.base| .cse147) 3 (store (select (store (store |c_old(#memory_$Pointer$#1.base)| 3 .cse148) |mutex_lock_ldv_list_add_~new#1.base| .cse147) 3) 0 |mutex_lock_ldv_list_add_~new#1.base|)))))) (not (= |mutex_lock_ldv_list_add_~new#1.base| 3)) (= .cse21 (store (select (store (store |c_#memory_$Pointer$#1.offset| 3 v_DerPreprocessor_26) |mutex_lock_ldv_list_add_~new#1.base| .cse144) 3) 0 .cse150))))))))) .cse33) (and (exists ((v_DerPreprocessor_30 (Array Int Int)) (v_DerPreprocessor_15 (Array Int Int)) (v_DerPreprocessor_28 (Array Int Int)) (v_DerPreprocessor_29 (Array Int Int))) (let ((.cse153 (select (select (store |c_old(#memory_$Pointer$#1.offset)| .cse7 v_DerPreprocessor_15) 3) 0))) (let ((.cse155 (+ .cse153 4))) (let ((.cse152 (select v_DerPreprocessor_30 .cse155)) (.cse159 (store (store |c_#memory_$Pointer$#1.offset| .cse7 v_DerPreprocessor_28) 3 v_DerPreprocessor_29))) (let ((.cse156 (select (store .cse159 .cse8 v_DerPreprocessor_30) .cse7)) (.cse154 (+ .cse152 4))) (and (not (= .cse152 .cse153)) (not (= .cse154 0)) (not (= .cse152 .cse155)) (= v_DerPreprocessor_28 .cse156) (= |c_#memory_$Pointer$#1.base| (let ((.cse157 (let ((.cse158 (store .cse83 .cse155 (select .cse84 .cse155)))) (store (store |c_old(#memory_$Pointer$#1.base)| .cse41 .cse158) .cse7 (store (store (select (store .cse10 .cse41 .cse158) .cse7) .cse152 .cse41) .cse154 (select .cse13 .cse154)))))) (store .cse157 3 (store (select .cse157 3) 0 .cse7)))) (= (store (store (select (store .cse159 .cse41 v_DerPreprocessor_30) .cse7) .cse152 .cse153) .cse154 0) .cse40) (= .cse21 (store (select (store (store (store |c_#memory_$Pointer$#1.offset| 3 v_DerPreprocessor_29) .cse8 v_DerPreprocessor_30) .cse7 (store (store .cse156 .cse152 .cse153) .cse154 0)) 3) 0 .cse152)))))))) .cse22 .cse86 .cse23))))))))) (= 3 |c_~#mutexes~0.base|)) is different from false [2024-11-23 23:38:49,822 INFO L190 IndexEqualityManager]: detected not equals via solver