./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 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-sets/test_mutex_unlock_at_exit.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-18 13:00:09,970 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-18 13:00:10,040 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-18 13:00:10,048 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-18 13:00:10,049 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-18 13:00:10,073 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-18 13:00:10,074 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-18 13:00:10,074 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-18 13:00:10,075 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-18 13:00:10,078 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-18 13:00:10,078 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-18 13:00:10,078 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-18 13:00:10,079 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-18 13:00:10,079 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-18 13:00:10,080 INFO L153 SettingsManager]: * Use SBE=true [2024-11-18 13:00:10,080 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-18 13:00:10,080 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-18 13:00:10,080 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-18 13:00:10,081 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-18 13:00:10,081 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-18 13:00:10,085 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-18 13:00:10,086 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-18 13:00:10,086 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-18 13:00:10,086 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-18 13:00:10,086 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-18 13:00:10,086 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-18 13:00:10,087 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-18 13:00:10,087 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-18 13:00:10,087 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-18 13:00:10,087 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-18 13:00:10,087 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-18 13:00:10,088 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-18 13:00:10,088 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 13:00:10,088 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-18 13:00:10,088 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-18 13:00:10,088 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-18 13:00:10,089 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-18 13:00:10,089 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-18 13:00:10,090 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-18 13:00:10,091 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-18 13:00:10,091 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-18 13:00:10,092 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-18 13:00:10,092 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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-18 13:00:10,361 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-18 13:00:10,391 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-18 13:00:10,393 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-18 13:00:10,394 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-18 13:00:10,395 INFO L274 PluginConnector]: CDTParser initialized [2024-11-18 13:00:10,397 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-sets/test_mutex_unlock_at_exit.i [2024-11-18 13:00:11,930 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-18 13:00:12,231 INFO L384 CDTParser]: Found 1 translation units. [2024-11-18 13:00:12,232 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex_unlock_at_exit.i [2024-11-18 13:00:12,253 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3fc5e47c6/5c19db1501294b12abf552fa7119e5ea/FLAG5aec24399 [2024-11-18 13:00:12,507 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3fc5e47c6/5c19db1501294b12abf552fa7119e5ea [2024-11-18 13:00:12,510 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-18 13:00:12,511 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-18 13:00:12,513 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-18 13:00:12,514 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-18 13:00:12,518 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-18 13:00:12,519 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 01:00:12" (1/1) ... [2024-11-18 13:00:12,520 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45f74f83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:00:12, skipping insertion in model container [2024-11-18 13:00:12,520 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 01:00:12" (1/1) ... [2024-11-18 13:00:12,559 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-18 13:00:13,006 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex_unlock_at_exit.i[25842,25855] [2024-11-18 13:00:13,034 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex_unlock_at_exit.i[25967,25980] [2024-11-18 13:00:13,036 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex_unlock_at_exit.i[26082,26095] [2024-11-18 13:00:13,044 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 13:00:13,055 INFO L200 MainTranslator]: Completed pre-run [2024-11-18 13:00:13,106 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex_unlock_at_exit.i[25842,25855] [2024-11-18 13:00:13,107 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex_unlock_at_exit.i[25967,25980] [2024-11-18 13:00:13,108 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex_unlock_at_exit.i[26082,26095] [2024-11-18 13:00:13,109 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 13:00:13,143 INFO L204 MainTranslator]: Completed translation [2024-11-18 13:00:13,143 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:00:13 WrapperNode [2024-11-18 13:00:13,143 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-18 13:00:13,145 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-18 13:00:13,146 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-18 13:00:13,146 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-18 13:00:13,153 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:00:13" (1/1) ... [2024-11-18 13:00:13,168 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:00:13" (1/1) ... [2024-11-18 13:00:13,195 INFO L138 Inliner]: procedures = 139, calls = 56, calls flagged for inlining = 15, calls inlined = 14, statements flattened = 139 [2024-11-18 13:00:13,195 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-18 13:00:13,196 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-18 13:00:13,196 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-18 13:00:13,196 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-18 13:00:13,206 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:00:13" (1/1) ... [2024-11-18 13:00:13,206 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:00:13" (1/1) ... [2024-11-18 13:00:13,211 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:00:13" (1/1) ... [2024-11-18 13:00:13,247 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-18 13:00:13,247 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:00:13" (1/1) ... [2024-11-18 13:00:13,247 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:00:13" (1/1) ... [2024-11-18 13:00:13,257 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:00:13" (1/1) ... [2024-11-18 13:00:13,261 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:00:13" (1/1) ... [2024-11-18 13:00:13,263 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:00:13" (1/1) ... [2024-11-18 13:00:13,265 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:00:13" (1/1) ... [2024-11-18 13:00:13,269 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-18 13:00:13,270 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-18 13:00:13,270 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-18 13:00:13,271 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-18 13:00:13,271 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:00:13" (1/1) ... [2024-11-18 13:00:13,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 13:00:13,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 13:00:13,307 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-18 13:00:13,309 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-18 13:00:13,350 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2024-11-18 13:00:13,351 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2024-11-18 13:00:13,351 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-18 13:00:13,351 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock [2024-11-18 13:00:13,351 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock [2024-11-18 13:00:13,351 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-18 13:00:13,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-18 13:00:13,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-18 13:00:13,351 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_in_set [2024-11-18 13:00:13,352 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_in_set [2024-11-18 13:00:13,352 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-18 13:00:13,352 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-18 13:00:13,352 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-18 13:00:13,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-18 13:00:13,353 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-18 13:00:13,353 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-18 13:00:13,353 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-18 13:00:13,353 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_successful_malloc [2024-11-18 13:00:13,353 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_successful_malloc [2024-11-18 13:00:13,354 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-18 13:00:13,354 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-18 13:00:13,524 INFO L238 CfgBuilder]: Building ICFG [2024-11-18 13:00:13,527 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-18 13:00:13,828 INFO L? ?]: Removed 77 outVars from TransFormulas that were not future-live. [2024-11-18 13:00:13,828 INFO L287 CfgBuilder]: Performing block encoding [2024-11-18 13:00:13,846 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-18 13:00:13,846 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-18 13:00:13,846 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 01:00:13 BoogieIcfgContainer [2024-11-18 13:00:13,847 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-18 13:00:13,848 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-18 13:00:13,848 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-18 13:00:13,852 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-18 13:00:13,852 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 01:00:12" (1/3) ... [2024-11-18 13:00:13,853 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40d85c03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 01:00:13, skipping insertion in model container [2024-11-18 13:00:13,853 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:00:13" (2/3) ... [2024-11-18 13:00:13,854 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40d85c03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 01:00:13, skipping insertion in model container [2024-11-18 13:00:13,854 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 01:00:13" (3/3) ... [2024-11-18 13:00:13,856 INFO L112 eAbstractionObserver]: Analyzing ICFG test_mutex_unlock_at_exit.i [2024-11-18 13:00:13,872 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-18 13:00:13,873 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-11-18 13:00:13,935 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-18 13:00:13,941 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;@120cc15d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-18 13:00:13,942 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-11-18 13:00:13,946 INFO L276 IsEmpty]: Start isEmpty. Operand has 66 states, 49 states have (on average 1.2857142857142858) internal successors, (63), 52 states have internal predecessors, (63), 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-18 13:00:13,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-18 13:00:13,956 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:00:13,957 INFO L215 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-18 13:00:13,958 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 13:00:13,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:00:13,965 INFO L85 PathProgramCache]: Analyzing trace with hash -1608135823, now seen corresponding path program 1 times [2024-11-18 13:00:13,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 13:00:13,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679935908] [2024-11-18 13:00:13,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:00:13,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 13:00:14,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:00:14,251 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-18 13:00:14,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 13:00:14,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679935908] [2024-11-18 13:00:14,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679935908] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 13:00:14,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [664248514] [2024-11-18 13:00:14,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:00:14,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 13:00:14,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 13:00:14,257 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 13:00:14,259 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-18 13:00:14,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:00:14,400 INFO L255 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-18 13:00:14,407 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 13:00:14,448 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-18 13:00:14,448 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 13:00:14,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [664248514] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 13:00:14,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-18 13:00:14,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-18 13:00:14,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271548660] [2024-11-18 13:00:14,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 13:00:14,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-18 13:00:14,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 13:00:14,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-18 13:00:14,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-18 13:00:14,492 INFO L87 Difference]: Start difference. First operand has 66 states, 49 states have (on average 1.2857142857142858) internal successors, (63), 52 states have internal predecessors, (63), 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-18 13:00:14,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 13:00:14,520 INFO L93 Difference]: Finished difference Result 128 states and 165 transitions. [2024-11-18 13:00:14,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-18 13:00:14,524 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-18 13:00:14,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 13:00:14,533 INFO L225 Difference]: With dead ends: 128 [2024-11-18 13:00:14,534 INFO L226 Difference]: Without dead ends: 61 [2024-11-18 13:00:14,538 INFO L431 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-18 13:00:14,544 INFO L432 NwaCegarLoop]: 75 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, 75 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-18 13:00:14,547 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 13:00:14,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-11-18 13:00:14,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2024-11-18 13:00:14,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 47 states have internal predecessors, (52), 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-18 13:00:14,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 70 transitions. [2024-11-18 13:00:14,585 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 70 transitions. Word has length 28 [2024-11-18 13:00:14,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 13:00:14,585 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 70 transitions. [2024-11-18 13:00:14,586 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-18 13:00:14,586 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 70 transitions. [2024-11-18 13:00:14,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-18 13:00:14,587 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:00:14,588 INFO L215 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-18 13:00:14,608 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-18 13:00:14,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-18 13:00:14,789 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 13:00:14,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:00:14,790 INFO L85 PathProgramCache]: Analyzing trace with hash -139675215, now seen corresponding path program 1 times [2024-11-18 13:00:14,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 13:00:14,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370988128] [2024-11-18 13:00:14,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:00:14,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 13:00:14,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:00:15,332 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-18 13:00:15,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 13:00:15,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370988128] [2024-11-18 13:00:15,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370988128] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 13:00:15,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 13:00:15,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-18 13:00:15,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213835553] [2024-11-18 13:00:15,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 13:00:15,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-18 13:00:15,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 13:00:15,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-18 13:00:15,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-18 13:00:15,338 INFO L87 Difference]: Start difference. First operand 61 states and 70 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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-18 13:00:15,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 13:00:15,719 INFO L93 Difference]: Finished difference Result 175 states and 212 transitions. [2024-11-18 13:00:15,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-18 13:00:15,720 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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 28 [2024-11-18 13:00:15,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 13:00:15,724 INFO L225 Difference]: With dead ends: 175 [2024-11-18 13:00:15,724 INFO L226 Difference]: Without dead ends: 122 [2024-11-18 13:00:15,725 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-18 13:00:15,726 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 79 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-18 13:00:15,726 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 184 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-18 13:00:15,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-18 13:00:15,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 92. [2024-11-18 13:00:15,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 67 states have (on average 1.1791044776119404) internal successors, (79), 71 states have internal predecessors, (79), 14 states have call successors, (14), 7 states have call predecessors, (14), 8 states have return successors, (17), 13 states have call predecessors, (17), 14 states have call successors, (17) [2024-11-18 13:00:15,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 110 transitions. [2024-11-18 13:00:15,752 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 110 transitions. Word has length 28 [2024-11-18 13:00:15,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 13:00:15,752 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 110 transitions. [2024-11-18 13:00:15,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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-18 13:00:15,752 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 110 transitions. [2024-11-18 13:00:15,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-18 13:00:15,753 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:00:15,754 INFO L215 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-18 13:00:15,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-18 13:00:15,754 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 13:00:15,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:00:15,755 INFO L85 PathProgramCache]: Analyzing trace with hash -1714278520, now seen corresponding path program 1 times [2024-11-18 13:00:15,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 13:00:15,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413791710] [2024-11-18 13:00:15,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:00:15,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 13:00:15,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:00:15,836 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-18 13:00:15,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 13:00:15,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413791710] [2024-11-18 13:00:15,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413791710] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 13:00:15,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 13:00:15,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 13:00:15,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013111828] [2024-11-18 13:00:15,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 13:00:15,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 13:00:15,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 13:00:15,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 13:00:15,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 13:00:15,841 INFO L87 Difference]: Start difference. First operand 92 states and 110 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-18 13:00:15,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 13:00:15,866 INFO L93 Difference]: Finished difference Result 100 states and 120 transitions. [2024-11-18 13:00:15,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 13:00:15,867 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-18 13:00:15,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 13:00:15,868 INFO L225 Difference]: With dead ends: 100 [2024-11-18 13:00:15,868 INFO L226 Difference]: Without dead ends: 98 [2024-11-18 13:00:15,869 INFO L431 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-18 13:00:15,870 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 0 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 206 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-18 13:00:15,872 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 206 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 13:00:15,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-18 13:00:15,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 96. [2024-11-18 13:00:15,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 70 states have (on average 1.1571428571428573) internal successors, (81), 74 states have internal predecessors, (81), 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-18 13:00:15,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 115 transitions. [2024-11-18 13:00:15,896 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 115 transitions. Word has length 28 [2024-11-18 13:00:15,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 13:00:15,897 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 115 transitions. [2024-11-18 13:00:15,897 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-18 13:00:15,897 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 115 transitions. [2024-11-18 13:00:15,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-18 13:00:15,899 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:00:15,899 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 13:00:15,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-18 13:00:15,901 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 13:00:15,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:00:15,902 INFO L85 PathProgramCache]: Analyzing trace with hash -2142153081, now seen corresponding path program 1 times [2024-11-18 13:00:15,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 13:00:15,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983820670] [2024-11-18 13:00:15,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:00:15,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 13:00:15,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:00:16,474 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 3 proven. 21 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-18 13:00:16,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 13:00:16,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983820670] [2024-11-18 13:00:16,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983820670] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 13:00:16,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [140335192] [2024-11-18 13:00:16,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:00:16,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 13:00:16,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 13:00:16,479 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 13:00:16,482 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-18 13:00:16,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:00:16,637 INFO L255 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-18 13:00:16,642 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 13:00:17,296 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-18 13:00:17,296 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 13:00:17,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [140335192] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 13:00:17,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-18 13:00:17,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 15 [2024-11-18 13:00:17,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888071474] [2024-11-18 13:00:17,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 13:00:17,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-18 13:00:17,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 13:00:17,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-18 13:00:17,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2024-11-18 13:00:17,303 INFO L87 Difference]: Start difference. First operand 96 states and 115 transitions. Second operand has 9 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 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-18 13:00:18,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 13:00:18,038 INFO L93 Difference]: Finished difference Result 245 states and 298 transitions. [2024-11-18 13:00:18,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-18 13:00:18,039 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 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 71 [2024-11-18 13:00:18,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 13:00:18,041 INFO L225 Difference]: With dead ends: 245 [2024-11-18 13:00:18,041 INFO L226 Difference]: Without dead ends: 147 [2024-11-18 13:00:18,042 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=159, Invalid=491, Unknown=0, NotChecked=0, Total=650 [2024-11-18 13:00:18,046 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 181 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-18 13:00:18,047 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 249 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-18 13:00:18,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-11-18 13:00:18,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 109. [2024-11-18 13:00:18,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 80 states have (on average 1.1375) internal successors, (91), 85 states have internal predecessors, (91), 15 states have call successors, (15), 8 states have call predecessors, (15), 11 states have return successors, (24), 15 states have call predecessors, (24), 15 states have call successors, (24) [2024-11-18 13:00:18,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 130 transitions. [2024-11-18 13:00:18,079 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 130 transitions. Word has length 71 [2024-11-18 13:00:18,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 13:00:18,080 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 130 transitions. [2024-11-18 13:00:18,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 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-18 13:00:18,080 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 130 transitions. [2024-11-18 13:00:18,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-18 13:00:18,085 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:00:18,085 INFO L215 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-18 13:00:18,103 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-18 13:00:18,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2024-11-18 13:00:18,286 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 13:00:18,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:00:18,287 INFO L85 PathProgramCache]: Analyzing trace with hash -1920269835, now seen corresponding path program 1 times [2024-11-18 13:00:18,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 13:00:18,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545011521] [2024-11-18 13:00:18,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:00:18,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 13:00:18,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:00:18,368 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-18 13:00:18,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 13:00:18,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545011521] [2024-11-18 13:00:18,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545011521] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 13:00:18,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [868415392] [2024-11-18 13:00:18,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:00:18,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 13:00:18,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 13:00:18,375 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 13:00:18,377 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-18 13:00:18,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:00:18,507 INFO L255 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-18 13:00:18,510 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 13:00:18,522 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-18 13:00:18,522 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 13:00:18,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [868415392] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 13:00:18,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-18 13:00:18,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2024-11-18 13:00:18,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079177849] [2024-11-18 13:00:18,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 13:00:18,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 13:00:18,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 13:00:18,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 13:00:18,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 13:00:18,525 INFO L87 Difference]: Start difference. First operand 109 states and 130 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-18 13:00:18,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 13:00:18,554 INFO L93 Difference]: Finished difference Result 177 states and 204 transitions. [2024-11-18 13:00:18,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 13:00:18,555 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-18 13:00:18,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 13:00:18,557 INFO L225 Difference]: With dead ends: 177 [2024-11-18 13:00:18,557 INFO L226 Difference]: Without dead ends: 107 [2024-11-18 13:00:18,557 INFO L431 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-18 13:00:18,561 INFO L432 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-18 13:00:18,562 INFO L433 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-18 13:00:18,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-11-18 13:00:18,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2024-11-18 13:00:18,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 80 states have (on average 1.125) internal successors, (90), 84 states have internal predecessors, (90), 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-18 13:00:18,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 124 transitions. [2024-11-18 13:00:18,583 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 124 transitions. Word has length 71 [2024-11-18 13:00:18,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 13:00:18,584 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 124 transitions. [2024-11-18 13:00:18,584 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-18 13:00:18,584 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 124 transitions. [2024-11-18 13:00:18,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-18 13:00:18,588 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:00:18,588 INFO L215 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] [2024-11-18 13:00:18,606 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-18 13:00:18,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 13:00:18,789 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 13:00:18,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:00:18,790 INFO L85 PathProgramCache]: Analyzing trace with hash -767049998, now seen corresponding path program 1 times [2024-11-18 13:00:18,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 13:00:18,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222660662] [2024-11-18 13:00:18,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:00:18,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 13:00:18,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:00:24,068 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-18 13:00:24,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 13:00:24,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222660662] [2024-11-18 13:00:24,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222660662] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 13:00:24,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [616409938] [2024-11-18 13:00:24,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:00:24,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 13:00:24,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 13:00:24,071 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 13:00:24,073 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-18 13:00:24,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:00:24,239 INFO L255 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 156 conjuncts are in the unsatisfiable core [2024-11-18 13:00:24,249 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 13:00:24,611 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-18 13:00:24,612 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-18 13:00:24,975 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2024-11-18 13:00:24,976 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-18 13:00:26,091 INFO L349 Elim1Store]: treesize reduction 117, result has 35.4 percent of original size [2024-11-18 13:00:26,091 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-18 13:00:26,109 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-18 13:00:26,161 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-18 13:00:26,177 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-18 13:00:26,194 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-18 13:00:26,248 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-18 13:00:26,254 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-18 13:00:26,270 INFO L349 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2024-11-18 13:00:26,270 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-18 13:00:26,314 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-18 13:00:26,369 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-18 13:00:26,374 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-18 13:00:26,376 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-18 13:00:26,382 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-18 13:00:26,494 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-18 13:00:26,495 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-18 13:00:26,495 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-18 13:00:26,499 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-18 13:00:26,638 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-18 13:00:26,639 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-18 13:00:28,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-18 13:00:28,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-18 13:00:28,629 INFO L349 Elim1Store]: treesize reduction 203, result has 0.5 percent of original size [2024-11-18 13:00:28,629 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-18 13:00:28,644 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-18 13:00:28,651 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-18 13:00:28,698 INFO L349 Elim1Store]: treesize reduction 44, result has 38.0 percent of original size [2024-11-18 13:00:28,699 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-18 13:00:28,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-18 13:00:28,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-18 13:00:28,721 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-18 13:00:28,748 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-18 13:00:28,780 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-18 13:00:28,788 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-18 13:00:28,793 INFO L349 Elim1Store]: treesize reduction 4, result has 80.0 percent of original size [2024-11-18 13:00:28,794 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-18 13:00:29,891 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-18 13:00:29,892 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 13:00:30,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [616409938] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 13:00:30,911 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-18 13:00:30,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 30] total 60 [2024-11-18 13:00:30,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544535708] [2024-11-18 13:00:30,911 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-18 13:00:30,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2024-11-18 13:00:30,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 13:00:30,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2024-11-18 13:00:30,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=254, Invalid=4290, Unknown=12, NotChecked=0, Total=4556 [2024-11-18 13:00:30,914 INFO L87 Difference]: Start difference. First operand 107 states and 124 transitions. Second operand has 60 states, 49 states have (on average 1.7346938775510203) internal successors, (85), 43 states have internal predecessors, (85), 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-18 13:00:37,639 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-18 13:00:42,300 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-18 13:00:43,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 13:00:43,002 INFO L93 Difference]: Finished difference Result 222 states and 255 transitions. [2024-11-18 13:00:43,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2024-11-18 13:00:43,003 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 49 states have (on average 1.7346938775510203) internal successors, (85), 43 states have internal predecessors, (85), 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 63 [2024-11-18 13:00:43,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 13:00:43,004 INFO L225 Difference]: With dead ends: 222 [2024-11-18 13:00:43,004 INFO L226 Difference]: Without dead ends: 140 [2024-11-18 13:00:43,007 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2112 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=693, Invalid=9801, Unknown=12, NotChecked=0, Total=10506 [2024-11-18 13:00:43,007 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 287 mSDsluCounter, 1270 mSDsCounter, 0 mSdLazyCounter, 2345 mSolverCounterSat, 73 mSolverCounterUnsat, 14 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 1317 SdHoareTripleChecker+Invalid, 2432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 2345 IncrementalHoareTripleChecker+Invalid, 14 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.1s IncrementalHoareTripleChecker+Time [2024-11-18 13:00:43,008 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 1317 Invalid, 2432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 2345 Invalid, 14 Unknown, 0 Unchecked, 10.1s Time] [2024-11-18 13:00:43,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-11-18 13:00:43,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 115. [2024-11-18 13:00:43,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 87 states have (on average 1.1379310344827587) internal successors, (99), 91 states have internal predecessors, (99), 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-18 13:00:43,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 129 transitions. [2024-11-18 13:00:43,028 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 129 transitions. Word has length 63 [2024-11-18 13:00:43,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 13:00:43,029 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 129 transitions. [2024-11-18 13:00:43,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 49 states have (on average 1.7346938775510203) internal successors, (85), 43 states have internal predecessors, (85), 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-18 13:00:43,032 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 129 transitions. [2024-11-18 13:00:43,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-18 13:00:43,032 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:00:43,033 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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, 1] [2024-11-18 13:00:43,047 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-18 13:00:43,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 13:00:43,233 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 13:00:43,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:00:43,234 INFO L85 PathProgramCache]: Analyzing trace with hash 507109837, now seen corresponding path program 1 times [2024-11-18 13:00:43,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 13:00:43,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416503537] [2024-11-18 13:00:43,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:00:43,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 13:00:43,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:00:46,183 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 12 proven. 19 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-18 13:00:46,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 13:00:46,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416503537] [2024-11-18 13:00:46,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416503537] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 13:00:46,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [459892342] [2024-11-18 13:00:46,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:00:46,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 13:00:46,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 13:00:46,186 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 13:00:46,189 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-18 13:00:46,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:00:46,332 INFO L255 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 143 conjuncts are in the unsatisfiable core [2024-11-18 13:00:46,338 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 13:00:46,619 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-18 13:00:46,619 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-18 13:00:46,922 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-18 13:00:46,923 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-18 13:00:47,679 INFO L349 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2024-11-18 13:00:47,679 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-18 13:00:47,698 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-18 13:00:47,789 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-18 13:00:47,794 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-18 13:00:47,802 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-18 13:00:47,803 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-18 13:00:47,804 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-18 13:00:47,812 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-18 13:00:47,816 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-18 13:00:47,845 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-18 13:00:47,870 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-18 13:00:47,926 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-18 13:00:47,934 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-18 13:00:47,935 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-18 13:00:47,936 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-18 13:00:47,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-18 13:00:47,953 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-18 13:00:47,958 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-18 13:00:48,061 INFO L349 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2024-11-18 13:00:48,062 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-18 13:00:48,095 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-18 13:00:48,744 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-18 13:00:48,752 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-18 13:00:48,753 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-18 13:00:48,754 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-18 13:00:48,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-18 13:00:48,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-18 13:00:48,769 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-18 13:00:48,782 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-18 13:00:48,793 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-18 13:00:48,794 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-18 13:00:48,794 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-18 13:00:48,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-18 13:00:48,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-18 13:00:48,814 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-18 13:00:48,874 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-18 13:00:48,886 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-18 13:00:48,887 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-18 13:00:48,888 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-18 13:00:48,898 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-18 13:00:48,899 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-18 13:00:48,900 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-18 13:00:48,909 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-18 13:00:48,919 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-18 13:00:49,056 INFO L349 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2024-11-18 13:00:49,056 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-18 13:00:49,104 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-18 13:00:49,418 INFO L349 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2024-11-18 13:00:49,419 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-18 13:00:49,435 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-18 13:00:49,436 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-18 13:00:49,466 INFO L349 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2024-11-18 13:00:49,467 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-18 13:00:49,484 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-18 13:00:49,505 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-18 13:00:49,516 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-18 13:00:49,538 INFO L349 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2024-11-18 13:00:49,539 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-18 13:00:49,613 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-18 13:00:49,626 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-18 13:00:49,628 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-18 13:00:49,643 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-18 13:00:49,644 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-18 13:00:49,663 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-18 13:00:49,824 INFO L349 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2024-11-18 13:00:49,825 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-18 13:00:49,845 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-18 13:00:49,854 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-18 13:00:49,854 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-18 13:00:49,907 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-18 13:00:50,138 INFO L349 Elim1Store]: treesize reduction 33, result has 38.9 percent of original size [2024-11-18 13:00:50,139 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-18 13:00:50,163 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-18 13:00:50,174 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-18 13:00:50,174 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-18 13:00:50,221 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-18 13:00:54,388 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-18 13:00:58,427 WARN L873 $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 true [2024-11-18 13:01:04,951 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-18 13:01:05,681 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-18 13:01:05,683 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-18 13:01:05,733 INFO L349 Elim1Store]: treesize reduction 25, result has 45.7 percent of original size [2024-11-18 13:01:05,733 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-18 13:01:05,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-18 13:01:05,828 INFO L349 Elim1Store]: treesize reduction 45, result has 2.2 percent of original size [2024-11-18 13:01:05,829 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-18 13:01:06,025 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-18 13:01:06,262 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-18 13:01:06,278 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-18 13:01:06,489 INFO L349 Elim1Store]: treesize reduction 94, result has 23.0 percent of original size [2024-11-18 13:01:06,490 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-18 13:01:07,132 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-18 13:01:07,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 96 treesize of output 84 [2024-11-18 13:01:07,732 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-18 13:01:07,818 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-18 13:01:11,082 INFO L349 Elim1Store]: treesize reduction 46, result has 38.7 percent of original size [2024-11-18 13:01:11,082 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-18 13:01:11,094 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-18 13:01:13,102 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-18 13:01:13,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-18 13:01:13,307 INFO L349 Elim1Store]: treesize reduction 94, result has 23.0 percent of original size [2024-11-18 13:01:13,308 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-18 13:01:15,069 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-18 13:01:15,191 INFO L349 Elim1Store]: treesize reduction 60, result has 36.8 percent of original size [2024-11-18 13:01:15,191 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-18 13:01:19,283 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-18 13:01:33,919 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