./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-atomic/read_write_lock-1.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-05-07_14-17-48.files/protection/read_write_lock-1.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b44c8288 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/pthread-atomic/read_write_lock-1.i ./goblint.2024-05-07_14-17-48.files/protection/read_write_lock-1.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 --- Real Ultimate output --- This is Ultimate 0.2.4-wip.fs.witness-ghost-b44c828-m [2024-05-12 12:37:47,697 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-12 12:37:47,792 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-05-12 12:37:47,798 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-12 12:37:47,798 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-12 12:37:47,831 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-12 12:37:47,832 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-12 12:37:47,832 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-12 12:37:47,833 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-05-12 12:37:47,837 INFO L153 SettingsManager]: * Use memory slicer=true [2024-05-12 12:37:47,837 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-12 12:37:47,837 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-12 12:37:47,838 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-12 12:37:47,840 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-12 12:37:47,840 INFO L153 SettingsManager]: * Use SBE=true [2024-05-12 12:37:47,840 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-12 12:37:47,841 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-12 12:37:47,841 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-12 12:37:47,841 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-12 12:37:47,841 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-12 12:37:47,842 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-12 12:37:47,842 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-12 12:37:47,842 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-12 12:37:47,843 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-12 12:37:47,843 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-05-12 12:37:47,843 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-12 12:37:47,843 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-12 12:37:47,844 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-12 12:37:47,844 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-12 12:37:47,845 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-12 12:37:47,846 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-05-12 12:37:47,846 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-12 12:37:47,846 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-05-12 12:37:47,846 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-12 12:37:47,846 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-12 12:37:47,847 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-05-12 12:37:47,847 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-12 12:37:47,847 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-12 12:37:47,847 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-12 12:37:47,848 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-05-12 12:37:47,848 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-12 12:37:47,848 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-05-12 12:37:47,848 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-05-12 12:37:47,849 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 [2024-05-12 12:37:48,114 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-12 12:37:48,139 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-12 12:37:48,141 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-12 12:37:48,142 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-12 12:37:48,143 INFO L274 PluginConnector]: CDTParser initialized [2024-05-12 12:37:48,144 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-atomic/read_write_lock-1.i [2024-05-12 12:37:49,362 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-12 12:37:49,626 INFO L384 CDTParser]: Found 1 translation units. [2024-05-12 12:37:49,627 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/read_write_lock-1.i [2024-05-12 12:37:49,647 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/660e00a13/25309aa8ba72427ab3faadc832e28ed5/FLAGe13b0143d [2024-05-12 12:37:49,666 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/660e00a13/25309aa8ba72427ab3faadc832e28ed5 [2024-05-12 12:37:49,669 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-05-12 12:37:49,669 INFO L274 PluginConnector]: Witness Parser initialized [2024-05-12 12:37:49,671 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-05-07_14-17-48.files/protection/read_write_lock-1.yml/witness.yml [2024-05-12 12:37:49,790 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-12 12:37:49,792 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-12 12:37:49,795 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-12 12:37:49,795 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-12 12:37:49,800 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-12 12:37:49,801 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.05 12:37:49" (1/2) ... [2024-05-12 12:37:49,802 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@269db369 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 12:37:49, skipping insertion in model container [2024-05-12 12:37:49,802 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.05 12:37:49" (1/2) ... [2024-05-12 12:37:49,805 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@28c4e039 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 12:37:49, skipping insertion in model container [2024-05-12 12:37:49,805 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 12.05 12:37:49" (2/2) ... [2024-05-12 12:37:49,806 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@269db369 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 12:37:49, skipping insertion in model container [2024-05-12 12:37:49,806 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 12.05 12:37:49" (2/2) ... [2024-05-12 12:37:49,807 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-05-12 12:37:49,843 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-05-12 12:37:49,844 INFO L97 edCorrectnessWitness]: Location invariant before [L747-L747] ((! multithreaded || ((0 <= w && w <= 1) && (w == 0 || w == 1))) && (! multithreaded || ((((0 <= x && x <= 3) && x <= 127) && x % 3 == 0) && (x == 0 || x == 3)))) && (! multithreaded || ((((0 <= y && y <= 3) && y <= 127) && y % 3 == 0) && (y == 0 || y == 3))) [2024-05-12 12:37:49,844 INFO L97 edCorrectnessWitness]: Location invariant before [L748-L748] ((! multithreaded || ((0 <= w && w <= 1) && (w == 0 || w == 1))) && (! multithreaded || ((((0 <= x && x <= 3) && x <= 127) && x % 3 == 0) && (x == 0 || x == 3)))) && (! multithreaded || ((((0 <= y && y <= 3) && y <= 127) && y % 3 == 0) && (y == 0 || y == 3))) [2024-05-12 12:37:49,845 INFO L97 edCorrectnessWitness]: Location invariant before [L746-L746] ((! multithreaded || ((0 <= w && w <= 1) && (w == 0 || w == 1))) && (! multithreaded || ((((0 <= x && x <= 3) && x <= 127) && x % 3 == 0) && (x == 0 || x == 3)))) && (! multithreaded || ((((0 <= y && y <= 3) && y <= 127) && y % 3 == 0) && (y == 0 || y == 3))) [2024-05-12 12:37:49,845 INFO L97 edCorrectnessWitness]: Location invariant before [L749-L749] ((! multithreaded || ((0 <= w && w <= 1) && (w == 0 || w == 1))) && (! multithreaded || ((((0 <= x && x <= 3) && x <= 127) && x % 3 == 0) && (x == 0 || x == 3)))) && (! multithreaded || ((((0 <= y && y <= 3) && y <= 127) && y % 3 == 0) && (y == 0 || y == 3))) [2024-05-12 12:37:49,845 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-05-12 12:37:49,845 INFO L106 edCorrectnessWitness]: ghost_update [L745-L745] multithreaded = 1; [2024-05-12 12:37:49,889 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-12 12:37:50,210 WARN L246 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/read_write_lock-1.i[31246,31259] [2024-05-12 12:37:50,220 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-05-12 12:37:50,228 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local [2024-05-12 12:37:50,299 WARN L246 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/read_write_lock-1.i[31246,31259] Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-05-12 12:37:50,320 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-05-12 12:37:50,357 INFO L206 MainTranslator]: Completed translation [2024-05-12 12:37:50,357 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 12:37:50 WrapperNode [2024-05-12 12:37:50,357 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-12 12:37:50,358 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-12 12:37:50,358 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-12 12:37:50,358 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-12 12:37:50,364 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 12.05 12:37:50" (1/1) ... [2024-05-12 12:37:50,378 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 12.05 12:37:50" (1/1) ... [2024-05-12 12:37:50,412 INFO L138 Inliner]: procedures = 174, calls = 45, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 120 [2024-05-12 12:37:50,413 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-12 12:37:50,414 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-12 12:37:50,414 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-12 12:37:50,414 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-12 12:37:50,430 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 12:37:50" (1/1) ... [2024-05-12 12:37:50,430 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 12:37:50" (1/1) ... [2024-05-12 12:37:50,433 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 12:37:50" (1/1) ... [2024-05-12 12:37:50,447 INFO L175 MemorySlicer]: Split 10 memory accesses to 5 slices as follows [2, 2, 2, 2, 2]. 20 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0]. The 4 writes are split as follows [0, 1, 1, 1, 1]. [2024-05-12 12:37:50,448 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 12:37:50" (1/1) ... [2024-05-12 12:37:50,448 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 12:37:50" (1/1) ... [2024-05-12 12:37:50,455 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 12:37:50" (1/1) ... [2024-05-12 12:37:50,457 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 12:37:50" (1/1) ... [2024-05-12 12:37:50,459 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 12:37:50" (1/1) ... [2024-05-12 12:37:50,460 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 12:37:50" (1/1) ... [2024-05-12 12:37:50,463 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-12 12:37:50,464 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-12 12:37:50,464 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-12 12:37:50,464 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-12 12:37:50,465 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 12:37:50" (1/1) ... [2024-05-12 12:37:50,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-05-12 12:37:50,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-05-12 12:37:50,500 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-05-12 12:37:50,520 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-05-12 12:37:50,535 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-05-12 12:37:50,535 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-05-12 12:37:50,536 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-05-12 12:37:50,536 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-05-12 12:37:50,537 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-05-12 12:37:50,537 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-05-12 12:37:50,537 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-05-12 12:37:50,537 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-05-12 12:37:50,537 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-05-12 12:37:50,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-05-12 12:37:50,538 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-05-12 12:37:50,539 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-12 12:37:50,539 INFO L130 BoogieDeclarations]: Found specification of procedure reader [2024-05-12 12:37:50,541 INFO L138 BoogieDeclarations]: Found implementation of procedure reader [2024-05-12 12:37:50,542 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-12 12:37:50,542 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-12 12:37:50,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-05-12 12:37:50,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-05-12 12:37:50,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-05-12 12:37:50,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-05-12 12:37:50,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-05-12 12:37:50,543 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-05-12 12:37:50,543 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-12 12:37:50,544 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-12 12:37:50,544 INFO L130 BoogieDeclarations]: Found specification of procedure writer [2024-05-12 12:37:50,545 INFO L138 BoogieDeclarations]: Found implementation of procedure writer [2024-05-12 12:37:50,546 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-05-12 12:37:50,672 INFO L244 CfgBuilder]: Building ICFG [2024-05-12 12:37:50,674 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-12 12:37:50,902 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-05-12 12:37:50,902 INFO L293 CfgBuilder]: Performing block encoding [2024-05-12 12:37:51,072 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-12 12:37:51,073 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-05-12 12:37:51,073 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.05 12:37:51 BoogieIcfgContainer [2024-05-12 12:37:51,074 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-12 12:37:51,077 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-12 12:37:51,077 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-12 12:37:51,080 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-12 12:37:51,082 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.05 12:37:49" (1/4) ... [2024-05-12 12:37:51,083 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a4718e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.05 12:37:51, skipping insertion in model container [2024-05-12 12:37:51,083 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 12.05 12:37:49" (2/4) ... [2024-05-12 12:37:51,083 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a4718e4 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 12.05 12:37:51, skipping insertion in model container [2024-05-12 12:37:51,084 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 12:37:50" (3/4) ... [2024-05-12 12:37:51,084 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a4718e4 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 12.05 12:37:51, skipping insertion in model container [2024-05-12 12:37:51,084 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.05 12:37:51" (4/4) ... [2024-05-12 12:37:51,085 INFO L112 eAbstractionObserver]: Analyzing ICFG read_write_lock-1.i [2024-05-12 12:37:51,100 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-12 12:37:51,100 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2024-05-12 12:37:51,100 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-12 12:37:51,180 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-05-12 12:37:51,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 76 places, 65 transitions, 158 flow [2024-05-12 12:37:51,264 INFO L124 PetriNetUnfolderBase]: 2/61 cut-off events. [2024-05-12 12:37:51,265 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-05-12 12:37:51,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78 conditions, 61 events. 2/61 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 114 event pairs, 0 based on Foata normal form. 0/53 useless extension candidates. Maximal degree in co-relation 55. Up to 2 conditions per place. [2024-05-12 12:37:51,269 INFO L82 GeneralOperation]: Start removeDead. Operand has 76 places, 65 transitions, 158 flow [2024-05-12 12:37:51,273 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 70 places, 59 transitions, 139 flow [2024-05-12 12:37:51,282 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-12 12:37:51,288 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;@c22d9e0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-12 12:37:51,288 INFO L358 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2024-05-12 12:37:51,297 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-05-12 12:37:51,298 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2024-05-12 12:37:51,298 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-05-12 12:37:51,298 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:37:51,299 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-05-12 12:37:51,299 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-05-12 12:37:51,306 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:37:51,306 INFO L85 PathProgramCache]: Analyzing trace with hash -611178298, now seen corresponding path program 1 times [2024-05-12 12:37:51,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:37:51,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275435814] [2024-05-12 12:37:51,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:37:51,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:37:51,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:37:51,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:37:51,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:37:51,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275435814] [2024-05-12 12:37:51,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275435814] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:37:51,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:37:51,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-05-12 12:37:51,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108825593] [2024-05-12 12:37:51,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:37:51,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-05-12 12:37:51,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:37:51,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-05-12 12:37:51,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-05-12 12:37:52,040 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 65 [2024-05-12 12:37:52,043 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 59 transitions, 139 flow. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 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-05-12 12:37:52,044 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:37:52,044 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 65 [2024-05-12 12:37:52,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:37:53,622 INFO L124 PetriNetUnfolderBase]: 8511/14167 cut-off events. [2024-05-12 12:37:53,623 INFO L125 PetriNetUnfolderBase]: For 570/570 co-relation queries the response was YES. [2024-05-12 12:37:53,666 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26243 conditions, 14167 events. 8511/14167 cut-off events. For 570/570 co-relation queries the response was YES. Maximal size of possible extension queue 606. Compared 104044 event pairs, 4414 based on Foata normal form. 753/13565 useless extension candidates. Maximal degree in co-relation 25842. Up to 11556 conditions per place. [2024-05-12 12:37:53,755 INFO L140 encePairwiseOnDemand]: 54/65 looper letters, 55 selfloop transitions, 5 changer transitions 0/76 dead transitions. [2024-05-12 12:37:53,755 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 76 transitions, 302 flow [2024-05-12 12:37:53,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-12 12:37:53,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-05-12 12:37:53,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 126 transitions. [2024-05-12 12:37:53,768 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6461538461538462 [2024-05-12 12:37:53,770 INFO L175 Difference]: Start difference. First operand has 70 places, 59 transitions, 139 flow. Second operand 3 states and 126 transitions. [2024-05-12 12:37:53,771 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 76 transitions, 302 flow [2024-05-12 12:37:53,786 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 76 transitions, 284 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-05-12 12:37:53,791 INFO L231 Difference]: Finished difference. Result has 66 places, 61 transitions, 161 flow [2024-05-12 12:37:53,793 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=161, PETRI_PLACES=66, PETRI_TRANSITIONS=61} [2024-05-12 12:37:53,798 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, -4 predicate places. [2024-05-12 12:37:53,799 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 61 transitions, 161 flow [2024-05-12 12:37:53,799 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 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-05-12 12:37:53,799 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:37:53,800 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:37:53,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-05-12 12:37:53,801 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-05-12 12:37:53,802 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:37:53,802 INFO L85 PathProgramCache]: Analyzing trace with hash 1068229061, now seen corresponding path program 1 times [2024-05-12 12:37:53,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:37:53,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585140715] [2024-05-12 12:37:53,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:37:53,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:37:53,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:37:54,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:37:54,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:37:54,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585140715] [2024-05-12 12:37:54,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585140715] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:37:54,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:37:54,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-12 12:37:54,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761301266] [2024-05-12 12:37:54,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:37:54,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-05-12 12:37:54,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:37:54,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-12 12:37:54,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-05-12 12:37:54,152 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 65 [2024-05-12 12:37:54,153 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 61 transitions, 161 flow. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 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-05-12 12:37:54,153 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:37:54,153 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 65 [2024-05-12 12:37:54,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:37:56,018 INFO L124 PetriNetUnfolderBase]: 13092/20893 cut-off events. [2024-05-12 12:37:56,019 INFO L125 PetriNetUnfolderBase]: For 3002/3002 co-relation queries the response was YES. [2024-05-12 12:37:56,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43209 conditions, 20893 events. 13092/20893 cut-off events. For 3002/3002 co-relation queries the response was YES. Maximal size of possible extension queue 836. Compared 151420 event pairs, 6426 based on Foata normal form. 145/20136 useless extension candidates. Maximal degree in co-relation 25439. Up to 17490 conditions per place. [2024-05-12 12:37:56,178 INFO L140 encePairwiseOnDemand]: 52/65 looper letters, 70 selfloop transitions, 9 changer transitions 0/93 dead transitions. [2024-05-12 12:37:56,179 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 93 transitions, 395 flow [2024-05-12 12:37:56,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-12 12:37:56,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-05-12 12:37:56,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 159 transitions. [2024-05-12 12:37:56,191 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6115384615384616 [2024-05-12 12:37:56,192 INFO L175 Difference]: Start difference. First operand has 66 places, 61 transitions, 161 flow. Second operand 4 states and 159 transitions. [2024-05-12 12:37:56,192 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 93 transitions, 395 flow [2024-05-12 12:37:56,194 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 93 transitions, 390 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-05-12 12:37:56,196 INFO L231 Difference]: Finished difference. Result has 69 places, 65 transitions, 216 flow [2024-05-12 12:37:56,196 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=216, PETRI_PLACES=69, PETRI_TRANSITIONS=65} [2024-05-12 12:37:56,197 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, -1 predicate places. [2024-05-12 12:37:56,198 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 65 transitions, 216 flow [2024-05-12 12:37:56,198 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 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-05-12 12:37:56,198 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:37:56,198 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:37:56,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-05-12 12:37:56,199 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-05-12 12:37:56,201 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:37:56,201 INFO L85 PathProgramCache]: Analyzing trace with hash -1215142642, now seen corresponding path program 1 times [2024-05-12 12:37:56,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:37:56,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958156645] [2024-05-12 12:37:56,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:37:56,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:37:56,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:37:56,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:37:56,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:37:56,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958156645] [2024-05-12 12:37:56,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958156645] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:37:56,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:37:56,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-05-12 12:37:56,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491880392] [2024-05-12 12:37:56,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:37:56,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-05-12 12:37:56,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:37:56,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-12 12:37:56,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-05-12 12:37:56,483 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 65 [2024-05-12 12:37:56,484 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 65 transitions, 216 flow. Second operand has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 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-05-12 12:37:56,484 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:37:56,484 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 65 [2024-05-12 12:37:56,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:37:58,253 INFO L124 PetriNetUnfolderBase]: 12069/19740 cut-off events. [2024-05-12 12:37:58,254 INFO L125 PetriNetUnfolderBase]: For 8645/8645 co-relation queries the response was YES. [2024-05-12 12:37:58,293 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46886 conditions, 19740 events. 12069/19740 cut-off events. For 8645/8645 co-relation queries the response was YES. Maximal size of possible extension queue 783. Compared 146149 event pairs, 3793 based on Foata normal form. 441/19161 useless extension candidates. Maximal degree in co-relation 20719. Up to 13390 conditions per place. [2024-05-12 12:37:58,390 INFO L140 encePairwiseOnDemand]: 50/65 looper letters, 97 selfloop transitions, 21 changer transitions 0/132 dead transitions. [2024-05-12 12:37:58,391 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 132 transitions, 660 flow [2024-05-12 12:37:58,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-12 12:37:58,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-05-12 12:37:58,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 210 transitions. [2024-05-12 12:37:58,394 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6461538461538462 [2024-05-12 12:37:58,394 INFO L175 Difference]: Start difference. First operand has 69 places, 65 transitions, 216 flow. Second operand 5 states and 210 transitions. [2024-05-12 12:37:58,394 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 132 transitions, 660 flow [2024-05-12 12:37:58,399 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 132 transitions, 644 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-05-12 12:37:58,401 INFO L231 Difference]: Finished difference. Result has 74 places, 77 transitions, 369 flow [2024-05-12 12:37:58,401 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=200, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=369, PETRI_PLACES=74, PETRI_TRANSITIONS=77} [2024-05-12 12:37:58,402 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, 4 predicate places. [2024-05-12 12:37:58,403 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 77 transitions, 369 flow [2024-05-12 12:37:58,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 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-05-12 12:37:58,403 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:37:58,403 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:37:58,404 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-05-12 12:37:58,404 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-05-12 12:37:58,404 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:37:58,405 INFO L85 PathProgramCache]: Analyzing trace with hash 1016714888, now seen corresponding path program 1 times [2024-05-12 12:37:58,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:37:58,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539287503] [2024-05-12 12:37:58,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:37:58,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:37:58,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:37:58,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:37:58,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:37:58,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539287503] [2024-05-12 12:37:58,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539287503] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:37:58,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:37:58,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-05-12 12:37:58,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019832828] [2024-05-12 12:37:58,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:37:58,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-05-12 12:37:58,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:37:58,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-12 12:37:58,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-05-12 12:37:58,687 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 65 [2024-05-12 12:37:58,688 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 77 transitions, 369 flow. Second operand has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 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-05-12 12:37:58,688 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:37:58,688 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 65 [2024-05-12 12:37:58,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:38:00,448 INFO L124 PetriNetUnfolderBase]: 11855/19446 cut-off events. [2024-05-12 12:38:00,449 INFO L125 PetriNetUnfolderBase]: For 25695/25701 co-relation queries the response was YES. [2024-05-12 12:38:00,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57066 conditions, 19446 events. 11855/19446 cut-off events. For 25695/25701 co-relation queries the response was YES. Maximal size of possible extension queue 783. Compared 144888 event pairs, 3202 based on Foata normal form. 110/18576 useless extension candidates. Maximal degree in co-relation 25987. Up to 13360 conditions per place. [2024-05-12 12:38:00,582 INFO L140 encePairwiseOnDemand]: 52/65 looper letters, 95 selfloop transitions, 17 changer transitions 0/126 dead transitions. [2024-05-12 12:38:00,582 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 126 transitions, 734 flow [2024-05-12 12:38:00,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-12 12:38:00,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-05-12 12:38:00,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 202 transitions. [2024-05-12 12:38:00,584 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6215384615384615 [2024-05-12 12:38:00,584 INFO L175 Difference]: Start difference. First operand has 74 places, 77 transitions, 369 flow. Second operand 5 states and 202 transitions. [2024-05-12 12:38:00,584 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 126 transitions, 734 flow [2024-05-12 12:38:00,593 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 126 transitions, 726 flow, removed 4 selfloop flow, removed 0 redundant places. [2024-05-12 12:38:00,595 INFO L231 Difference]: Finished difference. Result has 78 places, 76 transitions, 399 flow [2024-05-12 12:38:00,595 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=353, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=399, PETRI_PLACES=78, PETRI_TRANSITIONS=76} [2024-05-12 12:38:00,596 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, 8 predicate places. [2024-05-12 12:38:00,596 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 76 transitions, 399 flow [2024-05-12 12:38:00,596 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 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-05-12 12:38:00,596 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:38:00,596 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:38:00,597 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-05-12 12:38:00,597 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-05-12 12:38:00,597 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:38:00,597 INFO L85 PathProgramCache]: Analyzing trace with hash 1545825275, now seen corresponding path program 1 times [2024-05-12 12:38:00,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:38:00,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706386173] [2024-05-12 12:38:00,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:38:00,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:38:00,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:38:00,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:38:00,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:38:00,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706386173] [2024-05-12 12:38:00,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706386173] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:38:00,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:38:00,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-05-12 12:38:00,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317681046] [2024-05-12 12:38:00,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:38:00,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-05-12 12:38:00,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:38:00,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-12 12:38:00,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-05-12 12:38:00,819 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 65 [2024-05-12 12:38:00,820 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 76 transitions, 399 flow. Second operand has 5 states, 5 states have (on average 21.6) internal successors, (108), 5 states have internal predecessors, (108), 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-05-12 12:38:00,820 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:38:00,820 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 65 [2024-05-12 12:38:00,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:38:02,528 INFO L124 PetriNetUnfolderBase]: 12510/20852 cut-off events. [2024-05-12 12:38:02,528 INFO L125 PetriNetUnfolderBase]: For 35991/36008 co-relation queries the response was YES. [2024-05-12 12:38:02,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63328 conditions, 20852 events. 12510/20852 cut-off events. For 35991/36008 co-relation queries the response was YES. Maximal size of possible extension queue 876. Compared 160539 event pairs, 4357 based on Foata normal form. 41/19668 useless extension candidates. Maximal degree in co-relation 41149. Up to 16252 conditions per place. [2024-05-12 12:38:02,709 INFO L140 encePairwiseOnDemand]: 56/65 looper letters, 98 selfloop transitions, 17 changer transitions 0/132 dead transitions. [2024-05-12 12:38:02,709 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 132 transitions, 871 flow [2024-05-12 12:38:02,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 12:38:02,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 12:38:02,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 215 transitions. [2024-05-12 12:38:02,711 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5512820512820513 [2024-05-12 12:38:02,711 INFO L175 Difference]: Start difference. First operand has 78 places, 76 transitions, 399 flow. Second operand 6 states and 215 transitions. [2024-05-12 12:38:02,711 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 132 transitions, 871 flow [2024-05-12 12:38:02,746 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 132 transitions, 829 flow, removed 4 selfloop flow, removed 3 redundant places. [2024-05-12 12:38:02,749 INFO L231 Difference]: Finished difference. Result has 82 places, 89 transitions, 530 flow [2024-05-12 12:38:02,749 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=362, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=530, PETRI_PLACES=82, PETRI_TRANSITIONS=89} [2024-05-12 12:38:02,751 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, 12 predicate places. [2024-05-12 12:38:02,751 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 89 transitions, 530 flow [2024-05-12 12:38:02,752 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.6) internal successors, (108), 5 states have internal predecessors, (108), 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-05-12 12:38:02,752 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:38:02,752 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:38:02,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-05-12 12:38:02,752 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-05-12 12:38:02,753 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:38:02,753 INFO L85 PathProgramCache]: Analyzing trace with hash -494819974, now seen corresponding path program 1 times [2024-05-12 12:38:02,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:38:02,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040853451] [2024-05-12 12:38:02,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:38:02,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:38:02,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:38:02,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:38:02,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:38:02,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040853451] [2024-05-12 12:38:02,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040853451] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:38:02,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:38:02,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-05-12 12:38:02,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78319082] [2024-05-12 12:38:02,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:38:02,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-05-12 12:38:02,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:38:02,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-12 12:38:02,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-05-12 12:38:02,815 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 65 [2024-05-12 12:38:02,816 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 89 transitions, 530 flow. Second operand has 4 states, 4 states have (on average 30.75) internal successors, (123), 4 states have internal predecessors, (123), 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-05-12 12:38:02,816 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:38:02,816 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 65 [2024-05-12 12:38:02,816 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:38:04,074 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([202] L749-->ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT: Formula: (let ((.cse0 (not (= |v_#ghost~multithreaded_9| 0)))) (or (and .cse0 (or (< v_~w~0_9 0) (< 1 v_~w~0_9) (and (not (= v_~w~0_9 0)) (not (= v_~w~0_9 1))))) (and .cse0 (let ((.cse1 (< v_~y~0_10 0))) (or .cse1 (and (not (= v_~y~0_10 3)) (not (= v_~y~0_10 0))) (not (= (let ((.cse2 (mod v_~y~0_10 3))) (ite (and (not (= .cse2 0)) .cse1) (+ .cse2 (- 3)) .cse2)) 0)) (< 127 v_~y~0_10) (< 3 v_~y~0_10)))) (and .cse0 (let ((.cse4 (< v_~x~0_10 0))) (or (< 127 v_~x~0_10) (not (= (let ((.cse3 (mod v_~x~0_10 3))) (ite (and (not (= .cse3 0)) .cse4) (+ .cse3 (- 3)) .cse3)) 0)) (and (not (= v_~x~0_10 3)) (not (= v_~x~0_10 0))) (< 3 v_~x~0_10) .cse4))))) InVars {~w~0=v_~w~0_9, #ghost~multithreaded=|v_#ghost~multithreaded_9|, ~y~0=v_~y~0_10, ~x~0=v_~x~0_10} OutVars{~w~0=v_~w~0_9, #ghost~multithreaded=|v_#ghost~multithreaded_9|, ~y~0=v_~y~0_10, ~x~0=v_~x~0_10} AuxVars[] AssignedVars[][74], [113#(= ~r~0 0), 59#L732true, Black: 100#(and (= ~y~0 0) (= 3 ~x~0) (= ~w~0 0)), 29#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 88#true, 102#true, 53#L740true, 43#L721true, readerThread1of1ForFork1InUse, Black: 108#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~y~0 0) (= ~w~0 0)), Black: 105#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 0)), 65#L721true, Black: 81#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), Black: 86#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), Black: 90#(= ~y~0 0), Black: 91#(and (= ~w~0 1) (= ~y~0 0)), Black: 92#(and (= ~w~0 1) (= ~y~0 0) (= 3 ~x~0))]) [2024-05-12 12:38:04,074 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is not cut-off event [2024-05-12 12:38:04,074 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is not cut-off event [2024-05-12 12:38:04,074 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is not cut-off event [2024-05-12 12:38:04,074 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is not cut-off event [2024-05-12 12:38:04,084 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([269] L717-->L717-1: Formula: (and (= v_~w~0_74 1) (not (= (ite (and (= v_~r~0_55 0) (= v_~w~0_75 0)) 1 0) 0))) InVars {~w~0=v_~w~0_75, ~r~0=v_~r~0_55} OutVars{~w~0=v_~w~0_74, writerThread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_writerThread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~r~0=v_~r~0_55, writerThread1of1ForFork3_assume_abort_if_not_~cond#1=|v_writerThread1of1ForFork3_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[~w~0, writerThread1of1ForFork3_assume_abort_if_not_~cond#1, writerThread1of1ForFork3_assume_abort_if_not_#in~cond#1][99], [113#(= ~r~0 0), Black: 100#(and (= ~y~0 0) (= 3 ~x~0) (= ~w~0 0)), 29#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 88#true, 102#true, 53#L740true, 43#L721true, Black: 108#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~y~0 0) (= ~w~0 0)), readerThread1of1ForFork1InUse, Black: 105#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 0)), 4#L717-1true, Black: 81#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), Black: 86#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), 21#L740true, Black: 90#(= ~y~0 0), Black: 91#(and (= ~w~0 1) (= ~y~0 0)), Black: 92#(and (= ~w~0 1) (= ~y~0 0) (= 3 ~x~0))]) [2024-05-12 12:38:04,084 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-05-12 12:38:04,085 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-05-12 12:38:04,085 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-05-12 12:38:04,085 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-05-12 12:38:04,119 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([274] L717-->L717-1: Formula: (and (= v_~w~0_74 1) (not (= (ite (and (= v_~r~0_55 0) (= v_~w~0_75 0)) 1 0) 0))) InVars {~w~0=v_~w~0_75, ~r~0=v_~r~0_55} OutVars{~w~0=v_~w~0_74, writerThread1of1ForFork2_assume_abort_if_not_~cond#1=|v_writerThread1of1ForFork2_assume_abort_if_not_~cond#1_1|, writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~r~0=v_~r~0_55} AuxVars[] AssignedVars[~w~0, writerThread1of1ForFork2_assume_abort_if_not_~cond#1, writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1][102], [113#(= ~r~0 0), Black: 100#(and (= ~y~0 0) (= 3 ~x~0) (= ~w~0 0)), 29#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 88#true, 102#true, 53#L740true, Black: 108#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~y~0 0) (= ~w~0 0)), readerThread1of1ForFork1InUse, Black: 105#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 0)), 65#L721true, Black: 81#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), Black: 86#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), 21#L740true, Black: 90#(= ~y~0 0), Black: 91#(and (= ~w~0 1) (= ~y~0 0)), 23#L717-1true, Black: 92#(and (= ~w~0 1) (= ~y~0 0) (= 3 ~x~0))]) [2024-05-12 12:38:04,119 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-05-12 12:38:04,119 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-05-12 12:38:04,119 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-05-12 12:38:04,119 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-05-12 12:38:04,136 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([202] L749-->ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT: Formula: (let ((.cse0 (not (= |v_#ghost~multithreaded_9| 0)))) (or (and .cse0 (or (< v_~w~0_9 0) (< 1 v_~w~0_9) (and (not (= v_~w~0_9 0)) (not (= v_~w~0_9 1))))) (and .cse0 (let ((.cse1 (< v_~y~0_10 0))) (or .cse1 (and (not (= v_~y~0_10 3)) (not (= v_~y~0_10 0))) (not (= (let ((.cse2 (mod v_~y~0_10 3))) (ite (and (not (= .cse2 0)) .cse1) (+ .cse2 (- 3)) .cse2)) 0)) (< 127 v_~y~0_10) (< 3 v_~y~0_10)))) (and .cse0 (let ((.cse4 (< v_~x~0_10 0))) (or (< 127 v_~x~0_10) (not (= (let ((.cse3 (mod v_~x~0_10 3))) (ite (and (not (= .cse3 0)) .cse4) (+ .cse3 (- 3)) .cse3)) 0)) (and (not (= v_~x~0_10 3)) (not (= v_~x~0_10 0))) (< 3 v_~x~0_10) .cse4))))) InVars {~w~0=v_~w~0_9, #ghost~multithreaded=|v_#ghost~multithreaded_9|, ~y~0=v_~y~0_10, ~x~0=v_~x~0_10} OutVars{~w~0=v_~w~0_9, #ghost~multithreaded=|v_#ghost~multithreaded_9|, ~y~0=v_~y~0_10, ~x~0=v_~x~0_10} AuxVars[] AssignedVars[][74], [113#(= ~r~0 0), 59#L732true, Black: 100#(and (= ~y~0 0) (= 3 ~x~0) (= ~w~0 0)), 29#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 88#true, 102#true, 43#L721true, Black: 108#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~y~0 0) (= ~w~0 0)), readerThread1of1ForFork1InUse, Black: 105#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 0)), 65#L721true, Black: 81#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), Black: 86#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), 28#readerEXITtrue, Black: 90#(= ~y~0 0), Black: 91#(and (= ~w~0 1) (= ~y~0 0)), Black: 92#(and (= ~w~0 1) (= ~y~0 0) (= 3 ~x~0))]) [2024-05-12 12:38:04,136 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is not cut-off event [2024-05-12 12:38:04,136 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is not cut-off event [2024-05-12 12:38:04,136 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is not cut-off event [2024-05-12 12:38:04,137 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is not cut-off event [2024-05-12 12:38:04,137 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([269] L717-->L717-1: Formula: (and (= v_~w~0_74 1) (not (= (ite (and (= v_~r~0_55 0) (= v_~w~0_75 0)) 1 0) 0))) InVars {~w~0=v_~w~0_75, ~r~0=v_~r~0_55} OutVars{~w~0=v_~w~0_74, writerThread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_writerThread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~r~0=v_~r~0_55, writerThread1of1ForFork3_assume_abort_if_not_~cond#1=|v_writerThread1of1ForFork3_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[~w~0, writerThread1of1ForFork3_assume_abort_if_not_~cond#1, writerThread1of1ForFork3_assume_abort_if_not_#in~cond#1][99], [113#(= ~r~0 0), Black: 100#(and (= ~y~0 0) (= 3 ~x~0) (= ~w~0 0)), 29#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 88#true, 102#true, 53#L740true, 43#L721true, Black: 108#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~y~0 0) (= ~w~0 0)), readerThread1of1ForFork1InUse, Black: 105#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 0)), 4#L717-1true, Black: 81#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), Black: 86#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), 21#L740true, Black: 90#(= ~y~0 0), Black: 91#(and (= ~w~0 1) (= ~y~0 0)), Black: 92#(and (= ~w~0 1) (= ~y~0 0) (= 3 ~x~0))]) [2024-05-12 12:38:04,137 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-05-12 12:38:04,138 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-05-12 12:38:04,138 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-05-12 12:38:04,138 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-05-12 12:38:04,138 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-05-12 12:38:04,146 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([269] L717-->L717-1: Formula: (and (= v_~w~0_74 1) (not (= (ite (and (= v_~r~0_55 0) (= v_~w~0_75 0)) 1 0) 0))) InVars {~w~0=v_~w~0_75, ~r~0=v_~r~0_55} OutVars{~w~0=v_~w~0_74, writerThread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_writerThread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~r~0=v_~r~0_55, writerThread1of1ForFork3_assume_abort_if_not_~cond#1=|v_writerThread1of1ForFork3_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[~w~0, writerThread1of1ForFork3_assume_abort_if_not_~cond#1, writerThread1of1ForFork3_assume_abort_if_not_#in~cond#1][99], [113#(= ~r~0 0), Black: 100#(and (= ~y~0 0) (= 3 ~x~0) (= ~w~0 0)), 29#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 88#true, 102#true, 43#L721true, Black: 108#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~y~0 0) (= ~w~0 0)), readerThread1of1ForFork1InUse, Black: 105#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 0)), 4#L717-1true, Black: 81#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), Black: 86#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), 28#readerEXITtrue, 21#L740true, Black: 90#(= ~y~0 0), Black: 91#(and (= ~w~0 1) (= ~y~0 0)), Black: 92#(and (= ~w~0 1) (= ~y~0 0) (= 3 ~x~0))]) [2024-05-12 12:38:04,147 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-05-12 12:38:04,147 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-05-12 12:38:04,147 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-05-12 12:38:04,147 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-05-12 12:38:04,147 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([269] L717-->L717-1: Formula: (and (= v_~w~0_74 1) (not (= (ite (and (= v_~r~0_55 0) (= v_~w~0_75 0)) 1 0) 0))) InVars {~w~0=v_~w~0_75, ~r~0=v_~r~0_55} OutVars{~w~0=v_~w~0_74, writerThread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_writerThread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~r~0=v_~r~0_55, writerThread1of1ForFork3_assume_abort_if_not_~cond#1=|v_writerThread1of1ForFork3_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[~w~0, writerThread1of1ForFork3_assume_abort_if_not_~cond#1, writerThread1of1ForFork3_assume_abort_if_not_#in~cond#1][99], [113#(= ~r~0 0), Black: 100#(and (= ~y~0 0) (= 3 ~x~0) (= ~w~0 0)), 29#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 88#true, 47#readerEXITtrue, 102#true, 53#L740true, 43#L721true, Black: 108#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~y~0 0) (= ~w~0 0)), readerThread1of1ForFork1InUse, Black: 105#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 0)), 4#L717-1true, Black: 81#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), Black: 86#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), Black: 90#(= ~y~0 0), Black: 91#(and (= ~w~0 1) (= ~y~0 0)), Black: 92#(and (= ~w~0 1) (= ~y~0 0) (= 3 ~x~0))]) [2024-05-12 12:38:04,148 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-05-12 12:38:04,148 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-05-12 12:38:04,148 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-05-12 12:38:04,148 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-05-12 12:38:04,160 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([274] L717-->L717-1: Formula: (and (= v_~w~0_74 1) (not (= (ite (and (= v_~r~0_55 0) (= v_~w~0_75 0)) 1 0) 0))) InVars {~w~0=v_~w~0_75, ~r~0=v_~r~0_55} OutVars{~w~0=v_~w~0_74, writerThread1of1ForFork2_assume_abort_if_not_~cond#1=|v_writerThread1of1ForFork2_assume_abort_if_not_~cond#1_1|, writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~r~0=v_~r~0_55} AuxVars[] AssignedVars[~w~0, writerThread1of1ForFork2_assume_abort_if_not_~cond#1, writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1][102], [113#(= ~r~0 0), Black: 100#(and (= ~y~0 0) (= 3 ~x~0) (= ~w~0 0)), 29#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 88#true, 102#true, 53#L740true, readerThread1of1ForFork1InUse, Black: 108#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~y~0 0) (= ~w~0 0)), Black: 105#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 0)), 65#L721true, Black: 81#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), Black: 86#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), 21#L740true, Black: 90#(= ~y~0 0), Black: 91#(and (= ~w~0 1) (= ~y~0 0)), 23#L717-1true, Black: 92#(and (= ~w~0 1) (= ~y~0 0) (= 3 ~x~0))]) [2024-05-12 12:38:04,160 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-05-12 12:38:04,160 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-05-12 12:38:04,161 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-05-12 12:38:04,161 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-05-12 12:38:04,161 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-05-12 12:38:04,179 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([274] L717-->L717-1: Formula: (and (= v_~w~0_74 1) (not (= (ite (and (= v_~r~0_55 0) (= v_~w~0_75 0)) 1 0) 0))) InVars {~w~0=v_~w~0_75, ~r~0=v_~r~0_55} OutVars{~w~0=v_~w~0_74, writerThread1of1ForFork2_assume_abort_if_not_~cond#1=|v_writerThread1of1ForFork2_assume_abort_if_not_~cond#1_1|, writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~r~0=v_~r~0_55} AuxVars[] AssignedVars[~w~0, writerThread1of1ForFork2_assume_abort_if_not_~cond#1, writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1][102], [113#(= ~r~0 0), Black: 100#(and (= ~y~0 0) (= 3 ~x~0) (= ~w~0 0)), 29#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 88#true, 102#true, Black: 108#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~y~0 0) (= ~w~0 0)), readerThread1of1ForFork1InUse, Black: 105#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 0)), 65#L721true, Black: 81#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), Black: 86#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), 28#readerEXITtrue, 21#L740true, Black: 90#(= ~y~0 0), Black: 91#(and (= ~w~0 1) (= ~y~0 0)), 23#L717-1true, Black: 92#(and (= ~w~0 1) (= ~y~0 0) (= 3 ~x~0))]) [2024-05-12 12:38:04,179 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-05-12 12:38:04,179 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-05-12 12:38:04,179 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-05-12 12:38:04,179 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-05-12 12:38:04,180 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([274] L717-->L717-1: Formula: (and (= v_~w~0_74 1) (not (= (ite (and (= v_~r~0_55 0) (= v_~w~0_75 0)) 1 0) 0))) InVars {~w~0=v_~w~0_75, ~r~0=v_~r~0_55} OutVars{~w~0=v_~w~0_74, writerThread1of1ForFork2_assume_abort_if_not_~cond#1=|v_writerThread1of1ForFork2_assume_abort_if_not_~cond#1_1|, writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~r~0=v_~r~0_55} AuxVars[] AssignedVars[~w~0, writerThread1of1ForFork2_assume_abort_if_not_~cond#1, writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1][102], [113#(= ~r~0 0), Black: 100#(and (= ~y~0 0) (= 3 ~x~0) (= ~w~0 0)), 29#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 88#true, 47#readerEXITtrue, 102#true, 53#L740true, Black: 108#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~y~0 0) (= ~w~0 0)), readerThread1of1ForFork1InUse, Black: 105#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 0)), 65#L721true, Black: 81#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), Black: 86#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), Black: 90#(= ~y~0 0), Black: 91#(and (= ~w~0 1) (= ~y~0 0)), 23#L717-1true, Black: 92#(and (= ~w~0 1) (= ~y~0 0) (= 3 ~x~0))]) [2024-05-12 12:38:04,180 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-05-12 12:38:04,180 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-05-12 12:38:04,180 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-05-12 12:38:04,180 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-05-12 12:38:04,204 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([269] L717-->L717-1: Formula: (and (= v_~w~0_74 1) (not (= (ite (and (= v_~r~0_55 0) (= v_~w~0_75 0)) 1 0) 0))) InVars {~w~0=v_~w~0_75, ~r~0=v_~r~0_55} OutVars{~w~0=v_~w~0_74, writerThread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_writerThread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~r~0=v_~r~0_55, writerThread1of1ForFork3_assume_abort_if_not_~cond#1=|v_writerThread1of1ForFork3_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[~w~0, writerThread1of1ForFork3_assume_abort_if_not_~cond#1, writerThread1of1ForFork3_assume_abort_if_not_#in~cond#1][99], [113#(= ~r~0 0), Black: 100#(and (= ~y~0 0) (= 3 ~x~0) (= ~w~0 0)), 29#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 88#true, 102#true, 43#L721true, Black: 108#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~y~0 0) (= ~w~0 0)), readerThread1of1ForFork1InUse, Black: 105#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 0)), 4#L717-1true, Black: 81#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), Black: 86#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), 28#readerEXITtrue, 21#L740true, Black: 90#(= ~y~0 0), Black: 91#(and (= ~w~0 1) (= ~y~0 0)), Black: 92#(and (= ~w~0 1) (= ~y~0 0) (= 3 ~x~0))]) [2024-05-12 12:38:04,204 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-05-12 12:38:04,204 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-05-12 12:38:04,204 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-05-12 12:38:04,204 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-05-12 12:38:04,205 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-05-12 12:38:04,206 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([269] L717-->L717-1: Formula: (and (= v_~w~0_74 1) (not (= (ite (and (= v_~r~0_55 0) (= v_~w~0_75 0)) 1 0) 0))) InVars {~w~0=v_~w~0_75, ~r~0=v_~r~0_55} OutVars{~w~0=v_~w~0_74, writerThread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_writerThread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~r~0=v_~r~0_55, writerThread1of1ForFork3_assume_abort_if_not_~cond#1=|v_writerThread1of1ForFork3_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[~w~0, writerThread1of1ForFork3_assume_abort_if_not_~cond#1, writerThread1of1ForFork3_assume_abort_if_not_#in~cond#1][99], [113#(= ~r~0 0), Black: 100#(and (= ~y~0 0) (= 3 ~x~0) (= ~w~0 0)), 29#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 88#true, 47#readerEXITtrue, 102#true, 53#L740true, 43#L721true, Black: 108#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~y~0 0) (= ~w~0 0)), readerThread1of1ForFork1InUse, Black: 105#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 0)), 4#L717-1true, Black: 81#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), Black: 86#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), Black: 90#(= ~y~0 0), Black: 91#(and (= ~w~0 1) (= ~y~0 0)), Black: 92#(and (= ~w~0 1) (= ~y~0 0) (= 3 ~x~0))]) [2024-05-12 12:38:04,206 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-05-12 12:38:04,206 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-05-12 12:38:04,207 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-05-12 12:38:04,207 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-05-12 12:38:04,207 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-05-12 12:38:04,211 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([269] L717-->L717-1: Formula: (and (= v_~w~0_74 1) (not (= (ite (and (= v_~r~0_55 0) (= v_~w~0_75 0)) 1 0) 0))) InVars {~w~0=v_~w~0_75, ~r~0=v_~r~0_55} OutVars{~w~0=v_~w~0_74, writerThread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_writerThread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~r~0=v_~r~0_55, writerThread1of1ForFork3_assume_abort_if_not_~cond#1=|v_writerThread1of1ForFork3_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[~w~0, writerThread1of1ForFork3_assume_abort_if_not_~cond#1, writerThread1of1ForFork3_assume_abort_if_not_#in~cond#1][99], [113#(= ~r~0 0), Black: 100#(and (= ~y~0 0) (= 3 ~x~0) (= ~w~0 0)), 29#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 88#true, 102#true, 47#readerEXITtrue, 43#L721true, Black: 108#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~y~0 0) (= ~w~0 0)), readerThread1of1ForFork1InUse, Black: 105#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 0)), 4#L717-1true, Black: 81#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), Black: 86#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), 28#readerEXITtrue, Black: 90#(= ~y~0 0), Black: 91#(and (= ~w~0 1) (= ~y~0 0)), Black: 92#(and (= ~w~0 1) (= ~y~0 0) (= 3 ~x~0))]) [2024-05-12 12:38:04,211 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2024-05-12 12:38:04,211 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-05-12 12:38:04,211 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-05-12 12:38:04,211 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-05-12 12:38:04,220 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([274] L717-->L717-1: Formula: (and (= v_~w~0_74 1) (not (= (ite (and (= v_~r~0_55 0) (= v_~w~0_75 0)) 1 0) 0))) InVars {~w~0=v_~w~0_75, ~r~0=v_~r~0_55} OutVars{~w~0=v_~w~0_74, writerThread1of1ForFork2_assume_abort_if_not_~cond#1=|v_writerThread1of1ForFork2_assume_abort_if_not_~cond#1_1|, writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~r~0=v_~r~0_55} AuxVars[] AssignedVars[~w~0, writerThread1of1ForFork2_assume_abort_if_not_~cond#1, writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1][102], [113#(= ~r~0 0), Black: 100#(and (= ~y~0 0) (= 3 ~x~0) (= ~w~0 0)), 29#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 88#true, 102#true, readerThread1of1ForFork1InUse, Black: 108#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~y~0 0) (= ~w~0 0)), Black: 105#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 0)), 65#L721true, Black: 81#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), Black: 86#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), 28#readerEXITtrue, 21#L740true, Black: 90#(= ~y~0 0), Black: 91#(and (= ~w~0 1) (= ~y~0 0)), 23#L717-1true, Black: 92#(and (= ~w~0 1) (= ~y~0 0) (= 3 ~x~0))]) [2024-05-12 12:38:04,221 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-05-12 12:38:04,221 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-05-12 12:38:04,221 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-05-12 12:38:04,221 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-05-12 12:38:04,221 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-05-12 12:38:04,223 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([274] L717-->L717-1: Formula: (and (= v_~w~0_74 1) (not (= (ite (and (= v_~r~0_55 0) (= v_~w~0_75 0)) 1 0) 0))) InVars {~w~0=v_~w~0_75, ~r~0=v_~r~0_55} OutVars{~w~0=v_~w~0_74, writerThread1of1ForFork2_assume_abort_if_not_~cond#1=|v_writerThread1of1ForFork2_assume_abort_if_not_~cond#1_1|, writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~r~0=v_~r~0_55} AuxVars[] AssignedVars[~w~0, writerThread1of1ForFork2_assume_abort_if_not_~cond#1, writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1][102], [113#(= ~r~0 0), Black: 100#(and (= ~y~0 0) (= 3 ~x~0) (= ~w~0 0)), 29#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 88#true, 102#true, 47#readerEXITtrue, 53#L740true, readerThread1of1ForFork1InUse, Black: 108#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~y~0 0) (= ~w~0 0)), Black: 105#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 0)), 65#L721true, Black: 81#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), Black: 86#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), Black: 90#(= ~y~0 0), Black: 91#(and (= ~w~0 1) (= ~y~0 0)), 23#L717-1true, Black: 92#(and (= ~w~0 1) (= ~y~0 0) (= 3 ~x~0))]) [2024-05-12 12:38:04,224 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-05-12 12:38:04,224 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-05-12 12:38:04,224 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-05-12 12:38:04,224 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-05-12 12:38:04,224 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-05-12 12:38:04,234 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([274] L717-->L717-1: Formula: (and (= v_~w~0_74 1) (not (= (ite (and (= v_~r~0_55 0) (= v_~w~0_75 0)) 1 0) 0))) InVars {~w~0=v_~w~0_75, ~r~0=v_~r~0_55} OutVars{~w~0=v_~w~0_74, writerThread1of1ForFork2_assume_abort_if_not_~cond#1=|v_writerThread1of1ForFork2_assume_abort_if_not_~cond#1_1|, writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~r~0=v_~r~0_55} AuxVars[] AssignedVars[~w~0, writerThread1of1ForFork2_assume_abort_if_not_~cond#1, writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1][102], [113#(= ~r~0 0), Black: 100#(and (= ~y~0 0) (= 3 ~x~0) (= ~w~0 0)), 29#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 88#true, 102#true, 47#readerEXITtrue, Black: 108#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~y~0 0) (= ~w~0 0)), readerThread1of1ForFork1InUse, Black: 105#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 0)), 65#L721true, Black: 81#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), Black: 86#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), 28#readerEXITtrue, Black: 90#(= ~y~0 0), Black: 91#(and (= ~w~0 1) (= ~y~0 0)), 23#L717-1true, Black: 92#(and (= ~w~0 1) (= ~y~0 0) (= 3 ~x~0))]) [2024-05-12 12:38:04,234 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2024-05-12 12:38:04,234 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-05-12 12:38:04,234 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-05-12 12:38:04,234 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-05-12 12:38:04,251 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([269] L717-->L717-1: Formula: (and (= v_~w~0_74 1) (not (= (ite (and (= v_~r~0_55 0) (= v_~w~0_75 0)) 1 0) 0))) InVars {~w~0=v_~w~0_75, ~r~0=v_~r~0_55} OutVars{~w~0=v_~w~0_74, writerThread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_writerThread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~r~0=v_~r~0_55, writerThread1of1ForFork3_assume_abort_if_not_~cond#1=|v_writerThread1of1ForFork3_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[~w~0, writerThread1of1ForFork3_assume_abort_if_not_~cond#1, writerThread1of1ForFork3_assume_abort_if_not_#in~cond#1][99], [113#(= ~r~0 0), Black: 100#(and (= ~y~0 0) (= 3 ~x~0) (= ~w~0 0)), 29#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 88#true, 102#true, 47#readerEXITtrue, 43#L721true, Black: 108#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~y~0 0) (= ~w~0 0)), readerThread1of1ForFork1InUse, Black: 105#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 0)), 4#L717-1true, Black: 81#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), Black: 86#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), 28#readerEXITtrue, Black: 90#(= ~y~0 0), Black: 91#(and (= ~w~0 1) (= ~y~0 0)), Black: 92#(and (= ~w~0 1) (= ~y~0 0) (= 3 ~x~0))]) [2024-05-12 12:38:04,251 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2024-05-12 12:38:04,251 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-05-12 12:38:04,251 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-05-12 12:38:04,252 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-05-12 12:38:04,252 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-05-12 12:38:04,262 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([274] L717-->L717-1: Formula: (and (= v_~w~0_74 1) (not (= (ite (and (= v_~r~0_55 0) (= v_~w~0_75 0)) 1 0) 0))) InVars {~w~0=v_~w~0_75, ~r~0=v_~r~0_55} OutVars{~w~0=v_~w~0_74, writerThread1of1ForFork2_assume_abort_if_not_~cond#1=|v_writerThread1of1ForFork2_assume_abort_if_not_~cond#1_1|, writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~r~0=v_~r~0_55} AuxVars[] AssignedVars[~w~0, writerThread1of1ForFork2_assume_abort_if_not_~cond#1, writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1][102], [113#(= ~r~0 0), Black: 100#(and (= ~y~0 0) (= 3 ~x~0) (= ~w~0 0)), 29#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 88#true, 102#true, 47#readerEXITtrue, readerThread1of1ForFork1InUse, Black: 108#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~y~0 0) (= ~w~0 0)), Black: 105#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 0)), 65#L721true, Black: 81#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), Black: 86#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), 28#readerEXITtrue, Black: 90#(= ~y~0 0), Black: 91#(and (= ~w~0 1) (= ~y~0 0)), 23#L717-1true, Black: 92#(and (= ~w~0 1) (= ~y~0 0) (= 3 ~x~0))]) [2024-05-12 12:38:04,262 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2024-05-12 12:38:04,262 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-05-12 12:38:04,262 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-05-12 12:38:04,262 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-05-12 12:38:04,262 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-05-12 12:38:04,328 INFO L124 PetriNetUnfolderBase]: 8997/17393 cut-off events. [2024-05-12 12:38:04,328 INFO L125 PetriNetUnfolderBase]: For 49059/50864 co-relation queries the response was YES. [2024-05-12 12:38:04,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52163 conditions, 17393 events. 8997/17393 cut-off events. For 49059/50864 co-relation queries the response was YES. Maximal size of possible extension queue 955. Compared 159725 event pairs, 3304 based on Foata normal form. 727/16365 useless extension candidates. Maximal degree in co-relation 43151. Up to 5617 conditions per place. [2024-05-12 12:38:04,440 INFO L140 encePairwiseOnDemand]: 58/65 looper letters, 78 selfloop transitions, 15 changer transitions 0/131 dead transitions. [2024-05-12 12:38:04,441 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 131 transitions, 802 flow [2024-05-12 12:38:04,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-12 12:38:04,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-05-12 12:38:04,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 197 transitions. [2024-05-12 12:38:04,442 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7576923076923077 [2024-05-12 12:38:04,442 INFO L175 Difference]: Start difference. First operand has 82 places, 89 transitions, 530 flow. Second operand 4 states and 197 transitions. [2024-05-12 12:38:04,442 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 131 transitions, 802 flow [2024-05-12 12:38:04,514 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 131 transitions, 786 flow, removed 5 selfloop flow, removed 1 redundant places. [2024-05-12 12:38:04,519 INFO L231 Difference]: Finished difference. Result has 87 places, 89 transitions, 576 flow [2024-05-12 12:38:04,520 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=444, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=576, PETRI_PLACES=87, PETRI_TRANSITIONS=89} [2024-05-12 12:38:04,523 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, 17 predicate places. [2024-05-12 12:38:04,523 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 89 transitions, 576 flow [2024-05-12 12:38:04,523 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.75) internal successors, (123), 4 states have internal predecessors, (123), 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-05-12 12:38:04,523 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:38:04,523 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:38:04,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-05-12 12:38:04,524 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting readerErr0ASSERT_VIOLATIONERROR_FUNCTION === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-05-12 12:38:04,524 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:38:04,524 INFO L85 PathProgramCache]: Analyzing trace with hash 1389466421, now seen corresponding path program 1 times [2024-05-12 12:38:04,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:38:04,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552256991] [2024-05-12 12:38:04,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:38:04,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:38:04,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:38:04,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:38:04,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:38:04,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552256991] [2024-05-12 12:38:04,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552256991] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:38:04,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:38:04,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 12:38:04,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050736214] [2024-05-12 12:38:04,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:38:04,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 12:38:04,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:38:04,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 12:38:04,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-05-12 12:38:04,662 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 65 [2024-05-12 12:38:04,662 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 89 transitions, 576 flow. Second operand has 6 states, 6 states have (on average 21.333333333333332) internal successors, (128), 6 states have internal predecessors, (128), 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-05-12 12:38:04,662 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:38:04,663 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 65 [2024-05-12 12:38:04,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:38:08,626 INFO L124 PetriNetUnfolderBase]: 28324/45477 cut-off events. [2024-05-12 12:38:08,626 INFO L125 PetriNetUnfolderBase]: For 124728/126480 co-relation queries the response was YES. [2024-05-12 12:38:08,923 INFO L83 FinitePrefix]: Finished finitePrefix Result has 145256 conditions, 45477 events. 28324/45477 cut-off events. For 124728/126480 co-relation queries the response was YES. Maximal size of possible extension queue 2257. Compared 374556 event pairs, 5691 based on Foata normal form. 35/43329 useless extension candidates. Maximal degree in co-relation 85903. Up to 12444 conditions per place. [2024-05-12 12:38:09,150 INFO L140 encePairwiseOnDemand]: 55/65 looper letters, 262 selfloop transitions, 36 changer transitions 0/314 dead transitions. [2024-05-12 12:38:09,150 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 314 transitions, 2527 flow [2024-05-12 12:38:09,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 12:38:09,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 12:38:09,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 446 transitions. [2024-05-12 12:38:09,153 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6237762237762238 [2024-05-12 12:38:09,153 INFO L175 Difference]: Start difference. First operand has 87 places, 89 transitions, 576 flow. Second operand 11 states and 446 transitions. [2024-05-12 12:38:09,153 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 314 transitions, 2527 flow [2024-05-12 12:38:09,338 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 314 transitions, 2479 flow, removed 24 selfloop flow, removed 0 redundant places. [2024-05-12 12:38:09,342 INFO L231 Difference]: Finished difference. Result has 105 places, 116 transitions, 902 flow [2024-05-12 12:38:09,342 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=568, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=902, PETRI_PLACES=105, PETRI_TRANSITIONS=116} [2024-05-12 12:38:09,343 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, 35 predicate places. [2024-05-12 12:38:09,343 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 116 transitions, 902 flow [2024-05-12 12:38:09,343 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.333333333333332) internal successors, (128), 6 states have internal predecessors, (128), 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-05-12 12:38:09,343 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:38:09,343 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:38:09,344 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-05-12 12:38:09,344 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-05-12 12:38:09,344 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:38:09,344 INFO L85 PathProgramCache]: Analyzing trace with hash 1552077851, now seen corresponding path program 1 times [2024-05-12 12:38:09,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:38:09,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2935388] [2024-05-12 12:38:09,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:38:09,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:38:09,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:38:09,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:38:09,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:38:09,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2935388] [2024-05-12 12:38:09,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2935388] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:38:09,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:38:09,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 12:38:09,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9178135] [2024-05-12 12:38:09,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:38:09,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 12:38:09,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:38:09,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 12:38:09,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-05-12 12:38:09,691 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 65 [2024-05-12 12:38:09,692 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 116 transitions, 902 flow. Second operand has 6 states, 6 states have (on average 19.666666666666668) internal successors, (118), 6 states have internal predecessors, (118), 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-05-12 12:38:09,692 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:38:09,692 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 65 [2024-05-12 12:38:09,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:38:14,750 INFO L124 PetriNetUnfolderBase]: 34556/55221 cut-off events. [2024-05-12 12:38:14,751 INFO L125 PetriNetUnfolderBase]: For 177921/178374 co-relation queries the response was YES. [2024-05-12 12:38:14,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 196026 conditions, 55221 events. 34556/55221 cut-off events. For 177921/178374 co-relation queries the response was YES. Maximal size of possible extension queue 2511. Compared 459266 event pairs, 4358 based on Foata normal form. 482/54414 useless extension candidates. Maximal degree in co-relation 175510. Up to 20327 conditions per place. [2024-05-12 12:38:15,181 INFO L140 encePairwiseOnDemand]: 51/65 looper letters, 231 selfloop transitions, 45 changer transitions 0/294 dead transitions. [2024-05-12 12:38:15,181 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 294 transitions, 2664 flow [2024-05-12 12:38:15,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 12:38:15,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 12:38:15,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 274 transitions. [2024-05-12 12:38:15,185 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7025641025641025 [2024-05-12 12:38:15,185 INFO L175 Difference]: Start difference. First operand has 105 places, 116 transitions, 902 flow. Second operand 6 states and 274 transitions. [2024-05-12 12:38:15,185 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 294 transitions, 2664 flow [2024-05-12 12:38:16,541 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 294 transitions, 2613 flow, removed 23 selfloop flow, removed 1 redundant places. [2024-05-12 12:38:16,544 INFO L231 Difference]: Finished difference. Result has 114 places, 156 transitions, 1585 flow [2024-05-12 12:38:16,545 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=875, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1585, PETRI_PLACES=114, PETRI_TRANSITIONS=156} [2024-05-12 12:38:16,545 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, 44 predicate places. [2024-05-12 12:38:16,545 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 156 transitions, 1585 flow [2024-05-12 12:38:16,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.666666666666668) internal successors, (118), 6 states have internal predecessors, (118), 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-05-12 12:38:16,546 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:38:16,546 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:38:16,546 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-05-12 12:38:16,546 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-05-12 12:38:16,547 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:38:16,547 INFO L85 PathProgramCache]: Analyzing trace with hash 1540464942, now seen corresponding path program 1 times [2024-05-12 12:38:16,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:38:16,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538673541] [2024-05-12 12:38:16,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:38:16,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:38:16,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:38:16,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:38:16,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:38:16,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538673541] [2024-05-12 12:38:16,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538673541] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:38:16,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:38:16,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-05-12 12:38:16,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002518519] [2024-05-12 12:38:16,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:38:16,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-05-12 12:38:16,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:38:16,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-12 12:38:16,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-05-12 12:38:16,777 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 65 [2024-05-12 12:38:16,778 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 156 transitions, 1585 flow. Second operand has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 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-05-12 12:38:16,778 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:38:16,778 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 65 [2024-05-12 12:38:16,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:38:22,332 INFO L124 PetriNetUnfolderBase]: 32868/55024 cut-off events. [2024-05-12 12:38:22,333 INFO L125 PetriNetUnfolderBase]: For 245758/246974 co-relation queries the response was YES. [2024-05-12 12:38:22,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 213211 conditions, 55024 events. 32868/55024 cut-off events. For 245758/246974 co-relation queries the response was YES. Maximal size of possible extension queue 2681. Compared 486726 event pairs, 11978 based on Foata normal form. 584/54115 useless extension candidates. Maximal degree in co-relation 191220. Up to 43881 conditions per place. [2024-05-12 12:38:22,769 INFO L140 encePairwiseOnDemand]: 54/65 looper letters, 170 selfloop transitions, 12 changer transitions 0/204 dead transitions. [2024-05-12 12:38:22,769 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 204 transitions, 2154 flow [2024-05-12 12:38:22,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-12 12:38:22,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-05-12 12:38:22,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 192 transitions. [2024-05-12 12:38:22,770 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5907692307692308 [2024-05-12 12:38:22,770 INFO L175 Difference]: Start difference. First operand has 114 places, 156 transitions, 1585 flow. Second operand 5 states and 192 transitions. [2024-05-12 12:38:22,770 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 204 transitions, 2154 flow [2024-05-12 12:38:24,702 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 204 transitions, 2094 flow, removed 30 selfloop flow, removed 0 redundant places. [2024-05-12 12:38:24,705 INFO L231 Difference]: Finished difference. Result has 119 places, 158 transitions, 1583 flow [2024-05-12 12:38:24,705 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=1525, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1583, PETRI_PLACES=119, PETRI_TRANSITIONS=158} [2024-05-12 12:38:24,706 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, 49 predicate places. [2024-05-12 12:38:24,706 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 158 transitions, 1583 flow [2024-05-12 12:38:24,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 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-05-12 12:38:24,706 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:38:24,706 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:38:24,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-05-12 12:38:24,707 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-05-12 12:38:24,707 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:38:24,707 INFO L85 PathProgramCache]: Analyzing trace with hash -1384921130, now seen corresponding path program 1 times [2024-05-12 12:38:24,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:38:24,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547616330] [2024-05-12 12:38:24,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:38:24,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:38:24,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:38:24,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:38:24,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:38:24,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547616330] [2024-05-12 12:38:24,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547616330] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:38:24,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:38:24,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-05-12 12:38:24,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133437747] [2024-05-12 12:38:24,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:38:24,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 12:38:24,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:38:24,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 12:38:24,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-05-12 12:38:24,960 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 65 [2024-05-12 12:38:24,960 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 158 transitions, 1583 flow. Second operand has 6 states, 6 states have (on average 19.5) internal successors, (117), 6 states have internal predecessors, (117), 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-05-12 12:38:24,960 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:38:24,960 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 65 [2024-05-12 12:38:24,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:38:30,659 INFO L124 PetriNetUnfolderBase]: 34155/55791 cut-off events. [2024-05-12 12:38:30,659 INFO L125 PetriNetUnfolderBase]: For 241813/242422 co-relation queries the response was YES. [2024-05-12 12:38:30,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 216421 conditions, 55791 events. 34155/55791 cut-off events. For 241813/242422 co-relation queries the response was YES. Maximal size of possible extension queue 2634. Compared 477196 event pairs, 11982 based on Foata normal form. 222/54654 useless extension candidates. Maximal degree in co-relation 193133. Up to 45031 conditions per place. [2024-05-12 12:38:31,070 INFO L140 encePairwiseOnDemand]: 53/65 looper letters, 191 selfloop transitions, 44 changer transitions 0/253 dead transitions. [2024-05-12 12:38:31,070 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 253 transitions, 2613 flow [2024-05-12 12:38:31,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 12:38:31,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 12:38:31,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 280 transitions. [2024-05-12 12:38:31,072 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5384615384615384 [2024-05-12 12:38:31,073 INFO L175 Difference]: Start difference. First operand has 119 places, 158 transitions, 1583 flow. Second operand 8 states and 280 transitions. [2024-05-12 12:38:31,073 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 253 transitions, 2613 flow [2024-05-12 12:38:32,671 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 253 transitions, 2593 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-05-12 12:38:32,674 INFO L231 Difference]: Finished difference. Result has 127 places, 171 transitions, 1927 flow [2024-05-12 12:38:32,674 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=1563, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1927, PETRI_PLACES=127, PETRI_TRANSITIONS=171} [2024-05-12 12:38:32,675 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, 57 predicate places. [2024-05-12 12:38:32,675 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 171 transitions, 1927 flow [2024-05-12 12:38:32,675 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.5) internal successors, (117), 6 states have internal predecessors, (117), 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-05-12 12:38:32,675 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:38:32,675 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:38:32,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-05-12 12:38:32,676 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-05-12 12:38:32,676 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:38:32,676 INFO L85 PathProgramCache]: Analyzing trace with hash 2005635911, now seen corresponding path program 1 times [2024-05-12 12:38:32,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:38:32,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115328956] [2024-05-12 12:38:32,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:38:32,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:38:32,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:38:32,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:38:32,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:38:32,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115328956] [2024-05-12 12:38:32,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115328956] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:38:32,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:38:32,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-05-12 12:38:32,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965618973] [2024-05-12 12:38:32,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:38:32,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 12:38:32,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:38:32,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 12:38:32,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-05-12 12:38:32,986 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 65 [2024-05-12 12:38:32,986 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 171 transitions, 1927 flow. Second operand has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 6 states have internal predecessors, (133), 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-05-12 12:38:32,986 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:38:32,987 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 65 [2024-05-12 12:38:32,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:38:38,342 INFO L124 PetriNetUnfolderBase]: 28971/49243 cut-off events. [2024-05-12 12:38:38,342 INFO L125 PetriNetUnfolderBase]: For 255812/257844 co-relation queries the response was YES. [2024-05-12 12:38:38,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 195939 conditions, 49243 events. 28971/49243 cut-off events. For 255812/257844 co-relation queries the response was YES. Maximal size of possible extension queue 2540. Compared 443916 event pairs, 11147 based on Foata normal form. 700/48308 useless extension candidates. Maximal degree in co-relation 174828. Up to 38810 conditions per place. [2024-05-12 12:38:38,754 INFO L140 encePairwiseOnDemand]: 57/65 looper letters, 173 selfloop transitions, 20 changer transitions 0/223 dead transitions. [2024-05-12 12:38:38,754 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 223 transitions, 2548 flow [2024-05-12 12:38:38,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 12:38:38,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 12:38:38,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 230 transitions. [2024-05-12 12:38:38,755 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5054945054945055 [2024-05-12 12:38:38,755 INFO L175 Difference]: Start difference. First operand has 127 places, 171 transitions, 1927 flow. Second operand 7 states and 230 transitions. [2024-05-12 12:38:38,756 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 223 transitions, 2548 flow [2024-05-12 12:38:40,453 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 223 transitions, 2440 flow, removed 37 selfloop flow, removed 3 redundant places. [2024-05-12 12:38:40,455 INFO L231 Difference]: Finished difference. Result has 131 places, 176 transitions, 1921 flow [2024-05-12 12:38:40,456 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=1819, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1921, PETRI_PLACES=131, PETRI_TRANSITIONS=176} [2024-05-12 12:38:40,456 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, 61 predicate places. [2024-05-12 12:38:40,456 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 176 transitions, 1921 flow [2024-05-12 12:38:40,456 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 6 states have internal predecessors, (133), 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-05-12 12:38:40,456 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:38:40,456 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] [2024-05-12 12:38:40,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-05-12 12:38:40,457 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-05-12 12:38:40,457 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:38:40,457 INFO L85 PathProgramCache]: Analyzing trace with hash 1872002549, now seen corresponding path program 1 times [2024-05-12 12:38:40,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:38:40,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642990485] [2024-05-12 12:38:40,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:38:40,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:38:40,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat