./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/popl20-bad-commit-1.wvr-bad.c --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --validate ./goblint.2024-06-19_11-23-25.files/mutex-meet-nonrel/popl20-bad-commit-1.wvr-bad.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7724a2de Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/weaver/popl20-bad-commit-1.wvr-bad.c ./goblint.2024-06-19_11-23-25.files/mutex-meet-nonrel/popl20-bad-commit-1.wvr-bad.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-7724a2d-m [2024-06-28 02:46:30,517 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-28 02:46:30,610 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-28 02:46:30,614 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-28 02:46:30,615 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-28 02:46:30,636 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-28 02:46:30,637 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-28 02:46:30,637 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-28 02:46:30,638 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-28 02:46:30,642 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-28 02:46:30,642 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-28 02:46:30,642 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-28 02:46:30,643 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-28 02:46:30,644 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-28 02:46:30,644 INFO L153 SettingsManager]: * Use SBE=true [2024-06-28 02:46:30,644 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-28 02:46:30,645 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-28 02:46:30,645 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-28 02:46:30,645 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-28 02:46:30,646 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-28 02:46:30,646 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-28 02:46:30,646 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-28 02:46:30,647 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-28 02:46:30,647 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-28 02:46:30,647 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-28 02:46:30,647 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-28 02:46:30,648 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-28 02:46:30,648 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-28 02:46:30,649 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-28 02:46:30,649 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-28 02:46:30,650 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-28 02:46:30,651 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-28 02:46:30,651 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-28 02:46:30,651 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-28 02:46:30,651 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-28 02:46:30,652 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-28 02:46:30,652 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-28 02:46:30,652 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-28 02:46:30,652 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-28 02:46:30,652 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-28 02:46:30,653 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-28 02:46:30,653 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-28 02:46:30,653 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-28 02:46:30,654 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false [2024-06-28 02:46:30,882 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-28 02:46:30,904 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-28 02:46:30,906 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-28 02:46:30,907 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-28 02:46:30,907 INFO L274 PluginConnector]: CDTParser initialized [2024-06-28 02:46:30,908 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-bad-commit-1.wvr-bad.c [2024-06-28 02:46:32,032 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-28 02:46:32,223 INFO L384 CDTParser]: Found 1 translation units. [2024-06-28 02:46:32,223 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-commit-1.wvr-bad.c [2024-06-28 02:46:32,231 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/faf83391d/b5848b8b4726467193bb2f4e52d9aecc/FLAG8dbad038e [2024-06-28 02:46:32,241 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/faf83391d/b5848b8b4726467193bb2f4e52d9aecc [2024-06-28 02:46:32,244 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-28 02:46:32,244 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-28 02:46:32,245 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-06-19_11-23-25.files/mutex-meet-nonrel/popl20-bad-commit-1.wvr-bad.yml/witness.yml [2024-06-28 02:46:32,328 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-28 02:46:32,329 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-28 02:46:32,338 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-28 02:46:32,338 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-28 02:46:32,343 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-28 02:46:32,343 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.06 02:46:32" (1/2) ... [2024-06-28 02:46:32,344 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b89aa66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 02:46:32, skipping insertion in model container [2024-06-28 02:46:32,344 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.06 02:46:32" (1/2) ... [2024-06-28 02:46:32,346 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@16187f62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 02:46:32, skipping insertion in model container [2024-06-28 02:46:32,348 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 28.06 02:46:32" (2/2) ... [2024-06-28 02:46:32,348 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b89aa66 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 02:46:32, skipping insertion in model container [2024-06-28 02:46:32,348 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 28.06 02:46:32" (2/2) ... [2024-06-28 02:46:32,349 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-28 02:46:32,385 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-28 02:46:32,387 INFO L97 edCorrectnessWitness]: Location invariant before [L157-L157] (((! multithreaded || (((client_state == 0 || client_state == 1) && (node_state == 0 || node_state == 1)) && (((manager_state == 0 || manager_state == 1) || manager_state == 2) || manager_state == 3))) && (! multithreaded || (((manager_state == 0 || manager_state == 1) || manager_state == 2) || manager_state == 3))) && (! multithreaded || (node_state == 0 || node_state == 1))) && (! multithreaded || (client_state == 0 || client_state == 1)) [2024-06-28 02:46:32,387 INFO L97 edCorrectnessWitness]: Location invariant before [L155-L155] (((! multithreaded || (((client_state == 0 || client_state == 1) && (node_state == 0 || node_state == 1)) && (((manager_state == 0 || manager_state == 1) || manager_state == 2) || manager_state == 3))) && (! multithreaded || (((manager_state == 0 || manager_state == 1) || manager_state == 2) || manager_state == 3))) && (! multithreaded || (node_state == 0 || node_state == 1))) && (! multithreaded || (client_state == 0 || client_state == 1)) [2024-06-28 02:46:32,387 INFO L97 edCorrectnessWitness]: Location invariant before [L156-L156] (((! multithreaded || (((client_state == 0 || client_state == 1) && (node_state == 0 || node_state == 1)) && (((manager_state == 0 || manager_state == 1) || manager_state == 2) || manager_state == 3))) && (! multithreaded || (((manager_state == 0 || manager_state == 1) || manager_state == 2) || manager_state == 3))) && (! multithreaded || (node_state == 0 || node_state == 1))) && (! multithreaded || (client_state == 0 || client_state == 1)) [2024-06-28 02:46:32,387 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-28 02:46:32,387 INFO L106 edCorrectnessWitness]: ghost_update [L154-L154] multithreaded = 1; [2024-06-28 02:46:32,413 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-28 02:46:32,596 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-28 02:46:32,609 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-28 02:46:32,722 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-28 02:46:32,739 INFO L206 MainTranslator]: Completed translation [2024-06-28 02:46:32,740 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 02:46:32 WrapperNode [2024-06-28 02:46:32,741 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-28 02:46:32,742 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-28 02:46:32,742 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-28 02:46:32,742 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-28 02:46:32,749 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 02:46:32" (1/1) ... [2024-06-28 02:46:32,759 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 02:46:32" (1/1) ... [2024-06-28 02:46:32,791 INFO L138 Inliner]: procedures = 24, calls = 54, calls flagged for inlining = 21, calls inlined = 25, statements flattened = 345 [2024-06-28 02:46:32,791 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-28 02:46:32,798 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-28 02:46:32,798 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-28 02:46:32,799 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-28 02:46:32,809 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 02:46:32" (1/1) ... [2024-06-28 02:46:32,809 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 02:46:32" (1/1) ... [2024-06-28 02:46:32,822 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 02:46:32" (1/1) ... [2024-06-28 02:46:32,846 INFO L175 MemorySlicer]: Split 13 memory accesses to 2 slices as follows [2, 11]. 85 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 3 writes are split as follows [0, 3]. [2024-06-28 02:46:32,851 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 02:46:32" (1/1) ... [2024-06-28 02:46:32,852 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 02:46:32" (1/1) ... [2024-06-28 02:46:32,868 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 02:46:32" (1/1) ... [2024-06-28 02:46:32,879 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 02:46:32" (1/1) ... [2024-06-28 02:46:32,892 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 02:46:32" (1/1) ... [2024-06-28 02:46:32,893 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 02:46:32" (1/1) ... [2024-06-28 02:46:32,896 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-28 02:46:32,897 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-28 02:46:32,897 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-28 02:46:32,897 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-28 02:46:32,899 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 02:46:32" (1/1) ... [2024-06-28 02:46:32,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-28 02:46:32,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-28 02:46:32,929 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-06-28 02:46:32,957 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-06-28 02:46:32,973 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-28 02:46:32,974 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-06-28 02:46:32,974 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-06-28 02:46:32,974 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-06-28 02:46:32,974 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-06-28 02:46:32,974 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-06-28 02:46:32,975 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-06-28 02:46:32,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-28 02:46:32,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-06-28 02:46:32,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-06-28 02:46:32,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-06-28 02:46:32,976 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-28 02:46:32,976 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-28 02:46:32,976 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-06-28 02:46:32,977 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-28 02:46:32,977 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-28 02:46:32,978 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-06-28 02:46:32,979 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-06-28 02:46:32,980 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-28 02:46:33,114 INFO L244 CfgBuilder]: Building ICFG [2024-06-28 02:46:33,116 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-28 02:46:33,587 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-28 02:46:33,588 INFO L293 CfgBuilder]: Performing block encoding [2024-06-28 02:46:33,975 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-28 02:46:33,976 INFO L320 CfgBuilder]: Removed 6 assume(true) statements. [2024-06-28 02:46:33,976 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.06 02:46:33 BoogieIcfgContainer [2024-06-28 02:46:33,976 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-28 02:46:33,981 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-28 02:46:33,981 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-28 02:46:33,984 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-28 02:46:33,985 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.06 02:46:32" (1/4) ... [2024-06-28 02:46:33,986 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c55eed6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.06 02:46:33, skipping insertion in model container [2024-06-28 02:46:33,986 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 28.06 02:46:32" (2/4) ... [2024-06-28 02:46:33,986 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c55eed6 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 28.06 02:46:33, skipping insertion in model container [2024-06-28 02:46:33,986 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 02:46:32" (3/4) ... [2024-06-28 02:46:33,986 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c55eed6 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 28.06 02:46:33, skipping insertion in model container [2024-06-28 02:46:33,987 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.06 02:46:33" (4/4) ... [2024-06-28 02:46:33,988 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-bad-commit-1.wvr-bad.c [2024-06-28 02:46:34,005 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-28 02:46:34,006 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-06-28 02:46:34,006 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-28 02:46:34,062 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-06-28 02:46:34,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 59 places, 66 transitions, 153 flow [2024-06-28 02:46:34,139 INFO L124 PetriNetUnfolderBase]: 17/63 cut-off events. [2024-06-28 02:46:34,140 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-06-28 02:46:34,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76 conditions, 63 events. 17/63 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 121 event pairs, 0 based on Foata normal form. 0/43 useless extension candidates. Maximal degree in co-relation 54. Up to 6 conditions per place. [2024-06-28 02:46:34,144 INFO L82 GeneralOperation]: Start removeDead. Operand has 59 places, 66 transitions, 153 flow [2024-06-28 02:46:34,148 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 54 places, 61 transitions, 137 flow [2024-06-28 02:46:34,161 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-28 02:46:34,171 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=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4f755c06, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-28 02:46:34,171 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-06-28 02:46:34,178 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-28 02:46:34,178 INFO L124 PetriNetUnfolderBase]: 4/15 cut-off events. [2024-06-28 02:46:34,178 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-28 02:46:34,178 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:46:34,179 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:46:34,179 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 02:46:34,183 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:46:34,183 INFO L85 PathProgramCache]: Analyzing trace with hash -676753137, now seen corresponding path program 1 times [2024-06-28 02:46:34,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:46:34,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116976160] [2024-06-28 02:46:34,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:46:34,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:46:34,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:46:34,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:46:34,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:46:34,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116976160] [2024-06-28 02:46:34,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116976160] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:46:34,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:46:34,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-28 02:46:34,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924126665] [2024-06-28 02:46:34,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:46:34,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-28 02:46:34,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:46:34,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-28 02:46:34,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-28 02:46:34,772 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 66 [2024-06-28 02:46:34,775 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 61 transitions, 137 flow. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 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) [2024-06-28 02:46:34,775 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:46:34,775 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 66 [2024-06-28 02:46:34,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:46:35,741 INFO L124 PetriNetUnfolderBase]: 6385/8793 cut-off events. [2024-06-28 02:46:35,741 INFO L125 PetriNetUnfolderBase]: For 333/333 co-relation queries the response was YES. [2024-06-28 02:46:35,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17119 conditions, 8793 events. 6385/8793 cut-off events. For 333/333 co-relation queries the response was YES. Maximal size of possible extension queue 302. Compared 41042 event pairs, 1738 based on Foata normal form. 319/8166 useless extension candidates. Maximal degree in co-relation 16461. Up to 7001 conditions per place. [2024-06-28 02:46:35,801 INFO L140 encePairwiseOnDemand]: 53/66 looper letters, 65 selfloop transitions, 4 changer transitions 3/82 dead transitions. [2024-06-28 02:46:35,801 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 82 transitions, 335 flow [2024-06-28 02:46:35,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-28 02:46:35,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-28 02:46:35,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 123 transitions. [2024-06-28 02:46:35,813 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6212121212121212 [2024-06-28 02:46:35,814 INFO L175 Difference]: Start difference. First operand has 54 places, 61 transitions, 137 flow. Second operand 3 states and 123 transitions. [2024-06-28 02:46:35,815 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 82 transitions, 335 flow [2024-06-28 02:46:35,820 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 82 transitions, 319 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-06-28 02:46:35,825 INFO L231 Difference]: Finished difference. Result has 52 places, 60 transitions, 155 flow [2024-06-28 02:46:35,827 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=155, PETRI_PLACES=52, PETRI_TRANSITIONS=60} [2024-06-28 02:46:35,832 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, -2 predicate places. [2024-06-28 02:46:35,832 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 60 transitions, 155 flow [2024-06-28 02:46:35,835 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 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) [2024-06-28 02:46:35,835 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:46:35,835 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:46:35,836 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-28 02:46:35,836 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 02:46:35,836 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:46:35,837 INFO L85 PathProgramCache]: Analyzing trace with hash 147144050, now seen corresponding path program 1 times [2024-06-28 02:46:35,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:46:35,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401746074] [2024-06-28 02:46:35,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:46:35,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:46:35,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:46:35,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:46:35,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:46:35,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401746074] [2024-06-28 02:46:35,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401746074] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:46:35,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:46:35,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-28 02:46:35,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063062620] [2024-06-28 02:46:35,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:46:35,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-28 02:46:35,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:46:35,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-28 02:46:35,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-28 02:46:35,986 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 66 [2024-06-28 02:46:35,986 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 60 transitions, 155 flow. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 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) [2024-06-28 02:46:35,986 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:46:35,987 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 66 [2024-06-28 02:46:35,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:46:36,806 INFO L124 PetriNetUnfolderBase]: 5403/8436 cut-off events. [2024-06-28 02:46:36,807 INFO L125 PetriNetUnfolderBase]: For 1260/1601 co-relation queries the response was YES. [2024-06-28 02:46:36,827 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16861 conditions, 8436 events. 5403/8436 cut-off events. For 1260/1601 co-relation queries the response was YES. Maximal size of possible extension queue 424. Compared 49971 event pairs, 1986 based on Foata normal form. 344/6871 useless extension candidates. Maximal degree in co-relation 3516. Up to 3196 conditions per place. [2024-06-28 02:46:36,870 INFO L140 encePairwiseOnDemand]: 61/66 looper letters, 57 selfloop transitions, 4 changer transitions 0/81 dead transitions. [2024-06-28 02:46:36,870 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 81 transitions, 321 flow [2024-06-28 02:46:36,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-28 02:46:36,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-28 02:46:36,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 133 transitions. [2024-06-28 02:46:36,878 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6717171717171717 [2024-06-28 02:46:36,878 INFO L175 Difference]: Start difference. First operand has 52 places, 60 transitions, 155 flow. Second operand 3 states and 133 transitions. [2024-06-28 02:46:36,878 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 81 transitions, 321 flow [2024-06-28 02:46:36,880 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 81 transitions, 318 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-28 02:46:36,883 INFO L231 Difference]: Finished difference. Result has 52 places, 60 transitions, 169 flow [2024-06-28 02:46:36,885 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=143, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=169, PETRI_PLACES=52, PETRI_TRANSITIONS=60} [2024-06-28 02:46:36,885 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, -2 predicate places. [2024-06-28 02:46:36,886 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 60 transitions, 169 flow [2024-06-28 02:46:36,886 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 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) [2024-06-28 02:46:36,887 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:46:36,892 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:46:36,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-28 02:46:36,893 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 02:46:36,893 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:46:36,894 INFO L85 PathProgramCache]: Analyzing trace with hash -1890275853, now seen corresponding path program 1 times [2024-06-28 02:46:36,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:46:36,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103384394] [2024-06-28 02:46:36,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:46:36,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:46:36,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:46:36,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:46:36,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:46:36,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103384394] [2024-06-28 02:46:36,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103384394] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:46:36,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:46:36,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-28 02:46:36,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165030556] [2024-06-28 02:46:36,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:46:36,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-28 02:46:36,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:46:36,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-28 02:46:36,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-28 02:46:36,989 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 66 [2024-06-28 02:46:36,989 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 60 transitions, 169 flow. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 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) [2024-06-28 02:46:36,989 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:46:36,989 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 66 [2024-06-28 02:46:36,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:46:37,627 INFO L124 PetriNetUnfolderBase]: 4740/7641 cut-off events. [2024-06-28 02:46:37,628 INFO L125 PetriNetUnfolderBase]: For 2686/2875 co-relation queries the response was YES. [2024-06-28 02:46:37,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15955 conditions, 7641 events. 4740/7641 cut-off events. For 2686/2875 co-relation queries the response was YES. Maximal size of possible extension queue 309. Compared 45377 event pairs, 1654 based on Foata normal form. 179/6042 useless extension candidates. Maximal degree in co-relation 4692. Up to 3137 conditions per place. [2024-06-28 02:46:37,688 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 56 selfloop transitions, 2 changer transitions 0/77 dead transitions. [2024-06-28 02:46:37,761 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 77 transitions, 320 flow [2024-06-28 02:46:37,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-28 02:46:37,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-28 02:46:37,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 130 transitions. [2024-06-28 02:46:37,771 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6565656565656566 [2024-06-28 02:46:37,772 INFO L175 Difference]: Start difference. First operand has 52 places, 60 transitions, 169 flow. Second operand 3 states and 130 transitions. [2024-06-28 02:46:37,772 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 77 transitions, 320 flow [2024-06-28 02:46:37,773 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 77 transitions, 316 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-28 02:46:37,774 INFO L231 Difference]: Finished difference. Result has 52 places, 57 transitions, 157 flow [2024-06-28 02:46:37,774 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=145, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=157, PETRI_PLACES=52, PETRI_TRANSITIONS=57} [2024-06-28 02:46:37,775 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, -2 predicate places. [2024-06-28 02:46:37,775 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 57 transitions, 157 flow [2024-06-28 02:46:37,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 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) [2024-06-28 02:46:37,775 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:46:37,776 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:46:37,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-28 02:46:37,776 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 02:46:37,776 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:46:37,776 INFO L85 PathProgramCache]: Analyzing trace with hash -1345890450, now seen corresponding path program 1 times [2024-06-28 02:46:37,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:46:37,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291265704] [2024-06-28 02:46:37,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:46:37,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:46:37,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:46:37,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:46:37,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:46:37,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291265704] [2024-06-28 02:46:37,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291265704] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:46:37,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:46:37,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-28 02:46:37,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623695416] [2024-06-28 02:46:37,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:46:37,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-28 02:46:37,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:46:37,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-28 02:46:37,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-28 02:46:37,986 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 66 [2024-06-28 02:46:37,986 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 57 transitions, 157 flow. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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) [2024-06-28 02:46:37,986 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:46:37,986 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 66 [2024-06-28 02:46:37,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:46:39,589 INFO L124 PetriNetUnfolderBase]: 13981/19593 cut-off events. [2024-06-28 02:46:39,590 INFO L125 PetriNetUnfolderBase]: For 5611/5611 co-relation queries the response was YES. [2024-06-28 02:46:39,632 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43998 conditions, 19593 events. 13981/19593 cut-off events. For 5611/5611 co-relation queries the response was YES. Maximal size of possible extension queue 510. Compared 101621 event pairs, 4180 based on Foata normal form. 689/17499 useless extension candidates. Maximal degree in co-relation 26159. Up to 13634 conditions per place. [2024-06-28 02:46:39,699 INFO L140 encePairwiseOnDemand]: 56/66 looper letters, 76 selfloop transitions, 7 changer transitions 2/94 dead transitions. [2024-06-28 02:46:39,700 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 94 transitions, 417 flow [2024-06-28 02:46:39,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-28 02:46:39,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-28 02:46:39,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 138 transitions. [2024-06-28 02:46:39,701 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5227272727272727 [2024-06-28 02:46:39,701 INFO L175 Difference]: Start difference. First operand has 52 places, 57 transitions, 157 flow. Second operand 4 states and 138 transitions. [2024-06-28 02:46:39,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 94 transitions, 417 flow [2024-06-28 02:46:39,704 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 94 transitions, 415 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-28 02:46:39,706 INFO L231 Difference]: Finished difference. Result has 56 places, 62 transitions, 224 flow [2024-06-28 02:46:39,706 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=224, PETRI_PLACES=56, PETRI_TRANSITIONS=62} [2024-06-28 02:46:39,707 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 2 predicate places. [2024-06-28 02:46:39,708 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 62 transitions, 224 flow [2024-06-28 02:46:39,708 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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) [2024-06-28 02:46:39,708 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:46:39,708 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] [2024-06-28 02:46:39,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-28 02:46:39,708 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 02:46:39,709 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:46:39,709 INFO L85 PathProgramCache]: Analyzing trace with hash 1740348685, now seen corresponding path program 1 times [2024-06-28 02:46:39,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:46:39,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480510606] [2024-06-28 02:46:39,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:46:39,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:46:39,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:46:39,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:46:39,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:46:39,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480510606] [2024-06-28 02:46:39,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480510606] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:46:39,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:46:39,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-28 02:46:39,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651404197] [2024-06-28 02:46:39,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:46:39,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-28 02:46:39,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:46:39,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-28 02:46:39,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-28 02:46:39,915 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 66 [2024-06-28 02:46:39,915 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 62 transitions, 224 flow. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 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) [2024-06-28 02:46:39,915 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:46:39,916 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 66 [2024-06-28 02:46:39,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:46:42,949 INFO L124 PetriNetUnfolderBase]: 30732/42937 cut-off events. [2024-06-28 02:46:42,949 INFO L125 PetriNetUnfolderBase]: For 32099/32179 co-relation queries the response was YES. [2024-06-28 02:46:43,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 106347 conditions, 42937 events. 30732/42937 cut-off events. For 32099/32179 co-relation queries the response was YES. Maximal size of possible extension queue 1236. Compared 248836 event pairs, 10438 based on Foata normal form. 3473/41091 useless extension candidates. Maximal degree in co-relation 47264. Up to 15730 conditions per place. [2024-06-28 02:46:43,311 INFO L140 encePairwiseOnDemand]: 50/66 looper letters, 116 selfloop transitions, 19 changer transitions 0/142 dead transitions. [2024-06-28 02:46:43,313 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 142 transitions, 721 flow [2024-06-28 02:46:43,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-28 02:46:43,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-28 02:46:43,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 186 transitions. [2024-06-28 02:46:43,318 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5636363636363636 [2024-06-28 02:46:43,318 INFO L175 Difference]: Start difference. First operand has 56 places, 62 transitions, 224 flow. Second operand 5 states and 186 transitions. [2024-06-28 02:46:43,319 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 142 transitions, 721 flow [2024-06-28 02:46:43,326 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 142 transitions, 719 flow, removed 1 selfloop flow, removed 0 redundant places. [2024-06-28 02:46:43,329 INFO L231 Difference]: Finished difference. Result has 64 places, 73 transitions, 388 flow [2024-06-28 02:46:43,329 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=388, PETRI_PLACES=64, PETRI_TRANSITIONS=73} [2024-06-28 02:46:43,331 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 10 predicate places. [2024-06-28 02:46:43,331 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 73 transitions, 388 flow [2024-06-28 02:46:43,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 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) [2024-06-28 02:46:43,332 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:46:43,332 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:46:43,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-28 02:46:43,332 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 02:46:43,333 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:46:43,333 INFO L85 PathProgramCache]: Analyzing trace with hash 390040619, now seen corresponding path program 1 times [2024-06-28 02:46:43,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:46:43,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104732208] [2024-06-28 02:46:43,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:46:43,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:46:43,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:46:43,401 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-06-28 02:46:43,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:46:43,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104732208] [2024-06-28 02:46:43,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104732208] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:46:43,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:46:43,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-28 02:46:43,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206095563] [2024-06-28 02:46:43,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:46:43,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-28 02:46:43,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:46:43,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-28 02:46:43,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-28 02:46:43,405 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 66 [2024-06-28 02:46:43,406 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 73 transitions, 388 flow. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 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) [2024-06-28 02:46:43,406 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:46:43,406 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 66 [2024-06-28 02:46:43,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:46:44,885 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1031] L88-->L95: Formula: (not (= v_~node_state~0_3 0)) InVars {~node_state~0=v_~node_state~0_3} OutVars{~node_state~0=v_~node_state~0_3} AuxVars[] AssignedVars[][55], [Black: 64#(and (= ~node_state~0 0) (= ~client_state~0 0) (= ~manager_state~0 0)), Black: 68#(<= ~manager_back~0 ~manager_front~0), 80#true, Black: 72#(<= ~node_back~0 ~node_front~0), 50#L66true, 91#(<= ~client_back~0 ~client_front~0), Black: 77#(and (= ~node_state~0 0) (= ~client_state~0 1) (= ~manager_state~0 0)), Black: 76#(and (= ~node_state~0 0) (= ~manager_state~0 0)), 5#L118true, 40#L95true, 74#true, Black: 83#(and (= ~node_state~0 0) (= ~client_state~0 1)), Black: 84#(and (= ~manager_state~0 1) (= ~node_state~0 0) (= ~client_state~0 1)), Black: 82#(= ~node_state~0 0), thread3Thread1of1ForFork2InUse, 19#ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANTtrue]) [2024-06-28 02:46:44,886 INFO L294 olderBase$Statistics]: this new event has 42 ancestors and is not cut-off event [2024-06-28 02:46:44,886 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is not cut-off event [2024-06-28 02:46:44,886 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is not cut-off event [2024-06-28 02:46:44,886 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is not cut-off event [2024-06-28 02:46:45,151 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1032] L89-->L95-1: Formula: (and (= (+ 1 v_~node_front~0_81) v_~node_front~0_80) (= v_~node_state~0_54 1) (= (ite (= (ite (= (select (select |v_#memory_int#1_143| v_~node~0.base_85) (+ (* 4 v_~node_front~0_81) v_~node~0.offset_85)) v_~update~0_81) 1 0) 0) 0 1) v_~safe~0_104) (not (= (ite (and (< v_~node_front~0_81 v_~node_size~0_66) (<= 0 v_~node_front~0_81) (< v_~node_front~0_81 v_~node_back~0_92)) 1 0) 0))) InVars {~node_back~0=v_~node_back~0_92, ~node_size~0=v_~node_size~0_66, ~node~0.base=v_~node~0.base_85, ~node_front~0=v_~node_front~0_81, ~node~0.offset=v_~node~0.offset_85, #memory_int#1=|v_#memory_int#1_143|, ~update~0=v_~update~0_81} OutVars{~node_back~0=v_~node_back~0_92, thread2Thread1of1ForFork0_#t~post12#1=|v_thread2Thread1of1ForFork0_#t~post12#1_1|, thread2Thread1of1ForFork0_#t~mem11#1=|v_thread2Thread1of1ForFork0_#t~mem11#1_1|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~node~0.base=v_~node~0.base_85, ~node~0.offset=v_~node~0.offset_85, #memory_int#1=|v_#memory_int#1_143|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~node_size~0=v_~node_size~0_66, ~safe~0=v_~safe~0_104, ~node_front~0=v_~node_front~0_80, ~node_state~0=v_~node_state~0_54, ~update~0=v_~update~0_81} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#t~post12#1, thread2Thread1of1ForFork0_#t~mem11#1, ~safe~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~node_front~0, ~node_state~0][60], [Black: 64#(and (= ~node_state~0 0) (= ~client_state~0 0) (= ~manager_state~0 0)), Black: 68#(<= ~manager_back~0 ~manager_front~0), 29#L59true, 80#true, Black: 72#(<= ~node_back~0 ~node_front~0), 91#(<= ~client_back~0 ~client_front~0), Black: 77#(and (= ~node_state~0 0) (= ~client_state~0 1) (= ~manager_state~0 0)), Black: 76#(and (= ~node_state~0 0) (= ~manager_state~0 0)), 5#L118true, 74#true, Black: 83#(and (= ~node_state~0 0) (= ~client_state~0 1)), Black: 84#(and (= ~manager_state~0 1) (= ~node_state~0 0) (= ~client_state~0 1)), Black: 82#(= ~node_state~0 0), 21#L95-1true, thread3Thread1of1ForFork2InUse, 19#ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANTtrue]) [2024-06-28 02:46:45,151 INFO L294 olderBase$Statistics]: this new event has 46 ancestors and is cut-off event [2024-06-28 02:46:45,152 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2024-06-28 02:46:45,152 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2024-06-28 02:46:45,152 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2024-06-28 02:46:45,152 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1031] L88-->L95: Formula: (not (= v_~node_state~0_3 0)) InVars {~node_state~0=v_~node_state~0_3} OutVars{~node_state~0=v_~node_state~0_3} AuxVars[] AssignedVars[][55], [Black: 64#(and (= ~node_state~0 0) (= ~client_state~0 0) (= ~manager_state~0 0)), Black: 68#(<= ~manager_back~0 ~manager_front~0), 29#L59true, 80#true, Black: 72#(<= ~node_back~0 ~node_front~0), 91#(<= ~client_back~0 ~client_front~0), Black: 77#(and (= ~node_state~0 0) (= ~client_state~0 1) (= ~manager_state~0 0)), Black: 76#(and (= ~node_state~0 0) (= ~manager_state~0 0)), 5#L118true, 40#L95true, 74#true, Black: 83#(and (= ~node_state~0 0) (= ~client_state~0 1)), Black: 84#(and (= ~manager_state~0 1) (= ~node_state~0 0) (= ~client_state~0 1)), Black: 82#(= ~node_state~0 0), thread3Thread1of1ForFork2InUse, 19#ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANTtrue]) [2024-06-28 02:46:45,152 INFO L294 olderBase$Statistics]: this new event has 45 ancestors and is cut-off event [2024-06-28 02:46:45,152 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-06-28 02:46:45,152 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-06-28 02:46:45,152 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-06-28 02:46:45,153 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1031] L88-->L95: Formula: (not (= v_~node_state~0_3 0)) InVars {~node_state~0=v_~node_state~0_3} OutVars{~node_state~0=v_~node_state~0_3} AuxVars[] AssignedVars[][55], [Black: 64#(and (= ~node_state~0 0) (= ~client_state~0 0) (= ~manager_state~0 0)), Black: 68#(<= ~manager_back~0 ~manager_front~0), 80#true, Black: 72#(<= ~node_back~0 ~node_front~0), 91#(<= ~client_back~0 ~client_front~0), Black: 77#(and (= ~node_state~0 0) (= ~client_state~0 1) (= ~manager_state~0 0)), Black: 76#(and (= ~node_state~0 0) (= ~manager_state~0 0)), 5#L118true, 40#L95true, 74#true, Black: 83#(and (= ~node_state~0 0) (= ~client_state~0 1)), Black: 84#(and (= ~manager_state~0 1) (= ~node_state~0 0) (= ~client_state~0 1)), Black: 82#(= ~node_state~0 0), 7#L60true, thread3Thread1of1ForFork2InUse, 19#ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANTtrue]) [2024-06-28 02:46:45,153 INFO L294 olderBase$Statistics]: this new event has 46 ancestors and is cut-off event [2024-06-28 02:46:45,153 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2024-06-28 02:46:45,153 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2024-06-28 02:46:45,153 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2024-06-28 02:46:45,517 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1031] L88-->L95: Formula: (not (= v_~node_state~0_3 0)) InVars {~node_state~0=v_~node_state~0_3} OutVars{~node_state~0=v_~node_state~0_3} AuxVars[] AssignedVars[][55], [Black: 64#(and (= ~node_state~0 0) (= ~client_state~0 0) (= ~manager_state~0 0)), Black: 68#(<= ~manager_back~0 ~manager_front~0), 80#true, Black: 72#(<= ~node_back~0 ~node_front~0), 91#(<= ~client_back~0 ~client_front~0), 50#L66true, Black: 77#(and (= ~node_state~0 0) (= ~client_state~0 1) (= ~manager_state~0 0)), Black: 76#(and (= ~node_state~0 0) (= ~manager_state~0 0)), 5#L118true, 40#L95true, 74#true, Black: 83#(and (= ~node_state~0 0) (= ~client_state~0 1)), Black: 84#(and (= ~manager_state~0 1) (= ~node_state~0 0) (= ~client_state~0 1)), Black: 82#(= ~node_state~0 0), thread3Thread1of1ForFork2InUse, 19#ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANTtrue]) [2024-06-28 02:46:45,518 INFO L294 olderBase$Statistics]: this new event has 46 ancestors and is cut-off event [2024-06-28 02:46:45,518 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2024-06-28 02:46:45,518 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2024-06-28 02:46:45,518 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2024-06-28 02:46:45,518 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2024-06-28 02:46:45,670 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1032] L89-->L95-1: Formula: (and (= (+ 1 v_~node_front~0_81) v_~node_front~0_80) (= v_~node_state~0_54 1) (= (ite (= (ite (= (select (select |v_#memory_int#1_143| v_~node~0.base_85) (+ (* 4 v_~node_front~0_81) v_~node~0.offset_85)) v_~update~0_81) 1 0) 0) 0 1) v_~safe~0_104) (not (= (ite (and (< v_~node_front~0_81 v_~node_size~0_66) (<= 0 v_~node_front~0_81) (< v_~node_front~0_81 v_~node_back~0_92)) 1 0) 0))) InVars {~node_back~0=v_~node_back~0_92, ~node_size~0=v_~node_size~0_66, ~node~0.base=v_~node~0.base_85, ~node_front~0=v_~node_front~0_81, ~node~0.offset=v_~node~0.offset_85, #memory_int#1=|v_#memory_int#1_143|, ~update~0=v_~update~0_81} OutVars{~node_back~0=v_~node_back~0_92, thread2Thread1of1ForFork0_#t~post12#1=|v_thread2Thread1of1ForFork0_#t~post12#1_1|, thread2Thread1of1ForFork0_#t~mem11#1=|v_thread2Thread1of1ForFork0_#t~mem11#1_1|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~node~0.base=v_~node~0.base_85, ~node~0.offset=v_~node~0.offset_85, #memory_int#1=|v_#memory_int#1_143|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~node_size~0=v_~node_size~0_66, ~safe~0=v_~safe~0_104, ~node_front~0=v_~node_front~0_80, ~node_state~0=v_~node_state~0_54, ~update~0=v_~update~0_81} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#t~post12#1, thread2Thread1of1ForFork0_#t~mem11#1, ~safe~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~node_front~0, ~node_state~0][85], [Black: 64#(and (= ~node_state~0 0) (= ~client_state~0 0) (= ~manager_state~0 0)), 24#L117-1true, Black: 68#(<= ~manager_back~0 ~manager_front~0), 80#true, Black: 72#(<= ~node_back~0 ~node_front~0), Black: 77#(and (= ~node_state~0 0) (= ~client_state~0 1) (= ~manager_state~0 0)), Black: 76#(and (= ~node_state~0 0) (= ~manager_state~0 0)), 25#L73-1true, 74#true, Black: 83#(and (= ~node_state~0 0) (= ~client_state~0 1)), Black: 84#(and (= ~manager_state~0 1) (= ~node_state~0 0) (= ~client_state~0 1)), Black: 82#(= ~node_state~0 0), 21#L95-1true, thread3Thread1of1ForFork2InUse, 19#ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 89#true]) [2024-06-28 02:46:45,670 INFO L294 olderBase$Statistics]: this new event has 47 ancestors and is cut-off event [2024-06-28 02:46:45,670 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2024-06-28 02:46:45,670 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2024-06-28 02:46:45,670 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2024-06-28 02:46:45,749 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1032] L89-->L95-1: Formula: (and (= (+ 1 v_~node_front~0_81) v_~node_front~0_80) (= v_~node_state~0_54 1) (= (ite (= (ite (= (select (select |v_#memory_int#1_143| v_~node~0.base_85) (+ (* 4 v_~node_front~0_81) v_~node~0.offset_85)) v_~update~0_81) 1 0) 0) 0 1) v_~safe~0_104) (not (= (ite (and (< v_~node_front~0_81 v_~node_size~0_66) (<= 0 v_~node_front~0_81) (< v_~node_front~0_81 v_~node_back~0_92)) 1 0) 0))) InVars {~node_back~0=v_~node_back~0_92, ~node_size~0=v_~node_size~0_66, ~node~0.base=v_~node~0.base_85, ~node_front~0=v_~node_front~0_81, ~node~0.offset=v_~node~0.offset_85, #memory_int#1=|v_#memory_int#1_143|, ~update~0=v_~update~0_81} OutVars{~node_back~0=v_~node_back~0_92, thread2Thread1of1ForFork0_#t~post12#1=|v_thread2Thread1of1ForFork0_#t~post12#1_1|, thread2Thread1of1ForFork0_#t~mem11#1=|v_thread2Thread1of1ForFork0_#t~mem11#1_1|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~node~0.base=v_~node~0.base_85, ~node~0.offset=v_~node~0.offset_85, #memory_int#1=|v_#memory_int#1_143|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~node_size~0=v_~node_size~0_66, ~safe~0=v_~safe~0_104, ~node_front~0=v_~node_front~0_80, ~node_state~0=v_~node_state~0_54, ~update~0=v_~update~0_81} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#t~post12#1, thread2Thread1of1ForFork0_#t~mem11#1, ~safe~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~node_front~0, ~node_state~0][85], [Black: 64#(and (= ~node_state~0 0) (= ~client_state~0 0) (= ~manager_state~0 0)), 24#L117-1true, Black: 68#(<= ~manager_back~0 ~manager_front~0), 80#true, Black: 72#(<= ~node_back~0 ~node_front~0), 53#L51-1true, Black: 77#(and (= ~node_state~0 0) (= ~client_state~0 1) (= ~manager_state~0 0)), Black: 76#(and (= ~node_state~0 0) (= ~manager_state~0 0)), 74#true, Black: 83#(and (= ~node_state~0 0) (= ~client_state~0 1)), Black: 84#(and (= ~manager_state~0 1) (= ~node_state~0 0) (= ~client_state~0 1)), Black: 82#(= ~node_state~0 0), 21#L95-1true, thread3Thread1of1ForFork2InUse, 19#ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 89#true]) [2024-06-28 02:46:45,749 INFO L294 olderBase$Statistics]: this new event has 48 ancestors and is cut-off event [2024-06-28 02:46:45,749 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2024-06-28 02:46:45,749 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2024-06-28 02:46:45,749 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2024-06-28 02:46:45,750 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1032] L89-->L95-1: Formula: (and (= (+ 1 v_~node_front~0_81) v_~node_front~0_80) (= v_~node_state~0_54 1) (= (ite (= (ite (= (select (select |v_#memory_int#1_143| v_~node~0.base_85) (+ (* 4 v_~node_front~0_81) v_~node~0.offset_85)) v_~update~0_81) 1 0) 0) 0 1) v_~safe~0_104) (not (= (ite (and (< v_~node_front~0_81 v_~node_size~0_66) (<= 0 v_~node_front~0_81) (< v_~node_front~0_81 v_~node_back~0_92)) 1 0) 0))) InVars {~node_back~0=v_~node_back~0_92, ~node_size~0=v_~node_size~0_66, ~node~0.base=v_~node~0.base_85, ~node_front~0=v_~node_front~0_81, ~node~0.offset=v_~node~0.offset_85, #memory_int#1=|v_#memory_int#1_143|, ~update~0=v_~update~0_81} OutVars{~node_back~0=v_~node_back~0_92, thread2Thread1of1ForFork0_#t~post12#1=|v_thread2Thread1of1ForFork0_#t~post12#1_1|, thread2Thread1of1ForFork0_#t~mem11#1=|v_thread2Thread1of1ForFork0_#t~mem11#1_1|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~node~0.base=v_~node~0.base_85, ~node~0.offset=v_~node~0.offset_85, #memory_int#1=|v_#memory_int#1_143|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~node_size~0=v_~node_size~0_66, ~safe~0=v_~safe~0_104, ~node_front~0=v_~node_front~0_80, ~node_state~0=v_~node_state~0_54, ~update~0=v_~update~0_81} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#t~post12#1, thread2Thread1of1ForFork0_#t~mem11#1, ~safe~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~node_front~0, ~node_state~0][85], [Black: 64#(and (= ~node_state~0 0) (= ~client_state~0 0) (= ~manager_state~0 0)), 30#L109-1true, Black: 68#(<= ~manager_back~0 ~manager_front~0), 80#true, Black: 72#(<= ~node_back~0 ~node_front~0), Black: 77#(and (= ~node_state~0 0) (= ~client_state~0 1) (= ~manager_state~0 0)), Black: 76#(and (= ~node_state~0 0) (= ~manager_state~0 0)), 25#L73-1true, 74#true, Black: 83#(and (= ~node_state~0 0) (= ~client_state~0 1)), Black: 84#(and (= ~manager_state~0 1) (= ~node_state~0 0) (= ~client_state~0 1)), Black: 82#(= ~node_state~0 0), 21#L95-1true, thread3Thread1of1ForFork2InUse, 19#ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 89#true]) [2024-06-28 02:46:45,750 INFO L294 olderBase$Statistics]: this new event has 48 ancestors and is cut-off event [2024-06-28 02:46:45,750 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2024-06-28 02:46:45,750 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2024-06-28 02:46:45,750 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2024-06-28 02:46:45,808 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1032] L89-->L95-1: Formula: (and (= (+ 1 v_~node_front~0_81) v_~node_front~0_80) (= v_~node_state~0_54 1) (= (ite (= (ite (= (select (select |v_#memory_int#1_143| v_~node~0.base_85) (+ (* 4 v_~node_front~0_81) v_~node~0.offset_85)) v_~update~0_81) 1 0) 0) 0 1) v_~safe~0_104) (not (= (ite (and (< v_~node_front~0_81 v_~node_size~0_66) (<= 0 v_~node_front~0_81) (< v_~node_front~0_81 v_~node_back~0_92)) 1 0) 0))) InVars {~node_back~0=v_~node_back~0_92, ~node_size~0=v_~node_size~0_66, ~node~0.base=v_~node~0.base_85, ~node_front~0=v_~node_front~0_81, ~node~0.offset=v_~node~0.offset_85, #memory_int#1=|v_#memory_int#1_143|, ~update~0=v_~update~0_81} OutVars{~node_back~0=v_~node_back~0_92, thread2Thread1of1ForFork0_#t~post12#1=|v_thread2Thread1of1ForFork0_#t~post12#1_1|, thread2Thread1of1ForFork0_#t~mem11#1=|v_thread2Thread1of1ForFork0_#t~mem11#1_1|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~node~0.base=v_~node~0.base_85, ~node~0.offset=v_~node~0.offset_85, #memory_int#1=|v_#memory_int#1_143|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~node_size~0=v_~node_size~0_66, ~safe~0=v_~safe~0_104, ~node_front~0=v_~node_front~0_80, ~node_state~0=v_~node_state~0_54, ~update~0=v_~update~0_81} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#t~post12#1, thread2Thread1of1ForFork0_#t~mem11#1, ~safe~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~node_front~0, ~node_state~0][85], [Black: 64#(and (= ~node_state~0 0) (= ~client_state~0 0) (= ~manager_state~0 0)), 30#L109-1true, Black: 68#(<= ~manager_back~0 ~manager_front~0), 80#true, Black: 72#(<= ~node_back~0 ~node_front~0), 53#L51-1true, Black: 77#(and (= ~node_state~0 0) (= ~client_state~0 1) (= ~manager_state~0 0)), Black: 76#(and (= ~node_state~0 0) (= ~manager_state~0 0)), 74#true, Black: 83#(and (= ~node_state~0 0) (= ~client_state~0 1)), Black: 84#(and (= ~manager_state~0 1) (= ~node_state~0 0) (= ~client_state~0 1)), Black: 82#(= ~node_state~0 0), 21#L95-1true, thread3Thread1of1ForFork2InUse, 19#ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 89#true]) [2024-06-28 02:46:45,808 INFO L294 olderBase$Statistics]: this new event has 49 ancestors and is cut-off event [2024-06-28 02:46:45,809 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2024-06-28 02:46:45,809 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2024-06-28 02:46:45,809 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2024-06-28 02:46:45,809 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1032] L89-->L95-1: Formula: (and (= (+ 1 v_~node_front~0_81) v_~node_front~0_80) (= v_~node_state~0_54 1) (= (ite (= (ite (= (select (select |v_#memory_int#1_143| v_~node~0.base_85) (+ (* 4 v_~node_front~0_81) v_~node~0.offset_85)) v_~update~0_81) 1 0) 0) 0 1) v_~safe~0_104) (not (= (ite (and (< v_~node_front~0_81 v_~node_size~0_66) (<= 0 v_~node_front~0_81) (< v_~node_front~0_81 v_~node_back~0_92)) 1 0) 0))) InVars {~node_back~0=v_~node_back~0_92, ~node_size~0=v_~node_size~0_66, ~node~0.base=v_~node~0.base_85, ~node_front~0=v_~node_front~0_81, ~node~0.offset=v_~node~0.offset_85, #memory_int#1=|v_#memory_int#1_143|, ~update~0=v_~update~0_81} OutVars{~node_back~0=v_~node_back~0_92, thread2Thread1of1ForFork0_#t~post12#1=|v_thread2Thread1of1ForFork0_#t~post12#1_1|, thread2Thread1of1ForFork0_#t~mem11#1=|v_thread2Thread1of1ForFork0_#t~mem11#1_1|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~node~0.base=v_~node~0.base_85, ~node~0.offset=v_~node~0.offset_85, #memory_int#1=|v_#memory_int#1_143|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~node_size~0=v_~node_size~0_66, ~safe~0=v_~safe~0_104, ~node_front~0=v_~node_front~0_80, ~node_state~0=v_~node_state~0_54, ~update~0=v_~update~0_81} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#t~post12#1, thread2Thread1of1ForFork0_#t~mem11#1, ~safe~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~node_front~0, ~node_state~0][85], [Black: 64#(and (= ~node_state~0 0) (= ~client_state~0 0) (= ~manager_state~0 0)), 24#L117-1true, 18#L51-5true, Black: 68#(<= ~manager_back~0 ~manager_front~0), 80#true, Black: 72#(<= ~node_back~0 ~node_front~0), Black: 77#(and (= ~node_state~0 0) (= ~client_state~0 1) (= ~manager_state~0 0)), Black: 76#(and (= ~node_state~0 0) (= ~manager_state~0 0)), 74#true, Black: 83#(and (= ~node_state~0 0) (= ~client_state~0 1)), Black: 84#(and (= ~manager_state~0 1) (= ~node_state~0 0) (= ~client_state~0 1)), Black: 82#(= ~node_state~0 0), 21#L95-1true, thread3Thread1of1ForFork2InUse, 19#ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 89#true]) [2024-06-28 02:46:45,809 INFO L294 olderBase$Statistics]: this new event has 49 ancestors and is cut-off event [2024-06-28 02:46:45,809 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2024-06-28 02:46:45,809 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2024-06-28 02:46:45,809 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2024-06-28 02:46:45,810 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1032] L89-->L95-1: Formula: (and (= (+ 1 v_~node_front~0_81) v_~node_front~0_80) (= v_~node_state~0_54 1) (= (ite (= (ite (= (select (select |v_#memory_int#1_143| v_~node~0.base_85) (+ (* 4 v_~node_front~0_81) v_~node~0.offset_85)) v_~update~0_81) 1 0) 0) 0 1) v_~safe~0_104) (not (= (ite (and (< v_~node_front~0_81 v_~node_size~0_66) (<= 0 v_~node_front~0_81) (< v_~node_front~0_81 v_~node_back~0_92)) 1 0) 0))) InVars {~node_back~0=v_~node_back~0_92, ~node_size~0=v_~node_size~0_66, ~node~0.base=v_~node~0.base_85, ~node_front~0=v_~node_front~0_81, ~node~0.offset=v_~node~0.offset_85, #memory_int#1=|v_#memory_int#1_143|, ~update~0=v_~update~0_81} OutVars{~node_back~0=v_~node_back~0_92, thread2Thread1of1ForFork0_#t~post12#1=|v_thread2Thread1of1ForFork0_#t~post12#1_1|, thread2Thread1of1ForFork0_#t~mem11#1=|v_thread2Thread1of1ForFork0_#t~mem11#1_1|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~node~0.base=v_~node~0.base_85, ~node~0.offset=v_~node~0.offset_85, #memory_int#1=|v_#memory_int#1_143|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~node_size~0=v_~node_size~0_66, ~safe~0=v_~safe~0_104, ~node_front~0=v_~node_front~0_80, ~node_state~0=v_~node_state~0_54, ~update~0=v_~update~0_81} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#t~post12#1, thread2Thread1of1ForFork0_#t~mem11#1, ~safe~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~node_front~0, ~node_state~0][85], [Black: 64#(and (= ~node_state~0 0) (= ~client_state~0 0) (= ~manager_state~0 0)), 24#L117-1true, Black: 68#(<= ~manager_back~0 ~manager_front~0), 80#true, Black: 72#(<= ~node_back~0 ~node_front~0), Black: 77#(and (= ~node_state~0 0) (= ~client_state~0 1) (= ~manager_state~0 0)), Black: 76#(and (= ~node_state~0 0) (= ~manager_state~0 0)), 74#true, Black: 83#(and (= ~node_state~0 0) (= ~client_state~0 1)), Black: 84#(and (= ~manager_state~0 1) (= ~node_state~0 0) (= ~client_state~0 1)), 28#L52true, Black: 82#(= ~node_state~0 0), 21#L95-1true, thread3Thread1of1ForFork2InUse, 19#ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 89#true]) [2024-06-28 02:46:45,810 INFO L294 olderBase$Statistics]: this new event has 49 ancestors and is cut-off event [2024-06-28 02:46:45,810 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2024-06-28 02:46:45,810 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2024-06-28 02:46:45,810 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2024-06-28 02:46:45,811 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1032] L89-->L95-1: Formula: (and (= (+ 1 v_~node_front~0_81) v_~node_front~0_80) (= v_~node_state~0_54 1) (= (ite (= (ite (= (select (select |v_#memory_int#1_143| v_~node~0.base_85) (+ (* 4 v_~node_front~0_81) v_~node~0.offset_85)) v_~update~0_81) 1 0) 0) 0 1) v_~safe~0_104) (not (= (ite (and (< v_~node_front~0_81 v_~node_size~0_66) (<= 0 v_~node_front~0_81) (< v_~node_front~0_81 v_~node_back~0_92)) 1 0) 0))) InVars {~node_back~0=v_~node_back~0_92, ~node_size~0=v_~node_size~0_66, ~node~0.base=v_~node~0.base_85, ~node_front~0=v_~node_front~0_81, ~node~0.offset=v_~node~0.offset_85, #memory_int#1=|v_#memory_int#1_143|, ~update~0=v_~update~0_81} OutVars{~node_back~0=v_~node_back~0_92, thread2Thread1of1ForFork0_#t~post12#1=|v_thread2Thread1of1ForFork0_#t~post12#1_1|, thread2Thread1of1ForFork0_#t~mem11#1=|v_thread2Thread1of1ForFork0_#t~mem11#1_1|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~node~0.base=v_~node~0.base_85, ~node~0.offset=v_~node~0.offset_85, #memory_int#1=|v_#memory_int#1_143|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~node_size~0=v_~node_size~0_66, ~safe~0=v_~safe~0_104, ~node_front~0=v_~node_front~0_80, ~node_state~0=v_~node_state~0_54, ~update~0=v_~update~0_81} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#t~post12#1, thread2Thread1of1ForFork0_#t~mem11#1, ~safe~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~node_front~0, ~node_state~0][85], [Black: 64#(and (= ~node_state~0 0) (= ~client_state~0 0) (= ~manager_state~0 0)), Black: 68#(<= ~manager_back~0 ~manager_front~0), 80#true, Black: 72#(<= ~node_back~0 ~node_front~0), 43#L109-5true, Black: 77#(and (= ~node_state~0 0) (= ~client_state~0 1) (= ~manager_state~0 0)), Black: 76#(and (= ~node_state~0 0) (= ~manager_state~0 0)), 25#L73-1true, 74#true, Black: 83#(and (= ~node_state~0 0) (= ~client_state~0 1)), Black: 84#(and (= ~manager_state~0 1) (= ~node_state~0 0) (= ~client_state~0 1)), Black: 82#(= ~node_state~0 0), 21#L95-1true, thread3Thread1of1ForFork2InUse, 19#ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 89#true]) [2024-06-28 02:46:45,811 INFO L294 olderBase$Statistics]: this new event has 49 ancestors and is cut-off event [2024-06-28 02:46:45,811 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2024-06-28 02:46:45,811 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2024-06-28 02:46:45,811 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2024-06-28 02:46:45,811 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1032] L89-->L95-1: Formula: (and (= (+ 1 v_~node_front~0_81) v_~node_front~0_80) (= v_~node_state~0_54 1) (= (ite (= (ite (= (select (select |v_#memory_int#1_143| v_~node~0.base_85) (+ (* 4 v_~node_front~0_81) v_~node~0.offset_85)) v_~update~0_81) 1 0) 0) 0 1) v_~safe~0_104) (not (= (ite (and (< v_~node_front~0_81 v_~node_size~0_66) (<= 0 v_~node_front~0_81) (< v_~node_front~0_81 v_~node_back~0_92)) 1 0) 0))) InVars {~node_back~0=v_~node_back~0_92, ~node_size~0=v_~node_size~0_66, ~node~0.base=v_~node~0.base_85, ~node_front~0=v_~node_front~0_81, ~node~0.offset=v_~node~0.offset_85, #memory_int#1=|v_#memory_int#1_143|, ~update~0=v_~update~0_81} OutVars{~node_back~0=v_~node_back~0_92, thread2Thread1of1ForFork0_#t~post12#1=|v_thread2Thread1of1ForFork0_#t~post12#1_1|, thread2Thread1of1ForFork0_#t~mem11#1=|v_thread2Thread1of1ForFork0_#t~mem11#1_1|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~node~0.base=v_~node~0.base_85, ~node~0.offset=v_~node~0.offset_85, #memory_int#1=|v_#memory_int#1_143|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~node_size~0=v_~node_size~0_66, ~safe~0=v_~safe~0_104, ~node_front~0=v_~node_front~0_80, ~node_state~0=v_~node_state~0_54, ~update~0=v_~update~0_81} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#t~post12#1, thread2Thread1of1ForFork0_#t~mem11#1, ~safe~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~node_front~0, ~node_state~0][85], [Black: 64#(and (= ~node_state~0 0) (= ~client_state~0 0) (= ~manager_state~0 0)), Black: 68#(<= ~manager_back~0 ~manager_front~0), 32#L110true, 80#true, Black: 72#(<= ~node_back~0 ~node_front~0), Black: 77#(and (= ~node_state~0 0) (= ~client_state~0 1) (= ~manager_state~0 0)), Black: 76#(and (= ~node_state~0 0) (= ~manager_state~0 0)), 25#L73-1true, 74#true, Black: 83#(and (= ~node_state~0 0) (= ~client_state~0 1)), Black: 84#(and (= ~manager_state~0 1) (= ~node_state~0 0) (= ~client_state~0 1)), Black: 82#(= ~node_state~0 0), 21#L95-1true, thread3Thread1of1ForFork2InUse, 19#ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 89#true]) [2024-06-28 02:46:45,811 INFO L294 olderBase$Statistics]: this new event has 49 ancestors and is cut-off event [2024-06-28 02:46:45,811 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2024-06-28 02:46:45,812 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2024-06-28 02:46:45,812 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2024-06-28 02:46:45,858 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1032] L89-->L95-1: Formula: (and (= (+ 1 v_~node_front~0_81) v_~node_front~0_80) (= v_~node_state~0_54 1) (= (ite (= (ite (= (select (select |v_#memory_int#1_143| v_~node~0.base_85) (+ (* 4 v_~node_front~0_81) v_~node~0.offset_85)) v_~update~0_81) 1 0) 0) 0 1) v_~safe~0_104) (not (= (ite (and (< v_~node_front~0_81 v_~node_size~0_66) (<= 0 v_~node_front~0_81) (< v_~node_front~0_81 v_~node_back~0_92)) 1 0) 0))) InVars {~node_back~0=v_~node_back~0_92, ~node_size~0=v_~node_size~0_66, ~node~0.base=v_~node~0.base_85, ~node_front~0=v_~node_front~0_81, ~node~0.offset=v_~node~0.offset_85, #memory_int#1=|v_#memory_int#1_143|, ~update~0=v_~update~0_81} OutVars{~node_back~0=v_~node_back~0_92, thread2Thread1of1ForFork0_#t~post12#1=|v_thread2Thread1of1ForFork0_#t~post12#1_1|, thread2Thread1of1ForFork0_#t~mem11#1=|v_thread2Thread1of1ForFork0_#t~mem11#1_1|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~node~0.base=v_~node~0.base_85, ~node~0.offset=v_~node~0.offset_85, #memory_int#1=|v_#memory_int#1_143|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~node_size~0=v_~node_size~0_66, ~safe~0=v_~safe~0_104, ~node_front~0=v_~node_front~0_80, ~node_state~0=v_~node_state~0_54, ~update~0=v_~update~0_81} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#t~post12#1, thread2Thread1of1ForFork0_#t~mem11#1, ~safe~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~node_front~0, ~node_state~0][85], [Black: 64#(and (= ~node_state~0 0) (= ~client_state~0 0) (= ~manager_state~0 0)), Black: 68#(<= ~manager_back~0 ~manager_front~0), 80#true, Black: 72#(<= ~node_back~0 ~node_front~0), Black: 77#(and (= ~node_state~0 0) (= ~client_state~0 1) (= ~manager_state~0 0)), Black: 76#(and (= ~node_state~0 0) (= ~manager_state~0 0)), 25#L73-1true, 74#true, Black: 83#(and (= ~node_state~0 0) (= ~client_state~0 1)), Black: 84#(and (= ~manager_state~0 1) (= ~node_state~0 0) (= ~client_state~0 1)), Black: 82#(= ~node_state~0 0), 21#L95-1true, thread3Thread1of1ForFork2InUse, 13#L117true, 19#ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 89#true]) [2024-06-28 02:46:45,858 INFO L294 olderBase$Statistics]: this new event has 50 ancestors and is cut-off event [2024-06-28 02:46:45,858 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2024-06-28 02:46:45,858 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2024-06-28 02:46:45,858 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2024-06-28 02:46:45,862 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1032] L89-->L95-1: Formula: (and (= (+ 1 v_~node_front~0_81) v_~node_front~0_80) (= v_~node_state~0_54 1) (= (ite (= (ite (= (select (select |v_#memory_int#1_143| v_~node~0.base_85) (+ (* 4 v_~node_front~0_81) v_~node~0.offset_85)) v_~update~0_81) 1 0) 0) 0 1) v_~safe~0_104) (not (= (ite (and (< v_~node_front~0_81 v_~node_size~0_66) (<= 0 v_~node_front~0_81) (< v_~node_front~0_81 v_~node_back~0_92)) 1 0) 0))) InVars {~node_back~0=v_~node_back~0_92, ~node_size~0=v_~node_size~0_66, ~node~0.base=v_~node~0.base_85, ~node_front~0=v_~node_front~0_81, ~node~0.offset=v_~node~0.offset_85, #memory_int#1=|v_#memory_int#1_143|, ~update~0=v_~update~0_81} OutVars{~node_back~0=v_~node_back~0_92, thread2Thread1of1ForFork0_#t~post12#1=|v_thread2Thread1of1ForFork0_#t~post12#1_1|, thread2Thread1of1ForFork0_#t~mem11#1=|v_thread2Thread1of1ForFork0_#t~mem11#1_1|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~node~0.base=v_~node~0.base_85, ~node~0.offset=v_~node~0.offset_85, #memory_int#1=|v_#memory_int#1_143|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~node_size~0=v_~node_size~0_66, ~safe~0=v_~safe~0_104, ~node_front~0=v_~node_front~0_80, ~node_state~0=v_~node_state~0_54, ~update~0=v_~update~0_81} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#t~post12#1, thread2Thread1of1ForFork0_#t~mem11#1, ~safe~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~node_front~0, ~node_state~0][85], [Black: 64#(and (= ~node_state~0 0) (= ~client_state~0 0) (= ~manager_state~0 0)), Black: 68#(<= ~manager_back~0 ~manager_front~0), 80#true, Black: 72#(<= ~node_back~0 ~node_front~0), 53#L51-1true, 43#L109-5true, Black: 77#(and (= ~node_state~0 0) (= ~client_state~0 1) (= ~manager_state~0 0)), Black: 76#(and (= ~node_state~0 0) (= ~manager_state~0 0)), 74#true, Black: 83#(and (= ~node_state~0 0) (= ~client_state~0 1)), Black: 84#(and (= ~manager_state~0 1) (= ~node_state~0 0) (= ~client_state~0 1)), Black: 82#(= ~node_state~0 0), 21#L95-1true, thread3Thread1of1ForFork2InUse, 19#ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 89#true]) [2024-06-28 02:46:45,862 INFO L294 olderBase$Statistics]: this new event has 50 ancestors and is cut-off event [2024-06-28 02:46:45,862 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2024-06-28 02:46:45,862 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2024-06-28 02:46:45,862 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2024-06-28 02:46:45,863 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1032] L89-->L95-1: Formula: (and (= (+ 1 v_~node_front~0_81) v_~node_front~0_80) (= v_~node_state~0_54 1) (= (ite (= (ite (= (select (select |v_#memory_int#1_143| v_~node~0.base_85) (+ (* 4 v_~node_front~0_81) v_~node~0.offset_85)) v_~update~0_81) 1 0) 0) 0 1) v_~safe~0_104) (not (= (ite (and (< v_~node_front~0_81 v_~node_size~0_66) (<= 0 v_~node_front~0_81) (< v_~node_front~0_81 v_~node_back~0_92)) 1 0) 0))) InVars {~node_back~0=v_~node_back~0_92, ~node_size~0=v_~node_size~0_66, ~node~0.base=v_~node~0.base_85, ~node_front~0=v_~node_front~0_81, ~node~0.offset=v_~node~0.offset_85, #memory_int#1=|v_#memory_int#1_143|, ~update~0=v_~update~0_81} OutVars{~node_back~0=v_~node_back~0_92, thread2Thread1of1ForFork0_#t~post12#1=|v_thread2Thread1of1ForFork0_#t~post12#1_1|, thread2Thread1of1ForFork0_#t~mem11#1=|v_thread2Thread1of1ForFork0_#t~mem11#1_1|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~node~0.base=v_~node~0.base_85, ~node~0.offset=v_~node~0.offset_85, #memory_int#1=|v_#memory_int#1_143|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~node_size~0=v_~node_size~0_66, ~safe~0=v_~safe~0_104, ~node_front~0=v_~node_front~0_80, ~node_state~0=v_~node_state~0_54, ~update~0=v_~update~0_81} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#t~post12#1, thread2Thread1of1ForFork0_#t~mem11#1, ~safe~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~node_front~0, ~node_state~0][85], [Black: 64#(and (= ~node_state~0 0) (= ~client_state~0 0) (= ~manager_state~0 0)), Black: 68#(<= ~manager_back~0 ~manager_front~0), 32#L110true, 80#true, Black: 72#(<= ~node_back~0 ~node_front~0), 53#L51-1true, Black: 77#(and (= ~node_state~0 0) (= ~client_state~0 1) (= ~manager_state~0 0)), Black: 76#(and (= ~node_state~0 0) (= ~manager_state~0 0)), 74#true, Black: 83#(and (= ~node_state~0 0) (= ~client_state~0 1)), Black: 84#(and (= ~manager_state~0 1) (= ~node_state~0 0) (= ~client_state~0 1)), Black: 82#(= ~node_state~0 0), 21#L95-1true, thread3Thread1of1ForFork2InUse, 19#ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 89#true]) [2024-06-28 02:46:45,863 INFO L294 olderBase$Statistics]: this new event has 50 ancestors and is cut-off event [2024-06-28 02:46:45,863 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2024-06-28 02:46:45,863 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2024-06-28 02:46:45,863 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2024-06-28 02:46:45,863 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1032] L89-->L95-1: Formula: (and (= (+ 1 v_~node_front~0_81) v_~node_front~0_80) (= v_~node_state~0_54 1) (= (ite (= (ite (= (select (select |v_#memory_int#1_143| v_~node~0.base_85) (+ (* 4 v_~node_front~0_81) v_~node~0.offset_85)) v_~update~0_81) 1 0) 0) 0 1) v_~safe~0_104) (not (= (ite (and (< v_~node_front~0_81 v_~node_size~0_66) (<= 0 v_~node_front~0_81) (< v_~node_front~0_81 v_~node_back~0_92)) 1 0) 0))) InVars {~node_back~0=v_~node_back~0_92, ~node_size~0=v_~node_size~0_66, ~node~0.base=v_~node~0.base_85, ~node_front~0=v_~node_front~0_81, ~node~0.offset=v_~node~0.offset_85, #memory_int#1=|v_#memory_int#1_143|, ~update~0=v_~update~0_81} OutVars{~node_back~0=v_~node_back~0_92, thread2Thread1of1ForFork0_#t~post12#1=|v_thread2Thread1of1ForFork0_#t~post12#1_1|, thread2Thread1of1ForFork0_#t~mem11#1=|v_thread2Thread1of1ForFork0_#t~mem11#1_1|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~node~0.base=v_~node~0.base_85, ~node~0.offset=v_~node~0.offset_85, #memory_int#1=|v_#memory_int#1_143|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~node_size~0=v_~node_size~0_66, ~safe~0=v_~safe~0_104, ~node_front~0=v_~node_front~0_80, ~node_state~0=v_~node_state~0_54, ~update~0=v_~update~0_81} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#t~post12#1, thread2Thread1of1ForFork0_#t~mem11#1, ~safe~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~node_front~0, ~node_state~0][85], [30#L109-1true, Black: 64#(and (= ~node_state~0 0) (= ~client_state~0 0) (= ~manager_state~0 0)), 18#L51-5true, Black: 68#(<= ~manager_back~0 ~manager_front~0), 80#true, Black: 72#(<= ~node_back~0 ~node_front~0), Black: 77#(and (= ~node_state~0 0) (= ~client_state~0 1) (= ~manager_state~0 0)), Black: 76#(and (= ~node_state~0 0) (= ~manager_state~0 0)), 74#true, Black: 83#(and (= ~node_state~0 0) (= ~client_state~0 1)), Black: 84#(and (= ~manager_state~0 1) (= ~node_state~0 0) (= ~client_state~0 1)), Black: 82#(= ~node_state~0 0), 21#L95-1true, thread3Thread1of1ForFork2InUse, 19#ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 89#true]) [2024-06-28 02:46:45,864 INFO L294 olderBase$Statistics]: this new event has 50 ancestors and is cut-off event [2024-06-28 02:46:45,864 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2024-06-28 02:46:45,864 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2024-06-28 02:46:45,864 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2024-06-28 02:46:45,864 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1032] L89-->L95-1: Formula: (and (= (+ 1 v_~node_front~0_81) v_~node_front~0_80) (= v_~node_state~0_54 1) (= (ite (= (ite (= (select (select |v_#memory_int#1_143| v_~node~0.base_85) (+ (* 4 v_~node_front~0_81) v_~node~0.offset_85)) v_~update~0_81) 1 0) 0) 0 1) v_~safe~0_104) (not (= (ite (and (< v_~node_front~0_81 v_~node_size~0_66) (<= 0 v_~node_front~0_81) (< v_~node_front~0_81 v_~node_back~0_92)) 1 0) 0))) InVars {~node_back~0=v_~node_back~0_92, ~node_size~0=v_~node_size~0_66, ~node~0.base=v_~node~0.base_85, ~node_front~0=v_~node_front~0_81, ~node~0.offset=v_~node~0.offset_85, #memory_int#1=|v_#memory_int#1_143|, ~update~0=v_~update~0_81} OutVars{~node_back~0=v_~node_back~0_92, thread2Thread1of1ForFork0_#t~post12#1=|v_thread2Thread1of1ForFork0_#t~post12#1_1|, thread2Thread1of1ForFork0_#t~mem11#1=|v_thread2Thread1of1ForFork0_#t~mem11#1_1|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~node~0.base=v_~node~0.base_85, ~node~0.offset=v_~node~0.offset_85, #memory_int#1=|v_#memory_int#1_143|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~node_size~0=v_~node_size~0_66, ~safe~0=v_~safe~0_104, ~node_front~0=v_~node_front~0_80, ~node_state~0=v_~node_state~0_54, ~update~0=v_~update~0_81} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#t~post12#1, thread2Thread1of1ForFork0_#t~mem11#1, ~safe~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~node_front~0, ~node_state~0][85], [30#L109-1true, Black: 64#(and (= ~node_state~0 0) (= ~client_state~0 0) (= ~manager_state~0 0)), Black: 68#(<= ~manager_back~0 ~manager_front~0), 80#true, Black: 72#(<= ~node_back~0 ~node_front~0), Black: 77#(and (= ~node_state~0 0) (= ~client_state~0 1) (= ~manager_state~0 0)), Black: 76#(and (= ~node_state~0 0) (= ~manager_state~0 0)), 74#true, Black: 83#(and (= ~node_state~0 0) (= ~client_state~0 1)), Black: 84#(and (= ~manager_state~0 1) (= ~node_state~0 0) (= ~client_state~0 1)), 28#L52true, Black: 82#(= ~node_state~0 0), 21#L95-1true, thread3Thread1of1ForFork2InUse, 19#ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 89#true]) [2024-06-28 02:46:45,864 INFO L294 olderBase$Statistics]: this new event has 50 ancestors and is cut-off event [2024-06-28 02:46:45,864 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2024-06-28 02:46:45,864 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2024-06-28 02:46:45,865 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2024-06-28 02:46:45,865 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1032] L89-->L95-1: Formula: (and (= (+ 1 v_~node_front~0_81) v_~node_front~0_80) (= v_~node_state~0_54 1) (= (ite (= (ite (= (select (select |v_#memory_int#1_143| v_~node~0.base_85) (+ (* 4 v_~node_front~0_81) v_~node~0.offset_85)) v_~update~0_81) 1 0) 0) 0 1) v_~safe~0_104) (not (= (ite (and (< v_~node_front~0_81 v_~node_size~0_66) (<= 0 v_~node_front~0_81) (< v_~node_front~0_81 v_~node_back~0_92)) 1 0) 0))) InVars {~node_back~0=v_~node_back~0_92, ~node_size~0=v_~node_size~0_66, ~node~0.base=v_~node~0.base_85, ~node_front~0=v_~node_front~0_81, ~node~0.offset=v_~node~0.offset_85, #memory_int#1=|v_#memory_int#1_143|, ~update~0=v_~update~0_81} OutVars{~node_back~0=v_~node_back~0_92, thread2Thread1of1ForFork0_#t~post12#1=|v_thread2Thread1of1ForFork0_#t~post12#1_1|, thread2Thread1of1ForFork0_#t~mem11#1=|v_thread2Thread1of1ForFork0_#t~mem11#1_1|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~node~0.base=v_~node~0.base_85, ~node~0.offset=v_~node~0.offset_85, #memory_int#1=|v_#memory_int#1_143|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~node_size~0=v_~node_size~0_66, ~safe~0=v_~safe~0_104, ~node_front~0=v_~node_front~0_80, ~node_state~0=v_~node_state~0_54, ~update~0=v_~update~0_81} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#t~post12#1, thread2Thread1of1ForFork0_#t~mem11#1, ~safe~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~node_front~0, ~node_state~0][85], [Black: 64#(and (= ~node_state~0 0) (= ~client_state~0 0) (= ~manager_state~0 0)), 24#L117-1true, 33#thread1EXITtrue, Black: 68#(<= ~manager_back~0 ~manager_front~0), 80#true, Black: 72#(<= ~node_back~0 ~node_front~0), Black: 77#(and (= ~node_state~0 0) (= ~client_state~0 1) (= ~manager_state~0 0)), Black: 76#(and (= ~node_state~0 0) (= ~manager_state~0 0)), 74#true, Black: 83#(and (= ~node_state~0 0) (= ~client_state~0 1)), Black: 84#(and (= ~manager_state~0 1) (= ~node_state~0 0) (= ~client_state~0 1)), Black: 82#(= ~node_state~0 0), 21#L95-1true, thread3Thread1of1ForFork2InUse, 19#ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 89#true]) [2024-06-28 02:46:45,865 INFO L294 olderBase$Statistics]: this new event has 50 ancestors and is cut-off event [2024-06-28 02:46:45,865 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2024-06-28 02:46:45,865 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2024-06-28 02:46:45,865 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2024-06-28 02:46:45,865 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1032] L89-->L95-1: Formula: (and (= (+ 1 v_~node_front~0_81) v_~node_front~0_80) (= v_~node_state~0_54 1) (= (ite (= (ite (= (select (select |v_#memory_int#1_143| v_~node~0.base_85) (+ (* 4 v_~node_front~0_81) v_~node~0.offset_85)) v_~update~0_81) 1 0) 0) 0 1) v_~safe~0_104) (not (= (ite (and (< v_~node_front~0_81 v_~node_size~0_66) (<= 0 v_~node_front~0_81) (< v_~node_front~0_81 v_~node_back~0_92)) 1 0) 0))) InVars {~node_back~0=v_~node_back~0_92, ~node_size~0=v_~node_size~0_66, ~node~0.base=v_~node~0.base_85, ~node_front~0=v_~node_front~0_81, ~node~0.offset=v_~node~0.offset_85, #memory_int#1=|v_#memory_int#1_143|, ~update~0=v_~update~0_81} OutVars{~node_back~0=v_~node_back~0_92, thread2Thread1of1ForFork0_#t~post12#1=|v_thread2Thread1of1ForFork0_#t~post12#1_1|, thread2Thread1of1ForFork0_#t~mem11#1=|v_thread2Thread1of1ForFork0_#t~mem11#1_1|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~node~0.base=v_~node~0.base_85, ~node~0.offset=v_~node~0.offset_85, #memory_int#1=|v_#memory_int#1_143|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~node_size~0=v_~node_size~0_66, ~safe~0=v_~safe~0_104, ~node_front~0=v_~node_front~0_80, ~node_state~0=v_~node_state~0_54, ~update~0=v_~update~0_81} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#t~post12#1, thread2Thread1of1ForFork0_#t~mem11#1, ~safe~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~node_front~0, ~node_state~0][85], [Black: 64#(and (= ~node_state~0 0) (= ~client_state~0 0) (= ~manager_state~0 0)), Black: 68#(<= ~manager_back~0 ~manager_front~0), 80#true, Black: 72#(<= ~node_back~0 ~node_front~0), 47#thread3EXITtrue, Black: 77#(and (= ~node_state~0 0) (= ~client_state~0 1) (= ~manager_state~0 0)), Black: 76#(and (= ~node_state~0 0) (= ~manager_state~0 0)), 25#L73-1true, 74#true, Black: 83#(and (= ~node_state~0 0) (= ~client_state~0 1)), Black: 84#(and (= ~manager_state~0 1) (= ~node_state~0 0) (= ~client_state~0 1)), Black: 82#(= ~node_state~0 0), 21#L95-1true, thread3Thread1of1ForFork2InUse, 19#ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 89#true]) [2024-06-28 02:46:45,865 INFO L294 olderBase$Statistics]: this new event has 50 ancestors and is cut-off event [2024-06-28 02:46:45,866 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2024-06-28 02:46:45,866 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2024-06-28 02:46:45,866 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2024-06-28 02:46:46,032 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1032] L89-->L95-1: Formula: (and (= (+ 1 v_~node_front~0_81) v_~node_front~0_80) (= v_~node_state~0_54 1) (= (ite (= (ite (= (select (select |v_#memory_int#1_143| v_~node~0.base_85) (+ (* 4 v_~node_front~0_81) v_~node~0.offset_85)) v_~update~0_81) 1 0) 0) 0 1) v_~safe~0_104) (not (= (ite (and (< v_~node_front~0_81 v_~node_size~0_66) (<= 0 v_~node_front~0_81) (< v_~node_front~0_81 v_~node_back~0_92)) 1 0) 0))) InVars {~node_back~0=v_~node_back~0_92, ~node_size~0=v_~node_size~0_66, ~node~0.base=v_~node~0.base_85, ~node_front~0=v_~node_front~0_81, ~node~0.offset=v_~node~0.offset_85, #memory_int#1=|v_#memory_int#1_143|, ~update~0=v_~update~0_81} OutVars{~node_back~0=v_~node_back~0_92, thread2Thread1of1ForFork0_#t~post12#1=|v_thread2Thread1of1ForFork0_#t~post12#1_1|, thread2Thread1of1ForFork0_#t~mem11#1=|v_thread2Thread1of1ForFork0_#t~mem11#1_1|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~node~0.base=v_~node~0.base_85, ~node~0.offset=v_~node~0.offset_85, #memory_int#1=|v_#memory_int#1_143|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~node_size~0=v_~node_size~0_66, ~safe~0=v_~safe~0_104, ~node_front~0=v_~node_front~0_80, ~node_state~0=v_~node_state~0_54, ~update~0=v_~update~0_81} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#t~post12#1, thread2Thread1of1ForFork0_#t~mem11#1, ~safe~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~node_front~0, ~node_state~0][74], [Black: 64#(and (= ~node_state~0 0) (= ~client_state~0 0) (= ~manager_state~0 0)), 33#thread1EXITtrue, Black: 68#(<= ~manager_back~0 ~manager_front~0), 80#true, Black: 72#(<= ~node_back~0 ~node_front~0), Black: 77#(and (= ~node_state~0 0) (= ~client_state~0 1) (= ~manager_state~0 0)), Black: 76#(and (= ~node_state~0 0) (= ~manager_state~0 0)), 5#L118true, 74#true, Black: 83#(and (= ~node_state~0 0) (= ~client_state~0 1)), Black: 84#(and (= ~manager_state~0 1) (= ~node_state~0 0) (= ~client_state~0 1)), Black: 82#(= ~node_state~0 0), 21#L95-1true, 11#L156-5true, thread3Thread1of1ForFork2InUse, 89#true]) [2024-06-28 02:46:46,033 INFO L294 olderBase$Statistics]: this new event has 52 ancestors and is cut-off event [2024-06-28 02:46:46,033 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2024-06-28 02:46:46,033 INFO L297 olderBase$Statistics]: existing Event has 52 ancestors and is cut-off event [2024-06-28 02:46:46,033 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2024-06-28 02:46:46,033 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1032] L89-->L95-1: Formula: (and (= (+ 1 v_~node_front~0_81) v_~node_front~0_80) (= v_~node_state~0_54 1) (= (ite (= (ite (= (select (select |v_#memory_int#1_143| v_~node~0.base_85) (+ (* 4 v_~node_front~0_81) v_~node~0.offset_85)) v_~update~0_81) 1 0) 0) 0 1) v_~safe~0_104) (not (= (ite (and (< v_~node_front~0_81 v_~node_size~0_66) (<= 0 v_~node_front~0_81) (< v_~node_front~0_81 v_~node_back~0_92)) 1 0) 0))) InVars {~node_back~0=v_~node_back~0_92, ~node_size~0=v_~node_size~0_66, ~node~0.base=v_~node~0.base_85, ~node_front~0=v_~node_front~0_81, ~node~0.offset=v_~node~0.offset_85, #memory_int#1=|v_#memory_int#1_143|, ~update~0=v_~update~0_81} OutVars{~node_back~0=v_~node_back~0_92, thread2Thread1of1ForFork0_#t~post12#1=|v_thread2Thread1of1ForFork0_#t~post12#1_1|, thread2Thread1of1ForFork0_#t~mem11#1=|v_thread2Thread1of1ForFork0_#t~mem11#1_1|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~node~0.base=v_~node~0.base_85, ~node~0.offset=v_~node~0.offset_85, #memory_int#1=|v_#memory_int#1_143|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~node_size~0=v_~node_size~0_66, ~safe~0=v_~safe~0_104, ~node_front~0=v_~node_front~0_80, ~node_state~0=v_~node_state~0_54, ~update~0=v_~update~0_81} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#t~post12#1, thread2Thread1of1ForFork0_#t~mem11#1, ~safe~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~node_front~0, ~node_state~0][85], [Black: 64#(and (= ~node_state~0 0) (= ~client_state~0 0) (= ~manager_state~0 0)), 33#thread1EXITtrue, Black: 68#(<= ~manager_back~0 ~manager_front~0), 80#true, Black: 72#(<= ~node_back~0 ~node_front~0), Black: 77#(and (= ~node_state~0 0) (= ~client_state~0 1) (= ~manager_state~0 0)), Black: 76#(and (= ~node_state~0 0) (= ~manager_state~0 0)), 74#true, Black: 83#(and (= ~node_state~0 0) (= ~client_state~0 1)), Black: 84#(and (= ~manager_state~0 1) (= ~node_state~0 0) (= ~client_state~0 1)), Black: 82#(= ~node_state~0 0), 21#L95-1true, 11#L156-5true, thread3Thread1of1ForFork2InUse, 13#L117true, 89#true]) [2024-06-28 02:46:46,034 INFO L294 olderBase$Statistics]: this new event has 51 ancestors and is cut-off event [2024-06-28 02:46:46,034 INFO L297 olderBase$Statistics]: existing Event has 51 ancestors and is cut-off event [2024-06-28 02:46:46,034 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2024-06-28 02:46:46,037 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2024-06-28 02:46:46,046 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1032] L89-->L95-1: Formula: (and (= (+ 1 v_~node_front~0_81) v_~node_front~0_80) (= v_~node_state~0_54 1) (= (ite (= (ite (= (select (select |v_#memory_int#1_143| v_~node~0.base_85) (+ (* 4 v_~node_front~0_81) v_~node~0.offset_85)) v_~update~0_81) 1 0) 0) 0 1) v_~safe~0_104) (not (= (ite (and (< v_~node_front~0_81 v_~node_size~0_66) (<= 0 v_~node_front~0_81) (< v_~node_front~0_81 v_~node_back~0_92)) 1 0) 0))) InVars {~node_back~0=v_~node_back~0_92, ~node_size~0=v_~node_size~0_66, ~node~0.base=v_~node~0.base_85, ~node_front~0=v_~node_front~0_81, ~node~0.offset=v_~node~0.offset_85, #memory_int#1=|v_#memory_int#1_143|, ~update~0=v_~update~0_81} OutVars{~node_back~0=v_~node_back~0_92, thread2Thread1of1ForFork0_#t~post12#1=|v_thread2Thread1of1ForFork0_#t~post12#1_1|, thread2Thread1of1ForFork0_#t~mem11#1=|v_thread2Thread1of1ForFork0_#t~mem11#1_1|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~node~0.base=v_~node~0.base_85, ~node~0.offset=v_~node~0.offset_85, #memory_int#1=|v_#memory_int#1_143|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~node_size~0=v_~node_size~0_66, ~safe~0=v_~safe~0_104, ~node_front~0=v_~node_front~0_80, ~node_state~0=v_~node_state~0_54, ~update~0=v_~update~0_81} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#t~post12#1, thread2Thread1of1ForFork0_#t~mem11#1, ~safe~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~node_front~0, ~node_state~0][85], [Black: 64#(and (= ~node_state~0 0) (= ~client_state~0 0) (= ~manager_state~0 0)), Black: 68#(<= ~manager_back~0 ~manager_front~0), 80#true, Black: 72#(<= ~node_back~0 ~node_front~0), 53#L51-1true, Black: 77#(and (= ~node_state~0 0) (= ~client_state~0 1) (= ~manager_state~0 0)), Black: 76#(and (= ~node_state~0 0) (= ~manager_state~0 0)), 74#true, Black: 83#(and (= ~node_state~0 0) (= ~client_state~0 1)), Black: 84#(and (= ~manager_state~0 1) (= ~node_state~0 0) (= ~client_state~0 1)), Black: 82#(= ~node_state~0 0), 21#L95-1true, thread3Thread1of1ForFork2InUse, 13#L117true, 19#ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 89#true]) [2024-06-28 02:46:46,046 INFO L294 olderBase$Statistics]: this new event has 51 ancestors and is cut-off event [2024-06-28 02:46:46,047 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2024-06-28 02:46:46,047 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2024-06-28 02:46:46,047 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2024-06-28 02:46:46,047 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1032] L89-->L95-1: Formula: (and (= (+ 1 v_~node_front~0_81) v_~node_front~0_80) (= v_~node_state~0_54 1) (= (ite (= (ite (= (select (select |v_#memory_int#1_143| v_~node~0.base_85) (+ (* 4 v_~node_front~0_81) v_~node~0.offset_85)) v_~update~0_81) 1 0) 0) 0 1) v_~safe~0_104) (not (= (ite (and (< v_~node_front~0_81 v_~node_size~0_66) (<= 0 v_~node_front~0_81) (< v_~node_front~0_81 v_~node_back~0_92)) 1 0) 0))) InVars {~node_back~0=v_~node_back~0_92, ~node_size~0=v_~node_size~0_66, ~node~0.base=v_~node~0.base_85, ~node_front~0=v_~node_front~0_81, ~node~0.offset=v_~node~0.offset_85, #memory_int#1=|v_#memory_int#1_143|, ~update~0=v_~update~0_81} OutVars{~node_back~0=v_~node_back~0_92, thread2Thread1of1ForFork0_#t~post12#1=|v_thread2Thread1of1ForFork0_#t~post12#1_1|, thread2Thread1of1ForFork0_#t~mem11#1=|v_thread2Thread1of1ForFork0_#t~mem11#1_1|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~node~0.base=v_~node~0.base_85, ~node~0.offset=v_~node~0.offset_85, #memory_int#1=|v_#memory_int#1_143|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~node_size~0=v_~node_size~0_66, ~safe~0=v_~safe~0_104, ~node_front~0=v_~node_front~0_80, ~node_state~0=v_~node_state~0_54, ~update~0=v_~update~0_81} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#t~post12#1, thread2Thread1of1ForFork0_#t~mem11#1, ~safe~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~node_front~0, ~node_state~0][74], [Black: 64#(and (= ~node_state~0 0) (= ~client_state~0 0) (= ~manager_state~0 0)), Black: 68#(<= ~manager_back~0 ~manager_front~0), 80#true, Black: 72#(<= ~node_back~0 ~node_front~0), Black: 77#(and (= ~node_state~0 0) (= ~client_state~0 1) (= ~manager_state~0 0)), Black: 76#(and (= ~node_state~0 0) (= ~manager_state~0 0)), 5#L118true, 25#L73-1true, 74#true, Black: 83#(and (= ~node_state~0 0) (= ~client_state~0 1)), Black: 84#(and (= ~manager_state~0 1) (= ~node_state~0 0) (= ~client_state~0 1)), Black: 82#(= ~node_state~0 0), 21#L95-1true, thread3Thread1of1ForFork2InUse, 19#ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 89#true]) [2024-06-28 02:46:46,047 INFO L294 olderBase$Statistics]: this new event has 51 ancestors and is cut-off event [2024-06-28 02:46:46,048 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2024-06-28 02:46:46,048 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2024-06-28 02:46:46,048 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2024-06-28 02:46:46,054 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1032] L89-->L95-1: Formula: (and (= (+ 1 v_~node_front~0_81) v_~node_front~0_80) (= v_~node_state~0_54 1) (= (ite (= (ite (= (select (select |v_#memory_int#1_143| v_~node~0.base_85) (+ (* 4 v_~node_front~0_81) v_~node~0.offset_85)) v_~update~0_81) 1 0) 0) 0 1) v_~safe~0_104) (not (= (ite (and (< v_~node_front~0_81 v_~node_size~0_66) (<= 0 v_~node_front~0_81) (< v_~node_front~0_81 v_~node_back~0_92)) 1 0) 0))) InVars {~node_back~0=v_~node_back~0_92, ~node_size~0=v_~node_size~0_66, ~node~0.base=v_~node~0.base_85, ~node_front~0=v_~node_front~0_81, ~node~0.offset=v_~node~0.offset_85, #memory_int#1=|v_#memory_int#1_143|, ~update~0=v_~update~0_81} OutVars{~node_back~0=v_~node_back~0_92, thread2Thread1of1ForFork0_#t~post12#1=|v_thread2Thread1of1ForFork0_#t~post12#1_1|, thread2Thread1of1ForFork0_#t~mem11#1=|v_thread2Thread1of1ForFork0_#t~mem11#1_1|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~node~0.base=v_~node~0.base_85, ~node~0.offset=v_~node~0.offset_85, #memory_int#1=|v_#memory_int#1_143|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~node_size~0=v_~node_size~0_66, ~safe~0=v_~safe~0_104, ~node_front~0=v_~node_front~0_80, ~node_state~0=v_~node_state~0_54, ~update~0=v_~update~0_81} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#t~post12#1, thread2Thread1of1ForFork0_#t~mem11#1, ~safe~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~node_front~0, ~node_state~0][85], [Black: 64#(and (= ~node_state~0 0) (= ~client_state~0 0) (= ~manager_state~0 0)), 18#L51-5true, Black: 68#(<= ~manager_back~0 ~manager_front~0), 80#true, Black: 72#(<= ~node_back~0 ~node_front~0), 43#L109-5true, Black: 77#(and (= ~node_state~0 0) (= ~client_state~0 1) (= ~manager_state~0 0)), Black: 76#(and (= ~node_state~0 0) (= ~manager_state~0 0)), 74#true, Black: 83#(and (= ~node_state~0 0) (= ~client_state~0 1)), Black: 84#(and (= ~manager_state~0 1) (= ~node_state~0 0) (= ~client_state~0 1)), Black: 82#(= ~node_state~0 0), 21#L95-1true, thread3Thread1of1ForFork2InUse, 19#ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 89#true]) [2024-06-28 02:46:46,064 INFO L294 olderBase$Statistics]: this new event has 51 ancestors and is cut-off event [2024-06-28 02:46:46,064 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2024-06-28 02:46:46,064 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2024-06-28 02:46:46,064 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2024-06-28 02:46:46,065 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1032] L89-->L95-1: Formula: (and (= (+ 1 v_~node_front~0_81) v_~node_front~0_80) (= v_~node_state~0_54 1) (= (ite (= (ite (= (select (select |v_#memory_int#1_143| v_~node~0.base_85) (+ (* 4 v_~node_front~0_81) v_~node~0.offset_85)) v_~update~0_81) 1 0) 0) 0 1) v_~safe~0_104) (not (= (ite (and (< v_~node_front~0_81 v_~node_size~0_66) (<= 0 v_~node_front~0_81) (< v_~node_front~0_81 v_~node_back~0_92)) 1 0) 0))) InVars {~node_back~0=v_~node_back~0_92, ~node_size~0=v_~node_size~0_66, ~node~0.base=v_~node~0.base_85, ~node_front~0=v_~node_front~0_81, ~node~0.offset=v_~node~0.offset_85, #memory_int#1=|v_#memory_int#1_143|, ~update~0=v_~update~0_81} OutVars{~node_back~0=v_~node_back~0_92, thread2Thread1of1ForFork0_#t~post12#1=|v_thread2Thread1of1ForFork0_#t~post12#1_1|, thread2Thread1of1ForFork0_#t~mem11#1=|v_thread2Thread1of1ForFork0_#t~mem11#1_1|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~node~0.base=v_~node~0.base_85, ~node~0.offset=v_~node~0.offset_85, #memory_int#1=|v_#memory_int#1_143|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~node_size~0=v_~node_size~0_66, ~safe~0=v_~safe~0_104, ~node_front~0=v_~node_front~0_80, ~node_state~0=v_~node_state~0_54, ~update~0=v_~update~0_81} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#t~post12#1, thread2Thread1of1ForFork0_#t~mem11#1, ~safe~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~node_front~0, ~node_state~0][85], [Black: 64#(and (= ~node_state~0 0) (= ~client_state~0 0) (= ~manager_state~0 0)), Black: 68#(<= ~manager_back~0 ~manager_front~0), 80#true, Black: 72#(<= ~node_back~0 ~node_front~0), 43#L109-5true, Black: 77#(and (= ~node_state~0 0) (= ~client_state~0 1) (= ~manager_state~0 0)), Black: 76#(and (= ~node_state~0 0) (= ~manager_state~0 0)), 74#true, Black: 83#(and (= ~node_state~0 0) (= ~client_state~0 1)), Black: 84#(and (= ~manager_state~0 1) (= ~node_state~0 0) (= ~client_state~0 1)), 28#L52true, Black: 82#(= ~node_state~0 0), 21#L95-1true, thread3Thread1of1ForFork2InUse, 19#ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 89#true]) [2024-06-28 02:46:46,065 INFO L294 olderBase$Statistics]: this new event has 51 ancestors and is cut-off event [2024-06-28 02:46:46,066 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2024-06-28 02:46:46,066 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2024-06-28 02:46:46,066 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2024-06-28 02:46:46,066 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1032] L89-->L95-1: Formula: (and (= (+ 1 v_~node_front~0_81) v_~node_front~0_80) (= v_~node_state~0_54 1) (= (ite (= (ite (= (select (select |v_#memory_int#1_143| v_~node~0.base_85) (+ (* 4 v_~node_front~0_81) v_~node~0.offset_85)) v_~update~0_81) 1 0) 0) 0 1) v_~safe~0_104) (not (= (ite (and (< v_~node_front~0_81 v_~node_size~0_66) (<= 0 v_~node_front~0_81) (< v_~node_front~0_81 v_~node_back~0_92)) 1 0) 0))) InVars {~node_back~0=v_~node_back~0_92, ~node_size~0=v_~node_size~0_66, ~node~0.base=v_~node~0.base_85, ~node_front~0=v_~node_front~0_81, ~node~0.offset=v_~node~0.offset_85, #memory_int#1=|v_#memory_int#1_143|, ~update~0=v_~update~0_81} OutVars{~node_back~0=v_~node_back~0_92, thread2Thread1of1ForFork0_#t~post12#1=|v_thread2Thread1of1ForFork0_#t~post12#1_1|, thread2Thread1of1ForFork0_#t~mem11#1=|v_thread2Thread1of1ForFork0_#t~mem11#1_1|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~node~0.base=v_~node~0.base_85, ~node~0.offset=v_~node~0.offset_85, #memory_int#1=|v_#memory_int#1_143|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~node_size~0=v_~node_size~0_66, ~safe~0=v_~safe~0_104, ~node_front~0=v_~node_front~0_80, ~node_state~0=v_~node_state~0_54, ~update~0=v_~update~0_81} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#t~post12#1, thread2Thread1of1ForFork0_#t~mem11#1, ~safe~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~node_front~0, ~node_state~0][85], [Black: 64#(and (= ~node_state~0 0) (= ~client_state~0 0) (= ~manager_state~0 0)), Black: 68#(<= ~manager_back~0 ~manager_front~0), 80#true, Black: 72#(<= ~node_back~0 ~node_front~0), 47#thread3EXITtrue, 53#L51-1true, Black: 77#(and (= ~node_state~0 0) (= ~client_state~0 1) (= ~manager_state~0 0)), Black: 76#(and (= ~node_state~0 0) (= ~manager_state~0 0)), 74#true, Black: 83#(and (= ~node_state~0 0) (= ~client_state~0 1)), Black: 84#(and (= ~manager_state~0 1) (= ~node_state~0 0) (= ~client_state~0 1)), Black: 82#(= ~node_state~0 0), 21#L95-1true, thread3Thread1of1ForFork2InUse, 19#ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 89#true]) [2024-06-28 02:46:46,067 INFO L294 olderBase$Statistics]: this new event has 51 ancestors and is cut-off event [2024-06-28 02:46:46,067 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2024-06-28 02:46:46,067 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2024-06-28 02:46:46,067 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2024-06-28 02:46:46,068 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1032] L89-->L95-1: Formula: (and (= (+ 1 v_~node_front~0_81) v_~node_front~0_80) (= v_~node_state~0_54 1) (= (ite (= (ite (= (select (select |v_#memory_int#1_143| v_~node~0.base_85) (+ (* 4 v_~node_front~0_81) v_~node~0.offset_85)) v_~update~0_81) 1 0) 0) 0 1) v_~safe~0_104) (not (= (ite (and (< v_~node_front~0_81 v_~node_size~0_66) (<= 0 v_~node_front~0_81) (< v_~node_front~0_81 v_~node_back~0_92)) 1 0) 0))) InVars {~node_back~0=v_~node_back~0_92, ~node_size~0=v_~node_size~0_66, ~node~0.base=v_~node~0.base_85, ~node_front~0=v_~node_front~0_81, ~node~0.offset=v_~node~0.offset_85, #memory_int#1=|v_#memory_int#1_143|, ~update~0=v_~update~0_81} OutVars{~node_back~0=v_~node_back~0_92, thread2Thread1of1ForFork0_#t~post12#1=|v_thread2Thread1of1ForFork0_#t~post12#1_1|, thread2Thread1of1ForFork0_#t~mem11#1=|v_thread2Thread1of1ForFork0_#t~mem11#1_1|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~node~0.base=v_~node~0.base_85, ~node~0.offset=v_~node~0.offset_85, #memory_int#1=|v_#memory_int#1_143|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~node_size~0=v_~node_size~0_66, ~safe~0=v_~safe~0_104, ~node_front~0=v_~node_front~0_80, ~node_state~0=v_~node_state~0_54, ~update~0=v_~update~0_81} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#t~post12#1, thread2Thread1of1ForFork0_#t~mem11#1, ~safe~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~node_front~0, ~node_state~0][85], [Black: 64#(and (= ~node_state~0 0) (= ~client_state~0 0) (= ~manager_state~0 0)), 18#L51-5true, Black: 68#(<= ~manager_back~0 ~manager_front~0), 32#L110true, 80#true, Black: 72#(<= ~node_back~0 ~node_front~0), Black: 77#(and (= ~node_state~0 0) (= ~client_state~0 1) (= ~manager_state~0 0)), Black: 76#(and (= ~node_state~0 0) (= ~manager_state~0 0)), 74#true, Black: 83#(and (= ~node_state~0 0) (= ~client_state~0 1)), Black: 84#(and (= ~manager_state~0 1) (= ~node_state~0 0) (= ~client_state~0 1)), Black: 82#(= ~node_state~0 0), 21#L95-1true, thread3Thread1of1ForFork2InUse, 19#ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 89#true]) [2024-06-28 02:46:46,068 INFO L294 olderBase$Statistics]: this new event has 51 ancestors and is cut-off event [2024-06-28 02:46:46,068 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2024-06-28 02:46:46,068 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2024-06-28 02:46:46,068 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2024-06-28 02:46:46,068 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1032] L89-->L95-1: Formula: (and (= (+ 1 v_~node_front~0_81) v_~node_front~0_80) (= v_~node_state~0_54 1) (= (ite (= (ite (= (select (select |v_#memory_int#1_143| v_~node~0.base_85) (+ (* 4 v_~node_front~0_81) v_~node~0.offset_85)) v_~update~0_81) 1 0) 0) 0 1) v_~safe~0_104) (not (= (ite (and (< v_~node_front~0_81 v_~node_size~0_66) (<= 0 v_~node_front~0_81) (< v_~node_front~0_81 v_~node_back~0_92)) 1 0) 0))) InVars {~node_back~0=v_~node_back~0_92, ~node_size~0=v_~node_size~0_66, ~node~0.base=v_~node~0.base_85, ~node_front~0=v_~node_front~0_81, ~node~0.offset=v_~node~0.offset_85, #memory_int#1=|v_#memory_int#1_143|, ~update~0=v_~update~0_81} OutVars{~node_back~0=v_~node_back~0_92, thread2Thread1of1ForFork0_#t~post12#1=|v_thread2Thread1of1ForFork0_#t~post12#1_1|, thread2Thread1of1ForFork0_#t~mem11#1=|v_thread2Thread1of1ForFork0_#t~mem11#1_1|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~node~0.base=v_~node~0.base_85, ~node~0.offset=v_~node~0.offset_85, #memory_int#1=|v_#memory_int#1_143|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~node_size~0=v_~node_size~0_66, ~safe~0=v_~safe~0_104, ~node_front~0=v_~node_front~0_80, ~node_state~0=v_~node_state~0_54, ~update~0=v_~update~0_81} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#t~post12#1, thread2Thread1of1ForFork0_#t~mem11#1, ~safe~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~node_front~0, ~node_state~0][85], [Black: 64#(and (= ~node_state~0 0) (= ~client_state~0 0) (= ~manager_state~0 0)), 18#L51-5true, Black: 68#(<= ~manager_back~0 ~manager_front~0), 80#true, Black: 72#(<= ~node_back~0 ~node_front~0), Black: 77#(and (= ~node_state~0 0) (= ~client_state~0 1) (= ~manager_state~0 0)), Black: 76#(and (= ~node_state~0 0) (= ~manager_state~0 0)), 74#true, Black: 83#(and (= ~node_state~0 0) (= ~client_state~0 1)), Black: 84#(and (= ~manager_state~0 1) (= ~node_state~0 0) (= ~client_state~0 1)), Black: 82#(= ~node_state~0 0), 21#L95-1true, thread3Thread1of1ForFork2InUse, 13#L117true, 19#ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 89#true]) [2024-06-28 02:46:46,069 INFO L294 olderBase$Statistics]: this new event has 52 ancestors and is cut-off event [2024-06-28 02:46:46,069 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2024-06-28 02:46:46,069 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2024-06-28 02:46:46,069 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2024-06-28 02:46:46,070 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1032] L89-->L95-1: Formula: (and (= (+ 1 v_~node_front~0_81) v_~node_front~0_80) (= v_~node_state~0_54 1) (= (ite (= (ite (= (select (select |v_#memory_int#1_143| v_~node~0.base_85) (+ (* 4 v_~node_front~0_81) v_~node~0.offset_85)) v_~update~0_81) 1 0) 0) 0 1) v_~safe~0_104) (not (= (ite (and (< v_~node_front~0_81 v_~node_size~0_66) (<= 0 v_~node_front~0_81) (< v_~node_front~0_81 v_~node_back~0_92)) 1 0) 0))) InVars {~node_back~0=v_~node_back~0_92, ~node_size~0=v_~node_size~0_66, ~node~0.base=v_~node~0.base_85, ~node_front~0=v_~node_front~0_81, ~node~0.offset=v_~node~0.offset_85, #memory_int#1=|v_#memory_int#1_143|, ~update~0=v_~update~0_81} OutVars{~node_back~0=v_~node_back~0_92, thread2Thread1of1ForFork0_#t~post12#1=|v_thread2Thread1of1ForFork0_#t~post12#1_1|, thread2Thread1of1ForFork0_#t~mem11#1=|v_thread2Thread1of1ForFork0_#t~mem11#1_1|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~node~0.base=v_~node~0.base_85, ~node~0.offset=v_~node~0.offset_85, #memory_int#1=|v_#memory_int#1_143|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~node_size~0=v_~node_size~0_66, ~safe~0=v_~safe~0_104, ~node_front~0=v_~node_front~0_80, ~node_state~0=v_~node_state~0_54, ~update~0=v_~update~0_81} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#t~post12#1, thread2Thread1of1ForFork0_#t~mem11#1, ~safe~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~node_front~0, ~node_state~0][85], [Black: 64#(and (= ~node_state~0 0) (= ~client_state~0 0) (= ~manager_state~0 0)), Black: 68#(<= ~manager_back~0 ~manager_front~0), 32#L110true, 80#true, Black: 72#(<= ~node_back~0 ~node_front~0), Black: 77#(and (= ~node_state~0 0) (= ~client_state~0 1) (= ~manager_state~0 0)), Black: 76#(and (= ~node_state~0 0) (= ~manager_state~0 0)), 74#true, Black: 83#(and (= ~node_state~0 0) (= ~client_state~0 1)), Black: 84#(and (= ~manager_state~0 1) (= ~node_state~0 0) (= ~client_state~0 1)), 28#L52true, Black: 82#(= ~node_state~0 0), 21#L95-1true, thread3Thread1of1ForFork2InUse, 19#ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 89#true]) [2024-06-28 02:46:46,070 INFO L294 olderBase$Statistics]: this new event has 51 ancestors and is cut-off event [2024-06-28 02:46:46,070 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2024-06-28 02:46:46,070 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2024-06-28 02:46:46,070 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2024-06-28 02:46:46,071 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1032] L89-->L95-1: Formula: (and (= (+ 1 v_~node_front~0_81) v_~node_front~0_80) (= v_~node_state~0_54 1) (= (ite (= (ite (= (select (select |v_#memory_int#1_143| v_~node~0.base_85) (+ (* 4 v_~node_front~0_81) v_~node~0.offset_85)) v_~update~0_81) 1 0) 0) 0 1) v_~safe~0_104) (not (= (ite (and (< v_~node_front~0_81 v_~node_size~0_66) (<= 0 v_~node_front~0_81) (< v_~node_front~0_81 v_~node_back~0_92)) 1 0) 0))) InVars {~node_back~0=v_~node_back~0_92, ~node_size~0=v_~node_size~0_66, ~node~0.base=v_~node~0.base_85, ~node_front~0=v_~node_front~0_81, ~node~0.offset=v_~node~0.offset_85, #memory_int#1=|v_#memory_int#1_143|, ~update~0=v_~update~0_81} OutVars{~node_back~0=v_~node_back~0_92, thread2Thread1of1ForFork0_#t~post12#1=|v_thread2Thread1of1ForFork0_#t~post12#1_1|, thread2Thread1of1ForFork0_#t~mem11#1=|v_thread2Thread1of1ForFork0_#t~mem11#1_1|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~node~0.base=v_~node~0.base_85, ~node~0.offset=v_~node~0.offset_85, #memory_int#1=|v_#memory_int#1_143|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~node_size~0=v_~node_size~0_66, ~safe~0=v_~safe~0_104, ~node_front~0=v_~node_front~0_80, ~node_state~0=v_~node_state~0_54, ~update~0=v_~update~0_81} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#t~post12#1, thread2Thread1of1ForFork0_#t~mem11#1, ~safe~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~node_front~0, ~node_state~0][85], [Black: 64#(and (= ~node_state~0 0) (= ~client_state~0 0) (= ~manager_state~0 0)), Black: 68#(<= ~manager_back~0 ~manager_front~0), 80#true, Black: 72#(<= ~node_back~0 ~node_front~0), Black: 77#(and (= ~node_state~0 0) (= ~client_state~0 1) (= ~manager_state~0 0)), Black: 76#(and (= ~node_state~0 0) (= ~manager_state~0 0)), 74#true, Black: 83#(and (= ~node_state~0 0) (= ~client_state~0 1)), Black: 84#(and (= ~manager_state~0 1) (= ~node_state~0 0) (= ~client_state~0 1)), 28#L52true, Black: 82#(= ~node_state~0 0), 21#L95-1true, thread3Thread1of1ForFork2InUse, 13#L117true, 19#ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 89#true]) [2024-06-28 02:46:46,071 INFO L294 olderBase$Statistics]: this new event has 52 ancestors and is cut-off event [2024-06-28 02:46:46,071 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2024-06-28 02:46:46,071 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2024-06-28 02:46:46,072 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2024-06-28 02:46:46,072 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1032] L89-->L95-1: Formula: (and (= (+ 1 v_~node_front~0_81) v_~node_front~0_80) (= v_~node_state~0_54 1) (= (ite (= (ite (= (select (select |v_#memory_int#1_143| v_~node~0.base_85) (+ (* 4 v_~node_front~0_81) v_~node~0.offset_85)) v_~update~0_81) 1 0) 0) 0 1) v_~safe~0_104) (not (= (ite (and (< v_~node_front~0_81 v_~node_size~0_66) (<= 0 v_~node_front~0_81) (< v_~node_front~0_81 v_~node_back~0_92)) 1 0) 0))) InVars {~node_back~0=v_~node_back~0_92, ~node_size~0=v_~node_size~0_66, ~node~0.base=v_~node~0.base_85, ~node_front~0=v_~node_front~0_81, ~node~0.offset=v_~node~0.offset_85, #memory_int#1=|v_#memory_int#1_143|, ~update~0=v_~update~0_81} OutVars{~node_back~0=v_~node_back~0_92, thread2Thread1of1ForFork0_#t~post12#1=|v_thread2Thread1of1ForFork0_#t~post12#1_1|, thread2Thread1of1ForFork0_#t~mem11#1=|v_thread2Thread1of1ForFork0_#t~mem11#1_1|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~node~0.base=v_~node~0.base_85, ~node~0.offset=v_~node~0.offset_85, #memory_int#1=|v_#memory_int#1_143|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~node_size~0=v_~node_size~0_66, ~safe~0=v_~safe~0_104, ~node_front~0=v_~node_front~0_80, ~node_state~0=v_~node_state~0_54, ~update~0=v_~update~0_81} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#t~post12#1, thread2Thread1of1ForFork0_#t~mem11#1, ~safe~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~node_front~0, ~node_state~0][85], [Black: 64#(and (= ~node_state~0 0) (= ~client_state~0 0) (= ~manager_state~0 0)), 30#L109-1true, 33#thread1EXITtrue, Black: 68#(<= ~manager_back~0 ~manager_front~0), 80#true, Black: 72#(<= ~node_back~0 ~node_front~0), Black: 77#(and (= ~node_state~0 0) (= ~client_state~0 1) (= ~manager_state~0 0)), Black: 76#(and (= ~node_state~0 0) (= ~manager_state~0 0)), 74#true, Black: 83#(and (= ~node_state~0 0) (= ~client_state~0 1)), Black: 84#(and (= ~manager_state~0 1) (= ~node_state~0 0) (= ~client_state~0 1)), Black: 82#(= ~node_state~0 0), 21#L95-1true, thread3Thread1of1ForFork2InUse, 19#ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 89#true]) [2024-06-28 02:46:46,072 INFO L294 olderBase$Statistics]: this new event has 51 ancestors and is cut-off event [2024-06-28 02:46:46,072 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2024-06-28 02:46:46,073 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2024-06-28 02:46:46,073 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2024-06-28 02:46:46,110 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1032] L89-->L95-1: Formula: (and (= (+ 1 v_~node_front~0_81) v_~node_front~0_80) (= v_~node_state~0_54 1) (= (ite (= (ite (= (select (select |v_#memory_int#1_143| v_~node~0.base_85) (+ (* 4 v_~node_front~0_81) v_~node~0.offset_85)) v_~update~0_81) 1 0) 0) 0 1) v_~safe~0_104) (not (= (ite (and (< v_~node_front~0_81 v_~node_size~0_66) (<= 0 v_~node_front~0_81) (< v_~node_front~0_81 v_~node_back~0_92)) 1 0) 0))) InVars {~node_back~0=v_~node_back~0_92, ~node_size~0=v_~node_size~0_66, ~node~0.base=v_~node~0.base_85, ~node_front~0=v_~node_front~0_81, ~node~0.offset=v_~node~0.offset_85, #memory_int#1=|v_#memory_int#1_143|, ~update~0=v_~update~0_81} OutVars{~node_back~0=v_~node_back~0_92, thread2Thread1of1ForFork0_#t~post12#1=|v_thread2Thread1of1ForFork0_#t~post12#1_1|, thread2Thread1of1ForFork0_#t~mem11#1=|v_thread2Thread1of1ForFork0_#t~mem11#1_1|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~node~0.base=v_~node~0.base_85, ~node~0.offset=v_~node~0.offset_85, #memory_int#1=|v_#memory_int#1_143|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~node_size~0=v_~node_size~0_66, ~safe~0=v_~safe~0_104, ~node_front~0=v_~node_front~0_80, ~node_state~0=v_~node_state~0_54, ~update~0=v_~update~0_81} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#t~post12#1, thread2Thread1of1ForFork0_#t~mem11#1, ~safe~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~node_front~0, ~node_state~0][74], [Black: 64#(and (= ~node_state~0 0) (= ~client_state~0 0) (= ~manager_state~0 0)), 33#thread1EXITtrue, Black: 68#(<= ~manager_back~0 ~manager_front~0), 80#true, 6#L157true, Black: 72#(<= ~node_back~0 ~node_front~0), Black: 77#(and (= ~node_state~0 0) (= ~client_state~0 1) (= ~manager_state~0 0)), Black: 76#(and (= ~node_state~0 0) (= ~manager_state~0 0)), 5#L118true, 74#true, Black: 83#(and (= ~node_state~0 0) (= ~client_state~0 1)), Black: 84#(and (= ~manager_state~0 1) (= ~node_state~0 0) (= ~client_state~0 1)), Black: 82#(= ~node_state~0 0), 21#L95-1true, thread3Thread1of1ForFork2InUse, 89#true]) [2024-06-28 02:46:46,110 INFO L294 olderBase$Statistics]: this new event has 53 ancestors and is cut-off event [2024-06-28 02:46:46,110 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2024-06-28 02:46:46,111 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2024-06-28 02:46:46,111 INFO L297 olderBase$Statistics]: existing Event has 53 ancestors and is cut-off event [2024-06-28 02:46:46,111 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1032] L89-->L95-1: Formula: (and (= (+ 1 v_~node_front~0_81) v_~node_front~0_80) (= v_~node_state~0_54 1) (= (ite (= (ite (= (select (select |v_#memory_int#1_143| v_~node~0.base_85) (+ (* 4 v_~node_front~0_81) v_~node~0.offset_85)) v_~update~0_81) 1 0) 0) 0 1) v_~safe~0_104) (not (= (ite (and (< v_~node_front~0_81 v_~node_size~0_66) (<= 0 v_~node_front~0_81) (< v_~node_front~0_81 v_~node_back~0_92)) 1 0) 0))) InVars {~node_back~0=v_~node_back~0_92, ~node_size~0=v_~node_size~0_66, ~node~0.base=v_~node~0.base_85, ~node_front~0=v_~node_front~0_81, ~node~0.offset=v_~node~0.offset_85, #memory_int#1=|v_#memory_int#1_143|, ~update~0=v_~update~0_81} OutVars{~node_back~0=v_~node_back~0_92, thread2Thread1of1ForFork0_#t~post12#1=|v_thread2Thread1of1ForFork0_#t~post12#1_1|, thread2Thread1of1ForFork0_#t~mem11#1=|v_thread2Thread1of1ForFork0_#t~mem11#1_1|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~node~0.base=v_~node~0.base_85, ~node~0.offset=v_~node~0.offset_85, #memory_int#1=|v_#memory_int#1_143|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~node_size~0=v_~node_size~0_66, ~safe~0=v_~safe~0_104, ~node_front~0=v_~node_front~0_80, ~node_state~0=v_~node_state~0_54, ~update~0=v_~update~0_81} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#t~post12#1, thread2Thread1of1ForFork0_#t~mem11#1, ~safe~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~node_front~0, ~node_state~0][85], [Black: 64#(and (= ~node_state~0 0) (= ~client_state~0 0) (= ~manager_state~0 0)), 33#thread1EXITtrue, Black: 68#(<= ~manager_back~0 ~manager_front~0), 80#true, 6#L157true, Black: 72#(<= ~node_back~0 ~node_front~0), Black: 77#(and (= ~node_state~0 0) (= ~client_state~0 1) (= ~manager_state~0 0)), Black: 76#(and (= ~node_state~0 0) (= ~manager_state~0 0)), 74#true, Black: 83#(and (= ~node_state~0 0) (= ~client_state~0 1)), Black: 84#(and (= ~manager_state~0 1) (= ~node_state~0 0) (= ~client_state~0 1)), Black: 82#(= ~node_state~0 0), 21#L95-1true, thread3Thread1of1ForFork2InUse, 13#L117true, 89#true]) [2024-06-28 02:46:46,111 INFO L294 olderBase$Statistics]: this new event has 52 ancestors and is cut-off event [2024-06-28 02:46:46,111 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2024-06-28 02:46:46,111 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2024-06-28 02:46:46,112 INFO L297 olderBase$Statistics]: existing Event has 52 ancestors and is cut-off event [2024-06-28 02:46:46,120 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1032] L89-->L95-1: Formula: (and (= (+ 1 v_~node_front~0_81) v_~node_front~0_80) (= v_~node_state~0_54 1) (= (ite (= (ite (= (select (select |v_#memory_int#1_143| v_~node~0.base_85) (+ (* 4 v_~node_front~0_81) v_~node~0.offset_85)) v_~update~0_81) 1 0) 0) 0 1) v_~safe~0_104) (not (= (ite (and (< v_~node_front~0_81 v_~node_size~0_66) (<= 0 v_~node_front~0_81) (< v_~node_front~0_81 v_~node_back~0_92)) 1 0) 0))) InVars {~node_back~0=v_~node_back~0_92, ~node_size~0=v_~node_size~0_66, ~node~0.base=v_~node~0.base_85, ~node_front~0=v_~node_front~0_81, ~node~0.offset=v_~node~0.offset_85, #memory_int#1=|v_#memory_int#1_143|, ~update~0=v_~update~0_81} OutVars{~node_back~0=v_~node_back~0_92, thread2Thread1of1ForFork0_#t~post12#1=|v_thread2Thread1of1ForFork0_#t~post12#1_1|, thread2Thread1of1ForFork0_#t~mem11#1=|v_thread2Thread1of1ForFork0_#t~mem11#1_1|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~node~0.base=v_~node~0.base_85, ~node~0.offset=v_~node~0.offset_85, #memory_int#1=|v_#memory_int#1_143|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~node_size~0=v_~node_size~0_66, ~safe~0=v_~safe~0_104, ~node_front~0=v_~node_front~0_80, ~node_state~0=v_~node_state~0_54, ~update~0=v_~update~0_81} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#t~post12#1, thread2Thread1of1ForFork0_#t~mem11#1, ~safe~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~node_front~0, ~node_state~0][74], [Black: 64#(and (= ~node_state~0 0) (= ~client_state~0 0) (= ~manager_state~0 0)), Black: 68#(<= ~manager_back~0 ~manager_front~0), 80#true, Black: 72#(<= ~node_back~0 ~node_front~0), Black: 77#(and (= ~node_state~0 0) (= ~client_state~0 1) (= ~manager_state~0 0)), Black: 76#(and (= ~node_state~0 0) (= ~manager_state~0 0)), 5#L118true, 74#true, Black: 83#(and (= ~node_state~0 0) (= ~client_state~0 1)), Black: 84#(and (= ~manager_state~0 1) (= ~node_state~0 0) (= ~client_state~0 1)), 28#L52true, Black: 82#(= ~node_state~0 0), 21#L95-1true, thread3Thread1of1ForFork2InUse, 19#ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 89#true]) [2024-06-28 02:46:46,120 INFO L294 olderBase$Statistics]: this new event has 53 ancestors and is cut-off event [2024-06-28 02:46:46,120 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2024-06-28 02:46:46,121 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2024-06-28 02:46:46,121 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2024-06-28 02:46:46,121 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1032] L89-->L95-1: Formula: (and (= (+ 1 v_~node_front~0_81) v_~node_front~0_80) (= v_~node_state~0_54 1) (= (ite (= (ite (= (select (select |v_#memory_int#1_143| v_~node~0.base_85) (+ (* 4 v_~node_front~0_81) v_~node~0.offset_85)) v_~update~0_81) 1 0) 0) 0 1) v_~safe~0_104) (not (= (ite (and (< v_~node_front~0_81 v_~node_size~0_66) (<= 0 v_~node_front~0_81) (< v_~node_front~0_81 v_~node_back~0_92)) 1 0) 0))) InVars {~node_back~0=v_~node_back~0_92, ~node_size~0=v_~node_size~0_66, ~node~0.base=v_~node~0.base_85, ~node_front~0=v_~node_front~0_81, ~node~0.offset=v_~node~0.offset_85, #memory_int#1=|v_#memory_int#1_143|, ~update~0=v_~update~0_81} OutVars{~node_back~0=v_~node_back~0_92, thread2Thread1of1ForFork0_#t~post12#1=|v_thread2Thread1of1ForFork0_#t~post12#1_1|, thread2Thread1of1ForFork0_#t~mem11#1=|v_thread2Thread1of1ForFork0_#t~mem11#1_1|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~node~0.base=v_~node~0.base_85, ~node~0.offset=v_~node~0.offset_85, #memory_int#1=|v_#memory_int#1_143|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~node_size~0=v_~node_size~0_66, ~safe~0=v_~safe~0_104, ~node_front~0=v_~node_front~0_80, ~node_state~0=v_~node_state~0_54, ~update~0=v_~update~0_81} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#t~post12#1, thread2Thread1of1ForFork0_#t~mem11#1, ~safe~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~node_front~0, ~node_state~0][74], [Black: 64#(and (= ~node_state~0 0) (= ~client_state~0 0) (= ~manager_state~0 0)), Black: 68#(<= ~manager_back~0 ~manager_front~0), 80#true, Black: 72#(<= ~node_back~0 ~node_front~0), 53#L51-1true, Black: 77#(and (= ~node_state~0 0) (= ~client_state~0 1) (= ~manager_state~0 0)), Black: 76#(and (= ~node_state~0 0) (= ~manager_state~0 0)), 5#L118true, 74#true, Black: 83#(and (= ~node_state~0 0) (= ~client_state~0 1)), Black: 84#(and (= ~manager_state~0 1) (= ~node_state~0 0) (= ~client_state~0 1)), Black: 82#(= ~node_state~0 0), 21#L95-1true, thread3Thread1of1ForFork2InUse, 19#ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 89#true]) [2024-06-28 02:46:46,121 INFO L294 olderBase$Statistics]: this new event has 52 ancestors and is cut-off event [2024-06-28 02:46:46,121 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2024-06-28 02:46:46,121 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2024-06-28 02:46:46,122 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2024-06-28 02:46:46,122 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1032] L89-->L95-1: Formula: (and (= (+ 1 v_~node_front~0_81) v_~node_front~0_80) (= v_~node_state~0_54 1) (= (ite (= (ite (= (select (select |v_#memory_int#1_143| v_~node~0.base_85) (+ (* 4 v_~node_front~0_81) v_~node~0.offset_85)) v_~update~0_81) 1 0) 0) 0 1) v_~safe~0_104) (not (= (ite (and (< v_~node_front~0_81 v_~node_size~0_66) (<= 0 v_~node_front~0_81) (< v_~node_front~0_81 v_~node_back~0_92)) 1 0) 0))) InVars {~node_back~0=v_~node_back~0_92, ~node_size~0=v_~node_size~0_66, ~node~0.base=v_~node~0.base_85, ~node_front~0=v_~node_front~0_81, ~node~0.offset=v_~node~0.offset_85, #memory_int#1=|v_#memory_int#1_143|, ~update~0=v_~update~0_81} OutVars{~node_back~0=v_~node_back~0_92, thread2Thread1of1ForFork0_#t~post12#1=|v_thread2Thread1of1ForFork0_#t~post12#1_1|, thread2Thread1of1ForFork0_#t~mem11#1=|v_thread2Thread1of1ForFork0_#t~mem11#1_1|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~node~0.base=v_~node~0.base_85, ~node~0.offset=v_~node~0.offset_85, #memory_int#1=|v_#memory_int#1_143|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~node_size~0=v_~node_size~0_66, ~safe~0=v_~safe~0_104, ~node_front~0=v_~node_front~0_80, ~node_state~0=v_~node_state~0_54, ~update~0=v_~update~0_81} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#t~post12#1, thread2Thread1of1ForFork0_#t~mem11#1, ~safe~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~node_front~0, ~node_state~0][74], [Black: 64#(and (= ~node_state~0 0) (= ~client_state~0 0) (= ~manager_state~0 0)), 18#L51-5true, Black: 68#(<= ~manager_back~0 ~manager_front~0), 80#true, Black: 72#(<= ~node_back~0 ~node_front~0), Black: 77#(and (= ~node_state~0 0) (= ~client_state~0 1) (= ~manager_state~0 0)), Black: 76#(and (= ~node_state~0 0) (= ~manager_state~0 0)), 5#L118true, 74#true, Black: 83#(and (= ~node_state~0 0) (= ~client_state~0 1)), Black: 84#(and (= ~manager_state~0 1) (= ~node_state~0 0) (= ~client_state~0 1)), Black: 82#(= ~node_state~0 0), 21#L95-1true, thread3Thread1of1ForFork2InUse, 19#ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 89#true]) [2024-06-28 02:46:46,122 INFO L294 olderBase$Statistics]: this new event has 53 ancestors and is cut-off event [2024-06-28 02:46:46,122 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2024-06-28 02:46:46,122 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2024-06-28 02:46:46,122 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2024-06-28 02:46:46,127 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1032] L89-->L95-1: Formula: (and (= (+ 1 v_~node_front~0_81) v_~node_front~0_80) (= v_~node_state~0_54 1) (= (ite (= (ite (= (select (select |v_#memory_int#1_143| v_~node~0.base_85) (+ (* 4 v_~node_front~0_81) v_~node~0.offset_85)) v_~update~0_81) 1 0) 0) 0 1) v_~safe~0_104) (not (= (ite (and (< v_~node_front~0_81 v_~node_size~0_66) (<= 0 v_~node_front~0_81) (< v_~node_front~0_81 v_~node_back~0_92)) 1 0) 0))) InVars {~node_back~0=v_~node_back~0_92, ~node_size~0=v_~node_size~0_66, ~node~0.base=v_~node~0.base_85, ~node_front~0=v_~node_front~0_81, ~node~0.offset=v_~node~0.offset_85, #memory_int#1=|v_#memory_int#1_143|, ~update~0=v_~update~0_81} OutVars{~node_back~0=v_~node_back~0_92, thread2Thread1of1ForFork0_#t~post12#1=|v_thread2Thread1of1ForFork0_#t~post12#1_1|, thread2Thread1of1ForFork0_#t~mem11#1=|v_thread2Thread1of1ForFork0_#t~mem11#1_1|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~node~0.base=v_~node~0.base_85, ~node~0.offset=v_~node~0.offset_85, #memory_int#1=|v_#memory_int#1_143|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~node_size~0=v_~node_size~0_66, ~safe~0=v_~safe~0_104, ~node_front~0=v_~node_front~0_80, ~node_state~0=v_~node_state~0_54, ~update~0=v_~update~0_81} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#t~post12#1, thread2Thread1of1ForFork0_#t~mem11#1, ~safe~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~node_front~0, ~node_state~0][85], [Black: 64#(and (= ~node_state~0 0) (= ~client_state~0 0) (= ~manager_state~0 0)), 18#L51-5true, Black: 68#(<= ~manager_back~0 ~manager_front~0), 80#true, 47#thread3EXITtrue, Black: 72#(<= ~node_back~0 ~node_front~0), Black: 77#(and (= ~node_state~0 0) (= ~client_state~0 1) (= ~manager_state~0 0)), Black: 76#(and (= ~node_state~0 0) (= ~manager_state~0 0)), 74#true, Black: 83#(and (= ~node_state~0 0) (= ~client_state~0 1)), Black: 84#(and (= ~manager_state~0 1) (= ~node_state~0 0) (= ~client_state~0 1)), Black: 82#(= ~node_state~0 0), 21#L95-1true, thread3Thread1of1ForFork2InUse, 19#ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 89#true]) [2024-06-28 02:46:46,128 INFO L294 olderBase$Statistics]: this new event has 52 ancestors and is cut-off event [2024-06-28 02:46:46,128 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2024-06-28 02:46:46,128 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2024-06-28 02:46:46,128 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2024-06-28 02:46:46,128 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1032] L89-->L95-1: Formula: (and (= (+ 1 v_~node_front~0_81) v_~node_front~0_80) (= v_~node_state~0_54 1) (= (ite (= (ite (= (select (select |v_#memory_int#1_143| v_~node~0.base_85) (+ (* 4 v_~node_front~0_81) v_~node~0.offset_85)) v_~update~0_81) 1 0) 0) 0 1) v_~safe~0_104) (not (= (ite (and (< v_~node_front~0_81 v_~node_size~0_66) (<= 0 v_~node_front~0_81) (< v_~node_front~0_81 v_~node_back~0_92)) 1 0) 0))) InVars {~node_back~0=v_~node_back~0_92, ~node_size~0=v_~node_size~0_66, ~node~0.base=v_~node~0.base_85, ~node_front~0=v_~node_front~0_81, ~node~0.offset=v_~node~0.offset_85, #memory_int#1=|v_#memory_int#1_143|, ~update~0=v_~update~0_81} OutVars{~node_back~0=v_~node_back~0_92, thread2Thread1of1ForFork0_#t~post12#1=|v_thread2Thread1of1ForFork0_#t~post12#1_1|, thread2Thread1of1ForFork0_#t~mem11#1=|v_thread2Thread1of1ForFork0_#t~mem11#1_1|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~node~0.base=v_~node~0.base_85, ~node~0.offset=v_~node~0.offset_85, #memory_int#1=|v_#memory_int#1_143|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~node_size~0=v_~node_size~0_66, ~safe~0=v_~safe~0_104, ~node_front~0=v_~node_front~0_80, ~node_state~0=v_~node_state~0_54, ~update~0=v_~update~0_81} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#t~post12#1, thread2Thread1of1ForFork0_#t~mem11#1, ~safe~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~node_front~0, ~node_state~0][85], [Black: 64#(and (= ~node_state~0 0) (= ~client_state~0 0) (= ~manager_state~0 0)), 33#thread1EXITtrue, Black: 68#(<= ~manager_back~0 ~manager_front~0), 80#true, Black: 72#(<= ~node_back~0 ~node_front~0), 43#L109-5true, Black: 77#(and (= ~node_state~0 0) (= ~client_state~0 1) (= ~manager_state~0 0)), Black: 76#(and (= ~node_state~0 0) (= ~manager_state~0 0)), 74#true, Black: 83#(and (= ~node_state~0 0) (= ~client_state~0 1)), Black: 84#(and (= ~manager_state~0 1) (= ~node_state~0 0) (= ~client_state~0 1)), Black: 82#(= ~node_state~0 0), 21#L95-1true, thread3Thread1of1ForFork2InUse, 19#ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 89#true]) [2024-06-28 02:46:46,128 INFO L294 olderBase$Statistics]: this new event has 52 ancestors and is cut-off event [2024-06-28 02:46:46,128 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2024-06-28 02:46:46,128 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2024-06-28 02:46:46,129 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2024-06-28 02:46:46,129 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1032] L89-->L95-1: Formula: (and (= (+ 1 v_~node_front~0_81) v_~node_front~0_80) (= v_~node_state~0_54 1) (= (ite (= (ite (= (select (select |v_#memory_int#1_143| v_~node~0.base_85) (+ (* 4 v_~node_front~0_81) v_~node~0.offset_85)) v_~update~0_81) 1 0) 0) 0 1) v_~safe~0_104) (not (= (ite (and (< v_~node_front~0_81 v_~node_size~0_66) (<= 0 v_~node_front~0_81) (< v_~node_front~0_81 v_~node_back~0_92)) 1 0) 0))) InVars {~node_back~0=v_~node_back~0_92, ~node_size~0=v_~node_size~0_66, ~node~0.base=v_~node~0.base_85, ~node_front~0=v_~node_front~0_81, ~node~0.offset=v_~node~0.offset_85, #memory_int#1=|v_#memory_int#1_143|, ~update~0=v_~update~0_81} OutVars{~node_back~0=v_~node_back~0_92, thread2Thread1of1ForFork0_#t~post12#1=|v_thread2Thread1of1ForFork0_#t~post12#1_1|, thread2Thread1of1ForFork0_#t~mem11#1=|v_thread2Thread1of1ForFork0_#t~mem11#1_1|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~node~0.base=v_~node~0.base_85, ~node~0.offset=v_~node~0.offset_85, #memory_int#1=|v_#memory_int#1_143|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~node_size~0=v_~node_size~0_66, ~safe~0=v_~safe~0_104, ~node_front~0=v_~node_front~0_80, ~node_state~0=v_~node_state~0_54, ~update~0=v_~update~0_81} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#t~post12#1, thread2Thread1of1ForFork0_#t~mem11#1, ~safe~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~node_front~0, ~node_state~0][85], [Black: 64#(and (= ~node_state~0 0) (= ~client_state~0 0) (= ~manager_state~0 0)), Black: 68#(<= ~manager_back~0 ~manager_front~0), 80#true, Black: 72#(<= ~node_back~0 ~node_front~0), 47#thread3EXITtrue, Black: 77#(and (= ~node_state~0 0) (= ~client_state~0 1) (= ~manager_state~0 0)), Black: 76#(and (= ~node_state~0 0) (= ~manager_state~0 0)), 74#true, Black: 83#(and (= ~node_state~0 0) (= ~client_state~0 1)), Black: 84#(and (= ~manager_state~0 1) (= ~node_state~0 0) (= ~client_state~0 1)), Black: 82#(= ~node_state~0 0), 28#L52true, 21#L95-1true, thread3Thread1of1ForFork2InUse, 19#ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 89#true]) [2024-06-28 02:46:46,130 INFO L294 olderBase$Statistics]: this new event has 52 ancestors and is cut-off event [2024-06-28 02:46:46,130 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2024-06-28 02:46:46,130 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2024-06-28 02:46:46,130 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2024-06-28 02:46:46,131 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1032] L89-->L95-1: Formula: (and (= (+ 1 v_~node_front~0_81) v_~node_front~0_80) (= v_~node_state~0_54 1) (= (ite (= (ite (= (select (select |v_#memory_int#1_143| v_~node~0.base_85) (+ (* 4 v_~node_front~0_81) v_~node~0.offset_85)) v_~update~0_81) 1 0) 0) 0 1) v_~safe~0_104) (not (= (ite (and (< v_~node_front~0_81 v_~node_size~0_66) (<= 0 v_~node_front~0_81) (< v_~node_front~0_81 v_~node_back~0_92)) 1 0) 0))) InVars {~node_back~0=v_~node_back~0_92, ~node_size~0=v_~node_size~0_66, ~node~0.base=v_~node~0.base_85, ~node_front~0=v_~node_front~0_81, ~node~0.offset=v_~node~0.offset_85, #memory_int#1=|v_#memory_int#1_143|, ~update~0=v_~update~0_81} OutVars{~node_back~0=v_~node_back~0_92, thread2Thread1of1ForFork0_#t~post12#1=|v_thread2Thread1of1ForFork0_#t~post12#1_1|, thread2Thread1of1ForFork0_#t~mem11#1=|v_thread2Thread1of1ForFork0_#t~mem11#1_1|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~node~0.base=v_~node~0.base_85, ~node~0.offset=v_~node~0.offset_85, #memory_int#1=|v_#memory_int#1_143|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~node_size~0=v_~node_size~0_66, ~safe~0=v_~safe~0_104, ~node_front~0=v_~node_front~0_80, ~node_state~0=v_~node_state~0_54, ~update~0=v_~update~0_81} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#t~post12#1, thread2Thread1of1ForFork0_#t~mem11#1, ~safe~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~node_front~0, ~node_state~0][74], [Black: 64#(and (= ~node_state~0 0) (= ~client_state~0 0) (= ~manager_state~0 0)), 33#thread1EXITtrue, Black: 68#(<= ~manager_back~0 ~manager_front~0), 80#true, Black: 72#(<= ~node_back~0 ~node_front~0), Black: 77#(and (= ~node_state~0 0) (= ~client_state~0 1) (= ~manager_state~0 0)), Black: 76#(and (= ~node_state~0 0) (= ~manager_state~0 0)), 5#L118true, 74#true, Black: 83#(and (= ~node_state~0 0) (= ~client_state~0 1)), Black: 84#(and (= ~manager_state~0 1) (= ~node_state~0 0) (= ~client_state~0 1)), Black: 82#(= ~node_state~0 0), 21#L95-1true, thread3Thread1of1ForFork2InUse, 19#ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 89#true]) [2024-06-28 02:46:46,131 INFO L294 olderBase$Statistics]: this new event has 54 ancestors and is cut-off event [2024-06-28 02:46:46,131 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2024-06-28 02:46:46,131 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2024-06-28 02:46:46,131 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2024-06-28 02:46:46,131 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1032] L89-->L95-1: Formula: (and (= (+ 1 v_~node_front~0_81) v_~node_front~0_80) (= v_~node_state~0_54 1) (= (ite (= (ite (= (select (select |v_#memory_int#1_143| v_~node~0.base_85) (+ (* 4 v_~node_front~0_81) v_~node~0.offset_85)) v_~update~0_81) 1 0) 0) 0 1) v_~safe~0_104) (not (= (ite (and (< v_~node_front~0_81 v_~node_size~0_66) (<= 0 v_~node_front~0_81) (< v_~node_front~0_81 v_~node_back~0_92)) 1 0) 0))) InVars {~node_back~0=v_~node_back~0_92, ~node_size~0=v_~node_size~0_66, ~node~0.base=v_~node~0.base_85, ~node_front~0=v_~node_front~0_81, ~node~0.offset=v_~node~0.offset_85, #memory_int#1=|v_#memory_int#1_143|, ~update~0=v_~update~0_81} OutVars{~node_back~0=v_~node_back~0_92, thread2Thread1of1ForFork0_#t~post12#1=|v_thread2Thread1of1ForFork0_#t~post12#1_1|, thread2Thread1of1ForFork0_#t~mem11#1=|v_thread2Thread1of1ForFork0_#t~mem11#1_1|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~node~0.base=v_~node~0.base_85, ~node~0.offset=v_~node~0.offset_85, #memory_int#1=|v_#memory_int#1_143|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~node_size~0=v_~node_size~0_66, ~safe~0=v_~safe~0_104, ~node_front~0=v_~node_front~0_80, ~node_state~0=v_~node_state~0_54, ~update~0=v_~update~0_81} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#t~post12#1, thread2Thread1of1ForFork0_#t~mem11#1, ~safe~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~node_front~0, ~node_state~0][85], [Black: 64#(and (= ~node_state~0 0) (= ~client_state~0 0) (= ~manager_state~0 0)), 33#thread1EXITtrue, Black: 68#(<= ~manager_back~0 ~manager_front~0), 32#L110true, 80#true, Black: 72#(<= ~node_back~0 ~node_front~0), Black: 77#(and (= ~node_state~0 0) (= ~client_state~0 1) (= ~manager_state~0 0)), Black: 76#(and (= ~node_state~0 0) (= ~manager_state~0 0)), 74#true, Black: 83#(and (= ~node_state~0 0) (= ~client_state~0 1)), Black: 84#(and (= ~manager_state~0 1) (= ~node_state~0 0) (= ~client_state~0 1)), Black: 82#(= ~node_state~0 0), 21#L95-1true, thread3Thread1of1ForFork2InUse, 19#ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 89#true]) [2024-06-28 02:46:46,132 INFO L294 olderBase$Statistics]: this new event has 52 ancestors and is cut-off event [2024-06-28 02:46:46,132 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2024-06-28 02:46:46,132 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2024-06-28 02:46:46,132 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2024-06-28 02:46:46,132 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1032] L89-->L95-1: Formula: (and (= (+ 1 v_~node_front~0_81) v_~node_front~0_80) (= v_~node_state~0_54 1) (= (ite (= (ite (= (select (select |v_#memory_int#1_143| v_~node~0.base_85) (+ (* 4 v_~node_front~0_81) v_~node~0.offset_85)) v_~update~0_81) 1 0) 0) 0 1) v_~safe~0_104) (not (= (ite (and (< v_~node_front~0_81 v_~node_size~0_66) (<= 0 v_~node_front~0_81) (< v_~node_front~0_81 v_~node_back~0_92)) 1 0) 0))) InVars {~node_back~0=v_~node_back~0_92, ~node_size~0=v_~node_size~0_66, ~node~0.base=v_~node~0.base_85, ~node_front~0=v_~node_front~0_81, ~node~0.offset=v_~node~0.offset_85, #memory_int#1=|v_#memory_int#1_143|, ~update~0=v_~update~0_81} OutVars{~node_back~0=v_~node_back~0_92, thread2Thread1of1ForFork0_#t~post12#1=|v_thread2Thread1of1ForFork0_#t~post12#1_1|, thread2Thread1of1ForFork0_#t~mem11#1=|v_thread2Thread1of1ForFork0_#t~mem11#1_1|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~node~0.base=v_~node~0.base_85, ~node~0.offset=v_~node~0.offset_85, #memory_int#1=|v_#memory_int#1_143|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~node_size~0=v_~node_size~0_66, ~safe~0=v_~safe~0_104, ~node_front~0=v_~node_front~0_80, ~node_state~0=v_~node_state~0_54, ~update~0=v_~update~0_81} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#t~post12#1, thread2Thread1of1ForFork0_#t~mem11#1, ~safe~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~node_front~0, ~node_state~0][85], [Black: 64#(and (= ~node_state~0 0) (= ~client_state~0 0) (= ~manager_state~0 0)), 33#thread1EXITtrue, Black: 68#(<= ~manager_back~0 ~manager_front~0), 80#true, Black: 72#(<= ~node_back~0 ~node_front~0), Black: 77#(and (= ~node_state~0 0) (= ~client_state~0 1) (= ~manager_state~0 0)), Black: 76#(and (= ~node_state~0 0) (= ~manager_state~0 0)), 74#true, Black: 83#(and (= ~node_state~0 0) (= ~client_state~0 1)), Black: 84#(and (= ~manager_state~0 1) (= ~node_state~0 0) (= ~client_state~0 1)), Black: 82#(= ~node_state~0 0), 21#L95-1true, thread3Thread1of1ForFork2InUse, 13#L117true, 19#ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 89#true]) [2024-06-28 02:46:46,132 INFO L294 olderBase$Statistics]: this new event has 53 ancestors and is cut-off event [2024-06-28 02:46:46,133 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2024-06-28 02:46:46,133 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2024-06-28 02:46:46,133 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2024-06-28 02:46:46,152 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1032] L89-->L95-1: Formula: (and (= (+ 1 v_~node_front~0_81) v_~node_front~0_80) (= v_~node_state~0_54 1) (= (ite (= (ite (= (select (select |v_#memory_int#1_143| v_~node~0.base_85) (+ (* 4 v_~node_front~0_81) v_~node~0.offset_85)) v_~update~0_81) 1 0) 0) 0 1) v_~safe~0_104) (not (= (ite (and (< v_~node_front~0_81 v_~node_size~0_66) (<= 0 v_~node_front~0_81) (< v_~node_front~0_81 v_~node_back~0_92)) 1 0) 0))) InVars {~node_back~0=v_~node_back~0_92, ~node_size~0=v_~node_size~0_66, ~node~0.base=v_~node~0.base_85, ~node_front~0=v_~node_front~0_81, ~node~0.offset=v_~node~0.offset_85, #memory_int#1=|v_#memory_int#1_143|, ~update~0=v_~update~0_81} OutVars{~node_back~0=v_~node_back~0_92, thread2Thread1of1ForFork0_#t~post12#1=|v_thread2Thread1of1ForFork0_#t~post12#1_1|, thread2Thread1of1ForFork0_#t~mem11#1=|v_thread2Thread1of1ForFork0_#t~mem11#1_1|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~node~0.base=v_~node~0.base_85, ~node~0.offset=v_~node~0.offset_85, #memory_int#1=|v_#memory_int#1_143|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~node_size~0=v_~node_size~0_66, ~safe~0=v_~safe~0_104, ~node_front~0=v_~node_front~0_80, ~node_state~0=v_~node_state~0_54, ~update~0=v_~update~0_81} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#t~post12#1, thread2Thread1of1ForFork0_#t~mem11#1, ~safe~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~node_front~0, ~node_state~0][85], [Black: 64#(and (= ~node_state~0 0) (= ~client_state~0 0) (= ~manager_state~0 0)), 33#thread1EXITtrue, Black: 68#(<= ~manager_back~0 ~manager_front~0), 80#true, Black: 72#(<= ~node_back~0 ~node_front~0), Black: 77#(and (= ~node_state~0 0) (= ~client_state~0 1) (= ~manager_state~0 0)), Black: 76#(and (= ~node_state~0 0) (= ~manager_state~0 0)), 74#true, Black: 83#(and (= ~node_state~0 0) (= ~client_state~0 1)), Black: 84#(and (= ~manager_state~0 1) (= ~node_state~0 0) (= ~client_state~0 1)), Black: 82#(= ~node_state~0 0), 21#L95-1true, thread3Thread1of1ForFork2InUse, 13#L117true, 19#ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 89#true]) [2024-06-28 02:46:46,152 INFO L294 olderBase$Statistics]: this new event has 53 ancestors and is cut-off event [2024-06-28 02:46:46,152 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2024-06-28 02:46:46,152 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2024-06-28 02:46:46,152 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2024-06-28 02:46:46,152 INFO L297 olderBase$Statistics]: existing Event has 53 ancestors and is cut-off event [2024-06-28 02:46:46,160 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1032] L89-->L95-1: Formula: (and (= (+ 1 v_~node_front~0_81) v_~node_front~0_80) (= v_~node_state~0_54 1) (= (ite (= (ite (= (select (select |v_#memory_int#1_143| v_~node~0.base_85) (+ (* 4 v_~node_front~0_81) v_~node~0.offset_85)) v_~update~0_81) 1 0) 0) 0 1) v_~safe~0_104) (not (= (ite (and (< v_~node_front~0_81 v_~node_size~0_66) (<= 0 v_~node_front~0_81) (< v_~node_front~0_81 v_~node_back~0_92)) 1 0) 0))) InVars {~node_back~0=v_~node_back~0_92, ~node_size~0=v_~node_size~0_66, ~node~0.base=v_~node~0.base_85, ~node_front~0=v_~node_front~0_81, ~node~0.offset=v_~node~0.offset_85, #memory_int#1=|v_#memory_int#1_143|, ~update~0=v_~update~0_81} OutVars{~node_back~0=v_~node_back~0_92, thread2Thread1of1ForFork0_#t~post12#1=|v_thread2Thread1of1ForFork0_#t~post12#1_1|, thread2Thread1of1ForFork0_#t~mem11#1=|v_thread2Thread1of1ForFork0_#t~mem11#1_1|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~node~0.base=v_~node~0.base_85, ~node~0.offset=v_~node~0.offset_85, #memory_int#1=|v_#memory_int#1_143|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~node_size~0=v_~node_size~0_66, ~safe~0=v_~safe~0_104, ~node_front~0=v_~node_front~0_80, ~node_state~0=v_~node_state~0_54, ~update~0=v_~update~0_81} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#t~post12#1, thread2Thread1of1ForFork0_#t~mem11#1, ~safe~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~node_front~0, ~node_state~0][85], [Black: 64#(and (= ~node_state~0 0) (= ~client_state~0 0) (= ~manager_state~0 0)), 33#thread1EXITtrue, Black: 68#(<= ~manager_back~0 ~manager_front~0), 80#true, 47#thread3EXITtrue, Black: 72#(<= ~node_back~0 ~node_front~0), Black: 77#(and (= ~node_state~0 0) (= ~client_state~0 1) (= ~manager_state~0 0)), Black: 76#(and (= ~node_state~0 0) (= ~manager_state~0 0)), 74#true, Black: 83#(and (= ~node_state~0 0) (= ~client_state~0 1)), Black: 84#(and (= ~manager_state~0 1) (= ~node_state~0 0) (= ~client_state~0 1)), Black: 82#(= ~node_state~0 0), 21#L95-1true, thread3Thread1of1ForFork2InUse, 19#ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 89#true]) [2024-06-28 02:46:46,160 INFO L294 olderBase$Statistics]: this new event has 53 ancestors and is cut-off event [2024-06-28 02:46:46,160 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2024-06-28 02:46:46,160 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2024-06-28 02:46:46,160 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2024-06-28 02:46:46,169 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1032] L89-->L95-1: Formula: (and (= (+ 1 v_~node_front~0_81) v_~node_front~0_80) (= v_~node_state~0_54 1) (= (ite (= (ite (= (select (select |v_#memory_int#1_143| v_~node~0.base_85) (+ (* 4 v_~node_front~0_81) v_~node~0.offset_85)) v_~update~0_81) 1 0) 0) 0 1) v_~safe~0_104) (not (= (ite (and (< v_~node_front~0_81 v_~node_size~0_66) (<= 0 v_~node_front~0_81) (< v_~node_front~0_81 v_~node_back~0_92)) 1 0) 0))) InVars {~node_back~0=v_~node_back~0_92, ~node_size~0=v_~node_size~0_66, ~node~0.base=v_~node~0.base_85, ~node_front~0=v_~node_front~0_81, ~node~0.offset=v_~node~0.offset_85, #memory_int#1=|v_#memory_int#1_143|, ~update~0=v_~update~0_81} OutVars{~node_back~0=v_~node_back~0_92, thread2Thread1of1ForFork0_#t~post12#1=|v_thread2Thread1of1ForFork0_#t~post12#1_1|, thread2Thread1of1ForFork0_#t~mem11#1=|v_thread2Thread1of1ForFork0_#t~mem11#1_1|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~node~0.base=v_~node~0.base_85, ~node~0.offset=v_~node~0.offset_85, #memory_int#1=|v_#memory_int#1_143|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~node_size~0=v_~node_size~0_66, ~safe~0=v_~safe~0_104, ~node_front~0=v_~node_front~0_80, ~node_state~0=v_~node_state~0_54, ~update~0=v_~update~0_81} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#t~post12#1, thread2Thread1of1ForFork0_#t~mem11#1, ~safe~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~node_front~0, ~node_state~0][74], [Black: 64#(and (= ~node_state~0 0) (= ~client_state~0 0) (= ~manager_state~0 0)), Black: 68#(<= ~manager_back~0 ~manager_front~0), 80#true, Black: 72#(<= ~node_back~0 ~node_front~0), Black: 77#(and (= ~node_state~0 0) (= ~client_state~0 1) (= ~manager_state~0 0)), Black: 76#(and (= ~node_state~0 0) (= ~manager_state~0 0)), 5#L118true, 38#L157-2true, 74#true, Black: 83#(and (= ~node_state~0 0) (= ~client_state~0 1)), Black: 84#(and (= ~manager_state~0 1) (= ~node_state~0 0) (= ~client_state~0 1)), Black: 82#(= ~node_state~0 0), 21#L95-1true, thread3Thread1of1ForFork2InUse, 89#true]) [2024-06-28 02:46:46,169 INFO L294 olderBase$Statistics]: this new event has 55 ancestors and is cut-off event [2024-06-28 02:46:46,169 INFO L297 olderBase$Statistics]: existing Event has 50 ancestors and is cut-off event [2024-06-28 02:46:46,169 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2024-06-28 02:46:46,169 INFO L297 olderBase$Statistics]: existing Event has 51 ancestors and is cut-off event [2024-06-28 02:46:46,169 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1032] L89-->L95-1: Formula: (and (= (+ 1 v_~node_front~0_81) v_~node_front~0_80) (= v_~node_state~0_54 1) (= (ite (= (ite (= (select (select |v_#memory_int#1_143| v_~node~0.base_85) (+ (* 4 v_~node_front~0_81) v_~node~0.offset_85)) v_~update~0_81) 1 0) 0) 0 1) v_~safe~0_104) (not (= (ite (and (< v_~node_front~0_81 v_~node_size~0_66) (<= 0 v_~node_front~0_81) (< v_~node_front~0_81 v_~node_back~0_92)) 1 0) 0))) InVars {~node_back~0=v_~node_back~0_92, ~node_size~0=v_~node_size~0_66, ~node~0.base=v_~node~0.base_85, ~node_front~0=v_~node_front~0_81, ~node~0.offset=v_~node~0.offset_85, #memory_int#1=|v_#memory_int#1_143|, ~update~0=v_~update~0_81} OutVars{~node_back~0=v_~node_back~0_92, thread2Thread1of1ForFork0_#t~post12#1=|v_thread2Thread1of1ForFork0_#t~post12#1_1|, thread2Thread1of1ForFork0_#t~mem11#1=|v_thread2Thread1of1ForFork0_#t~mem11#1_1|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~node~0.base=v_~node~0.base_85, ~node~0.offset=v_~node~0.offset_85, #memory_int#1=|v_#memory_int#1_143|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~node_size~0=v_~node_size~0_66, ~safe~0=v_~safe~0_104, ~node_front~0=v_~node_front~0_80, ~node_state~0=v_~node_state~0_54, ~update~0=v_~update~0_81} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#t~post12#1, thread2Thread1of1ForFork0_#t~mem11#1, ~safe~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~node_front~0, ~node_state~0][85], [Black: 64#(and (= ~node_state~0 0) (= ~client_state~0 0) (= ~manager_state~0 0)), Black: 68#(<= ~manager_back~0 ~manager_front~0), 80#true, Black: 72#(<= ~node_back~0 ~node_front~0), Black: 77#(and (= ~node_state~0 0) (= ~client_state~0 1) (= ~manager_state~0 0)), Black: 76#(and (= ~node_state~0 0) (= ~manager_state~0 0)), 38#L157-2true, 74#true, Black: 83#(and (= ~node_state~0 0) (= ~client_state~0 1)), Black: 84#(and (= ~manager_state~0 1) (= ~node_state~0 0) (= ~client_state~0 1)), Black: 82#(= ~node_state~0 0), 21#L95-1true, thread3Thread1of1ForFork2InUse, 13#L117true, 89#true]) [2024-06-28 02:46:46,169 INFO L294 olderBase$Statistics]: this new event has 54 ancestors and is cut-off event [2024-06-28 02:46:46,169 INFO L297 olderBase$Statistics]: existing Event has 50 ancestors and is cut-off event [2024-06-28 02:46:46,170 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2024-06-28 02:46:46,170 INFO L297 olderBase$Statistics]: existing Event has 54 ancestors and is cut-off event [2024-06-28 02:46:46,181 INFO L124 PetriNetUnfolderBase]: 20248/31352 cut-off events. [2024-06-28 02:46:46,181 INFO L125 PetriNetUnfolderBase]: For 74485/78954 co-relation queries the response was YES. [2024-06-28 02:46:46,259 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93410 conditions, 31352 events. 20248/31352 cut-off events. For 74485/78954 co-relation queries the response was YES. Maximal size of possible extension queue 949. Compared 213754 event pairs, 7989 based on Foata normal form. 971/26525 useless extension candidates. Maximal degree in co-relation 63547. Up to 12278 conditions per place. [2024-06-28 02:46:46,414 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 70 selfloop transitions, 2 changer transitions 0/94 dead transitions. [2024-06-28 02:46:46,415 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 94 transitions, 614 flow [2024-06-28 02:46:46,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-28 02:46:46,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-28 02:46:46,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 130 transitions. [2024-06-28 02:46:46,416 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6565656565656566 [2024-06-28 02:46:46,416 INFO L175 Difference]: Start difference. First operand has 64 places, 73 transitions, 388 flow. Second operand 3 states and 130 transitions. [2024-06-28 02:46:46,416 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 94 transitions, 614 flow [2024-06-28 02:46:46,426 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 94 transitions, 612 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-28 02:46:46,428 INFO L231 Difference]: Finished difference. Result has 66 places, 69 transitions, 353 flow [2024-06-28 02:46:46,428 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=337, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=353, PETRI_PLACES=66, PETRI_TRANSITIONS=69} [2024-06-28 02:46:46,431 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 12 predicate places. [2024-06-28 02:46:46,431 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 69 transitions, 353 flow [2024-06-28 02:46:46,432 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 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) [2024-06-28 02:46:46,432 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:46:46,432 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:46:46,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-28 02:46:46,432 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 02:46:46,434 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:46:46,434 INFO L85 PathProgramCache]: Analyzing trace with hash 1171783176, now seen corresponding path program 1 times [2024-06-28 02:46:46,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:46:46,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271389272] [2024-06-28 02:46:46,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:46:46,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:46:46,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:46:46,586 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:46:46,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:46:46,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271389272] [2024-06-28 02:46:46,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271389272] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:46:46,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:46:46,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-28 02:46:46,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791764851] [2024-06-28 02:46:46,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:46:46,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-28 02:46:46,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:46:46,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-28 02:46:46,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-28 02:46:46,621 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 66 [2024-06-28 02:46:46,622 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 69 transitions, 353 flow. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 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) [2024-06-28 02:46:46,622 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:46:46,622 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 66 [2024-06-28 02:46:46,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:46:50,851 INFO L124 PetriNetUnfolderBase]: 41105/57684 cut-off events. [2024-06-28 02:46:50,851 INFO L125 PetriNetUnfolderBase]: For 103872/104089 co-relation queries the response was YES. [2024-06-28 02:46:51,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 173470 conditions, 57684 events. 41105/57684 cut-off events. For 103872/104089 co-relation queries the response was YES. Maximal size of possible extension queue 1116. Compared 341006 event pairs, 14272 based on Foata normal form. 1180/51602 useless extension candidates. Maximal degree in co-relation 118078. Up to 17331 conditions per place. [2024-06-28 02:46:51,249 INFO L140 encePairwiseOnDemand]: 52/66 looper letters, 118 selfloop transitions, 18 changer transitions 0/143 dead transitions. [2024-06-28 02:46:51,249 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 143 transitions, 876 flow [2024-06-28 02:46:51,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-28 02:46:51,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-28 02:46:51,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 180 transitions. [2024-06-28 02:46:51,251 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5454545454545454 [2024-06-28 02:46:51,251 INFO L175 Difference]: Start difference. First operand has 66 places, 69 transitions, 353 flow. Second operand 5 states and 180 transitions. [2024-06-28 02:46:51,251 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 143 transitions, 876 flow [2024-06-28 02:46:51,274 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 143 transitions, 872 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-28 02:46:51,279 INFO L231 Difference]: Finished difference. Result has 71 places, 74 transitions, 452 flow [2024-06-28 02:46:51,279 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=351, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=452, PETRI_PLACES=71, PETRI_TRANSITIONS=74} [2024-06-28 02:46:51,280 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 17 predicate places. [2024-06-28 02:46:51,280 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 74 transitions, 452 flow [2024-06-28 02:46:51,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 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) [2024-06-28 02:46:51,280 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:46:51,281 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:46:51,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-28 02:46:51,281 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 02:46:51,281 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:46:51,281 INFO L85 PathProgramCache]: Analyzing trace with hash 252628627, now seen corresponding path program 1 times [2024-06-28 02:46:51,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:46:51,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023209963] [2024-06-28 02:46:51,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:46:51,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:46:51,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:46:51,413 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:46:51,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:46:51,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023209963] [2024-06-28 02:46:51,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023209963] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:46:51,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:46:51,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-28 02:46:51,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582967891] [2024-06-28 02:46:51,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:46:51,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-28 02:46:51,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:46:51,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-28 02:46:51,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-28 02:46:51,444 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 66 [2024-06-28 02:46:51,444 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 74 transitions, 452 flow. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 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) [2024-06-28 02:46:51,444 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:46:51,444 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 66 [2024-06-28 02:46:51,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:46:58,482 INFO L124 PetriNetUnfolderBase]: 60076/85203 cut-off events. [2024-06-28 02:46:58,483 INFO L125 PetriNetUnfolderBase]: For 219097/220669 co-relation queries the response was YES. [2024-06-28 02:46:58,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 269761 conditions, 85203 events. 60076/85203 cut-off events. For 219097/220669 co-relation queries the response was YES. Maximal size of possible extension queue 1594. Compared 541911 event pairs, 23042 based on Foata normal form. 7503/81088 useless extension candidates. Maximal degree in co-relation 192081. Up to 38859 conditions per place. [2024-06-28 02:46:59,104 INFO L140 encePairwiseOnDemand]: 49/66 looper letters, 122 selfloop transitions, 26 changer transitions 0/155 dead transitions. [2024-06-28 02:46:59,105 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 155 transitions, 1103 flow [2024-06-28 02:46:59,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-28 02:46:59,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-28 02:46:59,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 187 transitions. [2024-06-28 02:46:59,106 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5666666666666667 [2024-06-28 02:46:59,106 INFO L175 Difference]: Start difference. First operand has 71 places, 74 transitions, 452 flow. Second operand 5 states and 187 transitions. [2024-06-28 02:46:59,106 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 155 transitions, 1103 flow [2024-06-28 02:46:59,210 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 155 transitions, 1064 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-06-28 02:46:59,212 INFO L231 Difference]: Finished difference. Result has 77 places, 88 transitions, 699 flow [2024-06-28 02:46:59,212 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=431, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=699, PETRI_PLACES=77, PETRI_TRANSITIONS=88} [2024-06-28 02:46:59,213 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 23 predicate places. [2024-06-28 02:46:59,213 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 88 transitions, 699 flow [2024-06-28 02:46:59,213 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 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) [2024-06-28 02:46:59,213 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:46:59,214 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:46:59,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-28 02:46:59,214 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 02:46:59,214 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:46:59,215 INFO L85 PathProgramCache]: Analyzing trace with hash -423759112, now seen corresponding path program 1 times [2024-06-28 02:46:59,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:46:59,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495897662] [2024-06-28 02:46:59,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:46:59,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:46:59,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:46:59,370 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-06-28 02:46:59,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:46:59,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495897662] [2024-06-28 02:46:59,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495897662] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:46:59,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:46:59,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-28 02:46:59,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213956276] [2024-06-28 02:46:59,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:46:59,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-28 02:46:59,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:46:59,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-28 02:46:59,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-28 02:46:59,407 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 66 [2024-06-28 02:46:59,407 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 88 transitions, 699 flow. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 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) [2024-06-28 02:46:59,407 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:46:59,408 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 66 [2024-06-28 02:46:59,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:47:06,585 INFO L124 PetriNetUnfolderBase]: 58048/83288 cut-off events. [2024-06-28 02:47:06,586 INFO L125 PetriNetUnfolderBase]: For 307634/308277 co-relation queries the response was YES. [2024-06-28 02:47:06,873 INFO L83 FinitePrefix]: Finished finitePrefix Result has 299401 conditions, 83288 events. 58048/83288 cut-off events. For 307634/308277 co-relation queries the response was YES. Maximal size of possible extension queue 1750. Compared 539928 event pairs, 20878 based on Foata normal form. 1500/74035 useless extension candidates. Maximal degree in co-relation 222615. Up to 33054 conditions per place. [2024-06-28 02:47:07,155 INFO L140 encePairwiseOnDemand]: 51/66 looper letters, 134 selfloop transitions, 26 changer transitions 0/167 dead transitions. [2024-06-28 02:47:07,156 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 167 transitions, 1402 flow [2024-06-28 02:47:07,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-28 02:47:07,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-28 02:47:07,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 181 transitions. [2024-06-28 02:47:07,157 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5484848484848485 [2024-06-28 02:47:07,157 INFO L175 Difference]: Start difference. First operand has 77 places, 88 transitions, 699 flow. Second operand 5 states and 181 transitions. [2024-06-28 02:47:07,157 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 167 transitions, 1402 flow [2024-06-28 02:47:07,269 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 167 transitions, 1392 flow, removed 5 selfloop flow, removed 0 redundant places. [2024-06-28 02:47:07,272 INFO L231 Difference]: Finished difference. Result has 83 places, 95 transitions, 847 flow [2024-06-28 02:47:07,272 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=689, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=847, PETRI_PLACES=83, PETRI_TRANSITIONS=95} [2024-06-28 02:47:07,272 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 29 predicate places. [2024-06-28 02:47:07,273 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 95 transitions, 847 flow [2024-06-28 02:47:07,273 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 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) [2024-06-28 02:47:07,273 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:47:07,273 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:47:07,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-28 02:47:07,273 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 02:47:07,274 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:47:07,274 INFO L85 PathProgramCache]: Analyzing trace with hash 1757956113, now seen corresponding path program 1 times [2024-06-28 02:47:07,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:47:07,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145945718] [2024-06-28 02:47:07,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:47:07,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:47:07,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:47:07,384 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:47:07,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:47:07,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145945718] [2024-06-28 02:47:07,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145945718] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:47:07,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:47:07,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-28 02:47:07,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086554273] [2024-06-28 02:47:07,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:47:07,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-28 02:47:07,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:47:07,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-28 02:47:07,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-28 02:47:07,417 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 66 [2024-06-28 02:47:07,417 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 95 transitions, 847 flow. Second operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 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) [2024-06-28 02:47:07,418 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:47:07,418 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 66 [2024-06-28 02:47:07,418 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:47:16,037 INFO L124 PetriNetUnfolderBase]: 64618/92628 cut-off events. [2024-06-28 02:47:16,037 INFO L125 PetriNetUnfolderBase]: For 415045/416179 co-relation queries the response was YES. [2024-06-28 02:47:16,433 INFO L83 FinitePrefix]: Finished finitePrefix Result has 351596 conditions, 92628 events. 64618/92628 cut-off events. For 415045/416179 co-relation queries the response was YES. Maximal size of possible extension queue 2117. Compared 610570 event pairs, 23428 based on Foata normal form. 865/82288 useless extension candidates. Maximal degree in co-relation 263336. Up to 38026 conditions per place. [2024-06-28 02:47:16,751 INFO L140 encePairwiseOnDemand]: 56/66 looper letters, 131 selfloop transitions, 36 changer transitions 0/174 dead transitions. [2024-06-28 02:47:16,751 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 174 transitions, 1668 flow [2024-06-28 02:47:16,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-28 02:47:16,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-28 02:47:16,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 173 transitions. [2024-06-28 02:47:16,752 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5242424242424243 [2024-06-28 02:47:16,753 INFO L175 Difference]: Start difference. First operand has 83 places, 95 transitions, 847 flow. Second operand 5 states and 173 transitions. [2024-06-28 02:47:16,753 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 174 transitions, 1668 flow [2024-06-28 02:47:16,916 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 174 transitions, 1622 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-06-28 02:47:16,918 INFO L231 Difference]: Finished difference. Result has 87 places, 107 transitions, 1095 flow [2024-06-28 02:47:16,918 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=819, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1095, PETRI_PLACES=87, PETRI_TRANSITIONS=107} [2024-06-28 02:47:16,919 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 33 predicate places. [2024-06-28 02:47:16,919 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 107 transitions, 1095 flow [2024-06-28 02:47:16,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 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) [2024-06-28 02:47:16,919 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:47:16,920 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:47:16,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-28 02:47:16,920 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 02:47:16,920 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:47:16,920 INFO L85 PathProgramCache]: Analyzing trace with hash 1544166929, now seen corresponding path program 1 times [2024-06-28 02:47:16,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:47:16,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836597307] [2024-06-28 02:47:16,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:47:16,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:47:16,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:47:17,029 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-06-28 02:47:17,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:47:17,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836597307] [2024-06-28 02:47:17,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836597307] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:47:17,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:47:17,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-28 02:47:17,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341529570] [2024-06-28 02:47:17,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:47:17,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-28 02:47:17,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:47:17,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-28 02:47:17,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-28 02:47:17,070 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 66 [2024-06-28 02:47:17,070 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 107 transitions, 1095 flow. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 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) [2024-06-28 02:47:17,070 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:47:17,071 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 66 [2024-06-28 02:47:17,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand