./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix026.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db4cb518-1826-4590-a2f4-8e2051766367/bin/uautomizer-verify-VRDe98Ueme/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db4cb518-1826-4590-a2f4-8e2051766367/bin/uautomizer-verify-VRDe98Ueme/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db4cb518-1826-4590-a2f4-8e2051766367/bin/uautomizer-verify-VRDe98Ueme/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db4cb518-1826-4590-a2f4-8e2051766367/bin/uautomizer-verify-VRDe98Ueme/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix026.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db4cb518-1826-4590-a2f4-8e2051766367/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db4cb518-1826-4590-a2f4-8e2051766367/bin/uautomizer-verify-VRDe98Ueme --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a107688f8a9743f96e4ba7fbbac745d7f444b48f461db6b6c74848593b202e05 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-26 10:46:30,992 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-26 10:46:31,072 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db4cb518-1826-4590-a2f4-8e2051766367/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-26 10:46:31,078 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-26 10:46:31,079 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-26 10:46:31,108 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-26 10:46:31,109 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-26 10:46:31,110 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-26 10:46:31,111 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-26 10:46:31,111 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-26 10:46:31,112 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-26 10:46:31,112 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-26 10:46:31,113 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-26 10:46:31,114 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-26 10:46:31,115 INFO L153 SettingsManager]: * Use SBE=true [2023-11-26 10:46:31,115 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-26 10:46:31,116 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-26 10:46:31,117 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-26 10:46:31,117 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-26 10:46:31,118 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-26 10:46:31,118 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-26 10:46:31,119 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-26 10:46:31,120 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-26 10:46:31,120 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-26 10:46:31,121 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-26 10:46:31,122 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-26 10:46:31,126 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-26 10:46:31,127 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-26 10:46:31,127 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-26 10:46:31,128 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-26 10:46:31,128 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-26 10:46:31,128 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-26 10:46:31,129 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 10:46:31,129 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-26 10:46:31,129 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-26 10:46:31,129 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-26 10:46:31,130 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-26 10:46:31,130 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-26 10:46:31,130 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-26 10:46:31,130 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-26 10:46:31,131 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-26 10:46:31,131 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db4cb518-1826-4590-a2f4-8e2051766367/bin/uautomizer-verify-VRDe98Ueme/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db4cb518-1826-4590-a2f4-8e2051766367/bin/uautomizer-verify-VRDe98Ueme Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> a107688f8a9743f96e4ba7fbbac745d7f444b48f461db6b6c74848593b202e05 [2023-11-26 10:46:31,413 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-26 10:46:31,435 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-26 10:46:31,438 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-26 10:46:31,440 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-26 10:46:31,441 INFO L274 PluginConnector]: CDTParser initialized [2023-11-26 10:46:31,442 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db4cb518-1826-4590-a2f4-8e2051766367/bin/uautomizer-verify-VRDe98Ueme/../../sv-benchmarks/c/pthread-wmm/mix026.oepc.i [2023-11-26 10:46:34,586 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-26 10:46:34,976 INFO L384 CDTParser]: Found 1 translation units. [2023-11-26 10:46:34,977 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db4cb518-1826-4590-a2f4-8e2051766367/sv-benchmarks/c/pthread-wmm/mix026.oepc.i [2023-11-26 10:46:34,997 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db4cb518-1826-4590-a2f4-8e2051766367/bin/uautomizer-verify-VRDe98Ueme/data/20981377c/4d584195ded9480ba89757d1611e5d08/FLAG2430d553c [2023-11-26 10:46:35,017 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db4cb518-1826-4590-a2f4-8e2051766367/bin/uautomizer-verify-VRDe98Ueme/data/20981377c/4d584195ded9480ba89757d1611e5d08 [2023-11-26 10:46:35,026 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-26 10:46:35,030 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-26 10:46:35,032 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-26 10:46:35,033 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-26 10:46:35,038 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-26 10:46:35,039 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 10:46:35" (1/1) ... [2023-11-26 10:46:35,040 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3088fb03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:46:35, skipping insertion in model container [2023-11-26 10:46:35,040 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 10:46:35" (1/1) ... [2023-11-26 10:46:35,117 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-26 10:46:35,618 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 10:46:35,630 INFO L202 MainTranslator]: Completed pre-run [2023-11-26 10:46:35,689 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 10:46:35,727 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-26 10:46:35,728 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-26 10:46:35,736 INFO L206 MainTranslator]: Completed translation [2023-11-26 10:46:35,737 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:46:35 WrapperNode [2023-11-26 10:46:35,737 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-26 10:46:35,738 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-26 10:46:35,739 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-26 10:46:35,739 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-26 10:46:35,747 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:46:35" (1/1) ... [2023-11-26 10:46:35,767 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:46:35" (1/1) ... [2023-11-26 10:46:35,812 INFO L138 Inliner]: procedures = 177, calls = 70, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 150 [2023-11-26 10:46:35,819 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-26 10:46:35,820 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-26 10:46:35,821 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-26 10:46:35,821 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-26 10:46:35,834 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:46:35" (1/1) ... [2023-11-26 10:46:35,834 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:46:35" (1/1) ... [2023-11-26 10:46:35,837 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:46:35" (1/1) ... [2023-11-26 10:46:35,861 INFO L175 MemorySlicer]: Split 6 memory accesses to 5 slices as follows [2, 1, 1, 1, 1]. 33 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0]. The 4 writes are split as follows [0, 1, 1, 1, 1]. [2023-11-26 10:46:35,870 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:46:35" (1/1) ... [2023-11-26 10:46:35,871 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:46:35" (1/1) ... [2023-11-26 10:46:35,882 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:46:35" (1/1) ... [2023-11-26 10:46:35,908 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:46:35" (1/1) ... [2023-11-26 10:46:35,911 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:46:35" (1/1) ... [2023-11-26 10:46:35,914 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:46:35" (1/1) ... [2023-11-26 10:46:35,919 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-26 10:46:35,920 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-26 10:46:35,920 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-26 10:46:35,921 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-26 10:46:35,922 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:46:35" (1/1) ... [2023-11-26 10:46:35,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 10:46:35,947 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db4cb518-1826-4590-a2f4-8e2051766367/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 10:46:35,968 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db4cb518-1826-4590-a2f4-8e2051766367/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-26 10:46:36,030 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db4cb518-1826-4590-a2f4-8e2051766367/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-26 10:46:36,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-26 10:46:36,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-26 10:46:36,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-26 10:46:36,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-26 10:46:36,050 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-11-26 10:46:36,050 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-26 10:46:36,050 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-26 10:46:36,050 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-26 10:46:36,050 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-26 10:46:36,051 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-26 10:46:36,051 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-26 10:46:36,051 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-26 10:46:36,051 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-26 10:46:36,051 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-26 10:46:36,052 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-26 10:46:36,052 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-11-26 10:46:36,052 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-11-26 10:46:36,052 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-26 10:46:36,052 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-26 10:46:36,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-26 10:46:36,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-26 10:46:36,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-11-26 10:46:36,053 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-26 10:46:36,054 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-26 10:46:36,054 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-26 10:46:36,055 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-26 10:46:36,269 INFO L241 CfgBuilder]: Building ICFG [2023-11-26 10:46:36,271 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-26 10:46:36,771 INFO L282 CfgBuilder]: Performing block encoding [2023-11-26 10:46:37,099 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-26 10:46:37,100 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-26 10:46:37,101 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 10:46:37 BoogieIcfgContainer [2023-11-26 10:46:37,101 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-26 10:46:37,107 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-26 10:46:37,108 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-26 10:46:37,111 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-26 10:46:37,112 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 10:46:35" (1/3) ... [2023-11-26 10:46:37,112 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ce8cee1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 10:46:37, skipping insertion in model container [2023-11-26 10:46:37,113 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:46:35" (2/3) ... [2023-11-26 10:46:37,114 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ce8cee1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 10:46:37, skipping insertion in model container [2023-11-26 10:46:37,115 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 10:46:37" (3/3) ... [2023-11-26 10:46:37,116 INFO L112 eAbstractionObserver]: Analyzing ICFG mix026.oepc.i [2023-11-26 10:46:37,138 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-26 10:46:37,138 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-11-26 10:46:37,139 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-26 10:46:37,216 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-26 10:46:37,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 77 places, 66 transitions, 148 flow [2023-11-26 10:46:37,326 INFO L124 PetriNetUnfolderBase]: 2/62 cut-off events. [2023-11-26 10:46:37,330 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-26 10:46:37,335 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75 conditions, 62 events. 2/62 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 124 event pairs, 0 based on Foata normal form. 0/49 useless extension candidates. Maximal degree in co-relation 63. Up to 2 conditions per place. [2023-11-26 10:46:37,336 INFO L82 GeneralOperation]: Start removeDead. Operand has 77 places, 66 transitions, 148 flow [2023-11-26 10:46:37,344 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 73 places, 62 transitions, 136 flow [2023-11-26 10:46:37,359 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-26 10:46:37,366 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@1440cbb0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-26 10:46:37,367 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-11-26 10:46:37,371 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-26 10:46:37,371 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-11-26 10:46:37,371 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-26 10:46:37,375 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:46:37,376 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-26 10:46:37,376 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-26 10:46:37,389 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:46:37,389 INFO L85 PathProgramCache]: Analyzing trace with hash 14179, now seen corresponding path program 1 times [2023-11-26 10:46:37,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:46:37,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233845380] [2023-11-26 10:46:37,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:46:37,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:46:37,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:46:37,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:46:37,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:46:37,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233845380] [2023-11-26 10:46:37,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233845380] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:46:37,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:46:37,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-26 10:46:37,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878864122] [2023-11-26 10:46:37,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:46:37,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:46:37,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:46:37,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:46:37,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:46:37,865 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 66 [2023-11-26 10:46:37,868 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 62 transitions, 136 flow. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:37,869 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:46:37,869 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 66 [2023-11-26 10:46:37,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:46:39,785 INFO L124 PetriNetUnfolderBase]: 4217/7238 cut-off events. [2023-11-26 10:46:39,785 INFO L125 PetriNetUnfolderBase]: For 65/65 co-relation queries the response was YES. [2023-11-26 10:46:39,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13165 conditions, 7238 events. 4217/7238 cut-off events. For 65/65 co-relation queries the response was YES. Maximal size of possible extension queue 410. Compared 53752 event pairs, 3179 based on Foata normal form. 360/6957 useless extension candidates. Maximal degree in co-relation 13150. Up to 4391 conditions per place. [2023-11-26 10:46:39,874 INFO L140 encePairwiseOnDemand]: 61/66 looper letters, 36 selfloop transitions, 2 changer transitions 0/69 dead transitions. [2023-11-26 10:46:39,875 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 69 transitions, 226 flow [2023-11-26 10:46:39,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:46:39,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 10:46:39,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 146 transitions. [2023-11-26 10:46:39,889 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7373737373737373 [2023-11-26 10:46:39,890 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 146 transitions. [2023-11-26 10:46:39,890 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 146 transitions. [2023-11-26 10:46:39,892 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:46:39,895 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 146 transitions. [2023-11-26 10:46:39,901 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:39,906 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:39,907 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:39,909 INFO L175 Difference]: Start difference. First operand has 73 places, 62 transitions, 136 flow. Second operand 3 states and 146 transitions. [2023-11-26 10:46:39,910 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 69 transitions, 226 flow [2023-11-26 10:46:39,919 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 69 transitions, 222 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-26 10:46:39,925 INFO L231 Difference]: Finished difference. Result has 69 places, 58 transitions, 128 flow [2023-11-26 10:46:39,928 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=128, PETRI_PLACES=69, PETRI_TRANSITIONS=58} [2023-11-26 10:46:39,932 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -4 predicate places. [2023-11-26 10:46:39,932 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 58 transitions, 128 flow [2023-11-26 10:46:39,933 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:39,933 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:46:39,933 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-26 10:46:39,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-26 10:46:39,934 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-26 10:46:39,934 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:46:39,935 INFO L85 PathProgramCache]: Analyzing trace with hash 14180, now seen corresponding path program 1 times [2023-11-26 10:46:39,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:46:39,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764172237] [2023-11-26 10:46:39,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:46:39,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:46:39,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:46:40,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:46:40,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:46:40,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764172237] [2023-11-26 10:46:40,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764172237] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:46:40,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:46:40,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-26 10:46:40,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628461856] [2023-11-26 10:46:40,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:46:40,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:46:40,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:46:40,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:46:40,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:46:40,145 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 66 [2023-11-26 10:46:40,145 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 58 transitions, 128 flow. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:40,145 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:46:40,146 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 66 [2023-11-26 10:46:40,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:46:41,677 INFO L124 PetriNetUnfolderBase]: 4217/7237 cut-off events. [2023-11-26 10:46:41,677 INFO L125 PetriNetUnfolderBase]: For 180/180 co-relation queries the response was YES. [2023-11-26 10:46:41,697 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13341 conditions, 7237 events. 4217/7237 cut-off events. For 180/180 co-relation queries the response was YES. Maximal size of possible extension queue 410. Compared 53760 event pairs, 3179 based on Foata normal form. 1/6597 useless extension candidates. Maximal degree in co-relation 13330. Up to 4390 conditions per place. [2023-11-26 10:46:41,749 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 35 selfloop transitions, 2 changer transitions 0/68 dead transitions. [2023-11-26 10:46:41,749 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 68 transitions, 222 flow [2023-11-26 10:46:41,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:46:41,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 10:46:41,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 146 transitions. [2023-11-26 10:46:41,751 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7373737373737373 [2023-11-26 10:46:41,752 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 146 transitions. [2023-11-26 10:46:41,752 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 146 transitions. [2023-11-26 10:46:41,752 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:46:41,753 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 146 transitions. [2023-11-26 10:46:41,754 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:41,755 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:41,755 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:41,755 INFO L175 Difference]: Start difference. First operand has 69 places, 58 transitions, 128 flow. Second operand 3 states and 146 transitions. [2023-11-26 10:46:41,756 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 68 transitions, 222 flow [2023-11-26 10:46:41,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 68 transitions, 218 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 10:46:41,768 INFO L231 Difference]: Finished difference. Result has 68 places, 57 transitions, 126 flow [2023-11-26 10:46:41,768 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=126, PETRI_PLACES=68, PETRI_TRANSITIONS=57} [2023-11-26 10:46:41,769 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -5 predicate places. [2023-11-26 10:46:41,769 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 57 transitions, 126 flow [2023-11-26 10:46:41,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:41,770 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:46:41,770 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-26 10:46:41,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-26 10:46:41,771 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-26 10:46:41,771 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:46:41,771 INFO L85 PathProgramCache]: Analyzing trace with hash 422848411, now seen corresponding path program 1 times [2023-11-26 10:46:41,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:46:41,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565290149] [2023-11-26 10:46:41,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:46:41,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:46:41,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:46:41,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:46:41,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:46:41,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565290149] [2023-11-26 10:46:41,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565290149] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:46:41,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:46:41,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-26 10:46:41,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052183034] [2023-11-26 10:46:41,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:46:41,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:46:41,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:46:41,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:46:41,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:46:41,895 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 66 [2023-11-26 10:46:41,895 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 57 transitions, 126 flow. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:41,895 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:46:41,896 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 66 [2023-11-26 10:46:41,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:46:42,906 INFO L124 PetriNetUnfolderBase]: 3311/5478 cut-off events. [2023-11-26 10:46:42,907 INFO L125 PetriNetUnfolderBase]: For 144/144 co-relation queries the response was YES. [2023-11-26 10:46:42,921 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10300 conditions, 5478 events. 3311/5478 cut-off events. For 144/144 co-relation queries the response was YES. Maximal size of possible extension queue 320. Compared 39077 event pairs, 593 based on Foata normal form. 0/5400 useless extension candidates. Maximal degree in co-relation 10289. Up to 3661 conditions per place. [2023-11-26 10:46:42,957 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 41 selfloop transitions, 2 changer transitions 2/76 dead transitions. [2023-11-26 10:46:42,958 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 76 transitions, 262 flow [2023-11-26 10:46:42,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:46:42,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 10:46:42,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 157 transitions. [2023-11-26 10:46:42,963 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7929292929292929 [2023-11-26 10:46:42,963 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 157 transitions. [2023-11-26 10:46:42,963 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 157 transitions. [2023-11-26 10:46:42,963 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:46:42,963 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 157 transitions. [2023-11-26 10:46:42,965 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:42,967 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:42,968 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:42,968 INFO L175 Difference]: Start difference. First operand has 68 places, 57 transitions, 126 flow. Second operand 3 states and 157 transitions. [2023-11-26 10:46:42,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 76 transitions, 262 flow [2023-11-26 10:46:42,971 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 76 transitions, 256 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 10:46:42,974 INFO L231 Difference]: Finished difference. Result has 67 places, 55 transitions, 122 flow [2023-11-26 10:46:42,974 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=122, PETRI_PLACES=67, PETRI_TRANSITIONS=55} [2023-11-26 10:46:42,976 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -6 predicate places. [2023-11-26 10:46:42,976 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 55 transitions, 122 flow [2023-11-26 10:46:42,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:42,977 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:46:42,977 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-26 10:46:42,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-26 10:46:42,977 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-26 10:46:42,979 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:46:42,979 INFO L85 PathProgramCache]: Analyzing trace with hash 422847131, now seen corresponding path program 1 times [2023-11-26 10:46:42,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:46:42,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433094117] [2023-11-26 10:46:42,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:46:42,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:46:43,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:46:43,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:46:43,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:46:43,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433094117] [2023-11-26 10:46:43,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433094117] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:46:43,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:46:43,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 10:46:43,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077599772] [2023-11-26 10:46:43,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:46:43,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:46:43,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:46:43,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:46:43,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:46:43,094 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 66 [2023-11-26 10:46:43,095 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 55 transitions, 122 flow. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:43,095 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:46:43,095 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 66 [2023-11-26 10:46:43,095 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:46:44,064 INFO L124 PetriNetUnfolderBase]: 2906/5175 cut-off events. [2023-11-26 10:46:44,065 INFO L125 PetriNetUnfolderBase]: For 279/279 co-relation queries the response was YES. [2023-11-26 10:46:44,078 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9587 conditions, 5175 events. 2906/5175 cut-off events. For 279/279 co-relation queries the response was YES. Maximal size of possible extension queue 299. Compared 37793 event pairs, 1880 based on Foata normal form. 0/4923 useless extension candidates. Maximal degree in co-relation 9576. Up to 3466 conditions per place. [2023-11-26 10:46:44,115 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 33 selfloop transitions, 2 changer transitions 0/64 dead transitions. [2023-11-26 10:46:44,115 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 64 transitions, 212 flow [2023-11-26 10:46:44,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:46:44,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 10:46:44,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 141 transitions. [2023-11-26 10:46:44,121 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7121212121212122 [2023-11-26 10:46:44,121 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 141 transitions. [2023-11-26 10:46:44,121 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 141 transitions. [2023-11-26 10:46:44,122 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:46:44,122 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 141 transitions. [2023-11-26 10:46:44,123 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:44,125 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:44,125 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:44,126 INFO L175 Difference]: Start difference. First operand has 67 places, 55 transitions, 122 flow. Second operand 3 states and 141 transitions. [2023-11-26 10:46:44,126 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 64 transitions, 212 flow [2023-11-26 10:46:44,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 64 transitions, 206 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 10:46:44,130 INFO L231 Difference]: Finished difference. Result has 65 places, 54 transitions, 120 flow [2023-11-26 10:46:44,130 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=120, PETRI_PLACES=65, PETRI_TRANSITIONS=54} [2023-11-26 10:46:44,132 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -8 predicate places. [2023-11-26 10:46:44,132 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 54 transitions, 120 flow [2023-11-26 10:46:44,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:44,133 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:46:44,133 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-26 10:46:44,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-26 10:46:44,134 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-26 10:46:44,136 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:46:44,136 INFO L85 PathProgramCache]: Analyzing trace with hash 422847132, now seen corresponding path program 1 times [2023-11-26 10:46:44,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:46:44,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135379154] [2023-11-26 10:46:44,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:46:44,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:46:44,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:46:44,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:46:44,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:46:44,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135379154] [2023-11-26 10:46:44,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135379154] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:46:44,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:46:44,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 10:46:44,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975848983] [2023-11-26 10:46:44,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:46:44,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:46:44,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:46:44,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:46:44,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:46:44,295 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 66 [2023-11-26 10:46:44,295 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 54 transitions, 120 flow. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:44,296 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:46:44,296 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 66 [2023-11-26 10:46:44,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:46:45,314 INFO L124 PetriNetUnfolderBase]: 2903/5168 cut-off events. [2023-11-26 10:46:45,314 INFO L125 PetriNetUnfolderBase]: For 147/147 co-relation queries the response was YES. [2023-11-26 10:46:45,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9441 conditions, 5168 events. 2903/5168 cut-off events. For 147/147 co-relation queries the response was YES. Maximal size of possible extension queue 299. Compared 37655 event pairs, 1880 based on Foata normal form. 4/4920 useless extension candidates. Maximal degree in co-relation 9431. Up to 3459 conditions per place. [2023-11-26 10:46:45,359 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 32 selfloop transitions, 2 changer transitions 0/63 dead transitions. [2023-11-26 10:46:45,360 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 63 transitions, 206 flow [2023-11-26 10:46:45,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:46:45,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 10:46:45,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 143 transitions. [2023-11-26 10:46:45,363 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7222222222222222 [2023-11-26 10:46:45,364 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 143 transitions. [2023-11-26 10:46:45,364 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 143 transitions. [2023-11-26 10:46:45,364 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:46:45,364 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 143 transitions. [2023-11-26 10:46:45,365 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:45,365 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:45,366 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:45,366 INFO L175 Difference]: Start difference. First operand has 65 places, 54 transitions, 120 flow. Second operand 3 states and 143 transitions. [2023-11-26 10:46:45,366 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 63 transitions, 206 flow [2023-11-26 10:46:45,369 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 63 transitions, 202 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 10:46:45,370 INFO L231 Difference]: Finished difference. Result has 64 places, 53 transitions, 118 flow [2023-11-26 10:46:45,371 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=118, PETRI_PLACES=64, PETRI_TRANSITIONS=53} [2023-11-26 10:46:45,371 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -9 predicate places. [2023-11-26 10:46:45,372 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 53 transitions, 118 flow [2023-11-26 10:46:45,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:45,372 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:46:45,372 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:46:45,372 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-26 10:46:45,372 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-26 10:46:45,373 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:46:45,373 INFO L85 PathProgramCache]: Analyzing trace with hash -99761962, now seen corresponding path program 1 times [2023-11-26 10:46:45,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:46:45,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668271374] [2023-11-26 10:46:45,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:46:45,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:46:45,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:46:45,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:46:45,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:46:45,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668271374] [2023-11-26 10:46:45,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668271374] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:46:45,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:46:45,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 10:46:45,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905925110] [2023-11-26 10:46:45,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:46:45,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:46:45,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:46:45,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:46:45,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:46:45,445 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 66 [2023-11-26 10:46:45,445 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 53 transitions, 118 flow. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:45,446 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:46:45,446 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 66 [2023-11-26 10:46:45,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:46:46,300 INFO L124 PetriNetUnfolderBase]: 2920/5121 cut-off events. [2023-11-26 10:46:46,300 INFO L125 PetriNetUnfolderBase]: For 147/147 co-relation queries the response was YES. [2023-11-26 10:46:46,318 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9423 conditions, 5121 events. 2920/5121 cut-off events. For 147/147 co-relation queries the response was YES. Maximal size of possible extension queue 298. Compared 36967 event pairs, 1892 based on Foata normal form. 0/4891 useless extension candidates. Maximal degree in co-relation 9413. Up to 3460 conditions per place. [2023-11-26 10:46:46,351 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 33 selfloop transitions, 2 changer transitions 0/62 dead transitions. [2023-11-26 10:46:46,351 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 62 transitions, 206 flow [2023-11-26 10:46:46,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:46:46,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 10:46:46,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 141 transitions. [2023-11-26 10:46:46,353 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7121212121212122 [2023-11-26 10:46:46,353 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 141 transitions. [2023-11-26 10:46:46,353 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 141 transitions. [2023-11-26 10:46:46,354 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:46:46,354 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 141 transitions. [2023-11-26 10:46:46,354 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:46,355 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:46,356 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:46,356 INFO L175 Difference]: Start difference. First operand has 64 places, 53 transitions, 118 flow. Second operand 3 states and 141 transitions. [2023-11-26 10:46:46,356 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 62 transitions, 206 flow [2023-11-26 10:46:46,359 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 62 transitions, 202 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 10:46:46,360 INFO L231 Difference]: Finished difference. Result has 63 places, 52 transitions, 116 flow [2023-11-26 10:46:46,361 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=116, PETRI_PLACES=63, PETRI_TRANSITIONS=52} [2023-11-26 10:46:46,364 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -10 predicate places. [2023-11-26 10:46:46,365 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 52 transitions, 116 flow [2023-11-26 10:46:46,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:46,365 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:46:46,365 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:46:46,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-26 10:46:46,366 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-26 10:46:46,367 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:46:46,367 INFO L85 PathProgramCache]: Analyzing trace with hash -99761961, now seen corresponding path program 1 times [2023-11-26 10:46:46,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:46:46,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946537352] [2023-11-26 10:46:46,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:46:46,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:46:46,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:46:46,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:46:46,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:46:46,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946537352] [2023-11-26 10:46:46,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946537352] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:46:46,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:46:46,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 10:46:46,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717652322] [2023-11-26 10:46:46,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:46:46,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:46:46,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:46:46,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:46:46,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:46:46,470 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 66 [2023-11-26 10:46:46,470 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 52 transitions, 116 flow. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:46,470 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:46:46,471 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 66 [2023-11-26 10:46:46,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:46:47,233 INFO L124 PetriNetUnfolderBase]: 2903/5092 cut-off events. [2023-11-26 10:46:47,234 INFO L125 PetriNetUnfolderBase]: For 152/152 co-relation queries the response was YES. [2023-11-26 10:46:47,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9373 conditions, 5092 events. 2903/5092 cut-off events. For 152/152 co-relation queries the response was YES. Maximal size of possible extension queue 298. Compared 36674 event pairs, 1884 based on Foata normal form. 12/4886 useless extension candidates. Maximal degree in co-relation 9363. Up to 3431 conditions per place. [2023-11-26 10:46:47,278 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 32 selfloop transitions, 2 changer transitions 0/61 dead transitions. [2023-11-26 10:46:47,278 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 61 transitions, 202 flow [2023-11-26 10:46:47,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:46:47,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 10:46:47,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 143 transitions. [2023-11-26 10:46:47,284 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7222222222222222 [2023-11-26 10:46:47,284 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 143 transitions. [2023-11-26 10:46:47,284 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 143 transitions. [2023-11-26 10:46:47,284 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:46:47,285 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 143 transitions. [2023-11-26 10:46:47,285 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:47,286 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:47,287 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:47,288 INFO L175 Difference]: Start difference. First operand has 63 places, 52 transitions, 116 flow. Second operand 3 states and 143 transitions. [2023-11-26 10:46:47,288 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 61 transitions, 202 flow [2023-11-26 10:46:47,290 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 61 transitions, 198 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 10:46:47,292 INFO L231 Difference]: Finished difference. Result has 62 places, 51 transitions, 114 flow [2023-11-26 10:46:47,292 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=114, PETRI_PLACES=62, PETRI_TRANSITIONS=51} [2023-11-26 10:46:47,293 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -11 predicate places. [2023-11-26 10:46:47,294 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 51 transitions, 114 flow [2023-11-26 10:46:47,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:47,294 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:46:47,294 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:46:47,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-26 10:46:47,295 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-26 10:46:47,295 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:46:47,295 INFO L85 PathProgramCache]: Analyzing trace with hash 109193433, now seen corresponding path program 1 times [2023-11-26 10:46:47,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:46:47,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703050395] [2023-11-26 10:46:47,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:46:47,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:46:47,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:46:47,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:46:47,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:46:47,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703050395] [2023-11-26 10:46:47,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703050395] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:46:47,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:46:47,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 10:46:47,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742785921] [2023-11-26 10:46:47,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:46:47,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:46:47,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:46:47,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:46:47,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:46:47,379 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 66 [2023-11-26 10:46:47,379 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 51 transitions, 114 flow. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:47,380 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:46:47,380 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 66 [2023-11-26 10:46:47,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:46:48,186 INFO L124 PetriNetUnfolderBase]: 2978/5123 cut-off events. [2023-11-26 10:46:48,186 INFO L125 PetriNetUnfolderBase]: For 152/152 co-relation queries the response was YES. [2023-11-26 10:46:48,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9515 conditions, 5123 events. 2978/5123 cut-off events. For 152/152 co-relation queries the response was YES. Maximal size of possible extension queue 296. Compared 36271 event pairs, 1424 based on Foata normal form. 0/4969 useless extension candidates. Maximal degree in co-relation 9505. Up to 3426 conditions per place. [2023-11-26 10:46:48,224 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 33 selfloop transitions, 2 changer transitions 0/60 dead transitions. [2023-11-26 10:46:48,224 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 60 transitions, 202 flow [2023-11-26 10:46:48,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:46:48,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 10:46:48,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 141 transitions. [2023-11-26 10:46:48,226 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7121212121212122 [2023-11-26 10:46:48,226 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 141 transitions. [2023-11-26 10:46:48,226 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 141 transitions. [2023-11-26 10:46:48,226 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:46:48,226 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 141 transitions. [2023-11-26 10:46:48,227 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:48,228 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:48,228 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:48,228 INFO L175 Difference]: Start difference. First operand has 62 places, 51 transitions, 114 flow. Second operand 3 states and 141 transitions. [2023-11-26 10:46:48,228 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 60 transitions, 202 flow [2023-11-26 10:46:48,230 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 60 transitions, 198 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 10:46:48,234 INFO L231 Difference]: Finished difference. Result has 61 places, 50 transitions, 112 flow [2023-11-26 10:46:48,234 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=112, PETRI_PLACES=61, PETRI_TRANSITIONS=50} [2023-11-26 10:46:48,236 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -12 predicate places. [2023-11-26 10:46:48,237 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 50 transitions, 112 flow [2023-11-26 10:46:48,237 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:48,237 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:46:48,237 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:46:48,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-26 10:46:48,238 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-26 10:46:48,238 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:46:48,238 INFO L85 PathProgramCache]: Analyzing trace with hash 109193434, now seen corresponding path program 1 times [2023-11-26 10:46:48,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:46:48,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676521957] [2023-11-26 10:46:48,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:46:48,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:46:48,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:46:48,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:46:48,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:46:48,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676521957] [2023-11-26 10:46:48,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676521957] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:46:48,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:46:48,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 10:46:48,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331465352] [2023-11-26 10:46:48,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:46:48,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:46:48,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:46:48,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:46:48,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:46:48,381 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 66 [2023-11-26 10:46:48,381 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 50 transitions, 112 flow. Second operand has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:48,381 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:46:48,382 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 66 [2023-11-26 10:46:48,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:46:49,095 INFO L124 PetriNetUnfolderBase]: 2903/5072 cut-off events. [2023-11-26 10:46:49,095 INFO L125 PetriNetUnfolderBase]: For 168/168 co-relation queries the response was YES. [2023-11-26 10:46:49,108 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9377 conditions, 5072 events. 2903/5072 cut-off events. For 168/168 co-relation queries the response was YES. Maximal size of possible extension queue 297. Compared 36428 event pairs, 920 based on Foata normal form. 36/4974 useless extension candidates. Maximal degree in co-relation 9367. Up to 3315 conditions per place. [2023-11-26 10:46:49,137 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 32 selfloop transitions, 2 changer transitions 0/59 dead transitions. [2023-11-26 10:46:49,137 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 59 transitions, 198 flow [2023-11-26 10:46:49,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:46:49,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 10:46:49,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 143 transitions. [2023-11-26 10:46:49,139 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7222222222222222 [2023-11-26 10:46:49,139 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 143 transitions. [2023-11-26 10:46:49,139 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 143 transitions. [2023-11-26 10:46:49,139 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:46:49,139 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 143 transitions. [2023-11-26 10:46:49,140 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:49,141 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:49,141 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:49,141 INFO L175 Difference]: Start difference. First operand has 61 places, 50 transitions, 112 flow. Second operand 3 states and 143 transitions. [2023-11-26 10:46:49,141 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 59 transitions, 198 flow [2023-11-26 10:46:49,143 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 59 transitions, 194 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 10:46:49,144 INFO L231 Difference]: Finished difference. Result has 60 places, 49 transitions, 110 flow [2023-11-26 10:46:49,144 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=110, PETRI_PLACES=60, PETRI_TRANSITIONS=49} [2023-11-26 10:46:49,145 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -13 predicate places. [2023-11-26 10:46:49,146 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 49 transitions, 110 flow [2023-11-26 10:46:49,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:49,146 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:46:49,146 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:46:49,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-26 10:46:49,147 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-26 10:46:49,147 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:46:49,147 INFO L85 PathProgramCache]: Analyzing trace with hash -591535221, now seen corresponding path program 1 times [2023-11-26 10:46:49,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:46:49,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755203593] [2023-11-26 10:46:49,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:46:49,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:46:49,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:46:50,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:46:50,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:46:50,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755203593] [2023-11-26 10:46:50,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755203593] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:46:50,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:46:50,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-26 10:46:50,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561556153] [2023-11-26 10:46:50,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:46:50,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-26 10:46:50,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:46:50,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-26 10:46:50,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-11-26 10:46:50,305 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 66 [2023-11-26 10:46:50,306 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 49 transitions, 110 flow. Second operand has 9 states, 9 states have (on average 32.77777777777778) internal successors, (295), 9 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:50,306 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:46:50,306 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 66 [2023-11-26 10:46:50,306 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:46:51,322 INFO L124 PetriNetUnfolderBase]: 2920/4939 cut-off events. [2023-11-26 10:46:51,323 INFO L125 PetriNetUnfolderBase]: For 168/168 co-relation queries the response was YES. [2023-11-26 10:46:51,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9274 conditions, 4939 events. 2920/4939 cut-off events. For 168/168 co-relation queries the response was YES. Maximal size of possible extension queue 291. Compared 34245 event pairs, 546 based on Foata normal form. 144/4969 useless extension candidates. Maximal degree in co-relation 9263. Up to 3315 conditions per place. [2023-11-26 10:46:51,358 INFO L140 encePairwiseOnDemand]: 60/66 looper letters, 36 selfloop transitions, 4 changer transitions 11/73 dead transitions. [2023-11-26 10:46:51,359 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 73 transitions, 260 flow [2023-11-26 10:46:51,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-26 10:46:51,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-26 10:46:51,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 269 transitions. [2023-11-26 10:46:51,361 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5822510822510822 [2023-11-26 10:46:51,361 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 269 transitions. [2023-11-26 10:46:51,361 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 269 transitions. [2023-11-26 10:46:51,362 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:46:51,362 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 269 transitions. [2023-11-26 10:46:51,363 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 38.42857142857143) internal successors, (269), 7 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:51,364 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 66.0) internal successors, (528), 8 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:51,364 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 66.0) internal successors, (528), 8 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:51,365 INFO L175 Difference]: Start difference. First operand has 60 places, 49 transitions, 110 flow. Second operand 7 states and 269 transitions. [2023-11-26 10:46:51,365 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 73 transitions, 260 flow [2023-11-26 10:46:51,366 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 73 transitions, 256 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 10:46:51,367 INFO L231 Difference]: Finished difference. Result has 63 places, 47 transitions, 110 flow [2023-11-26 10:46:51,368 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=110, PETRI_PLACES=63, PETRI_TRANSITIONS=47} [2023-11-26 10:46:51,368 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -10 predicate places. [2023-11-26 10:46:51,369 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 47 transitions, 110 flow [2023-11-26 10:46:51,369 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 32.77777777777778) internal successors, (295), 9 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:51,369 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:46:51,369 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:46:51,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-26 10:46:51,370 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-26 10:46:51,370 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:46:51,370 INFO L85 PathProgramCache]: Analyzing trace with hash -591533723, now seen corresponding path program 1 times [2023-11-26 10:46:51,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:46:51,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458197578] [2023-11-26 10:46:51,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:46:51,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:46:51,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:46:51,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:46:51,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:46:51,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458197578] [2023-11-26 10:46:51,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458197578] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:46:51,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:46:51,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-26 10:46:51,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068032916] [2023-11-26 10:46:51,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:46:51,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-26 10:46:51,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:46:51,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-26 10:46:51,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-26 10:46:51,652 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 66 [2023-11-26 10:46:51,653 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 47 transitions, 110 flow. Second operand has 5 states, 5 states have (on average 32.8) internal successors, (164), 5 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:51,653 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:46:51,653 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 66 [2023-11-26 10:46:51,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:46:56,200 INFO L124 PetriNetUnfolderBase]: 27273/39373 cut-off events. [2023-11-26 10:46:56,200 INFO L125 PetriNetUnfolderBase]: For 154/154 co-relation queries the response was YES. [2023-11-26 10:46:56,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76590 conditions, 39373 events. 27273/39373 cut-off events. For 154/154 co-relation queries the response was YES. Maximal size of possible extension queue 1840. Compared 283561 event pairs, 6785 based on Foata normal form. 0/38397 useless extension candidates. Maximal degree in co-relation 76579. Up to 15294 conditions per place. [2023-11-26 10:46:56,397 INFO L140 encePairwiseOnDemand]: 55/66 looper letters, 48 selfloop transitions, 7 changer transitions 96/168 dead transitions. [2023-11-26 10:46:56,397 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 168 transitions, 666 flow [2023-11-26 10:46:56,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-26 10:46:56,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-26 10:46:56,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 423 transitions. [2023-11-26 10:46:56,400 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7121212121212122 [2023-11-26 10:46:56,401 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 423 transitions. [2023-11-26 10:46:56,401 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 423 transitions. [2023-11-26 10:46:56,401 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:46:56,402 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 423 transitions. [2023-11-26 10:46:56,403 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 47.0) internal successors, (423), 9 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:56,405 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 66.0) internal successors, (660), 10 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:56,405 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 66.0) internal successors, (660), 10 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:56,406 INFO L175 Difference]: Start difference. First operand has 63 places, 47 transitions, 110 flow. Second operand 9 states and 423 transitions. [2023-11-26 10:46:56,406 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 168 transitions, 666 flow [2023-11-26 10:46:56,408 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 168 transitions, 654 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-26 10:46:56,410 INFO L231 Difference]: Finished difference. Result has 73 places, 52 transitions, 199 flow [2023-11-26 10:46:56,410 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=199, PETRI_PLACES=73, PETRI_TRANSITIONS=52} [2023-11-26 10:46:56,411 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, 0 predicate places. [2023-11-26 10:46:56,411 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 52 transitions, 199 flow [2023-11-26 10:46:56,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.8) internal successors, (164), 5 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:56,412 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:46:56,412 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:46:56,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-26 10:46:56,412 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-26 10:46:56,413 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:46:56,413 INFO L85 PathProgramCache]: Analyzing trace with hash 878477508, now seen corresponding path program 1 times [2023-11-26 10:46:56,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:46:56,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812025792] [2023-11-26 10:46:56,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:46:56,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:46:56,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:46:56,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:46:56,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:46:56,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812025792] [2023-11-26 10:46:56,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812025792] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:46:56,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:46:56,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-26 10:46:56,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728478495] [2023-11-26 10:46:56,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:46:56,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-26 10:46:56,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:46:56,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-26 10:46:56,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-26 10:46:56,670 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 66 [2023-11-26 10:46:56,670 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 52 transitions, 199 flow. Second operand has 5 states, 5 states have (on average 36.8) internal successors, (184), 5 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:56,671 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:46:56,671 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 66 [2023-11-26 10:46:56,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:46:59,881 INFO L124 PetriNetUnfolderBase]: 14561/23105 cut-off events. [2023-11-26 10:46:59,881 INFO L125 PetriNetUnfolderBase]: For 17204/18241 co-relation queries the response was YES. [2023-11-26 10:46:59,965 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59592 conditions, 23105 events. 14561/23105 cut-off events. For 17204/18241 co-relation queries the response was YES. Maximal size of possible extension queue 1207. Compared 181431 event pairs, 3780 based on Foata normal form. 781/23013 useless extension candidates. Maximal degree in co-relation 59573. Up to 12061 conditions per place. [2023-11-26 10:47:00,100 INFO L140 encePairwiseOnDemand]: 61/66 looper letters, 34 selfloop transitions, 3 changer transitions 43/105 dead transitions. [2023-11-26 10:47:00,100 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 105 transitions, 523 flow [2023-11-26 10:47:00,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-26 10:47:00,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-26 10:47:00,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 314 transitions. [2023-11-26 10:47:00,104 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6796536796536796 [2023-11-26 10:47:00,105 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 314 transitions. [2023-11-26 10:47:00,105 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 314 transitions. [2023-11-26 10:47:00,105 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:47:00,106 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 314 transitions. [2023-11-26 10:47:00,108 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 44.857142857142854) internal successors, (314), 7 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:47:00,111 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 66.0) internal successors, (528), 8 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:47:00,112 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 66.0) internal successors, (528), 8 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:47:00,112 INFO L175 Difference]: Start difference. First operand has 73 places, 52 transitions, 199 flow. Second operand 7 states and 314 transitions. [2023-11-26 10:47:00,112 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 105 transitions, 523 flow [2023-11-26 10:47:00,378 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 105 transitions, 473 flow, removed 14 selfloop flow, removed 4 redundant places. [2023-11-26 10:47:00,381 INFO L231 Difference]: Finished difference. Result has 73 places, 52 transitions, 188 flow [2023-11-26 10:47:00,381 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=169, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=188, PETRI_PLACES=73, PETRI_TRANSITIONS=52} [2023-11-26 10:47:00,382 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, 0 predicate places. [2023-11-26 10:47:00,382 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 52 transitions, 188 flow [2023-11-26 10:47:00,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 36.8) internal successors, (184), 5 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:47:00,383 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:47:00,383 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:47:00,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-26 10:47:00,383 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-26 10:47:00,384 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:47:00,384 INFO L85 PathProgramCache]: Analyzing trace with hash 429804698, now seen corresponding path program 1 times [2023-11-26 10:47:00,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:47:00,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859493545] [2023-11-26 10:47:00,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:47:00,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:47:00,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:47:00,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:47:00,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:47:00,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859493545] [2023-11-26 10:47:00,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859493545] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:47:00,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:47:00,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-26 10:47:00,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903532725] [2023-11-26 10:47:00,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:47:00,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-26 10:47:00,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:47:00,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-26 10:47:00,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-26 10:47:00,851 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 66 [2023-11-26 10:47:00,851 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 52 transitions, 188 flow. Second operand has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:47:00,851 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:47:00,851 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 66 [2023-11-26 10:47:00,852 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:47:05,742 INFO L124 PetriNetUnfolderBase]: 28197/41976 cut-off events. [2023-11-26 10:47:05,742 INFO L125 PetriNetUnfolderBase]: For 20803/26436 co-relation queries the response was YES. [2023-11-26 10:47:05,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97127 conditions, 41976 events. 28197/41976 cut-off events. For 20803/26436 co-relation queries the response was YES. Maximal size of possible extension queue 1750. Compared 306947 event pairs, 4604 based on Foata normal form. 1727/42387 useless extension candidates. Maximal degree in co-relation 97105. Up to 22862 conditions per place. [2023-11-26 10:47:06,018 INFO L140 encePairwiseOnDemand]: 59/66 looper letters, 57 selfloop transitions, 6 changer transitions 0/86 dead transitions. [2023-11-26 10:47:06,018 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 86 transitions, 405 flow [2023-11-26 10:47:06,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-26 10:47:06,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-26 10:47:06,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 190 transitions. [2023-11-26 10:47:06,020 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7196969696969697 [2023-11-26 10:47:06,020 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 190 transitions. [2023-11-26 10:47:06,020 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 190 transitions. [2023-11-26 10:47:06,021 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:47:06,021 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 190 transitions. [2023-11-26 10:47:06,022 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 47.5) internal successors, (190), 4 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:47:06,024 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 66.0) internal successors, (330), 5 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:47:06,024 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 66.0) internal successors, (330), 5 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:47:06,024 INFO L175 Difference]: Start difference. First operand has 73 places, 52 transitions, 188 flow. Second operand 4 states and 190 transitions. [2023-11-26 10:47:06,024 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 86 transitions, 405 flow [2023-11-26 10:47:06,295 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 86 transitions, 387 flow, removed 6 selfloop flow, removed 8 redundant places. [2023-11-26 10:47:06,297 INFO L231 Difference]: Finished difference. Result has 66 places, 57 transitions, 216 flow [2023-11-26 10:47:06,297 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=216, PETRI_PLACES=66, PETRI_TRANSITIONS=57} [2023-11-26 10:47:06,298 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -7 predicate places. [2023-11-26 10:47:06,298 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 57 transitions, 216 flow [2023-11-26 10:47:06,298 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:47:06,298 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:47:06,299 INFO L208 CegarLoopForPetriNet]: trace histogram [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] [2023-11-26 10:47:06,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-26 10:47:06,299 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-26 10:47:06,299 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:47:06,300 INFO L85 PathProgramCache]: Analyzing trace with hash 67933092, now seen corresponding path program 1 times [2023-11-26 10:47:06,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:47:06,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777310020] [2023-11-26 10:47:06,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:47:06,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:47:06,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:47:06,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:47:06,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:47:06,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777310020] [2023-11-26 10:47:06,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777310020] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:47:06,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:47:06,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-26 10:47:06,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46650219] [2023-11-26 10:47:06,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:47:06,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-26 10:47:06,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:47:06,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-26 10:47:06,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-26 10:47:06,532 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 66 [2023-11-26 10:47:06,533 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 57 transitions, 216 flow. Second operand has 5 states, 5 states have (on average 35.4) internal successors, (177), 5 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:47:06,533 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:47:06,533 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 66 [2023-11-26 10:47:06,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:47:10,436 INFO L124 PetriNetUnfolderBase]: 22470/33603 cut-off events. [2023-11-26 10:47:10,436 INFO L125 PetriNetUnfolderBase]: For 17177/21745 co-relation queries the response was YES. [2023-11-26 10:47:10,521 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85606 conditions, 33603 events. 22470/33603 cut-off events. For 17177/21745 co-relation queries the response was YES. Maximal size of possible extension queue 1369. Compared 237691 event pairs, 2818 based on Foata normal form. 1502/34069 useless extension candidates. Maximal degree in co-relation 85588. Up to 12185 conditions per place. [2023-11-26 10:47:10,632 INFO L140 encePairwiseOnDemand]: 59/66 looper letters, 74 selfloop transitions, 10 changer transitions 0/107 dead transitions. [2023-11-26 10:47:10,632 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 107 transitions, 539 flow [2023-11-26 10:47:10,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-26 10:47:10,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-26 10:47:10,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 242 transitions. [2023-11-26 10:47:10,634 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7333333333333333 [2023-11-26 10:47:10,634 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 242 transitions. [2023-11-26 10:47:10,635 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 242 transitions. [2023-11-26 10:47:10,635 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:47:10,635 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 242 transitions. [2023-11-26 10:47:10,636 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 48.4) internal successors, (242), 5 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:47:10,640 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 66.0) internal successors, (396), 6 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:47:10,640 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 66.0) internal successors, (396), 6 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:47:10,640 INFO L175 Difference]: Start difference. First operand has 66 places, 57 transitions, 216 flow. Second operand 5 states and 242 transitions. [2023-11-26 10:47:10,641 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 107 transitions, 539 flow [2023-11-26 10:47:10,645 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 107 transitions, 536 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-26 10:47:10,651 INFO L231 Difference]: Finished difference. Result has 71 places, 62 transitions, 281 flow [2023-11-26 10:47:10,651 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=281, PETRI_PLACES=71, PETRI_TRANSITIONS=62} [2023-11-26 10:47:10,652 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -2 predicate places. [2023-11-26 10:47:10,653 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 62 transitions, 281 flow [2023-11-26 10:47:10,653 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 35.4) internal successors, (177), 5 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:47:10,653 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:47:10,653 INFO L208 CegarLoopForPetriNet]: trace histogram [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] [2023-11-26 10:47:10,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-26 10:47:10,654 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-26 10:47:10,654 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:47:10,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1897256495, now seen corresponding path program 1 times [2023-11-26 10:47:10,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:47:10,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124883071] [2023-11-26 10:47:10,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:47:10,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:47:10,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:47:11,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:47:11,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:47:11,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124883071] [2023-11-26 10:47:11,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124883071] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:47:11,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:47:11,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-26 10:47:11,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565805252] [2023-11-26 10:47:11,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:47:11,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-26 10:47:11,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:47:11,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-26 10:47:11,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-11-26 10:47:11,622 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 66 [2023-11-26 10:47:11,624 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 62 transitions, 281 flow. Second operand has 8 states, 8 states have (on average 32.625) internal successors, (261), 8 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:47:11,624 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:47:11,624 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 66 [2023-11-26 10:47:11,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:47:18,279 INFO L124 PetriNetUnfolderBase]: 31598/49003 cut-off events. [2023-11-26 10:47:18,280 INFO L125 PetriNetUnfolderBase]: For 51432/61463 co-relation queries the response was YES. [2023-11-26 10:47:18,431 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136712 conditions, 49003 events. 31598/49003 cut-off events. For 51432/61463 co-relation queries the response was YES. Maximal size of possible extension queue 2458. Compared 401542 event pairs, 3581 based on Foata normal form. 902/46676 useless extension candidates. Maximal degree in co-relation 136691. Up to 12992 conditions per place. [2023-11-26 10:47:18,627 INFO L140 encePairwiseOnDemand]: 51/66 looper letters, 171 selfloop transitions, 48 changer transitions 18/264 dead transitions. [2023-11-26 10:47:18,627 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 264 transitions, 1464 flow [2023-11-26 10:47:18,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-26 10:47:18,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2023-11-26 10:47:18,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 686 transitions. [2023-11-26 10:47:18,631 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.692929292929293 [2023-11-26 10:47:18,631 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 686 transitions. [2023-11-26 10:47:18,631 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 686 transitions. [2023-11-26 10:47:18,632 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:47:18,632 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 686 transitions. [2023-11-26 10:47:18,635 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 45.733333333333334) internal successors, (686), 15 states have internal predecessors, (686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:47:18,638 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 66.0) internal successors, (1056), 16 states have internal predecessors, (1056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:47:18,638 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 66.0) internal successors, (1056), 16 states have internal predecessors, (1056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:47:18,638 INFO L175 Difference]: Start difference. First operand has 71 places, 62 transitions, 281 flow. Second operand 15 states and 686 transitions. [2023-11-26 10:47:18,638 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 264 transitions, 1464 flow [2023-11-26 10:47:18,654 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 264 transitions, 1449 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-11-26 10:47:18,658 INFO L231 Difference]: Finished difference. Result has 96 places, 104 transitions, 682 flow [2023-11-26 10:47:18,658 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=682, PETRI_PLACES=96, PETRI_TRANSITIONS=104} [2023-11-26 10:47:18,659 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, 23 predicate places. [2023-11-26 10:47:18,659 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 104 transitions, 682 flow [2023-11-26 10:47:18,659 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 32.625) internal successors, (261), 8 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:47:18,660 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:47:18,660 INFO L208 CegarLoopForPetriNet]: trace histogram [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] [2023-11-26 10:47:18,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-26 10:47:18,660 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-26 10:47:18,661 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:47:18,661 INFO L85 PathProgramCache]: Analyzing trace with hash -1579252785, now seen corresponding path program 2 times [2023-11-26 10:47:18,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:47:18,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928075615] [2023-11-26 10:47:18,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:47:18,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:47:18,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:47:19,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:47:19,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:47:19,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928075615] [2023-11-26 10:47:19,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928075615] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:47:19,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:47:19,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 10:47:19,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059901301] [2023-11-26 10:47:19,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:47:19,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 10:47:19,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:47:19,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 10:47:19,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-26 10:47:19,164 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 66 [2023-11-26 10:47:19,165 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 104 transitions, 682 flow. Second operand has 6 states, 6 states have (on average 35.333333333333336) internal successors, (212), 6 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:47:19,165 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:47:19,165 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 66 [2023-11-26 10:47:19,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:47:21,507 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([465] L826-->L842: Formula: (let ((.cse11 (= (mod v_~a$r_buff1_thd4~0_64 256) 0)) (.cse4 (= (mod v_~a$r_buff0_thd4~0_66 256) 0))) (let ((.cse6 (not .cse4)) (.cse2 (and .cse11 .cse4)) (.cse7 (and (= (mod v_~a$w_buff1_used~0_127 256) 0) .cse4)) (.cse12 (= (mod v_~a$w_buff0_used~0_134 256) 0))) (let ((.cse8 (or .cse2 .cse7 .cse12)) (.cse9 (and (not .cse12) .cse6))) (let ((.cse1 (ite .cse8 v_~a~0_78 (ite .cse9 v_~a$w_buff0~0_49 v_~a$w_buff1~0_42))) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse3 (= (mod v_~a$w_buff1_used~0_126 256) 0)) (.cse5 (= (mod v_~a$w_buff0_used~0_133 256) 0))) (and (= v_~a~0_78 v_~a$mem_tmp~0_20) (= v_~a$flush_delayed~0_27 0) (= v_~a~0_76 (ite .cse0 v_~a$mem_tmp~0_20 .cse1)) (= v_~a$r_buff0_thd4~0_65 (ite .cse0 v_~a$r_buff0_thd4~0_66 (ite (or .cse2 (and .cse3 .cse4) .cse5) v_~a$r_buff0_thd4~0_66 (ite (and (not .cse5) .cse6) 0 v_~a$r_buff0_thd4~0_66)))) (= .cse1 v_~__unbuffered_p3_EBX~0_12) (= (ite .cse0 v_~a$w_buff1_used~0_127 (ite (or .cse2 .cse7 .cse5) v_~a$w_buff1_used~0_127 0)) v_~a$w_buff1_used~0_126) (= v_~a$w_buff1~0_42 v_~a$w_buff1~0_41) (= (ite .cse0 v_~a$w_buff0_used~0_134 (ite .cse8 v_~a$w_buff0_used~0_134 (ite .cse9 0 v_~a$w_buff0_used~0_134))) v_~a$w_buff0_used~0_133) (= v_~a$w_buff0~0_49 v_~a$w_buff0~0_48) (= (ite .cse0 v_~a$r_buff1_thd4~0_64 (ite (let ((.cse10 (= (mod v_~a$r_buff0_thd4~0_65 256) 0))) (or (and .cse3 .cse10) (and .cse11 .cse10) .cse5)) v_~a$r_buff1_thd4~0_64 0)) v_~a$r_buff1_thd4~0_63)))))) InVars {~a~0=v_~a~0_78, ~a$w_buff1~0=v_~a$w_buff1~0_42, ~a$w_buff0~0=v_~a$w_buff0~0_49, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_64, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_134, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_127, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_66} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_63, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_133, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_12, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_65, P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~a~0=v_~a~0_76, ~a$mem_tmp~0=v_~a$mem_tmp~0_20, ~weak$$choice0~0=v_~weak$$choice0~0_13, ~a$w_buff1~0=v_~a$w_buff1~0_41, ~a$flush_delayed~0=v_~a$flush_delayed~0_27, ~a$w_buff0~0=v_~a$w_buff0~0_48, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_126, ~weak$$choice2~0=v_~weak$$choice2~0_30, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~nondet4, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork2_#t~nondet3][101], [233#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1)), P0Thread1of1ForFork3InUse, P2Thread1of1ForFork0InUse, 186#true, P3Thread1of1ForFork2InUse, 54#L842true, P1Thread1of1ForFork1InUse, Black: 132#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 128#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 134#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 201#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 189#(and (not (= ~a$w_buff0~0 0)) (= ~a$r_buff1_thd4~0 0) (<= (div ~a$w_buff0_used~0 256) 0) (<= 1 ~a$w_buff0_used~0) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 205#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 190#(and (= ~a$r_buff1_thd4~0 0) (not (= ~a~0 0)) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 192#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 191#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 168#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 197#(and (not (= ~a$w_buff0~0 0)) (= ~a$r_buff1_thd4~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~a$w_buff0_used~0 256) 0) (<= 1 ~a$w_buff0_used~0) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), 45#P0EXITtrue, Black: 203#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 209#(and (= ~a$r_buff1_thd4~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= ~a~0 0)) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 199#(and (= ~a$r_buff1_thd4~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= ~a~0 0)) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 207#(and (= ~a$r_buff1_thd4~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= ~a~0 0)) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 188#(and (= ~a$w_buff0~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 150#(= ~__unbuffered_p3_EAX~0 0), 36#L873-3true, Black: 170#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 38#L793true, 182#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1) (<= 0 ~main$tmp_guard0~0)), 27#L806true, Black: 178#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 123#(and (not (= |ULTIMATE.start_main_~#t684~0#1.base| |ULTIMATE.start_main_~#t681~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t682~0#1.base| 0) |ULTIMATE.start_main_~#t683~0#1.base| 0) |ULTIMATE.start_main_~#t681~0#1.base| 0) |ULTIMATE.start_main_~#t684~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t683~0#1.base| |ULTIMATE.start_main_~#t682~0#1.base|)) (not (= |ULTIMATE.start_main_~#t682~0#1.base| |ULTIMATE.start_main_~#t681~0#1.base|)) (not (= |ULTIMATE.start_main_~#t683~0#1.base| |ULTIMATE.start_main_~#t681~0#1.base|)) (not (= |ULTIMATE.start_main_~#t684~0#1.base| |ULTIMATE.start_main_~#t682~0#1.base|)) (not (= |ULTIMATE.start_main_~#t684~0#1.base| |ULTIMATE.start_main_~#t683~0#1.base|)))]) [2023-11-26 10:47:21,507 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2023-11-26 10:47:21,507 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-26 10:47:21,508 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-26 10:47:21,508 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-26 10:47:21,559 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([465] L826-->L842: Formula: (let ((.cse11 (= (mod v_~a$r_buff1_thd4~0_64 256) 0)) (.cse4 (= (mod v_~a$r_buff0_thd4~0_66 256) 0))) (let ((.cse6 (not .cse4)) (.cse2 (and .cse11 .cse4)) (.cse7 (and (= (mod v_~a$w_buff1_used~0_127 256) 0) .cse4)) (.cse12 (= (mod v_~a$w_buff0_used~0_134 256) 0))) (let ((.cse8 (or .cse2 .cse7 .cse12)) (.cse9 (and (not .cse12) .cse6))) (let ((.cse1 (ite .cse8 v_~a~0_78 (ite .cse9 v_~a$w_buff0~0_49 v_~a$w_buff1~0_42))) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse3 (= (mod v_~a$w_buff1_used~0_126 256) 0)) (.cse5 (= (mod v_~a$w_buff0_used~0_133 256) 0))) (and (= v_~a~0_78 v_~a$mem_tmp~0_20) (= v_~a$flush_delayed~0_27 0) (= v_~a~0_76 (ite .cse0 v_~a$mem_tmp~0_20 .cse1)) (= v_~a$r_buff0_thd4~0_65 (ite .cse0 v_~a$r_buff0_thd4~0_66 (ite (or .cse2 (and .cse3 .cse4) .cse5) v_~a$r_buff0_thd4~0_66 (ite (and (not .cse5) .cse6) 0 v_~a$r_buff0_thd4~0_66)))) (= .cse1 v_~__unbuffered_p3_EBX~0_12) (= (ite .cse0 v_~a$w_buff1_used~0_127 (ite (or .cse2 .cse7 .cse5) v_~a$w_buff1_used~0_127 0)) v_~a$w_buff1_used~0_126) (= v_~a$w_buff1~0_42 v_~a$w_buff1~0_41) (= (ite .cse0 v_~a$w_buff0_used~0_134 (ite .cse8 v_~a$w_buff0_used~0_134 (ite .cse9 0 v_~a$w_buff0_used~0_134))) v_~a$w_buff0_used~0_133) (= v_~a$w_buff0~0_49 v_~a$w_buff0~0_48) (= (ite .cse0 v_~a$r_buff1_thd4~0_64 (ite (let ((.cse10 (= (mod v_~a$r_buff0_thd4~0_65 256) 0))) (or (and .cse3 .cse10) (and .cse11 .cse10) .cse5)) v_~a$r_buff1_thd4~0_64 0)) v_~a$r_buff1_thd4~0_63)))))) InVars {~a~0=v_~a~0_78, ~a$w_buff1~0=v_~a$w_buff1~0_42, ~a$w_buff0~0=v_~a$w_buff0~0_49, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_64, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_134, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_127, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_66} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_63, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_133, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_12, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_65, P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~a~0=v_~a~0_76, ~a$mem_tmp~0=v_~a$mem_tmp~0_20, ~weak$$choice0~0=v_~weak$$choice0~0_13, ~a$w_buff1~0=v_~a$w_buff1~0_41, ~a$flush_delayed~0=v_~a$flush_delayed~0_27, ~a$w_buff0~0=v_~a$w_buff0~0_48, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_126, ~weak$$choice2~0=v_~weak$$choice2~0_30, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~nondet4, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork2_#t~nondet3][101], [33#L776true, 233#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1)), P0Thread1of1ForFork3InUse, P2Thread1of1ForFork0InUse, 186#true, P3Thread1of1ForFork2InUse, 54#L842true, Black: 132#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), P1Thread1of1ForFork1InUse, Black: 128#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 134#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 201#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 189#(and (not (= ~a$w_buff0~0 0)) (= ~a$r_buff1_thd4~0 0) (<= (div ~a$w_buff0_used~0 256) 0) (<= 1 ~a$w_buff0_used~0) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 205#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 190#(and (= ~a$r_buff1_thd4~0 0) (not (= ~a~0 0)) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 192#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 191#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 168#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 197#(and (not (= ~a$w_buff0~0 0)) (= ~a$r_buff1_thd4~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~a$w_buff0_used~0 256) 0) (<= 1 ~a$w_buff0_used~0) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 203#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 209#(and (= ~a$r_buff1_thd4~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= ~a~0 0)) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 199#(and (= ~a$r_buff1_thd4~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= ~a~0 0)) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 207#(and (= ~a$r_buff1_thd4~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= ~a~0 0)) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 188#(and (= ~a$w_buff0~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 150#(= ~__unbuffered_p3_EAX~0 0), Black: 170#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 38#L793true, 182#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1) (<= 0 ~main$tmp_guard0~0)), 27#L806true, 12#L874true, Black: 178#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 123#(and (not (= |ULTIMATE.start_main_~#t684~0#1.base| |ULTIMATE.start_main_~#t681~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t682~0#1.base| 0) |ULTIMATE.start_main_~#t683~0#1.base| 0) |ULTIMATE.start_main_~#t681~0#1.base| 0) |ULTIMATE.start_main_~#t684~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t683~0#1.base| |ULTIMATE.start_main_~#t682~0#1.base|)) (not (= |ULTIMATE.start_main_~#t682~0#1.base| |ULTIMATE.start_main_~#t681~0#1.base|)) (not (= |ULTIMATE.start_main_~#t683~0#1.base| |ULTIMATE.start_main_~#t681~0#1.base|)) (not (= |ULTIMATE.start_main_~#t684~0#1.base| |ULTIMATE.start_main_~#t682~0#1.base|)) (not (= |ULTIMATE.start_main_~#t684~0#1.base| |ULTIMATE.start_main_~#t683~0#1.base|)))]) [2023-11-26 10:47:21,560 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2023-11-26 10:47:21,560 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-26 10:47:21,560 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-26 10:47:21,560 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-26 10:47:21,582 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([465] L826-->L842: Formula: (let ((.cse11 (= (mod v_~a$r_buff1_thd4~0_64 256) 0)) (.cse4 (= (mod v_~a$r_buff0_thd4~0_66 256) 0))) (let ((.cse6 (not .cse4)) (.cse2 (and .cse11 .cse4)) (.cse7 (and (= (mod v_~a$w_buff1_used~0_127 256) 0) .cse4)) (.cse12 (= (mod v_~a$w_buff0_used~0_134 256) 0))) (let ((.cse8 (or .cse2 .cse7 .cse12)) (.cse9 (and (not .cse12) .cse6))) (let ((.cse1 (ite .cse8 v_~a~0_78 (ite .cse9 v_~a$w_buff0~0_49 v_~a$w_buff1~0_42))) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse3 (= (mod v_~a$w_buff1_used~0_126 256) 0)) (.cse5 (= (mod v_~a$w_buff0_used~0_133 256) 0))) (and (= v_~a~0_78 v_~a$mem_tmp~0_20) (= v_~a$flush_delayed~0_27 0) (= v_~a~0_76 (ite .cse0 v_~a$mem_tmp~0_20 .cse1)) (= v_~a$r_buff0_thd4~0_65 (ite .cse0 v_~a$r_buff0_thd4~0_66 (ite (or .cse2 (and .cse3 .cse4) .cse5) v_~a$r_buff0_thd4~0_66 (ite (and (not .cse5) .cse6) 0 v_~a$r_buff0_thd4~0_66)))) (= .cse1 v_~__unbuffered_p3_EBX~0_12) (= (ite .cse0 v_~a$w_buff1_used~0_127 (ite (or .cse2 .cse7 .cse5) v_~a$w_buff1_used~0_127 0)) v_~a$w_buff1_used~0_126) (= v_~a$w_buff1~0_42 v_~a$w_buff1~0_41) (= (ite .cse0 v_~a$w_buff0_used~0_134 (ite .cse8 v_~a$w_buff0_used~0_134 (ite .cse9 0 v_~a$w_buff0_used~0_134))) v_~a$w_buff0_used~0_133) (= v_~a$w_buff0~0_49 v_~a$w_buff0~0_48) (= (ite .cse0 v_~a$r_buff1_thd4~0_64 (ite (let ((.cse10 (= (mod v_~a$r_buff0_thd4~0_65 256) 0))) (or (and .cse3 .cse10) (and .cse11 .cse10) .cse5)) v_~a$r_buff1_thd4~0_64 0)) v_~a$r_buff1_thd4~0_63)))))) InVars {~a~0=v_~a~0_78, ~a$w_buff1~0=v_~a$w_buff1~0_42, ~a$w_buff0~0=v_~a$w_buff0~0_49, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_64, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_134, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_127, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_66} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_63, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_133, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_12, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_65, P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~a~0=v_~a~0_76, ~a$mem_tmp~0=v_~a$mem_tmp~0_20, ~weak$$choice0~0=v_~weak$$choice0~0_13, ~a$w_buff1~0=v_~a$w_buff1~0_41, ~a$flush_delayed~0=v_~a$flush_delayed~0_27, ~a$w_buff0~0=v_~a$w_buff0~0_48, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_126, ~weak$$choice2~0=v_~weak$$choice2~0_30, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~nondet4, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork2_#t~nondet3][66], [P0Thread1of1ForFork3InUse, 186#true, P2Thread1of1ForFork0InUse, P3Thread1of1ForFork2InUse, 54#L842true, Black: 132#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), P1Thread1of1ForFork1InUse, Black: 128#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 134#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 201#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 189#(and (not (= ~a$w_buff0~0 0)) (= ~a$r_buff1_thd4~0 0) (<= (div ~a$w_buff0_used~0 256) 0) (<= 1 ~a$w_buff0_used~0) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 205#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 231#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), Black: 190#(and (= ~a$r_buff1_thd4~0 0) (not (= ~a~0 0)) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 192#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 191#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 180#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 7#L773true, Black: 197#(and (not (= ~a$w_buff0~0 0)) (= ~a$r_buff1_thd4~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~a$w_buff0_used~0 256) 0) (<= 1 ~a$w_buff0_used~0) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 203#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 209#(and (= ~a$r_buff1_thd4~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= ~a~0 0)) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 199#(and (= ~a$r_buff1_thd4~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= ~a~0 0)) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 207#(and (= ~a$r_buff1_thd4~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= ~a~0 0)) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 188#(and (= ~a$w_buff0~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 150#(= ~__unbuffered_p3_EAX~0 0), 29#L876true, Black: 168#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 38#L793true, 27#L806true, Black: 182#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1) (<= 0 ~main$tmp_guard0~0)), Black: 178#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 123#(and (not (= |ULTIMATE.start_main_~#t684~0#1.base| |ULTIMATE.start_main_~#t681~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t682~0#1.base| 0) |ULTIMATE.start_main_~#t683~0#1.base| 0) |ULTIMATE.start_main_~#t681~0#1.base| 0) |ULTIMATE.start_main_~#t684~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t683~0#1.base| |ULTIMATE.start_main_~#t682~0#1.base|)) (not (= |ULTIMATE.start_main_~#t682~0#1.base| |ULTIMATE.start_main_~#t681~0#1.base|)) (not (= |ULTIMATE.start_main_~#t683~0#1.base| |ULTIMATE.start_main_~#t681~0#1.base|)) (not (= |ULTIMATE.start_main_~#t684~0#1.base| |ULTIMATE.start_main_~#t682~0#1.base|)) (not (= |ULTIMATE.start_main_~#t684~0#1.base| |ULTIMATE.start_main_~#t683~0#1.base|)))]) [2023-11-26 10:47:21,583 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2023-11-26 10:47:21,583 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-26 10:47:21,583 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-26 10:47:21,583 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-26 10:47:21,923 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([465] L826-->L842: Formula: (let ((.cse11 (= (mod v_~a$r_buff1_thd4~0_64 256) 0)) (.cse4 (= (mod v_~a$r_buff0_thd4~0_66 256) 0))) (let ((.cse6 (not .cse4)) (.cse2 (and .cse11 .cse4)) (.cse7 (and (= (mod v_~a$w_buff1_used~0_127 256) 0) .cse4)) (.cse12 (= (mod v_~a$w_buff0_used~0_134 256) 0))) (let ((.cse8 (or .cse2 .cse7 .cse12)) (.cse9 (and (not .cse12) .cse6))) (let ((.cse1 (ite .cse8 v_~a~0_78 (ite .cse9 v_~a$w_buff0~0_49 v_~a$w_buff1~0_42))) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse3 (= (mod v_~a$w_buff1_used~0_126 256) 0)) (.cse5 (= (mod v_~a$w_buff0_used~0_133 256) 0))) (and (= v_~a~0_78 v_~a$mem_tmp~0_20) (= v_~a$flush_delayed~0_27 0) (= v_~a~0_76 (ite .cse0 v_~a$mem_tmp~0_20 .cse1)) (= v_~a$r_buff0_thd4~0_65 (ite .cse0 v_~a$r_buff0_thd4~0_66 (ite (or .cse2 (and .cse3 .cse4) .cse5) v_~a$r_buff0_thd4~0_66 (ite (and (not .cse5) .cse6) 0 v_~a$r_buff0_thd4~0_66)))) (= .cse1 v_~__unbuffered_p3_EBX~0_12) (= (ite .cse0 v_~a$w_buff1_used~0_127 (ite (or .cse2 .cse7 .cse5) v_~a$w_buff1_used~0_127 0)) v_~a$w_buff1_used~0_126) (= v_~a$w_buff1~0_42 v_~a$w_buff1~0_41) (= (ite .cse0 v_~a$w_buff0_used~0_134 (ite .cse8 v_~a$w_buff0_used~0_134 (ite .cse9 0 v_~a$w_buff0_used~0_134))) v_~a$w_buff0_used~0_133) (= v_~a$w_buff0~0_49 v_~a$w_buff0~0_48) (= (ite .cse0 v_~a$r_buff1_thd4~0_64 (ite (let ((.cse10 (= (mod v_~a$r_buff0_thd4~0_65 256) 0))) (or (and .cse3 .cse10) (and .cse11 .cse10) .cse5)) v_~a$r_buff1_thd4~0_64 0)) v_~a$r_buff1_thd4~0_63)))))) InVars {~a~0=v_~a~0_78, ~a$w_buff1~0=v_~a$w_buff1~0_42, ~a$w_buff0~0=v_~a$w_buff0~0_49, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_64, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_134, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_127, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_66} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_63, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_133, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_12, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_65, P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~a~0=v_~a~0_76, ~a$mem_tmp~0=v_~a$mem_tmp~0_20, ~weak$$choice0~0=v_~weak$$choice0~0_13, ~a$w_buff1~0=v_~a$w_buff1~0_41, ~a$flush_delayed~0=v_~a$flush_delayed~0_27, ~a$w_buff0~0=v_~a$w_buff0~0_48, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_126, ~weak$$choice2~0=v_~weak$$choice2~0_30, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~nondet4, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork2_#t~nondet3][121], [P0Thread1of1ForFork3InUse, P2Thread1of1ForFork0InUse, 186#true, P3Thread1of1ForFork2InUse, 54#L842true, Black: 132#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), P1Thread1of1ForFork1InUse, Black: 128#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 134#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 201#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 189#(and (not (= ~a$w_buff0~0 0)) (= ~a$r_buff1_thd4~0 0) (<= (div ~a$w_buff0_used~0 256) 0) (<= 1 ~a$w_buff0_used~0) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 205#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 190#(and (= ~a$r_buff1_thd4~0 0) (not (= ~a~0 0)) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 192#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 191#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 168#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 197#(and (not (= ~a$w_buff0~0 0)) (= ~a$r_buff1_thd4~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~a$w_buff0_used~0 256) 0) (<= 1 ~a$w_buff0_used~0) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), 45#P0EXITtrue, Black: 203#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 209#(and (= ~a$r_buff1_thd4~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= ~a~0 0)) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 199#(and (= ~a$r_buff1_thd4~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= ~a~0 0)) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 207#(and (= ~a$r_buff1_thd4~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= ~a~0 0)) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 188#(and (= ~a$w_buff0~0 0) (= ~a$r_buff0_thd4~0 0)), 235#(and (<= ~__unbuffered_cnt~0 2) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), Black: 150#(= ~__unbuffered_p3_EAX~0 0), 36#L873-3true, Black: 170#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 40#L796true, 27#L806true, Black: 182#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1) (<= 0 ~main$tmp_guard0~0)), 123#(and (not (= |ULTIMATE.start_main_~#t684~0#1.base| |ULTIMATE.start_main_~#t681~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t682~0#1.base| 0) |ULTIMATE.start_main_~#t683~0#1.base| 0) |ULTIMATE.start_main_~#t681~0#1.base| 0) |ULTIMATE.start_main_~#t684~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t683~0#1.base| |ULTIMATE.start_main_~#t682~0#1.base|)) (not (= |ULTIMATE.start_main_~#t682~0#1.base| |ULTIMATE.start_main_~#t681~0#1.base|)) (not (= |ULTIMATE.start_main_~#t683~0#1.base| |ULTIMATE.start_main_~#t681~0#1.base|)) (not (= |ULTIMATE.start_main_~#t684~0#1.base| |ULTIMATE.start_main_~#t682~0#1.base|)) (not (= |ULTIMATE.start_main_~#t684~0#1.base| |ULTIMATE.start_main_~#t683~0#1.base|))), 178#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0))]) [2023-11-26 10:47:21,923 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2023-11-26 10:47:21,923 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-26 10:47:21,923 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-26 10:47:21,923 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-26 10:47:22,155 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([465] L826-->L842: Formula: (let ((.cse11 (= (mod v_~a$r_buff1_thd4~0_64 256) 0)) (.cse4 (= (mod v_~a$r_buff0_thd4~0_66 256) 0))) (let ((.cse6 (not .cse4)) (.cse2 (and .cse11 .cse4)) (.cse7 (and (= (mod v_~a$w_buff1_used~0_127 256) 0) .cse4)) (.cse12 (= (mod v_~a$w_buff0_used~0_134 256) 0))) (let ((.cse8 (or .cse2 .cse7 .cse12)) (.cse9 (and (not .cse12) .cse6))) (let ((.cse1 (ite .cse8 v_~a~0_78 (ite .cse9 v_~a$w_buff0~0_49 v_~a$w_buff1~0_42))) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse3 (= (mod v_~a$w_buff1_used~0_126 256) 0)) (.cse5 (= (mod v_~a$w_buff0_used~0_133 256) 0))) (and (= v_~a~0_78 v_~a$mem_tmp~0_20) (= v_~a$flush_delayed~0_27 0) (= v_~a~0_76 (ite .cse0 v_~a$mem_tmp~0_20 .cse1)) (= v_~a$r_buff0_thd4~0_65 (ite .cse0 v_~a$r_buff0_thd4~0_66 (ite (or .cse2 (and .cse3 .cse4) .cse5) v_~a$r_buff0_thd4~0_66 (ite (and (not .cse5) .cse6) 0 v_~a$r_buff0_thd4~0_66)))) (= .cse1 v_~__unbuffered_p3_EBX~0_12) (= (ite .cse0 v_~a$w_buff1_used~0_127 (ite (or .cse2 .cse7 .cse5) v_~a$w_buff1_used~0_127 0)) v_~a$w_buff1_used~0_126) (= v_~a$w_buff1~0_42 v_~a$w_buff1~0_41) (= (ite .cse0 v_~a$w_buff0_used~0_134 (ite .cse8 v_~a$w_buff0_used~0_134 (ite .cse9 0 v_~a$w_buff0_used~0_134))) v_~a$w_buff0_used~0_133) (= v_~a$w_buff0~0_49 v_~a$w_buff0~0_48) (= (ite .cse0 v_~a$r_buff1_thd4~0_64 (ite (let ((.cse10 (= (mod v_~a$r_buff0_thd4~0_65 256) 0))) (or (and .cse3 .cse10) (and .cse11 .cse10) .cse5)) v_~a$r_buff1_thd4~0_64 0)) v_~a$r_buff1_thd4~0_63)))))) InVars {~a~0=v_~a~0_78, ~a$w_buff1~0=v_~a$w_buff1~0_42, ~a$w_buff0~0=v_~a$w_buff0~0_49, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_64, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_134, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_127, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_66} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_63, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_133, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_12, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_65, P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~a~0=v_~a~0_76, ~a$mem_tmp~0=v_~a$mem_tmp~0_20, ~weak$$choice0~0=v_~weak$$choice0~0_13, ~a$w_buff1~0=v_~a$w_buff1~0_41, ~a$flush_delayed~0=v_~a$flush_delayed~0_27, ~a$w_buff0~0=v_~a$w_buff0~0_48, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_126, ~weak$$choice2~0=v_~weak$$choice2~0_30, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~nondet4, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork2_#t~nondet3][101], [233#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1)), P0Thread1of1ForFork3InUse, P2Thread1of1ForFork0InUse, 186#true, P3Thread1of1ForFork2InUse, 54#L842true, Black: 132#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), P1Thread1of1ForFork1InUse, Black: 128#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 134#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 201#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 189#(and (not (= ~a$w_buff0~0 0)) (= ~a$r_buff1_thd4~0 0) (<= (div ~a$w_buff0_used~0 256) 0) (<= 1 ~a$w_buff0_used~0) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 205#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 190#(and (= ~a$r_buff1_thd4~0 0) (not (= ~a~0 0)) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 192#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 191#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 168#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 197#(and (not (= ~a$w_buff0~0 0)) (= ~a$r_buff1_thd4~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~a$w_buff0_used~0 256) 0) (<= 1 ~a$w_buff0_used~0) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), 45#P0EXITtrue, Black: 203#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 209#(and (= ~a$r_buff1_thd4~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= ~a~0 0)) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 199#(and (= ~a$r_buff1_thd4~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= ~a~0 0)) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 207#(and (= ~a$r_buff1_thd4~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= ~a~0 0)) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 188#(and (= ~a$w_buff0~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 150#(= ~__unbuffered_p3_EAX~0 0), Black: 170#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 38#L793true, 182#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1) (<= 0 ~main$tmp_guard0~0)), 27#L806true, 12#L874true, Black: 178#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 123#(and (not (= |ULTIMATE.start_main_~#t684~0#1.base| |ULTIMATE.start_main_~#t681~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t682~0#1.base| 0) |ULTIMATE.start_main_~#t683~0#1.base| 0) |ULTIMATE.start_main_~#t681~0#1.base| 0) |ULTIMATE.start_main_~#t684~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t683~0#1.base| |ULTIMATE.start_main_~#t682~0#1.base|)) (not (= |ULTIMATE.start_main_~#t682~0#1.base| |ULTIMATE.start_main_~#t681~0#1.base|)) (not (= |ULTIMATE.start_main_~#t683~0#1.base| |ULTIMATE.start_main_~#t681~0#1.base|)) (not (= |ULTIMATE.start_main_~#t684~0#1.base| |ULTIMATE.start_main_~#t682~0#1.base|)) (not (= |ULTIMATE.start_main_~#t684~0#1.base| |ULTIMATE.start_main_~#t683~0#1.base|)))]) [2023-11-26 10:47:22,155 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2023-11-26 10:47:22,155 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-26 10:47:22,155 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-26 10:47:22,155 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-26 10:47:22,156 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([465] L826-->L842: Formula: (let ((.cse11 (= (mod v_~a$r_buff1_thd4~0_64 256) 0)) (.cse4 (= (mod v_~a$r_buff0_thd4~0_66 256) 0))) (let ((.cse6 (not .cse4)) (.cse2 (and .cse11 .cse4)) (.cse7 (and (= (mod v_~a$w_buff1_used~0_127 256) 0) .cse4)) (.cse12 (= (mod v_~a$w_buff0_used~0_134 256) 0))) (let ((.cse8 (or .cse2 .cse7 .cse12)) (.cse9 (and (not .cse12) .cse6))) (let ((.cse1 (ite .cse8 v_~a~0_78 (ite .cse9 v_~a$w_buff0~0_49 v_~a$w_buff1~0_42))) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse3 (= (mod v_~a$w_buff1_used~0_126 256) 0)) (.cse5 (= (mod v_~a$w_buff0_used~0_133 256) 0))) (and (= v_~a~0_78 v_~a$mem_tmp~0_20) (= v_~a$flush_delayed~0_27 0) (= v_~a~0_76 (ite .cse0 v_~a$mem_tmp~0_20 .cse1)) (= v_~a$r_buff0_thd4~0_65 (ite .cse0 v_~a$r_buff0_thd4~0_66 (ite (or .cse2 (and .cse3 .cse4) .cse5) v_~a$r_buff0_thd4~0_66 (ite (and (not .cse5) .cse6) 0 v_~a$r_buff0_thd4~0_66)))) (= .cse1 v_~__unbuffered_p3_EBX~0_12) (= (ite .cse0 v_~a$w_buff1_used~0_127 (ite (or .cse2 .cse7 .cse5) v_~a$w_buff1_used~0_127 0)) v_~a$w_buff1_used~0_126) (= v_~a$w_buff1~0_42 v_~a$w_buff1~0_41) (= (ite .cse0 v_~a$w_buff0_used~0_134 (ite .cse8 v_~a$w_buff0_used~0_134 (ite .cse9 0 v_~a$w_buff0_used~0_134))) v_~a$w_buff0_used~0_133) (= v_~a$w_buff0~0_49 v_~a$w_buff0~0_48) (= (ite .cse0 v_~a$r_buff1_thd4~0_64 (ite (let ((.cse10 (= (mod v_~a$r_buff0_thd4~0_65 256) 0))) (or (and .cse3 .cse10) (and .cse11 .cse10) .cse5)) v_~a$r_buff1_thd4~0_64 0)) v_~a$r_buff1_thd4~0_63)))))) InVars {~a~0=v_~a~0_78, ~a$w_buff1~0=v_~a$w_buff1~0_42, ~a$w_buff0~0=v_~a$w_buff0~0_49, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_64, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_134, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_127, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_66} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_63, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_133, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_12, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_65, P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~a~0=v_~a~0_76, ~a$mem_tmp~0=v_~a$mem_tmp~0_20, ~weak$$choice0~0=v_~weak$$choice0~0_13, ~a$w_buff1~0=v_~a$w_buff1~0_41, ~a$flush_delayed~0=v_~a$flush_delayed~0_27, ~a$w_buff0~0=v_~a$w_buff0~0_48, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_126, ~weak$$choice2~0=v_~weak$$choice2~0_30, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~nondet4, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork2_#t~nondet3][121], [33#L776true, P0Thread1of1ForFork3InUse, P2Thread1of1ForFork0InUse, 186#true, P3Thread1of1ForFork2InUse, 54#L842true, Black: 132#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), P1Thread1of1ForFork1InUse, Black: 128#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 134#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 201#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 189#(and (not (= ~a$w_buff0~0 0)) (= ~a$r_buff1_thd4~0 0) (<= (div ~a$w_buff0_used~0 256) 0) (<= 1 ~a$w_buff0_used~0) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 205#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 190#(and (= ~a$r_buff1_thd4~0 0) (not (= ~a~0 0)) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 192#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 191#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 168#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 197#(and (not (= ~a$w_buff0~0 0)) (= ~a$r_buff1_thd4~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~a$w_buff0_used~0 256) 0) (<= 1 ~a$w_buff0_used~0) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 203#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 209#(and (= ~a$r_buff1_thd4~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= ~a~0 0)) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 199#(and (= ~a$r_buff1_thd4~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= ~a~0 0)) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 207#(and (= ~a$r_buff1_thd4~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= ~a~0 0)) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 188#(and (= ~a$w_buff0~0 0) (= ~a$r_buff0_thd4~0 0)), 235#(and (<= ~__unbuffered_cnt~0 2) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), Black: 150#(= ~__unbuffered_p3_EAX~0 0), Black: 170#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 40#L796true, 27#L806true, Black: 182#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1) (<= 0 ~main$tmp_guard0~0)), 12#L874true, 123#(and (not (= |ULTIMATE.start_main_~#t684~0#1.base| |ULTIMATE.start_main_~#t681~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t682~0#1.base| 0) |ULTIMATE.start_main_~#t683~0#1.base| 0) |ULTIMATE.start_main_~#t681~0#1.base| 0) |ULTIMATE.start_main_~#t684~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t683~0#1.base| |ULTIMATE.start_main_~#t682~0#1.base|)) (not (= |ULTIMATE.start_main_~#t682~0#1.base| |ULTIMATE.start_main_~#t681~0#1.base|)) (not (= |ULTIMATE.start_main_~#t683~0#1.base| |ULTIMATE.start_main_~#t681~0#1.base|)) (not (= |ULTIMATE.start_main_~#t684~0#1.base| |ULTIMATE.start_main_~#t682~0#1.base|)) (not (= |ULTIMATE.start_main_~#t684~0#1.base| |ULTIMATE.start_main_~#t683~0#1.base|))), 178#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0))]) [2023-11-26 10:47:22,156 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2023-11-26 10:47:22,156 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-26 10:47:22,156 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-26 10:47:22,156 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-26 10:47:22,157 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([465] L826-->L842: Formula: (let ((.cse11 (= (mod v_~a$r_buff1_thd4~0_64 256) 0)) (.cse4 (= (mod v_~a$r_buff0_thd4~0_66 256) 0))) (let ((.cse6 (not .cse4)) (.cse2 (and .cse11 .cse4)) (.cse7 (and (= (mod v_~a$w_buff1_used~0_127 256) 0) .cse4)) (.cse12 (= (mod v_~a$w_buff0_used~0_134 256) 0))) (let ((.cse8 (or .cse2 .cse7 .cse12)) (.cse9 (and (not .cse12) .cse6))) (let ((.cse1 (ite .cse8 v_~a~0_78 (ite .cse9 v_~a$w_buff0~0_49 v_~a$w_buff1~0_42))) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse3 (= (mod v_~a$w_buff1_used~0_126 256) 0)) (.cse5 (= (mod v_~a$w_buff0_used~0_133 256) 0))) (and (= v_~a~0_78 v_~a$mem_tmp~0_20) (= v_~a$flush_delayed~0_27 0) (= v_~a~0_76 (ite .cse0 v_~a$mem_tmp~0_20 .cse1)) (= v_~a$r_buff0_thd4~0_65 (ite .cse0 v_~a$r_buff0_thd4~0_66 (ite (or .cse2 (and .cse3 .cse4) .cse5) v_~a$r_buff0_thd4~0_66 (ite (and (not .cse5) .cse6) 0 v_~a$r_buff0_thd4~0_66)))) (= .cse1 v_~__unbuffered_p3_EBX~0_12) (= (ite .cse0 v_~a$w_buff1_used~0_127 (ite (or .cse2 .cse7 .cse5) v_~a$w_buff1_used~0_127 0)) v_~a$w_buff1_used~0_126) (= v_~a$w_buff1~0_42 v_~a$w_buff1~0_41) (= (ite .cse0 v_~a$w_buff0_used~0_134 (ite .cse8 v_~a$w_buff0_used~0_134 (ite .cse9 0 v_~a$w_buff0_used~0_134))) v_~a$w_buff0_used~0_133) (= v_~a$w_buff0~0_49 v_~a$w_buff0~0_48) (= (ite .cse0 v_~a$r_buff1_thd4~0_64 (ite (let ((.cse10 (= (mod v_~a$r_buff0_thd4~0_65 256) 0))) (or (and .cse3 .cse10) (and .cse11 .cse10) .cse5)) v_~a$r_buff1_thd4~0_64 0)) v_~a$r_buff1_thd4~0_63)))))) InVars {~a~0=v_~a~0_78, ~a$w_buff1~0=v_~a$w_buff1~0_42, ~a$w_buff0~0=v_~a$w_buff0~0_49, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_64, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_134, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_127, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_66} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_63, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_133, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_12, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_65, P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~a~0=v_~a~0_76, ~a$mem_tmp~0=v_~a$mem_tmp~0_20, ~weak$$choice0~0=v_~weak$$choice0~0_13, ~a$w_buff1~0=v_~a$w_buff1~0_41, ~a$flush_delayed~0=v_~a$flush_delayed~0_27, ~a$w_buff0~0=v_~a$w_buff0~0_48, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_126, ~weak$$choice2~0=v_~weak$$choice2~0_30, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~nondet4, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork2_#t~nondet3][101], [33#L776true, 233#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1)), P0Thread1of1ForFork3InUse, P2Thread1of1ForFork0InUse, 186#true, P3Thread1of1ForFork2InUse, 54#L842true, Black: 132#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), P1Thread1of1ForFork1InUse, Black: 128#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 134#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 201#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 189#(and (not (= ~a$w_buff0~0 0)) (= ~a$r_buff1_thd4~0 0) (<= (div ~a$w_buff0_used~0 256) 0) (<= 1 ~a$w_buff0_used~0) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 205#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 190#(and (= ~a$r_buff1_thd4~0 0) (not (= ~a~0 0)) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 192#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 191#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 197#(and (not (= ~a$w_buff0~0 0)) (= ~a$r_buff1_thd4~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~a$w_buff0_used~0 256) 0) (<= 1 ~a$w_buff0_used~0) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 203#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 209#(and (= ~a$r_buff1_thd4~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= ~a~0 0)) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 199#(and (= ~a$r_buff1_thd4~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= ~a~0 0)) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 207#(and (= ~a$r_buff1_thd4~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= ~a~0 0)) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 188#(and (= ~a$w_buff0~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 150#(= ~__unbuffered_p3_EAX~0 0), 29#L876true, Black: 170#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 168#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 38#L793true, 182#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1) (<= 0 ~main$tmp_guard0~0)), 27#L806true, Black: 178#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 123#(and (not (= |ULTIMATE.start_main_~#t684~0#1.base| |ULTIMATE.start_main_~#t681~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t682~0#1.base| 0) |ULTIMATE.start_main_~#t683~0#1.base| 0) |ULTIMATE.start_main_~#t681~0#1.base| 0) |ULTIMATE.start_main_~#t684~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t683~0#1.base| |ULTIMATE.start_main_~#t682~0#1.base|)) (not (= |ULTIMATE.start_main_~#t682~0#1.base| |ULTIMATE.start_main_~#t681~0#1.base|)) (not (= |ULTIMATE.start_main_~#t683~0#1.base| |ULTIMATE.start_main_~#t681~0#1.base|)) (not (= |ULTIMATE.start_main_~#t684~0#1.base| |ULTIMATE.start_main_~#t682~0#1.base|)) (not (= |ULTIMATE.start_main_~#t684~0#1.base| |ULTIMATE.start_main_~#t683~0#1.base|)))]) [2023-11-26 10:47:22,158 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2023-11-26 10:47:22,158 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-26 10:47:22,158 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-26 10:47:22,158 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-26 10:47:22,257 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([465] L826-->L842: Formula: (let ((.cse11 (= (mod v_~a$r_buff1_thd4~0_64 256) 0)) (.cse4 (= (mod v_~a$r_buff0_thd4~0_66 256) 0))) (let ((.cse6 (not .cse4)) (.cse2 (and .cse11 .cse4)) (.cse7 (and (= (mod v_~a$w_buff1_used~0_127 256) 0) .cse4)) (.cse12 (= (mod v_~a$w_buff0_used~0_134 256) 0))) (let ((.cse8 (or .cse2 .cse7 .cse12)) (.cse9 (and (not .cse12) .cse6))) (let ((.cse1 (ite .cse8 v_~a~0_78 (ite .cse9 v_~a$w_buff0~0_49 v_~a$w_buff1~0_42))) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse3 (= (mod v_~a$w_buff1_used~0_126 256) 0)) (.cse5 (= (mod v_~a$w_buff0_used~0_133 256) 0))) (and (= v_~a~0_78 v_~a$mem_tmp~0_20) (= v_~a$flush_delayed~0_27 0) (= v_~a~0_76 (ite .cse0 v_~a$mem_tmp~0_20 .cse1)) (= v_~a$r_buff0_thd4~0_65 (ite .cse0 v_~a$r_buff0_thd4~0_66 (ite (or .cse2 (and .cse3 .cse4) .cse5) v_~a$r_buff0_thd4~0_66 (ite (and (not .cse5) .cse6) 0 v_~a$r_buff0_thd4~0_66)))) (= .cse1 v_~__unbuffered_p3_EBX~0_12) (= (ite .cse0 v_~a$w_buff1_used~0_127 (ite (or .cse2 .cse7 .cse5) v_~a$w_buff1_used~0_127 0)) v_~a$w_buff1_used~0_126) (= v_~a$w_buff1~0_42 v_~a$w_buff1~0_41) (= (ite .cse0 v_~a$w_buff0_used~0_134 (ite .cse8 v_~a$w_buff0_used~0_134 (ite .cse9 0 v_~a$w_buff0_used~0_134))) v_~a$w_buff0_used~0_133) (= v_~a$w_buff0~0_49 v_~a$w_buff0~0_48) (= (ite .cse0 v_~a$r_buff1_thd4~0_64 (ite (let ((.cse10 (= (mod v_~a$r_buff0_thd4~0_65 256) 0))) (or (and .cse3 .cse10) (and .cse11 .cse10) .cse5)) v_~a$r_buff1_thd4~0_64 0)) v_~a$r_buff1_thd4~0_63)))))) InVars {~a~0=v_~a~0_78, ~a$w_buff1~0=v_~a$w_buff1~0_42, ~a$w_buff0~0=v_~a$w_buff0~0_49, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_64, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_134, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_127, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_66} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_63, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_133, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_12, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_65, P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~a~0=v_~a~0_76, ~a$mem_tmp~0=v_~a$mem_tmp~0_20, ~weak$$choice0~0=v_~weak$$choice0~0_13, ~a$w_buff1~0=v_~a$w_buff1~0_41, ~a$flush_delayed~0=v_~a$flush_delayed~0_27, ~a$w_buff0~0=v_~a$w_buff0~0_48, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_126, ~weak$$choice2~0=v_~weak$$choice2~0_30, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~nondet4, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork2_#t~nondet3][101], [233#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1)), P0Thread1of1ForFork3InUse, P2Thread1of1ForFork0InUse, 186#true, P3Thread1of1ForFork2InUse, 54#L842true, Black: 132#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), P1Thread1of1ForFork1InUse, Black: 128#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 134#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 201#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 189#(and (not (= ~a$w_buff0~0 0)) (= ~a$r_buff1_thd4~0 0) (<= (div ~a$w_buff0_used~0 256) 0) (<= 1 ~a$w_buff0_used~0) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 205#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 190#(and (= ~a$r_buff1_thd4~0 0) (not (= ~a~0 0)) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 192#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 191#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 7#L773true, 168#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 197#(and (not (= ~a$w_buff0~0 0)) (= ~a$r_buff1_thd4~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~a$w_buff0_used~0 256) 0) (<= 1 ~a$w_buff0_used~0) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 203#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 209#(and (= ~a$r_buff1_thd4~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= ~a~0 0)) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 199#(and (= ~a$r_buff1_thd4~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= ~a~0 0)) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 207#(and (= ~a$r_buff1_thd4~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= ~a~0 0)) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 188#(and (= ~a$w_buff0~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 150#(= ~__unbuffered_p3_EAX~0 0), 29#L876true, Black: 170#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 182#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1) (<= 0 ~main$tmp_guard0~0)), 40#L796true, 27#L806true, Black: 178#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 123#(and (not (= |ULTIMATE.start_main_~#t684~0#1.base| |ULTIMATE.start_main_~#t681~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t682~0#1.base| 0) |ULTIMATE.start_main_~#t683~0#1.base| 0) |ULTIMATE.start_main_~#t681~0#1.base| 0) |ULTIMATE.start_main_~#t684~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t683~0#1.base| |ULTIMATE.start_main_~#t682~0#1.base|)) (not (= |ULTIMATE.start_main_~#t682~0#1.base| |ULTIMATE.start_main_~#t681~0#1.base|)) (not (= |ULTIMATE.start_main_~#t683~0#1.base| |ULTIMATE.start_main_~#t681~0#1.base|)) (not (= |ULTIMATE.start_main_~#t684~0#1.base| |ULTIMATE.start_main_~#t682~0#1.base|)) (not (= |ULTIMATE.start_main_~#t684~0#1.base| |ULTIMATE.start_main_~#t683~0#1.base|)))]) [2023-11-26 10:47:22,257 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2023-11-26 10:47:22,257 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-26 10:47:22,257 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-26 10:47:22,257 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-26 10:47:22,258 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([465] L826-->L842: Formula: (let ((.cse11 (= (mod v_~a$r_buff1_thd4~0_64 256) 0)) (.cse4 (= (mod v_~a$r_buff0_thd4~0_66 256) 0))) (let ((.cse6 (not .cse4)) (.cse2 (and .cse11 .cse4)) (.cse7 (and (= (mod v_~a$w_buff1_used~0_127 256) 0) .cse4)) (.cse12 (= (mod v_~a$w_buff0_used~0_134 256) 0))) (let ((.cse8 (or .cse2 .cse7 .cse12)) (.cse9 (and (not .cse12) .cse6))) (let ((.cse1 (ite .cse8 v_~a~0_78 (ite .cse9 v_~a$w_buff0~0_49 v_~a$w_buff1~0_42))) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse3 (= (mod v_~a$w_buff1_used~0_126 256) 0)) (.cse5 (= (mod v_~a$w_buff0_used~0_133 256) 0))) (and (= v_~a~0_78 v_~a$mem_tmp~0_20) (= v_~a$flush_delayed~0_27 0) (= v_~a~0_76 (ite .cse0 v_~a$mem_tmp~0_20 .cse1)) (= v_~a$r_buff0_thd4~0_65 (ite .cse0 v_~a$r_buff0_thd4~0_66 (ite (or .cse2 (and .cse3 .cse4) .cse5) v_~a$r_buff0_thd4~0_66 (ite (and (not .cse5) .cse6) 0 v_~a$r_buff0_thd4~0_66)))) (= .cse1 v_~__unbuffered_p3_EBX~0_12) (= (ite .cse0 v_~a$w_buff1_used~0_127 (ite (or .cse2 .cse7 .cse5) v_~a$w_buff1_used~0_127 0)) v_~a$w_buff1_used~0_126) (= v_~a$w_buff1~0_42 v_~a$w_buff1~0_41) (= (ite .cse0 v_~a$w_buff0_used~0_134 (ite .cse8 v_~a$w_buff0_used~0_134 (ite .cse9 0 v_~a$w_buff0_used~0_134))) v_~a$w_buff0_used~0_133) (= v_~a$w_buff0~0_49 v_~a$w_buff0~0_48) (= (ite .cse0 v_~a$r_buff1_thd4~0_64 (ite (let ((.cse10 (= (mod v_~a$r_buff0_thd4~0_65 256) 0))) (or (and .cse3 .cse10) (and .cse11 .cse10) .cse5)) v_~a$r_buff1_thd4~0_64 0)) v_~a$r_buff1_thd4~0_63)))))) InVars {~a~0=v_~a~0_78, ~a$w_buff1~0=v_~a$w_buff1~0_42, ~a$w_buff0~0=v_~a$w_buff0~0_49, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_64, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_134, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_127, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_66} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_63, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_133, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_12, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_65, P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~a~0=v_~a~0_76, ~a$mem_tmp~0=v_~a$mem_tmp~0_20, ~weak$$choice0~0=v_~weak$$choice0~0_13, ~a$w_buff1~0=v_~a$w_buff1~0_41, ~a$flush_delayed~0=v_~a$flush_delayed~0_27, ~a$w_buff0~0=v_~a$w_buff0~0_48, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_126, ~weak$$choice2~0=v_~weak$$choice2~0_30, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~nondet4, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork2_#t~nondet3][101], [33#L776true, 233#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1)), P0Thread1of1ForFork3InUse, P2Thread1of1ForFork0InUse, 186#true, P3Thread1of1ForFork2InUse, 54#L842true, P1Thread1of1ForFork1InUse, Black: 132#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 128#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 134#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 201#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 189#(and (not (= ~a$w_buff0~0 0)) (= ~a$r_buff1_thd4~0 0) (<= (div ~a$w_buff0_used~0 256) 0) (<= 1 ~a$w_buff0_used~0) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 205#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 190#(and (= ~a$r_buff1_thd4~0 0) (not (= ~a~0 0)) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 192#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 191#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 197#(and (not (= ~a$w_buff0~0 0)) (= ~a$r_buff1_thd4~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~a$w_buff0_used~0 256) 0) (<= 1 ~a$w_buff0_used~0) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), 168#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 203#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 209#(and (= ~a$r_buff1_thd4~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= ~a~0 0)) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 199#(and (= ~a$r_buff1_thd4~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= ~a~0 0)) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 207#(and (= ~a$r_buff1_thd4~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= ~a~0 0)) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 188#(and (= ~a$w_buff0~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 150#(= ~__unbuffered_p3_EAX~0 0), 29#L876true, Black: 170#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 38#L793true, 182#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1) (<= 0 ~main$tmp_guard0~0)), 27#L806true, Black: 178#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 123#(and (not (= |ULTIMATE.start_main_~#t684~0#1.base| |ULTIMATE.start_main_~#t681~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t682~0#1.base| 0) |ULTIMATE.start_main_~#t683~0#1.base| 0) |ULTIMATE.start_main_~#t681~0#1.base| 0) |ULTIMATE.start_main_~#t684~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t683~0#1.base| |ULTIMATE.start_main_~#t682~0#1.base|)) (not (= |ULTIMATE.start_main_~#t682~0#1.base| |ULTIMATE.start_main_~#t681~0#1.base|)) (not (= |ULTIMATE.start_main_~#t683~0#1.base| |ULTIMATE.start_main_~#t681~0#1.base|)) (not (= |ULTIMATE.start_main_~#t684~0#1.base| |ULTIMATE.start_main_~#t682~0#1.base|)) (not (= |ULTIMATE.start_main_~#t684~0#1.base| |ULTIMATE.start_main_~#t683~0#1.base|)))]) [2023-11-26 10:47:22,258 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2023-11-26 10:47:22,258 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-26 10:47:22,258 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-26 10:47:22,258 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-26 10:47:22,385 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([465] L826-->L842: Formula: (let ((.cse11 (= (mod v_~a$r_buff1_thd4~0_64 256) 0)) (.cse4 (= (mod v_~a$r_buff0_thd4~0_66 256) 0))) (let ((.cse6 (not .cse4)) (.cse2 (and .cse11 .cse4)) (.cse7 (and (= (mod v_~a$w_buff1_used~0_127 256) 0) .cse4)) (.cse12 (= (mod v_~a$w_buff0_used~0_134 256) 0))) (let ((.cse8 (or .cse2 .cse7 .cse12)) (.cse9 (and (not .cse12) .cse6))) (let ((.cse1 (ite .cse8 v_~a~0_78 (ite .cse9 v_~a$w_buff0~0_49 v_~a$w_buff1~0_42))) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse3 (= (mod v_~a$w_buff1_used~0_126 256) 0)) (.cse5 (= (mod v_~a$w_buff0_used~0_133 256) 0))) (and (= v_~a~0_78 v_~a$mem_tmp~0_20) (= v_~a$flush_delayed~0_27 0) (= v_~a~0_76 (ite .cse0 v_~a$mem_tmp~0_20 .cse1)) (= v_~a$r_buff0_thd4~0_65 (ite .cse0 v_~a$r_buff0_thd4~0_66 (ite (or .cse2 (and .cse3 .cse4) .cse5) v_~a$r_buff0_thd4~0_66 (ite (and (not .cse5) .cse6) 0 v_~a$r_buff0_thd4~0_66)))) (= .cse1 v_~__unbuffered_p3_EBX~0_12) (= (ite .cse0 v_~a$w_buff1_used~0_127 (ite (or .cse2 .cse7 .cse5) v_~a$w_buff1_used~0_127 0)) v_~a$w_buff1_used~0_126) (= v_~a$w_buff1~0_42 v_~a$w_buff1~0_41) (= (ite .cse0 v_~a$w_buff0_used~0_134 (ite .cse8 v_~a$w_buff0_used~0_134 (ite .cse9 0 v_~a$w_buff0_used~0_134))) v_~a$w_buff0_used~0_133) (= v_~a$w_buff0~0_49 v_~a$w_buff0~0_48) (= (ite .cse0 v_~a$r_buff1_thd4~0_64 (ite (let ((.cse10 (= (mod v_~a$r_buff0_thd4~0_65 256) 0))) (or (and .cse3 .cse10) (and .cse11 .cse10) .cse5)) v_~a$r_buff1_thd4~0_64 0)) v_~a$r_buff1_thd4~0_63)))))) InVars {~a~0=v_~a~0_78, ~a$w_buff1~0=v_~a$w_buff1~0_42, ~a$w_buff0~0=v_~a$w_buff0~0_49, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_64, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_134, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_127, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_66} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_63, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_133, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_12, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_65, P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~a~0=v_~a~0_76, ~a$mem_tmp~0=v_~a$mem_tmp~0_20, ~weak$$choice0~0=v_~weak$$choice0~0_13, ~a$w_buff1~0=v_~a$w_buff1~0_41, ~a$flush_delayed~0=v_~a$flush_delayed~0_27, ~a$w_buff0~0=v_~a$w_buff0~0_48, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_126, ~weak$$choice2~0=v_~weak$$choice2~0_30, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~nondet4, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork2_#t~nondet3][101], [233#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1)), P0Thread1of1ForFork3InUse, P2Thread1of1ForFork0InUse, 186#true, P3Thread1of1ForFork2InUse, 54#L842true, Black: 132#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), P1Thread1of1ForFork1InUse, Black: 128#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 134#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 201#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 189#(and (not (= ~a$w_buff0~0 0)) (= ~a$r_buff1_thd4~0 0) (<= (div ~a$w_buff0_used~0 256) 0) (<= 1 ~a$w_buff0_used~0) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 205#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 190#(and (= ~a$r_buff1_thd4~0 0) (not (= ~a~0 0)) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 192#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 191#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 168#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 197#(and (not (= ~a$w_buff0~0 0)) (= ~a$r_buff1_thd4~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~a$w_buff0_used~0 256) 0) (<= 1 ~a$w_buff0_used~0) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), 45#P0EXITtrue, Black: 203#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 209#(and (= ~a$r_buff1_thd4~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= ~a~0 0)) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 199#(and (= ~a$r_buff1_thd4~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= ~a~0 0)) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 207#(and (= ~a$r_buff1_thd4~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= ~a~0 0)) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 188#(and (= ~a$w_buff0~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 150#(= ~__unbuffered_p3_EAX~0 0), Black: 170#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 38#L793true, 182#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1) (<= 0 ~main$tmp_guard0~0)), 27#L806true, 12#L874true, Black: 178#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 123#(and (not (= |ULTIMATE.start_main_~#t684~0#1.base| |ULTIMATE.start_main_~#t681~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t682~0#1.base| 0) |ULTIMATE.start_main_~#t683~0#1.base| 0) |ULTIMATE.start_main_~#t681~0#1.base| 0) |ULTIMATE.start_main_~#t684~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t683~0#1.base| |ULTIMATE.start_main_~#t682~0#1.base|)) (not (= |ULTIMATE.start_main_~#t682~0#1.base| |ULTIMATE.start_main_~#t681~0#1.base|)) (not (= |ULTIMATE.start_main_~#t683~0#1.base| |ULTIMATE.start_main_~#t681~0#1.base|)) (not (= |ULTIMATE.start_main_~#t684~0#1.base| |ULTIMATE.start_main_~#t682~0#1.base|)) (not (= |ULTIMATE.start_main_~#t684~0#1.base| |ULTIMATE.start_main_~#t683~0#1.base|)))]) [2023-11-26 10:47:22,385 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2023-11-26 10:47:22,386 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-26 10:47:22,386 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-26 10:47:22,386 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-26 10:47:22,386 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-26 10:47:22,394 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([465] L826-->L842: Formula: (let ((.cse11 (= (mod v_~a$r_buff1_thd4~0_64 256) 0)) (.cse4 (= (mod v_~a$r_buff0_thd4~0_66 256) 0))) (let ((.cse6 (not .cse4)) (.cse2 (and .cse11 .cse4)) (.cse7 (and (= (mod v_~a$w_buff1_used~0_127 256) 0) .cse4)) (.cse12 (= (mod v_~a$w_buff0_used~0_134 256) 0))) (let ((.cse8 (or .cse2 .cse7 .cse12)) (.cse9 (and (not .cse12) .cse6))) (let ((.cse1 (ite .cse8 v_~a~0_78 (ite .cse9 v_~a$w_buff0~0_49 v_~a$w_buff1~0_42))) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse3 (= (mod v_~a$w_buff1_used~0_126 256) 0)) (.cse5 (= (mod v_~a$w_buff0_used~0_133 256) 0))) (and (= v_~a~0_78 v_~a$mem_tmp~0_20) (= v_~a$flush_delayed~0_27 0) (= v_~a~0_76 (ite .cse0 v_~a$mem_tmp~0_20 .cse1)) (= v_~a$r_buff0_thd4~0_65 (ite .cse0 v_~a$r_buff0_thd4~0_66 (ite (or .cse2 (and .cse3 .cse4) .cse5) v_~a$r_buff0_thd4~0_66 (ite (and (not .cse5) .cse6) 0 v_~a$r_buff0_thd4~0_66)))) (= .cse1 v_~__unbuffered_p3_EBX~0_12) (= (ite .cse0 v_~a$w_buff1_used~0_127 (ite (or .cse2 .cse7 .cse5) v_~a$w_buff1_used~0_127 0)) v_~a$w_buff1_used~0_126) (= v_~a$w_buff1~0_42 v_~a$w_buff1~0_41) (= (ite .cse0 v_~a$w_buff0_used~0_134 (ite .cse8 v_~a$w_buff0_used~0_134 (ite .cse9 0 v_~a$w_buff0_used~0_134))) v_~a$w_buff0_used~0_133) (= v_~a$w_buff0~0_49 v_~a$w_buff0~0_48) (= (ite .cse0 v_~a$r_buff1_thd4~0_64 (ite (let ((.cse10 (= (mod v_~a$r_buff0_thd4~0_65 256) 0))) (or (and .cse3 .cse10) (and .cse11 .cse10) .cse5)) v_~a$r_buff1_thd4~0_64 0)) v_~a$r_buff1_thd4~0_63)))))) InVars {~a~0=v_~a~0_78, ~a$w_buff1~0=v_~a$w_buff1~0_42, ~a$w_buff0~0=v_~a$w_buff0~0_49, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_64, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_134, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_127, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_66} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_63, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_133, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_12, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_65, P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~a~0=v_~a~0_76, ~a$mem_tmp~0=v_~a$mem_tmp~0_20, ~weak$$choice0~0=v_~weak$$choice0~0_13, ~a$w_buff1~0=v_~a$w_buff1~0_41, ~a$flush_delayed~0=v_~a$flush_delayed~0_27, ~a$w_buff0~0=v_~a$w_buff0~0_48, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_126, ~weak$$choice2~0=v_~weak$$choice2~0_30, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~nondet4, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork2_#t~nondet3][101], [33#L776true, 233#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1)), P0Thread1of1ForFork3InUse, P2Thread1of1ForFork0InUse, 186#true, P3Thread1of1ForFork2InUse, 54#L842true, P1Thread1of1ForFork1InUse, Black: 132#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 128#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 134#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 201#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 189#(and (not (= ~a$w_buff0~0 0)) (= ~a$r_buff1_thd4~0 0) (<= (div ~a$w_buff0_used~0 256) 0) (<= 1 ~a$w_buff0_used~0) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 205#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 190#(and (= ~a$r_buff1_thd4~0 0) (not (= ~a~0 0)) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 192#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 191#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 168#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 197#(and (not (= ~a$w_buff0~0 0)) (= ~a$r_buff1_thd4~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~a$w_buff0_used~0 256) 0) (<= 1 ~a$w_buff0_used~0) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 203#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 209#(and (= ~a$r_buff1_thd4~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= ~a~0 0)) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 199#(and (= ~a$r_buff1_thd4~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= ~a~0 0)) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 207#(and (= ~a$r_buff1_thd4~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= ~a~0 0)) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 188#(and (= ~a$w_buff0~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 150#(= ~__unbuffered_p3_EAX~0 0), 29#L876true, Black: 170#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 38#L793true, 182#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1) (<= 0 ~main$tmp_guard0~0)), 27#L806true, Black: 178#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 123#(and (not (= |ULTIMATE.start_main_~#t684~0#1.base| |ULTIMATE.start_main_~#t681~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t682~0#1.base| 0) |ULTIMATE.start_main_~#t683~0#1.base| 0) |ULTIMATE.start_main_~#t681~0#1.base| 0) |ULTIMATE.start_main_~#t684~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t683~0#1.base| |ULTIMATE.start_main_~#t682~0#1.base|)) (not (= |ULTIMATE.start_main_~#t682~0#1.base| |ULTIMATE.start_main_~#t681~0#1.base|)) (not (= |ULTIMATE.start_main_~#t683~0#1.base| |ULTIMATE.start_main_~#t681~0#1.base|)) (not (= |ULTIMATE.start_main_~#t684~0#1.base| |ULTIMATE.start_main_~#t682~0#1.base|)) (not (= |ULTIMATE.start_main_~#t684~0#1.base| |ULTIMATE.start_main_~#t683~0#1.base|)))]) [2023-11-26 10:47:22,394 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2023-11-26 10:47:22,394 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-26 10:47:22,394 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-26 10:47:22,394 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-26 10:47:22,395 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-26 10:47:22,396 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([465] L826-->L842: Formula: (let ((.cse11 (= (mod v_~a$r_buff1_thd4~0_64 256) 0)) (.cse4 (= (mod v_~a$r_buff0_thd4~0_66 256) 0))) (let ((.cse6 (not .cse4)) (.cse2 (and .cse11 .cse4)) (.cse7 (and (= (mod v_~a$w_buff1_used~0_127 256) 0) .cse4)) (.cse12 (= (mod v_~a$w_buff0_used~0_134 256) 0))) (let ((.cse8 (or .cse2 .cse7 .cse12)) (.cse9 (and (not .cse12) .cse6))) (let ((.cse1 (ite .cse8 v_~a~0_78 (ite .cse9 v_~a$w_buff0~0_49 v_~a$w_buff1~0_42))) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse3 (= (mod v_~a$w_buff1_used~0_126 256) 0)) (.cse5 (= (mod v_~a$w_buff0_used~0_133 256) 0))) (and (= v_~a~0_78 v_~a$mem_tmp~0_20) (= v_~a$flush_delayed~0_27 0) (= v_~a~0_76 (ite .cse0 v_~a$mem_tmp~0_20 .cse1)) (= v_~a$r_buff0_thd4~0_65 (ite .cse0 v_~a$r_buff0_thd4~0_66 (ite (or .cse2 (and .cse3 .cse4) .cse5) v_~a$r_buff0_thd4~0_66 (ite (and (not .cse5) .cse6) 0 v_~a$r_buff0_thd4~0_66)))) (= .cse1 v_~__unbuffered_p3_EBX~0_12) (= (ite .cse0 v_~a$w_buff1_used~0_127 (ite (or .cse2 .cse7 .cse5) v_~a$w_buff1_used~0_127 0)) v_~a$w_buff1_used~0_126) (= v_~a$w_buff1~0_42 v_~a$w_buff1~0_41) (= (ite .cse0 v_~a$w_buff0_used~0_134 (ite .cse8 v_~a$w_buff0_used~0_134 (ite .cse9 0 v_~a$w_buff0_used~0_134))) v_~a$w_buff0_used~0_133) (= v_~a$w_buff0~0_49 v_~a$w_buff0~0_48) (= (ite .cse0 v_~a$r_buff1_thd4~0_64 (ite (let ((.cse10 (= (mod v_~a$r_buff0_thd4~0_65 256) 0))) (or (and .cse3 .cse10) (and .cse11 .cse10) .cse5)) v_~a$r_buff1_thd4~0_64 0)) v_~a$r_buff1_thd4~0_63)))))) InVars {~a~0=v_~a~0_78, ~a$w_buff1~0=v_~a$w_buff1~0_42, ~a$w_buff0~0=v_~a$w_buff0~0_49, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_64, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_134, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_127, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_66} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_63, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_133, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_12, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_65, P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~a~0=v_~a~0_76, ~a$mem_tmp~0=v_~a$mem_tmp~0_20, ~weak$$choice0~0=v_~weak$$choice0~0_13, ~a$w_buff1~0=v_~a$w_buff1~0_41, ~a$flush_delayed~0=v_~a$flush_delayed~0_27, ~a$w_buff0~0=v_~a$w_buff0~0_48, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_126, ~weak$$choice2~0=v_~weak$$choice2~0_30, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~nondet4, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork2_#t~nondet3][101], [33#L776true, 233#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1)), P0Thread1of1ForFork3InUse, 186#true, P2Thread1of1ForFork0InUse, P3Thread1of1ForFork2InUse, 54#L842true, P1Thread1of1ForFork1InUse, Black: 132#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 128#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 134#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 201#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 189#(and (not (= ~a$w_buff0~0 0)) (= ~a$r_buff1_thd4~0 0) (<= (div ~a$w_buff0_used~0 256) 0) (<= 1 ~a$w_buff0_used~0) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 205#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 190#(and (= ~a$r_buff1_thd4~0 0) (not (= ~a~0 0)) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 192#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 191#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 197#(and (not (= ~a$w_buff0~0 0)) (= ~a$r_buff1_thd4~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~a$w_buff0_used~0 256) 0) (<= 1 ~a$w_buff0_used~0) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 203#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 209#(and (= ~a$r_buff1_thd4~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= ~a~0 0)) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 199#(and (= ~a$r_buff1_thd4~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= ~a~0 0)) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 207#(and (= ~a$r_buff1_thd4~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= ~a~0 0)) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 188#(and (= ~a$w_buff0~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 150#(= ~__unbuffered_p3_EAX~0 0), 29#L876true, Black: 170#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 168#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 38#L793true, 182#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1) (<= 0 ~main$tmp_guard0~0)), 27#L806true, Black: 178#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 123#(and (not (= |ULTIMATE.start_main_~#t684~0#1.base| |ULTIMATE.start_main_~#t681~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t682~0#1.base| 0) |ULTIMATE.start_main_~#t683~0#1.base| 0) |ULTIMATE.start_main_~#t681~0#1.base| 0) |ULTIMATE.start_main_~#t684~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t683~0#1.base| |ULTIMATE.start_main_~#t682~0#1.base|)) (not (= |ULTIMATE.start_main_~#t682~0#1.base| |ULTIMATE.start_main_~#t681~0#1.base|)) (not (= |ULTIMATE.start_main_~#t683~0#1.base| |ULTIMATE.start_main_~#t681~0#1.base|)) (not (= |ULTIMATE.start_main_~#t684~0#1.base| |ULTIMATE.start_main_~#t682~0#1.base|)) (not (= |ULTIMATE.start_main_~#t684~0#1.base| |ULTIMATE.start_main_~#t683~0#1.base|)))]) [2023-11-26 10:47:22,396 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2023-11-26 10:47:22,396 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-26 10:47:22,396 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-26 10:47:22,396 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-26 10:47:22,397 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-26 10:47:22,836 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([465] L826-->L842: Formula: (let ((.cse11 (= (mod v_~a$r_buff1_thd4~0_64 256) 0)) (.cse4 (= (mod v_~a$r_buff0_thd4~0_66 256) 0))) (let ((.cse6 (not .cse4)) (.cse2 (and .cse11 .cse4)) (.cse7 (and (= (mod v_~a$w_buff1_used~0_127 256) 0) .cse4)) (.cse12 (= (mod v_~a$w_buff0_used~0_134 256) 0))) (let ((.cse8 (or .cse2 .cse7 .cse12)) (.cse9 (and (not .cse12) .cse6))) (let ((.cse1 (ite .cse8 v_~a~0_78 (ite .cse9 v_~a$w_buff0~0_49 v_~a$w_buff1~0_42))) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse3 (= (mod v_~a$w_buff1_used~0_126 256) 0)) (.cse5 (= (mod v_~a$w_buff0_used~0_133 256) 0))) (and (= v_~a~0_78 v_~a$mem_tmp~0_20) (= v_~a$flush_delayed~0_27 0) (= v_~a~0_76 (ite .cse0 v_~a$mem_tmp~0_20 .cse1)) (= v_~a$r_buff0_thd4~0_65 (ite .cse0 v_~a$r_buff0_thd4~0_66 (ite (or .cse2 (and .cse3 .cse4) .cse5) v_~a$r_buff0_thd4~0_66 (ite (and (not .cse5) .cse6) 0 v_~a$r_buff0_thd4~0_66)))) (= .cse1 v_~__unbuffered_p3_EBX~0_12) (= (ite .cse0 v_~a$w_buff1_used~0_127 (ite (or .cse2 .cse7 .cse5) v_~a$w_buff1_used~0_127 0)) v_~a$w_buff1_used~0_126) (= v_~a$w_buff1~0_42 v_~a$w_buff1~0_41) (= (ite .cse0 v_~a$w_buff0_used~0_134 (ite .cse8 v_~a$w_buff0_used~0_134 (ite .cse9 0 v_~a$w_buff0_used~0_134))) v_~a$w_buff0_used~0_133) (= v_~a$w_buff0~0_49 v_~a$w_buff0~0_48) (= (ite .cse0 v_~a$r_buff1_thd4~0_64 (ite (let ((.cse10 (= (mod v_~a$r_buff0_thd4~0_65 256) 0))) (or (and .cse3 .cse10) (and .cse11 .cse10) .cse5)) v_~a$r_buff1_thd4~0_64 0)) v_~a$r_buff1_thd4~0_63)))))) InVars {~a~0=v_~a~0_78, ~a$w_buff1~0=v_~a$w_buff1~0_42, ~a$w_buff0~0=v_~a$w_buff0~0_49, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_64, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_134, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_127, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_66} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_63, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_133, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_12, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_65, P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~a~0=v_~a~0_76, ~a$mem_tmp~0=v_~a$mem_tmp~0_20, ~weak$$choice0~0=v_~weak$$choice0~0_13, ~a$w_buff1~0=v_~a$w_buff1~0_41, ~a$flush_delayed~0=v_~a$flush_delayed~0_27, ~a$w_buff0~0=v_~a$w_buff0~0_48, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_126, ~weak$$choice2~0=v_~weak$$choice2~0_30, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~nondet4, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork2_#t~nondet3][121], [P0Thread1of1ForFork3InUse, P2Thread1of1ForFork0InUse, 186#true, P3Thread1of1ForFork2InUse, 54#L842true, Black: 132#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), P1Thread1of1ForFork1InUse, Black: 128#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 134#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 201#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 189#(and (not (= ~a$w_buff0~0 0)) (= ~a$r_buff1_thd4~0 0) (<= (div ~a$w_buff0_used~0 256) 0) (<= 1 ~a$w_buff0_used~0) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 205#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 190#(and (= ~a$r_buff1_thd4~0 0) (not (= ~a~0 0)) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 192#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 191#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 168#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 197#(and (not (= ~a$w_buff0~0 0)) (= ~a$r_buff1_thd4~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~a$w_buff0_used~0 256) 0) (<= 1 ~a$w_buff0_used~0) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), 45#P0EXITtrue, Black: 203#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 209#(and (= ~a$r_buff1_thd4~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= ~a~0 0)) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 199#(and (= ~a$r_buff1_thd4~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= ~a~0 0)) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 207#(and (= ~a$r_buff1_thd4~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= ~a~0 0)) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 188#(and (= ~a$w_buff0~0 0) (= ~a$r_buff0_thd4~0 0)), 235#(and (<= ~__unbuffered_cnt~0 2) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), Black: 150#(= ~__unbuffered_p3_EAX~0 0), Black: 170#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 40#L796true, 27#L806true, Black: 182#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1) (<= 0 ~main$tmp_guard0~0)), 12#L874true, 123#(and (not (= |ULTIMATE.start_main_~#t684~0#1.base| |ULTIMATE.start_main_~#t681~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t682~0#1.base| 0) |ULTIMATE.start_main_~#t683~0#1.base| 0) |ULTIMATE.start_main_~#t681~0#1.base| 0) |ULTIMATE.start_main_~#t684~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t683~0#1.base| |ULTIMATE.start_main_~#t682~0#1.base|)) (not (= |ULTIMATE.start_main_~#t682~0#1.base| |ULTIMATE.start_main_~#t681~0#1.base|)) (not (= |ULTIMATE.start_main_~#t683~0#1.base| |ULTIMATE.start_main_~#t681~0#1.base|)) (not (= |ULTIMATE.start_main_~#t684~0#1.base| |ULTIMATE.start_main_~#t682~0#1.base|)) (not (= |ULTIMATE.start_main_~#t684~0#1.base| |ULTIMATE.start_main_~#t683~0#1.base|))), 178#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0))]) [2023-11-26 10:47:22,837 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2023-11-26 10:47:22,837 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-26 10:47:22,837 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-26 10:47:22,837 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-26 10:47:22,838 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([465] L826-->L842: Formula: (let ((.cse11 (= (mod v_~a$r_buff1_thd4~0_64 256) 0)) (.cse4 (= (mod v_~a$r_buff0_thd4~0_66 256) 0))) (let ((.cse6 (not .cse4)) (.cse2 (and .cse11 .cse4)) (.cse7 (and (= (mod v_~a$w_buff1_used~0_127 256) 0) .cse4)) (.cse12 (= (mod v_~a$w_buff0_used~0_134 256) 0))) (let ((.cse8 (or .cse2 .cse7 .cse12)) (.cse9 (and (not .cse12) .cse6))) (let ((.cse1 (ite .cse8 v_~a~0_78 (ite .cse9 v_~a$w_buff0~0_49 v_~a$w_buff1~0_42))) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse3 (= (mod v_~a$w_buff1_used~0_126 256) 0)) (.cse5 (= (mod v_~a$w_buff0_used~0_133 256) 0))) (and (= v_~a~0_78 v_~a$mem_tmp~0_20) (= v_~a$flush_delayed~0_27 0) (= v_~a~0_76 (ite .cse0 v_~a$mem_tmp~0_20 .cse1)) (= v_~a$r_buff0_thd4~0_65 (ite .cse0 v_~a$r_buff0_thd4~0_66 (ite (or .cse2 (and .cse3 .cse4) .cse5) v_~a$r_buff0_thd4~0_66 (ite (and (not .cse5) .cse6) 0 v_~a$r_buff0_thd4~0_66)))) (= .cse1 v_~__unbuffered_p3_EBX~0_12) (= (ite .cse0 v_~a$w_buff1_used~0_127 (ite (or .cse2 .cse7 .cse5) v_~a$w_buff1_used~0_127 0)) v_~a$w_buff1_used~0_126) (= v_~a$w_buff1~0_42 v_~a$w_buff1~0_41) (= (ite .cse0 v_~a$w_buff0_used~0_134 (ite .cse8 v_~a$w_buff0_used~0_134 (ite .cse9 0 v_~a$w_buff0_used~0_134))) v_~a$w_buff0_used~0_133) (= v_~a$w_buff0~0_49 v_~a$w_buff0~0_48) (= (ite .cse0 v_~a$r_buff1_thd4~0_64 (ite (let ((.cse10 (= (mod v_~a$r_buff0_thd4~0_65 256) 0))) (or (and .cse3 .cse10) (and .cse11 .cse10) .cse5)) v_~a$r_buff1_thd4~0_64 0)) v_~a$r_buff1_thd4~0_63)))))) InVars {~a~0=v_~a~0_78, ~a$w_buff1~0=v_~a$w_buff1~0_42, ~a$w_buff0~0=v_~a$w_buff0~0_49, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_64, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_134, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_127, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_66} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_63, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_133, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_12, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_65, P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~a~0=v_~a~0_76, ~a$mem_tmp~0=v_~a$mem_tmp~0_20, ~weak$$choice0~0=v_~weak$$choice0~0_13, ~a$w_buff1~0=v_~a$w_buff1~0_41, ~a$flush_delayed~0=v_~a$flush_delayed~0_27, ~a$w_buff0~0=v_~a$w_buff0~0_48, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_126, ~weak$$choice2~0=v_~weak$$choice2~0_30, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~nondet4, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork2_#t~nondet3][101], [233#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1)), P0Thread1of1ForFork3InUse, P2Thread1of1ForFork0InUse, 186#true, P3Thread1of1ForFork2InUse, 54#L842true, Black: 132#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), P1Thread1of1ForFork1InUse, Black: 128#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 134#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 201#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 189#(and (not (= ~a$w_buff0~0 0)) (= ~a$r_buff1_thd4~0 0) (<= (div ~a$w_buff0_used~0 256) 0) (<= 1 ~a$w_buff0_used~0) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 205#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 190#(and (= ~a$r_buff1_thd4~0 0) (not (= ~a~0 0)) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 192#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 191#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 197#(and (not (= ~a$w_buff0~0 0)) (= ~a$r_buff1_thd4~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~a$w_buff0_used~0 256) 0) (<= 1 ~a$w_buff0_used~0) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), 45#P0EXITtrue, Black: 203#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 209#(and (= ~a$r_buff1_thd4~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= ~a~0 0)) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 199#(and (= ~a$r_buff1_thd4~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= ~a~0 0)) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 207#(and (= ~a$r_buff1_thd4~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= ~a~0 0)) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 188#(and (= ~a$w_buff0~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 150#(= ~__unbuffered_p3_EAX~0 0), 29#L876true, Black: 170#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 168#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 38#L793true, 182#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1) (<= 0 ~main$tmp_guard0~0)), 27#L806true, Black: 178#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 123#(and (not (= |ULTIMATE.start_main_~#t684~0#1.base| |ULTIMATE.start_main_~#t681~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t682~0#1.base| 0) |ULTIMATE.start_main_~#t683~0#1.base| 0) |ULTIMATE.start_main_~#t681~0#1.base| 0) |ULTIMATE.start_main_~#t684~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t683~0#1.base| |ULTIMATE.start_main_~#t682~0#1.base|)) (not (= |ULTIMATE.start_main_~#t682~0#1.base| |ULTIMATE.start_main_~#t681~0#1.base|)) (not (= |ULTIMATE.start_main_~#t683~0#1.base| |ULTIMATE.start_main_~#t681~0#1.base|)) (not (= |ULTIMATE.start_main_~#t684~0#1.base| |ULTIMATE.start_main_~#t682~0#1.base|)) (not (= |ULTIMATE.start_main_~#t684~0#1.base| |ULTIMATE.start_main_~#t683~0#1.base|)))]) [2023-11-26 10:47:22,838 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2023-11-26 10:47:22,838 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-26 10:47:22,838 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-26 10:47:22,838 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-26 10:47:22,848 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([465] L826-->L842: Formula: (let ((.cse11 (= (mod v_~a$r_buff1_thd4~0_64 256) 0)) (.cse4 (= (mod v_~a$r_buff0_thd4~0_66 256) 0))) (let ((.cse6 (not .cse4)) (.cse2 (and .cse11 .cse4)) (.cse7 (and (= (mod v_~a$w_buff1_used~0_127 256) 0) .cse4)) (.cse12 (= (mod v_~a$w_buff0_used~0_134 256) 0))) (let ((.cse8 (or .cse2 .cse7 .cse12)) (.cse9 (and (not .cse12) .cse6))) (let ((.cse1 (ite .cse8 v_~a~0_78 (ite .cse9 v_~a$w_buff0~0_49 v_~a$w_buff1~0_42))) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse3 (= (mod v_~a$w_buff1_used~0_126 256) 0)) (.cse5 (= (mod v_~a$w_buff0_used~0_133 256) 0))) (and (= v_~a~0_78 v_~a$mem_tmp~0_20) (= v_~a$flush_delayed~0_27 0) (= v_~a~0_76 (ite .cse0 v_~a$mem_tmp~0_20 .cse1)) (= v_~a$r_buff0_thd4~0_65 (ite .cse0 v_~a$r_buff0_thd4~0_66 (ite (or .cse2 (and .cse3 .cse4) .cse5) v_~a$r_buff0_thd4~0_66 (ite (and (not .cse5) .cse6) 0 v_~a$r_buff0_thd4~0_66)))) (= .cse1 v_~__unbuffered_p3_EBX~0_12) (= (ite .cse0 v_~a$w_buff1_used~0_127 (ite (or .cse2 .cse7 .cse5) v_~a$w_buff1_used~0_127 0)) v_~a$w_buff1_used~0_126) (= v_~a$w_buff1~0_42 v_~a$w_buff1~0_41) (= (ite .cse0 v_~a$w_buff0_used~0_134 (ite .cse8 v_~a$w_buff0_used~0_134 (ite .cse9 0 v_~a$w_buff0_used~0_134))) v_~a$w_buff0_used~0_133) (= v_~a$w_buff0~0_49 v_~a$w_buff0~0_48) (= (ite .cse0 v_~a$r_buff1_thd4~0_64 (ite (let ((.cse10 (= (mod v_~a$r_buff0_thd4~0_65 256) 0))) (or (and .cse3 .cse10) (and .cse11 .cse10) .cse5)) v_~a$r_buff1_thd4~0_64 0)) v_~a$r_buff1_thd4~0_63)))))) InVars {~a~0=v_~a~0_78, ~a$w_buff1~0=v_~a$w_buff1~0_42, ~a$w_buff0~0=v_~a$w_buff0~0_49, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_64, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_134, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_127, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_66} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_63, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_133, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_12, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_65, P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~a~0=v_~a~0_76, ~a$mem_tmp~0=v_~a$mem_tmp~0_20, ~weak$$choice0~0=v_~weak$$choice0~0_13, ~a$w_buff1~0=v_~a$w_buff1~0_41, ~a$flush_delayed~0=v_~a$flush_delayed~0_27, ~a$w_buff0~0=v_~a$w_buff0~0_48, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_126, ~weak$$choice2~0=v_~weak$$choice2~0_30, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~nondet4, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork2_#t~nondet3][121], [30#P1EXITtrue, P0Thread1of1ForFork3InUse, P2Thread1of1ForFork0InUse, 186#true, P3Thread1of1ForFork2InUse, 54#L842true, Black: 132#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), P1Thread1of1ForFork1InUse, Black: 128#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 134#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 201#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 189#(and (not (= ~a$w_buff0~0 0)) (= ~a$r_buff1_thd4~0 0) (<= (div ~a$w_buff0_used~0 256) 0) (<= 1 ~a$w_buff0_used~0) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 205#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 190#(and (= ~a$r_buff1_thd4~0 0) (not (= ~a~0 0)) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 192#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 191#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 168#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 197#(and (not (= ~a$w_buff0~0 0)) (= ~a$r_buff1_thd4~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~a$w_buff0_used~0 256) 0) (<= 1 ~a$w_buff0_used~0) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), 45#P0EXITtrue, Black: 203#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 209#(and (= ~a$r_buff1_thd4~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= ~a~0 0)) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 199#(and (= ~a$r_buff1_thd4~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= ~a~0 0)) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 207#(and (= ~a$r_buff1_thd4~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= ~a~0 0)) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 188#(and (= ~a$w_buff0~0 0) (= ~a$r_buff0_thd4~0 0)), 235#(and (<= ~__unbuffered_cnt~0 2) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), Black: 150#(= ~__unbuffered_p3_EAX~0 0), 36#L873-3true, Black: 170#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 27#L806true, Black: 182#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1) (<= 0 ~main$tmp_guard0~0)), 123#(and (not (= |ULTIMATE.start_main_~#t684~0#1.base| |ULTIMATE.start_main_~#t681~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t682~0#1.base| 0) |ULTIMATE.start_main_~#t683~0#1.base| 0) |ULTIMATE.start_main_~#t681~0#1.base| 0) |ULTIMATE.start_main_~#t684~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t683~0#1.base| |ULTIMATE.start_main_~#t682~0#1.base|)) (not (= |ULTIMATE.start_main_~#t682~0#1.base| |ULTIMATE.start_main_~#t681~0#1.base|)) (not (= |ULTIMATE.start_main_~#t683~0#1.base| |ULTIMATE.start_main_~#t681~0#1.base|)) (not (= |ULTIMATE.start_main_~#t684~0#1.base| |ULTIMATE.start_main_~#t682~0#1.base|)) (not (= |ULTIMATE.start_main_~#t684~0#1.base| |ULTIMATE.start_main_~#t683~0#1.base|))), 178#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0))]) [2023-11-26 10:47:22,848 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2023-11-26 10:47:22,848 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-26 10:47:22,848 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-26 10:47:22,849 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-26 10:47:22,933 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([465] L826-->L842: Formula: (let ((.cse11 (= (mod v_~a$r_buff1_thd4~0_64 256) 0)) (.cse4 (= (mod v_~a$r_buff0_thd4~0_66 256) 0))) (let ((.cse6 (not .cse4)) (.cse2 (and .cse11 .cse4)) (.cse7 (and (= (mod v_~a$w_buff1_used~0_127 256) 0) .cse4)) (.cse12 (= (mod v_~a$w_buff0_used~0_134 256) 0))) (let ((.cse8 (or .cse2 .cse7 .cse12)) (.cse9 (and (not .cse12) .cse6))) (let ((.cse1 (ite .cse8 v_~a~0_78 (ite .cse9 v_~a$w_buff0~0_49 v_~a$w_buff1~0_42))) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse3 (= (mod v_~a$w_buff1_used~0_126 256) 0)) (.cse5 (= (mod v_~a$w_buff0_used~0_133 256) 0))) (and (= v_~a~0_78 v_~a$mem_tmp~0_20) (= v_~a$flush_delayed~0_27 0) (= v_~a~0_76 (ite .cse0 v_~a$mem_tmp~0_20 .cse1)) (= v_~a$r_buff0_thd4~0_65 (ite .cse0 v_~a$r_buff0_thd4~0_66 (ite (or .cse2 (and .cse3 .cse4) .cse5) v_~a$r_buff0_thd4~0_66 (ite (and (not .cse5) .cse6) 0 v_~a$r_buff0_thd4~0_66)))) (= .cse1 v_~__unbuffered_p3_EBX~0_12) (= (ite .cse0 v_~a$w_buff1_used~0_127 (ite (or .cse2 .cse7 .cse5) v_~a$w_buff1_used~0_127 0)) v_~a$w_buff1_used~0_126) (= v_~a$w_buff1~0_42 v_~a$w_buff1~0_41) (= (ite .cse0 v_~a$w_buff0_used~0_134 (ite .cse8 v_~a$w_buff0_used~0_134 (ite .cse9 0 v_~a$w_buff0_used~0_134))) v_~a$w_buff0_used~0_133) (= v_~a$w_buff0~0_49 v_~a$w_buff0~0_48) (= (ite .cse0 v_~a$r_buff1_thd4~0_64 (ite (let ((.cse10 (= (mod v_~a$r_buff0_thd4~0_65 256) 0))) (or (and .cse3 .cse10) (and .cse11 .cse10) .cse5)) v_~a$r_buff1_thd4~0_64 0)) v_~a$r_buff1_thd4~0_63)))))) InVars {~a~0=v_~a~0_78, ~a$w_buff1~0=v_~a$w_buff1~0_42, ~a$w_buff0~0=v_~a$w_buff0~0_49, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_64, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_134, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_127, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_66} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_63, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_133, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_12, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_65, P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~a~0=v_~a~0_76, ~a$mem_tmp~0=v_~a$mem_tmp~0_20, ~weak$$choice0~0=v_~weak$$choice0~0_13, ~a$w_buff1~0=v_~a$w_buff1~0_41, ~a$flush_delayed~0=v_~a$flush_delayed~0_27, ~a$w_buff0~0=v_~a$w_buff0~0_48, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_126, ~weak$$choice2~0=v_~weak$$choice2~0_30, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~nondet4, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork2_#t~nondet3][101], [233#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1)), P0Thread1of1ForFork3InUse, P2Thread1of1ForFork0InUse, 186#true, P3Thread1of1ForFork2InUse, 54#L842true, Black: 132#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), P1Thread1of1ForFork1InUse, Black: 128#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 134#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 201#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 189#(and (not (= ~a$w_buff0~0 0)) (= ~a$r_buff1_thd4~0 0) (<= (div ~a$w_buff0_used~0 256) 0) (<= 1 ~a$w_buff0_used~0) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 205#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 190#(and (= ~a$r_buff1_thd4~0 0) (not (= ~a~0 0)) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 192#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 191#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 197#(and (not (= ~a$w_buff0~0 0)) (= ~a$r_buff1_thd4~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~a$w_buff0_used~0 256) 0) (<= 1 ~a$w_buff0_used~0) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), 168#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 203#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 45#P0EXITtrue, Black: 209#(and (= ~a$r_buff1_thd4~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= ~a~0 0)) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 199#(and (= ~a$r_buff1_thd4~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= ~a~0 0)) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 207#(and (= ~a$r_buff1_thd4~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= ~a~0 0)) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 188#(and (= ~a$w_buff0~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 150#(= ~__unbuffered_p3_EAX~0 0), 29#L876true, Black: 170#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 38#L793true, 182#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1) (<= 0 ~main$tmp_guard0~0)), 27#L806true, Black: 178#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 123#(and (not (= |ULTIMATE.start_main_~#t684~0#1.base| |ULTIMATE.start_main_~#t681~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t682~0#1.base| 0) |ULTIMATE.start_main_~#t683~0#1.base| 0) |ULTIMATE.start_main_~#t681~0#1.base| 0) |ULTIMATE.start_main_~#t684~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t683~0#1.base| |ULTIMATE.start_main_~#t682~0#1.base|)) (not (= |ULTIMATE.start_main_~#t682~0#1.base| |ULTIMATE.start_main_~#t681~0#1.base|)) (not (= |ULTIMATE.start_main_~#t683~0#1.base| |ULTIMATE.start_main_~#t681~0#1.base|)) (not (= |ULTIMATE.start_main_~#t684~0#1.base| |ULTIMATE.start_main_~#t682~0#1.base|)) (not (= |ULTIMATE.start_main_~#t684~0#1.base| |ULTIMATE.start_main_~#t683~0#1.base|)))]) [2023-11-26 10:47:22,933 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2023-11-26 10:47:22,934 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-26 10:47:22,934 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-26 10:47:22,934 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-26 10:47:22,934 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([465] L826-->L842: Formula: (let ((.cse11 (= (mod v_~a$r_buff1_thd4~0_64 256) 0)) (.cse4 (= (mod v_~a$r_buff0_thd4~0_66 256) 0))) (let ((.cse6 (not .cse4)) (.cse2 (and .cse11 .cse4)) (.cse7 (and (= (mod v_~a$w_buff1_used~0_127 256) 0) .cse4)) (.cse12 (= (mod v_~a$w_buff0_used~0_134 256) 0))) (let ((.cse8 (or .cse2 .cse7 .cse12)) (.cse9 (and (not .cse12) .cse6))) (let ((.cse1 (ite .cse8 v_~a~0_78 (ite .cse9 v_~a$w_buff0~0_49 v_~a$w_buff1~0_42))) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse3 (= (mod v_~a$w_buff1_used~0_126 256) 0)) (.cse5 (= (mod v_~a$w_buff0_used~0_133 256) 0))) (and (= v_~a~0_78 v_~a$mem_tmp~0_20) (= v_~a$flush_delayed~0_27 0) (= v_~a~0_76 (ite .cse0 v_~a$mem_tmp~0_20 .cse1)) (= v_~a$r_buff0_thd4~0_65 (ite .cse0 v_~a$r_buff0_thd4~0_66 (ite (or .cse2 (and .cse3 .cse4) .cse5) v_~a$r_buff0_thd4~0_66 (ite (and (not .cse5) .cse6) 0 v_~a$r_buff0_thd4~0_66)))) (= .cse1 v_~__unbuffered_p3_EBX~0_12) (= (ite .cse0 v_~a$w_buff1_used~0_127 (ite (or .cse2 .cse7 .cse5) v_~a$w_buff1_used~0_127 0)) v_~a$w_buff1_used~0_126) (= v_~a$w_buff1~0_42 v_~a$w_buff1~0_41) (= (ite .cse0 v_~a$w_buff0_used~0_134 (ite .cse8 v_~a$w_buff0_used~0_134 (ite .cse9 0 v_~a$w_buff0_used~0_134))) v_~a$w_buff0_used~0_133) (= v_~a$w_buff0~0_49 v_~a$w_buff0~0_48) (= (ite .cse0 v_~a$r_buff1_thd4~0_64 (ite (let ((.cse10 (= (mod v_~a$r_buff0_thd4~0_65 256) 0))) (or (and .cse3 .cse10) (and .cse11 .cse10) .cse5)) v_~a$r_buff1_thd4~0_64 0)) v_~a$r_buff1_thd4~0_63)))))) InVars {~a~0=v_~a~0_78, ~a$w_buff1~0=v_~a$w_buff1~0_42, ~a$w_buff0~0=v_~a$w_buff0~0_49, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_64, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_134, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_127, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_66} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_63, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_133, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_12, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_65, P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~a~0=v_~a~0_76, ~a$mem_tmp~0=v_~a$mem_tmp~0_20, ~weak$$choice0~0=v_~weak$$choice0~0_13, ~a$w_buff1~0=v_~a$w_buff1~0_41, ~a$flush_delayed~0=v_~a$flush_delayed~0_27, ~a$w_buff0~0=v_~a$w_buff0~0_48, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_126, ~weak$$choice2~0=v_~weak$$choice2~0_30, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~nondet4, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork2_#t~nondet3][121], [33#L776true, P0Thread1of1ForFork3InUse, 186#true, P2Thread1of1ForFork0InUse, P3Thread1of1ForFork2InUse, 54#L842true, P1Thread1of1ForFork1InUse, Black: 132#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 128#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 134#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 201#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 189#(and (not (= ~a$w_buff0~0 0)) (= ~a$r_buff1_thd4~0 0) (<= (div ~a$w_buff0_used~0 256) 0) (<= 1 ~a$w_buff0_used~0) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 205#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 190#(and (= ~a$r_buff1_thd4~0 0) (not (= ~a~0 0)) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 192#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 191#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 197#(and (not (= ~a$w_buff0~0 0)) (= ~a$r_buff1_thd4~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~a$w_buff0_used~0 256) 0) (<= 1 ~a$w_buff0_used~0) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), 168#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 203#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 209#(and (= ~a$r_buff1_thd4~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= ~a~0 0)) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 199#(and (= ~a$r_buff1_thd4~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= ~a~0 0)) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 207#(and (= ~a$r_buff1_thd4~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= ~a~0 0)) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 188#(and (= ~a$w_buff0~0 0) (= ~a$r_buff0_thd4~0 0)), 235#(and (<= ~__unbuffered_cnt~0 2) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), Black: 150#(= ~__unbuffered_p3_EAX~0 0), 29#L876true, Black: 170#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 40#L796true, 27#L806true, Black: 182#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1) (<= 0 ~main$tmp_guard0~0)), 123#(and (not (= |ULTIMATE.start_main_~#t684~0#1.base| |ULTIMATE.start_main_~#t681~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t682~0#1.base| 0) |ULTIMATE.start_main_~#t683~0#1.base| 0) |ULTIMATE.start_main_~#t681~0#1.base| 0) |ULTIMATE.start_main_~#t684~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t683~0#1.base| |ULTIMATE.start_main_~#t682~0#1.base|)) (not (= |ULTIMATE.start_main_~#t682~0#1.base| |ULTIMATE.start_main_~#t681~0#1.base|)) (not (= |ULTIMATE.start_main_~#t683~0#1.base| |ULTIMATE.start_main_~#t681~0#1.base|)) (not (= |ULTIMATE.start_main_~#t684~0#1.base| |ULTIMATE.start_main_~#t682~0#1.base|)) (not (= |ULTIMATE.start_main_~#t684~0#1.base| |ULTIMATE.start_main_~#t683~0#1.base|))), 178#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0))]) [2023-11-26 10:47:22,935 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2023-11-26 10:47:22,935 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-26 10:47:22,935 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-26 10:47:22,935 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-26 10:47:22,936 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([465] L826-->L842: Formula: (let ((.cse11 (= (mod v_~a$r_buff1_thd4~0_64 256) 0)) (.cse4 (= (mod v_~a$r_buff0_thd4~0_66 256) 0))) (let ((.cse6 (not .cse4)) (.cse2 (and .cse11 .cse4)) (.cse7 (and (= (mod v_~a$w_buff1_used~0_127 256) 0) .cse4)) (.cse12 (= (mod v_~a$w_buff0_used~0_134 256) 0))) (let ((.cse8 (or .cse2 .cse7 .cse12)) (.cse9 (and (not .cse12) .cse6))) (let ((.cse1 (ite .cse8 v_~a~0_78 (ite .cse9 v_~a$w_buff0~0_49 v_~a$w_buff1~0_42))) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse3 (= (mod v_~a$w_buff1_used~0_126 256) 0)) (.cse5 (= (mod v_~a$w_buff0_used~0_133 256) 0))) (and (= v_~a~0_78 v_~a$mem_tmp~0_20) (= v_~a$flush_delayed~0_27 0) (= v_~a~0_76 (ite .cse0 v_~a$mem_tmp~0_20 .cse1)) (= v_~a$r_buff0_thd4~0_65 (ite .cse0 v_~a$r_buff0_thd4~0_66 (ite (or .cse2 (and .cse3 .cse4) .cse5) v_~a$r_buff0_thd4~0_66 (ite (and (not .cse5) .cse6) 0 v_~a$r_buff0_thd4~0_66)))) (= .cse1 v_~__unbuffered_p3_EBX~0_12) (= (ite .cse0 v_~a$w_buff1_used~0_127 (ite (or .cse2 .cse7 .cse5) v_~a$w_buff1_used~0_127 0)) v_~a$w_buff1_used~0_126) (= v_~a$w_buff1~0_42 v_~a$w_buff1~0_41) (= (ite .cse0 v_~a$w_buff0_used~0_134 (ite .cse8 v_~a$w_buff0_used~0_134 (ite .cse9 0 v_~a$w_buff0_used~0_134))) v_~a$w_buff0_used~0_133) (= v_~a$w_buff0~0_49 v_~a$w_buff0~0_48) (= (ite .cse0 v_~a$r_buff1_thd4~0_64 (ite (let ((.cse10 (= (mod v_~a$r_buff0_thd4~0_65 256) 0))) (or (and .cse3 .cse10) (and .cse11 .cse10) .cse5)) v_~a$r_buff1_thd4~0_64 0)) v_~a$r_buff1_thd4~0_63)))))) InVars {~a~0=v_~a~0_78, ~a$w_buff1~0=v_~a$w_buff1~0_42, ~a$w_buff0~0=v_~a$w_buff0~0_49, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_64, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_134, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_127, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_66} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_63, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_133, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_12, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_65, P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~a~0=v_~a~0_76, ~a$mem_tmp~0=v_~a$mem_tmp~0_20, ~weak$$choice0~0=v_~weak$$choice0~0_13, ~a$w_buff1~0=v_~a$w_buff1~0_41, ~a$flush_delayed~0=v_~a$flush_delayed~0_27, ~a$w_buff0~0=v_~a$w_buff0~0_48, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_126, ~weak$$choice2~0=v_~weak$$choice2~0_30, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~nondet4, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork2_#t~nondet3][121], [30#P1EXITtrue, 33#L776true, P0Thread1of1ForFork3InUse, P2Thread1of1ForFork0InUse, 186#true, P3Thread1of1ForFork2InUse, 54#L842true, P1Thread1of1ForFork1InUse, Black: 132#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 128#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 134#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 201#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 189#(and (not (= ~a$w_buff0~0 0)) (= ~a$r_buff1_thd4~0 0) (<= (div ~a$w_buff0_used~0 256) 0) (<= 1 ~a$w_buff0_used~0) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 205#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 190#(and (= ~a$r_buff1_thd4~0 0) (not (= ~a~0 0)) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 192#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 191#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 168#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 197#(and (not (= ~a$w_buff0~0 0)) (= ~a$r_buff1_thd4~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~a$w_buff0_used~0 256) 0) (<= 1 ~a$w_buff0_used~0) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 203#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 209#(and (= ~a$r_buff1_thd4~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= ~a~0 0)) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 199#(and (= ~a$r_buff1_thd4~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= ~a~0 0)) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 207#(and (= ~a$r_buff1_thd4~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= ~a~0 0)) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 188#(and (= ~a$w_buff0~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 150#(= ~__unbuffered_p3_EAX~0 0), 235#(and (<= ~__unbuffered_cnt~0 2) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), Black: 170#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 27#L806true, Black: 182#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1) (<= 0 ~main$tmp_guard0~0)), 12#L874true, 123#(and (not (= |ULTIMATE.start_main_~#t684~0#1.base| |ULTIMATE.start_main_~#t681~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t682~0#1.base| 0) |ULTIMATE.start_main_~#t683~0#1.base| 0) |ULTIMATE.start_main_~#t681~0#1.base| 0) |ULTIMATE.start_main_~#t684~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t683~0#1.base| |ULTIMATE.start_main_~#t682~0#1.base|)) (not (= |ULTIMATE.start_main_~#t682~0#1.base| |ULTIMATE.start_main_~#t681~0#1.base|)) (not (= |ULTIMATE.start_main_~#t683~0#1.base| |ULTIMATE.start_main_~#t681~0#1.base|)) (not (= |ULTIMATE.start_main_~#t684~0#1.base| |ULTIMATE.start_main_~#t682~0#1.base|)) (not (= |ULTIMATE.start_main_~#t684~0#1.base| |ULTIMATE.start_main_~#t683~0#1.base|))), 178#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0))]) [2023-11-26 10:47:22,936 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2023-11-26 10:47:22,936 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-26 10:47:22,936 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-26 10:47:22,936 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-26 10:47:22,937 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([465] L826-->L842: Formula: (let ((.cse11 (= (mod v_~a$r_buff1_thd4~0_64 256) 0)) (.cse4 (= (mod v_~a$r_buff0_thd4~0_66 256) 0))) (let ((.cse6 (not .cse4)) (.cse2 (and .cse11 .cse4)) (.cse7 (and (= (mod v_~a$w_buff1_used~0_127 256) 0) .cse4)) (.cse12 (= (mod v_~a$w_buff0_used~0_134 256) 0))) (let ((.cse8 (or .cse2 .cse7 .cse12)) (.cse9 (and (not .cse12) .cse6))) (let ((.cse1 (ite .cse8 v_~a~0_78 (ite .cse9 v_~a$w_buff0~0_49 v_~a$w_buff1~0_42))) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse3 (= (mod v_~a$w_buff1_used~0_126 256) 0)) (.cse5 (= (mod v_~a$w_buff0_used~0_133 256) 0))) (and (= v_~a~0_78 v_~a$mem_tmp~0_20) (= v_~a$flush_delayed~0_27 0) (= v_~a~0_76 (ite .cse0 v_~a$mem_tmp~0_20 .cse1)) (= v_~a$r_buff0_thd4~0_65 (ite .cse0 v_~a$r_buff0_thd4~0_66 (ite (or .cse2 (and .cse3 .cse4) .cse5) v_~a$r_buff0_thd4~0_66 (ite (and (not .cse5) .cse6) 0 v_~a$r_buff0_thd4~0_66)))) (= .cse1 v_~__unbuffered_p3_EBX~0_12) (= (ite .cse0 v_~a$w_buff1_used~0_127 (ite (or .cse2 .cse7 .cse5) v_~a$w_buff1_used~0_127 0)) v_~a$w_buff1_used~0_126) (= v_~a$w_buff1~0_42 v_~a$w_buff1~0_41) (= (ite .cse0 v_~a$w_buff0_used~0_134 (ite .cse8 v_~a$w_buff0_used~0_134 (ite .cse9 0 v_~a$w_buff0_used~0_134))) v_~a$w_buff0_used~0_133) (= v_~a$w_buff0~0_49 v_~a$w_buff0~0_48) (= (ite .cse0 v_~a$r_buff1_thd4~0_64 (ite (let ((.cse10 (= (mod v_~a$r_buff0_thd4~0_65 256) 0))) (or (and .cse3 .cse10) (and .cse11 .cse10) .cse5)) v_~a$r_buff1_thd4~0_64 0)) v_~a$r_buff1_thd4~0_63)))))) InVars {~a~0=v_~a~0_78, ~a$w_buff1~0=v_~a$w_buff1~0_42, ~a$w_buff0~0=v_~a$w_buff0~0_49, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_64, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_134, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_127, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_66} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_63, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_133, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_12, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_65, P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~a~0=v_~a~0_76, ~a$mem_tmp~0=v_~a$mem_tmp~0_20, ~weak$$choice0~0=v_~weak$$choice0~0_13, ~a$w_buff1~0=v_~a$w_buff1~0_41, ~a$flush_delayed~0=v_~a$flush_delayed~0_27, ~a$w_buff0~0=v_~a$w_buff0~0_48, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_126, ~weak$$choice2~0=v_~weak$$choice2~0_30, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~nondet4, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork2_#t~nondet3][121], [33#L776true, P0Thread1of1ForFork3InUse, 186#true, P2Thread1of1ForFork0InUse, P3Thread1of1ForFork2InUse, 54#L842true, Black: 132#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), P1Thread1of1ForFork1InUse, Black: 128#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 134#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 201#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 189#(and (not (= ~a$w_buff0~0 0)) (= ~a$r_buff1_thd4~0 0) (<= (div ~a$w_buff0_used~0 256) 0) (<= 1 ~a$w_buff0_used~0) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 205#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 190#(and (= ~a$r_buff1_thd4~0 0) (not (= ~a~0 0)) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 192#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 191#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 197#(and (not (= ~a$w_buff0~0 0)) (= ~a$r_buff1_thd4~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~a$w_buff0_used~0 256) 0) (<= 1 ~a$w_buff0_used~0) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 203#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 209#(and (= ~a$r_buff1_thd4~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= ~a~0 0)) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 199#(and (= ~a$r_buff1_thd4~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= ~a~0 0)) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 207#(and (= ~a$r_buff1_thd4~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= ~a~0 0)) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 188#(and (= ~a$w_buff0~0 0) (= ~a$r_buff0_thd4~0 0)), 235#(and (<= ~__unbuffered_cnt~0 2) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), Black: 150#(= ~__unbuffered_p3_EAX~0 0), 29#L876true, Black: 170#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 168#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 40#L796true, 27#L806true, Black: 182#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1) (<= 0 ~main$tmp_guard0~0)), Black: 178#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 123#(and (not (= |ULTIMATE.start_main_~#t684~0#1.base| |ULTIMATE.start_main_~#t681~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t682~0#1.base| 0) |ULTIMATE.start_main_~#t683~0#1.base| 0) |ULTIMATE.start_main_~#t681~0#1.base| 0) |ULTIMATE.start_main_~#t684~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t683~0#1.base| |ULTIMATE.start_main_~#t682~0#1.base|)) (not (= |ULTIMATE.start_main_~#t682~0#1.base| |ULTIMATE.start_main_~#t681~0#1.base|)) (not (= |ULTIMATE.start_main_~#t683~0#1.base| |ULTIMATE.start_main_~#t681~0#1.base|)) (not (= |ULTIMATE.start_main_~#t684~0#1.base| |ULTIMATE.start_main_~#t682~0#1.base|)) (not (= |ULTIMATE.start_main_~#t684~0#1.base| |ULTIMATE.start_main_~#t683~0#1.base|)))]) [2023-11-26 10:47:22,938 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2023-11-26 10:47:22,938 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-26 10:47:22,938 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-26 10:47:22,938 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-26 10:47:22,941 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([465] L826-->L842: Formula: (let ((.cse11 (= (mod v_~a$r_buff1_thd4~0_64 256) 0)) (.cse4 (= (mod v_~a$r_buff0_thd4~0_66 256) 0))) (let ((.cse6 (not .cse4)) (.cse2 (and .cse11 .cse4)) (.cse7 (and (= (mod v_~a$w_buff1_used~0_127 256) 0) .cse4)) (.cse12 (= (mod v_~a$w_buff0_used~0_134 256) 0))) (let ((.cse8 (or .cse2 .cse7 .cse12)) (.cse9 (and (not .cse12) .cse6))) (let ((.cse1 (ite .cse8 v_~a~0_78 (ite .cse9 v_~a$w_buff0~0_49 v_~a$w_buff1~0_42))) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse3 (= (mod v_~a$w_buff1_used~0_126 256) 0)) (.cse5 (= (mod v_~a$w_buff0_used~0_133 256) 0))) (and (= v_~a~0_78 v_~a$mem_tmp~0_20) (= v_~a$flush_delayed~0_27 0) (= v_~a~0_76 (ite .cse0 v_~a$mem_tmp~0_20 .cse1)) (= v_~a$r_buff0_thd4~0_65 (ite .cse0 v_~a$r_buff0_thd4~0_66 (ite (or .cse2 (and .cse3 .cse4) .cse5) v_~a$r_buff0_thd4~0_66 (ite (and (not .cse5) .cse6) 0 v_~a$r_buff0_thd4~0_66)))) (= .cse1 v_~__unbuffered_p3_EBX~0_12) (= (ite .cse0 v_~a$w_buff1_used~0_127 (ite (or .cse2 .cse7 .cse5) v_~a$w_buff1_used~0_127 0)) v_~a$w_buff1_used~0_126) (= v_~a$w_buff1~0_42 v_~a$w_buff1~0_41) (= (ite .cse0 v_~a$w_buff0_used~0_134 (ite .cse8 v_~a$w_buff0_used~0_134 (ite .cse9 0 v_~a$w_buff0_used~0_134))) v_~a$w_buff0_used~0_133) (= v_~a$w_buff0~0_49 v_~a$w_buff0~0_48) (= (ite .cse0 v_~a$r_buff1_thd4~0_64 (ite (let ((.cse10 (= (mod v_~a$r_buff0_thd4~0_65 256) 0))) (or (and .cse3 .cse10) (and .cse11 .cse10) .cse5)) v_~a$r_buff1_thd4~0_64 0)) v_~a$r_buff1_thd4~0_63)))))) InVars {~a~0=v_~a~0_78, ~a$w_buff1~0=v_~a$w_buff1~0_42, ~a$w_buff0~0=v_~a$w_buff0~0_49, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_64, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_134, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_127, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_66} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_63, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_133, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_12, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_65, P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~a~0=v_~a~0_76, ~a$mem_tmp~0=v_~a$mem_tmp~0_20, ~weak$$choice0~0=v_~weak$$choice0~0_13, ~a$w_buff1~0=v_~a$w_buff1~0_41, ~a$flush_delayed~0=v_~a$flush_delayed~0_27, ~a$w_buff0~0=v_~a$w_buff0~0_48, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_126, ~weak$$choice2~0=v_~weak$$choice2~0_30, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~nondet4, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork2_#t~nondet3][121], [33#L776true, P0Thread1of1ForFork3InUse, 186#true, P2Thread1of1ForFork0InUse, P3Thread1of1ForFork2InUse, 54#L842true, Black: 132#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), P1Thread1of1ForFork1InUse, Black: 128#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 134#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 201#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 189#(and (not (= ~a$w_buff0~0 0)) (= ~a$r_buff1_thd4~0 0) (<= (div ~a$w_buff0_used~0 256) 0) (<= 1 ~a$w_buff0_used~0) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 205#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 190#(and (= ~a$r_buff1_thd4~0 0) (not (= ~a~0 0)) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 192#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 191#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 197#(and (not (= ~a$w_buff0~0 0)) (= ~a$r_buff1_thd4~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~a$w_buff0_used~0 256) 0) (<= 1 ~a$w_buff0_used~0) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 203#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 209#(and (= ~a$r_buff1_thd4~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= ~a~0 0)) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 199#(and (= ~a$r_buff1_thd4~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= ~a~0 0)) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 207#(and (= ~a$r_buff1_thd4~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= ~a~0 0)) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 188#(and (= ~a$w_buff0~0 0) (= ~a$r_buff0_thd4~0 0)), 235#(and (<= ~__unbuffered_cnt~0 2) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), Black: 150#(= ~__unbuffered_p3_EAX~0 0), 29#L876true, Black: 170#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 168#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 40#L796true, 27#L806true, Black: 182#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1) (<= 0 ~main$tmp_guard0~0)), 123#(and (not (= |ULTIMATE.start_main_~#t684~0#1.base| |ULTIMATE.start_main_~#t681~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t682~0#1.base| 0) |ULTIMATE.start_main_~#t683~0#1.base| 0) |ULTIMATE.start_main_~#t681~0#1.base| 0) |ULTIMATE.start_main_~#t684~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t683~0#1.base| |ULTIMATE.start_main_~#t682~0#1.base|)) (not (= |ULTIMATE.start_main_~#t682~0#1.base| |ULTIMATE.start_main_~#t681~0#1.base|)) (not (= |ULTIMATE.start_main_~#t683~0#1.base| |ULTIMATE.start_main_~#t681~0#1.base|)) (not (= |ULTIMATE.start_main_~#t684~0#1.base| |ULTIMATE.start_main_~#t682~0#1.base|)) (not (= |ULTIMATE.start_main_~#t684~0#1.base| |ULTIMATE.start_main_~#t683~0#1.base|))), 178#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0))]) [2023-11-26 10:47:22,941 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2023-11-26 10:47:22,941 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-26 10:47:22,941 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-26 10:47:22,941 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event