./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-atomic/read_write_lock-2.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --validate ./goblint.2024-05-21_14-57-05.files/protection/read_write_lock-2.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version bcb38a6f 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-2.i ./goblint.2024-05-21_14-57-05.files/protection/read_write_lock-2.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-bcb38a6-m [2024-06-04 14:32:07,285 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-04 14:32:07,343 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-04 14:32:07,349 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-04 14:32:07,349 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-04 14:32:07,379 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-04 14:32:07,379 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-04 14:32:07,380 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-04 14:32:07,380 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-04 14:32:07,383 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-04 14:32:07,384 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-04 14:32:07,384 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-04 14:32:07,385 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-04 14:32:07,385 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-04 14:32:07,386 INFO L153 SettingsManager]: * Use SBE=true [2024-06-04 14:32:07,386 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-04 14:32:07,386 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-04 14:32:07,386 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-04 14:32:07,387 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-04 14:32:07,387 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-04 14:32:07,387 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-04 14:32:07,388 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-04 14:32:07,388 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-04 14:32:07,389 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-04 14:32:07,389 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-04 14:32:07,389 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-04 14:32:07,389 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-04 14:32:07,389 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-04 14:32:07,390 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-04 14:32:07,390 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-04 14:32:07,391 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-04 14:32:07,392 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-04 14:32:07,392 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-04 14:32:07,392 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-04 14:32:07,392 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-04 14:32:07,392 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-04 14:32:07,393 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-04 14:32:07,393 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-04 14:32:07,393 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-04 14:32:07,393 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-04 14:32:07,393 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-04 14:32:07,394 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-04 14:32:07,394 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-04 14:32:07,394 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false [2024-06-04 14:32:07,611 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-04 14:32:07,634 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-04 14:32:07,637 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-04 14:32:07,638 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-04 14:32:07,639 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-04 14:32:07,640 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-05-21_14-57-05.files/protection/read_write_lock-2.yml/witness.yml [2024-06-04 14:32:07,747 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-04 14:32:07,747 INFO L274 PluginConnector]: CDTParser initialized [2024-06-04 14:32:07,749 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-atomic/read_write_lock-2.i [2024-06-04 14:32:08,795 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-04 14:32:09,039 INFO L384 CDTParser]: Found 1 translation units. [2024-06-04 14:32:09,041 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/read_write_lock-2.i [2024-06-04 14:32:09,056 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc2614698/9fcf070531e04f45ac4f6c31e923ca8e/FLAGd5537f1dc [2024-06-04 14:32:09,071 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc2614698/9fcf070531e04f45ac4f6c31e923ca8e [2024-06-04 14:32:09,072 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-04 14:32:09,073 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-04 14:32:09,075 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-04 14:32:09,075 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-04 14:32:09,079 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-04 14:32:09,080 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 04.06 02:32:07" (1/2) ... [2024-06-04 14:32:09,080 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55f716ef and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 02:32:09, skipping insertion in model container [2024-06-04 14:32:09,080 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 04.06 02:32:07" (1/2) ... [2024-06-04 14:32:09,082 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@42a5bfb8 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 02:32:09, skipping insertion in model container [2024-06-04 14:32:09,083 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.06 02:32:09" (2/2) ... [2024-06-04 14:32:09,083 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55f716ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 02:32:09, skipping insertion in model container [2024-06-04 14:32:09,084 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.06 02:32:09" (2/2) ... [2024-06-04 14:32:09,084 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-04 14:32:09,111 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-04 14:32:09,111 INFO L97 edCorrectnessWitness]: Location invariant before [L752-L752] ((! 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-06-04 14:32:09,112 INFO L97 edCorrectnessWitness]: Location invariant before [L753-L753] ((! 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-06-04 14:32:09,112 INFO L97 edCorrectnessWitness]: Location invariant before [L750-L750] ((! 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-06-04 14:32:09,112 INFO L97 edCorrectnessWitness]: Location invariant before [L751-L751] ((! 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-06-04 14:32:09,112 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-04 14:32:09,113 INFO L106 edCorrectnessWitness]: ghost_update [L749-L749] multithreaded = 1; [2024-06-04 14:32:09,152 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-04 14:32:09,425 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-04 14:32:09,432 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-04 14:32:09,520 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-04 14:32:09,557 INFO L206 MainTranslator]: Completed translation [2024-06-04 14:32:09,557 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 02:32:09 WrapperNode [2024-06-04 14:32:09,557 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-04 14:32:09,558 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-04 14:32:09,558 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-04 14:32:09,558 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-04 14:32:09,564 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 02:32:09" (1/1) ... [2024-06-04 14:32:09,580 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 02:32:09" (1/1) ... [2024-06-04 14:32:09,602 INFO L138 Inliner]: procedures = 172, calls = 31, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 103 [2024-06-04 14:32:09,602 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-04 14:32:09,605 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-04 14:32:09,620 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-04 14:32:09,620 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-04 14:32:09,628 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 02:32:09" (1/1) ... [2024-06-04 14:32:09,629 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 02:32:09" (1/1) ... [2024-06-04 14:32:09,631 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 02:32:09" (1/1) ... [2024-06-04 14:32:09,640 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-06-04 14:32:09,640 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 02:32:09" (1/1) ... [2024-06-04 14:32:09,640 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 02:32:09" (1/1) ... [2024-06-04 14:32:09,644 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 02:32:09" (1/1) ... [2024-06-04 14:32:09,645 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 02:32:09" (1/1) ... [2024-06-04 14:32:09,646 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 02:32:09" (1/1) ... [2024-06-04 14:32:09,647 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 02:32:09" (1/1) ... [2024-06-04 14:32:09,649 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-04 14:32:09,650 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-04 14:32:09,650 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-04 14:32:09,650 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-04 14:32:09,651 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 02:32:09" (1/1) ... [2024-06-04 14:32:09,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-04 14:32:09,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-04 14:32:09,699 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-06-04 14:32:09,727 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-06-04 14:32:09,758 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-04 14:32:09,759 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-04 14:32:09,759 INFO L130 BoogieDeclarations]: Found specification of procedure reader [2024-06-04 14:32:09,759 INFO L138 BoogieDeclarations]: Found implementation of procedure reader [2024-06-04 14:32:09,759 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-04 14:32:09,759 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-04 14:32:09,759 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-04 14:32:09,759 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-04 14:32:09,759 INFO L130 BoogieDeclarations]: Found specification of procedure writer [2024-06-04 14:32:09,760 INFO L138 BoogieDeclarations]: Found implementation of procedure writer [2024-06-04 14:32:09,761 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-04 14:32:09,847 INFO L244 CfgBuilder]: Building ICFG [2024-06-04 14:32:09,848 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-04 14:32:10,022 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-04 14:32:10,023 INFO L293 CfgBuilder]: Performing block encoding [2024-06-04 14:32:10,142 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-04 14:32:10,142 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-04 14:32:10,142 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.06 02:32:10 BoogieIcfgContainer [2024-06-04 14:32:10,143 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-04 14:32:10,144 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-04 14:32:10,144 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-04 14:32:10,146 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-04 14:32:10,147 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 04.06 02:32:07" (1/4) ... [2024-06-04 14:32:10,147 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f67b93d and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 04.06 02:32:10, skipping insertion in model container [2024-06-04 14:32:10,147 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.06 02:32:09" (2/4) ... [2024-06-04 14:32:10,148 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f67b93d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.06 02:32:10, skipping insertion in model container [2024-06-04 14:32:10,148 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 02:32:09" (3/4) ... [2024-06-04 14:32:10,148 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f67b93d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.06 02:32:10, skipping insertion in model container [2024-06-04 14:32:10,148 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.06 02:32:10" (4/4) ... [2024-06-04 14:32:10,149 INFO L112 eAbstractionObserver]: Analyzing ICFG read_write_lock-2.i [2024-06-04 14:32:10,161 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-04 14:32:10,162 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-06-04 14:32:10,162 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-04 14:32:10,225 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-06-04 14:32:10,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 71 places, 58 transitions, 144 flow [2024-06-04 14:32:10,292 INFO L124 PetriNetUnfolderBase]: 0/54 cut-off events. [2024-06-04 14:32:10,292 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-06-04 14:32:10,293 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71 conditions, 54 events. 0/54 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 97 event pairs, 0 based on Foata normal form. 0/50 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2024-06-04 14:32:10,294 INFO L82 GeneralOperation]: Start removeDead. Operand has 71 places, 58 transitions, 144 flow [2024-06-04 14:32:10,298 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 61 places, 48 transitions, 108 flow [2024-06-04 14:32:10,310 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-04 14:32:10,316 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;@504e6453, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-04 14:32:10,316 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-06-04 14:32:10,320 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-04 14:32:10,320 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2024-06-04 14:32:10,320 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-04 14:32:10,320 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 14:32:10,321 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-06-04 14:32:10,321 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-04 14:32:10,324 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 14:32:10,325 INFO L85 PathProgramCache]: Analyzing trace with hash -1341263991, now seen corresponding path program 1 times [2024-06-04 14:32:10,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 14:32:10,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141971274] [2024-06-04 14:32:10,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 14:32:10,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 14:32:10,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 14:32:10,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 14:32:10,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 14:32:10,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141971274] [2024-06-04 14:32:10,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141971274] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 14:32:10,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 14:32:10,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-04 14:32:10,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899349771] [2024-06-04 14:32:10,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 14:32:10,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-04 14:32:10,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 14:32:10,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-04 14:32:10,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-04 14:32:10,859 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 58 [2024-06-04 14:32:10,861 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 48 transitions, 108 flow. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:32:10,861 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 14:32:10,861 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 58 [2024-06-04 14:32:10,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 14:32:11,760 INFO L124 PetriNetUnfolderBase]: 5905/9727 cut-off events. [2024-06-04 14:32:11,760 INFO L125 PetriNetUnfolderBase]: For 117/117 co-relation queries the response was YES. [2024-06-04 14:32:11,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18099 conditions, 9727 events. 5905/9727 cut-off events. For 117/117 co-relation queries the response was YES. Maximal size of possible extension queue 397. Compared 66733 event pairs, 3124 based on Foata normal form. 9/9480 useless extension candidates. Maximal degree in co-relation 18083. Up to 8047 conditions per place. [2024-06-04 14:32:11,886 INFO L140 encePairwiseOnDemand]: 49/58 looper letters, 47 selfloop transitions, 5 changer transitions 0/66 dead transitions. [2024-06-04 14:32:11,886 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 66 transitions, 257 flow [2024-06-04 14:32:11,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-04 14:32:11,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-04 14:32:11,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 113 transitions. [2024-06-04 14:32:11,896 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6494252873563219 [2024-06-04 14:32:11,897 INFO L175 Difference]: Start difference. First operand has 61 places, 48 transitions, 108 flow. Second operand 3 states and 113 transitions. [2024-06-04 14:32:11,898 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 66 transitions, 257 flow [2024-06-04 14:32:11,900 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 66 transitions, 250 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-06-04 14:32:11,905 INFO L231 Difference]: Finished difference. Result has 60 places, 52 transitions, 143 flow [2024-06-04 14:32:11,906 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=143, PETRI_PLACES=60, PETRI_TRANSITIONS=52} [2024-06-04 14:32:11,909 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, -1 predicate places. [2024-06-04 14:32:11,909 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 52 transitions, 143 flow [2024-06-04 14:32:11,909 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:32:11,909 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 14:32:11,910 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 14:32:11,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-04 14:32:11,910 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-04 14:32:11,910 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 14:32:11,910 INFO L85 PathProgramCache]: Analyzing trace with hash -464438168, now seen corresponding path program 1 times [2024-06-04 14:32:11,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 14:32:11,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082922932] [2024-06-04 14:32:11,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 14:32:11,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 14:32:11,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 14:32:12,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 14:32:12,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 14:32:12,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082922932] [2024-06-04 14:32:12,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082922932] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 14:32:12,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 14:32:12,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-04 14:32:12,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227755052] [2024-06-04 14:32:12,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 14:32:12,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-04 14:32:12,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 14:32:12,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-04 14:32:12,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-04 14:32:12,164 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 58 [2024-06-04 14:32:12,164 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 52 transitions, 143 flow. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:32:12,164 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 14:32:12,164 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 58 [2024-06-04 14:32:12,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 14:32:13,128 INFO L124 PetriNetUnfolderBase]: 9222/14466 cut-off events. [2024-06-04 14:32:13,129 INFO L125 PetriNetUnfolderBase]: For 2061/2061 co-relation queries the response was YES. [2024-06-04 14:32:13,153 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30749 conditions, 14466 events. 9222/14466 cut-off events. For 2061/2061 co-relation queries the response was YES. Maximal size of possible extension queue 569. Compared 97480 event pairs, 4632 based on Foata normal form. 115/14415 useless extension candidates. Maximal degree in co-relation 30734. Up to 12366 conditions per place. [2024-06-04 14:32:13,216 INFO L140 encePairwiseOnDemand]: 45/58 looper letters, 61 selfloop transitions, 9 changer transitions 0/82 dead transitions. [2024-06-04 14:32:13,217 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 82 transitions, 359 flow [2024-06-04 14:32:13,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-04 14:32:13,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-04 14:32:13,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 146 transitions. [2024-06-04 14:32:13,222 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6293103448275862 [2024-06-04 14:32:13,222 INFO L175 Difference]: Start difference. First operand has 60 places, 52 transitions, 143 flow. Second operand 4 states and 146 transitions. [2024-06-04 14:32:13,223 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 82 transitions, 359 flow [2024-06-04 14:32:13,224 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 82 transitions, 354 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-04 14:32:13,226 INFO L231 Difference]: Finished difference. Result has 63 places, 56 transitions, 198 flow [2024-06-04 14:32:13,226 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=198, PETRI_PLACES=63, PETRI_TRANSITIONS=56} [2024-06-04 14:32:13,227 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 2 predicate places. [2024-06-04 14:32:13,227 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 56 transitions, 198 flow [2024-06-04 14:32:13,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:32:13,227 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 14:32:13,228 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 14:32:13,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-04 14:32:13,341 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-04 14:32:13,341 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 14:32:13,341 INFO L85 PathProgramCache]: Analyzing trace with hash -1512679122, now seen corresponding path program 1 times [2024-06-04 14:32:13,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 14:32:13,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822462115] [2024-06-04 14:32:13,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 14:32:13,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 14:32:13,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 14:32:13,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 14:32:13,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 14:32:13,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822462115] [2024-06-04 14:32:13,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822462115] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 14:32:13,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 14:32:13,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-04 14:32:13,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161138621] [2024-06-04 14:32:13,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 14:32:13,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-04 14:32:13,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 14:32:13,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-04 14:32:13,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-04 14:32:13,498 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 58 [2024-06-04 14:32:13,498 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 56 transitions, 198 flow. Second operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:32:13,499 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 14:32:13,499 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 58 [2024-06-04 14:32:13,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 14:32:14,415 INFO L124 PetriNetUnfolderBase]: 8409/13384 cut-off events. [2024-06-04 14:32:14,415 INFO L125 PetriNetUnfolderBase]: For 5780/5780 co-relation queries the response was YES. [2024-06-04 14:32:14,434 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33228 conditions, 13384 events. 8409/13384 cut-off events. For 5780/5780 co-relation queries the response was YES. Maximal size of possible extension queue 551. Compared 91055 event pairs, 2749 based on Foata normal form. 339/13440 useless extension candidates. Maximal degree in co-relation 33211. Up to 9313 conditions per place. [2024-06-04 14:32:14,475 INFO L140 encePairwiseOnDemand]: 43/58 looper letters, 81 selfloop transitions, 21 changer transitions 0/114 dead transitions. [2024-06-04 14:32:14,476 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 114 transitions, 594 flow [2024-06-04 14:32:14,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-04 14:32:14,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-04 14:32:14,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 189 transitions. [2024-06-04 14:32:14,478 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6517241379310345 [2024-06-04 14:32:14,478 INFO L175 Difference]: Start difference. First operand has 63 places, 56 transitions, 198 flow. Second operand 5 states and 189 transitions. [2024-06-04 14:32:14,478 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 114 transitions, 594 flow [2024-06-04 14:32:14,482 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 114 transitions, 578 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-06-04 14:32:14,484 INFO L231 Difference]: Finished difference. Result has 68 places, 68 transitions, 351 flow [2024-06-04 14:32:14,484 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=351, PETRI_PLACES=68, PETRI_TRANSITIONS=68} [2024-06-04 14:32:14,485 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 7 predicate places. [2024-06-04 14:32:14,485 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 68 transitions, 351 flow [2024-06-04 14:32:14,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:32:14,485 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 14:32:14,486 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 14:32:14,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-04 14:32:14,486 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-04 14:32:14,486 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 14:32:14,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1869887243, now seen corresponding path program 1 times [2024-06-04 14:32:14,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 14:32:14,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382338774] [2024-06-04 14:32:14,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 14:32:14,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 14:32:14,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 14:32:14,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 14:32:14,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 14:32:14,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382338774] [2024-06-04 14:32:14,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382338774] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 14:32:14,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 14:32:14,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-04 14:32:14,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31078429] [2024-06-04 14:32:14,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 14:32:14,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-04 14:32:14,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 14:32:14,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-04 14:32:14,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-04 14:32:14,622 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 58 [2024-06-04 14:32:14,623 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 68 transitions, 351 flow. Second operand has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:32:14,623 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 14:32:14,623 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 58 [2024-06-04 14:32:14,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 14:32:15,585 INFO L124 PetriNetUnfolderBase]: 8195/12989 cut-off events. [2024-06-04 14:32:15,586 INFO L125 PetriNetUnfolderBase]: For 17024/17030 co-relation queries the response was YES. [2024-06-04 14:32:15,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40361 conditions, 12989 events. 8195/12989 cut-off events. For 17024/17030 co-relation queries the response was YES. Maximal size of possible extension queue 544. Compared 88248 event pairs, 2416 based on Foata normal form. 110/12779 useless extension candidates. Maximal degree in co-relation 40341. Up to 9283 conditions per place. [2024-06-04 14:32:15,806 INFO L140 encePairwiseOnDemand]: 45/58 looper letters, 81 selfloop transitions, 17 changer transitions 0/110 dead transitions. [2024-06-04 14:32:15,806 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 110 transitions, 677 flow [2024-06-04 14:32:15,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-04 14:32:15,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-04 14:32:15,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 183 transitions. [2024-06-04 14:32:15,807 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6310344827586207 [2024-06-04 14:32:15,808 INFO L175 Difference]: Start difference. First operand has 68 places, 68 transitions, 351 flow. Second operand 5 states and 183 transitions. [2024-06-04 14:32:15,808 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 110 transitions, 677 flow [2024-06-04 14:32:15,815 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 110 transitions, 669 flow, removed 4 selfloop flow, removed 0 redundant places. [2024-06-04 14:32:15,816 INFO L231 Difference]: Finished difference. Result has 72 places, 67 transitions, 381 flow [2024-06-04 14:32:15,817 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=335, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=381, PETRI_PLACES=72, PETRI_TRANSITIONS=67} [2024-06-04 14:32:15,818 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 11 predicate places. [2024-06-04 14:32:15,818 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 67 transitions, 381 flow [2024-06-04 14:32:15,818 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:32:15,818 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 14:32:15,819 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 14:32:15,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-04 14:32:15,819 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-04 14:32:15,819 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 14:32:15,819 INFO L85 PathProgramCache]: Analyzing trace with hash 1742681279, now seen corresponding path program 1 times [2024-06-04 14:32:15,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 14:32:15,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821798322] [2024-06-04 14:32:15,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 14:32:15,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 14:32:15,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 14:32:16,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 14:32:16,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 14:32:16,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821798322] [2024-06-04 14:32:16,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821798322] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 14:32:16,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 14:32:16,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-04 14:32:16,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744649526] [2024-06-04 14:32:16,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 14:32:16,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-04 14:32:16,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 14:32:16,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-04 14:32:16,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-06-04 14:32:16,114 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 58 [2024-06-04 14:32:16,114 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 67 transitions, 381 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-06-04 14:32:16,114 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 14:32:16,114 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 58 [2024-06-04 14:32:16,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 14:32:17,324 INFO L124 PetriNetUnfolderBase]: 10109/16328 cut-off events. [2024-06-04 14:32:17,325 INFO L125 PetriNetUnfolderBase]: For 29498/29512 co-relation queries the response was YES. [2024-06-04 14:32:17,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51915 conditions, 16328 events. 10109/16328 cut-off events. For 29498/29512 co-relation queries the response was YES. Maximal size of possible extension queue 635. Compared 115666 event pairs, 3953 based on Foata normal form. 46/15984 useless extension candidates. Maximal degree in co-relation 51892. Up to 12984 conditions per place. [2024-06-04 14:32:17,421 INFO L140 encePairwiseOnDemand]: 48/58 looper letters, 90 selfloop transitions, 22 changer transitions 0/126 dead transitions. [2024-06-04 14:32:17,421 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 126 transitions, 878 flow [2024-06-04 14:32:17,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 14:32:17,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 14:32:17,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 200 transitions. [2024-06-04 14:32:17,423 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5747126436781609 [2024-06-04 14:32:17,423 INFO L175 Difference]: Start difference. First operand has 72 places, 67 transitions, 381 flow. Second operand 6 states and 200 transitions. [2024-06-04 14:32:17,423 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 126 transitions, 878 flow [2024-06-04 14:32:17,440 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 126 transitions, 836 flow, removed 4 selfloop flow, removed 3 redundant places. [2024-06-04 14:32:17,441 INFO L231 Difference]: Finished difference. Result has 77 places, 85 transitions, 573 flow [2024-06-04 14:32:17,442 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=344, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=573, PETRI_PLACES=77, PETRI_TRANSITIONS=85} [2024-06-04 14:32:17,442 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 16 predicate places. [2024-06-04 14:32:17,442 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 85 transitions, 573 flow [2024-06-04 14:32:17,443 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-06-04 14:32:17,443 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 14:32:17,443 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 14:32:17,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-04 14:32:17,443 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-04 14:32:17,444 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 14:32:17,444 INFO L85 PathProgramCache]: Analyzing trace with hash -298585698, now seen corresponding path program 1 times [2024-06-04 14:32:17,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 14:32:17,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442329792] [2024-06-04 14:32:17,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 14:32:17,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 14:32:17,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 14:32:17,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 14:32:17,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 14:32:17,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442329792] [2024-06-04 14:32:17,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442329792] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 14:32:17,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 14:32:17,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-04 14:32:17,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786880767] [2024-06-04 14:32:17,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 14:32:17,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-04 14:32:17,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 14:32:17,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-04 14:32:17,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-04 14:32:17,488 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 58 [2024-06-04 14:32:17,488 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 85 transitions, 573 flow. Second operand has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:32:17,488 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 14:32:17,488 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 58 [2024-06-04 14:32:17,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 14:32:18,299 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([242] L714-->L714-1: Formula: (and (= v_~w~0_72 1) (not (= (ite (and (= v_~w~0_73 0) (= v_~r~0_51 0)) 1 0) 0))) InVars {~w~0=v_~w~0_73, ~r~0=v_~r~0_51} OutVars{~w~0=v_~w~0_72, writerThread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_writerThread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~r~0=v_~r~0_51, 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][94], [Black: 95#(and (= ~y~0 0) (= 3 ~x~0) (= ~w~0 0)), writerThread1of1ForFork3InUse, writerThread1of1ForFork2InUse, 83#true, 59#L744true, readerThread1of1ForFork0InUse, 16#L720true, Black: 101#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), readerThread1of1ForFork1InUse, Black: 103#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~y~0 0) (= ~w~0 0)), Black: 100#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 0)), 109#(= ~r~0 0), 97#true, Black: 76#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), Black: 81#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), 12#L714-1true, Black: 85#(= ~y~0 0), 28#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, Black: 86#(and (= ~w~0 1) (= ~y~0 0)), 11#L744true, Black: 87#(and (= ~w~0 1) (= ~y~0 0) (= 3 ~x~0))]) [2024-06-04 14:32:18,299 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2024-06-04 14:32:18,299 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-06-04 14:32:18,300 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-06-04 14:32:18,300 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-06-04 14:32:18,322 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([247] L714-->L714-1: Formula: (and (= v_~w~0_72 1) (not (= (ite (and (= v_~w~0_73 0) (= v_~r~0_51 0)) 1 0) 0))) InVars {~w~0=v_~w~0_73, ~r~0=v_~r~0_51} OutVars{~w~0=v_~w~0_72, 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_51} AuxVars[] AssignedVars[~w~0, writerThread1of1ForFork2_assume_abort_if_not_~cond#1, writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1][98], [Black: 95#(and (= ~y~0 0) (= 3 ~x~0) (= ~w~0 0)), writerThread1of1ForFork3InUse, writerThread1of1ForFork2InUse, 83#true, 59#L744true, readerThread1of1ForFork0InUse, 29#L714-1true, readerThread1of1ForFork1InUse, Black: 101#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), 6#L720true, Black: 103#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~y~0 0) (= ~w~0 0)), Black: 100#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 0)), 109#(= ~r~0 0), 97#true, Black: 76#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), Black: 81#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), Black: 85#(= ~y~0 0), 28#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, Black: 86#(and (= ~w~0 1) (= ~y~0 0)), 11#L744true, Black: 87#(and (= ~w~0 1) (= ~y~0 0) (= 3 ~x~0))]) [2024-06-04 14:32:18,322 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2024-06-04 14:32:18,325 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-06-04 14:32:18,325 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-06-04 14:32:18,325 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-06-04 14:32:18,436 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([242] L714-->L714-1: Formula: (and (= v_~w~0_72 1) (not (= (ite (and (= v_~w~0_73 0) (= v_~r~0_51 0)) 1 0) 0))) InVars {~w~0=v_~w~0_73, ~r~0=v_~r~0_51} OutVars{~w~0=v_~w~0_72, writerThread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_writerThread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~r~0=v_~r~0_51, 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][94], [Black: 95#(and (= ~y~0 0) (= 3 ~x~0) (= ~w~0 0)), writerThread1of1ForFork3InUse, writerThread1of1ForFork2InUse, 83#true, 59#L744true, readerThread1of1ForFork0InUse, 16#L720true, Black: 101#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), readerThread1of1ForFork1InUse, Black: 103#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~y~0 0) (= ~w~0 0)), Black: 100#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 0)), 109#(= ~r~0 0), 97#true, Black: 76#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), Black: 81#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), 28#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 12#L714-1true, Black: 85#(= ~y~0 0), Black: 86#(and (= ~w~0 1) (= ~y~0 0)), 11#L744true, Black: 87#(and (= ~w~0 1) (= ~y~0 0) (= 3 ~x~0))]) [2024-06-04 14:32:18,437 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2024-06-04 14:32:18,437 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-06-04 14:32:18,437 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-06-04 14:32:18,437 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-06-04 14:32:18,437 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-06-04 14:32:18,445 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([242] L714-->L714-1: Formula: (and (= v_~w~0_72 1) (not (= (ite (and (= v_~w~0_73 0) (= v_~r~0_51 0)) 1 0) 0))) InVars {~w~0=v_~w~0_73, ~r~0=v_~r~0_51} OutVars{~w~0=v_~w~0_72, writerThread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_writerThread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~r~0=v_~r~0_51, 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][94], [Black: 95#(and (= ~y~0 0) (= 3 ~x~0) (= ~w~0 0)), writerThread1of1ForFork3InUse, writerThread1of1ForFork2InUse, 83#true, readerThread1of1ForFork0InUse, 16#L720true, Black: 101#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), readerThread1of1ForFork1InUse, Black: 103#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~y~0 0) (= ~w~0 0)), Black: 100#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 0)), 109#(= ~r~0 0), 97#true, Black: 76#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), Black: 81#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), 27#readerEXITtrue, 12#L714-1true, Black: 85#(= ~y~0 0), 28#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, Black: 86#(and (= ~w~0 1) (= ~y~0 0)), Black: 87#(and (= ~w~0 1) (= ~y~0 0) (= 3 ~x~0)), 11#L744true]) [2024-06-04 14:32:18,445 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2024-06-04 14:32:18,445 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-06-04 14:32:18,445 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-06-04 14:32:18,447 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-06-04 14:32:18,448 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([242] L714-->L714-1: Formula: (and (= v_~w~0_72 1) (not (= (ite (and (= v_~w~0_73 0) (= v_~r~0_51 0)) 1 0) 0))) InVars {~w~0=v_~w~0_73, ~r~0=v_~r~0_51} OutVars{~w~0=v_~w~0_72, writerThread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_writerThread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~r~0=v_~r~0_51, 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][94], [Black: 95#(and (= ~y~0 0) (= 3 ~x~0) (= ~w~0 0)), writerThread1of1ForFork3InUse, writerThread1of1ForFork2InUse, 83#true, 59#L744true, readerThread1of1ForFork0InUse, 16#L720true, Black: 101#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), readerThread1of1ForFork1InUse, Black: 103#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~y~0 0) (= ~w~0 0)), Black: 100#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 0)), 109#(= ~r~0 0), 97#true, Black: 76#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), Black: 81#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), 12#L714-1true, Black: 85#(= ~y~0 0), 28#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, Black: 86#(and (= ~w~0 1) (= ~y~0 0)), Black: 87#(and (= ~w~0 1) (= ~y~0 0) (= 3 ~x~0)), 45#readerEXITtrue]) [2024-06-04 14:32:18,448 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2024-06-04 14:32:18,448 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-06-04 14:32:18,448 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-06-04 14:32:18,449 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-06-04 14:32:18,453 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([247] L714-->L714-1: Formula: (and (= v_~w~0_72 1) (not (= (ite (and (= v_~w~0_73 0) (= v_~r~0_51 0)) 1 0) 0))) InVars {~w~0=v_~w~0_73, ~r~0=v_~r~0_51} OutVars{~w~0=v_~w~0_72, 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_51} AuxVars[] AssignedVars[~w~0, writerThread1of1ForFork2_assume_abort_if_not_~cond#1, writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1][98], [Black: 95#(and (= ~y~0 0) (= 3 ~x~0) (= ~w~0 0)), writerThread1of1ForFork3InUse, writerThread1of1ForFork2InUse, 83#true, 59#L744true, readerThread1of1ForFork0InUse, 29#L714-1true, Black: 101#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), readerThread1of1ForFork1InUse, Black: 103#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~y~0 0) (= ~w~0 0)), 6#L720true, Black: 100#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 0)), 109#(= ~r~0 0), 97#true, Black: 76#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), Black: 81#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), 28#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, Black: 85#(= ~y~0 0), Black: 86#(and (= ~w~0 1) (= ~y~0 0)), 11#L744true, Black: 87#(and (= ~w~0 1) (= ~y~0 0) (= 3 ~x~0))]) [2024-06-04 14:32:18,453 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2024-06-04 14:32:18,453 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-06-04 14:32:18,453 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-06-04 14:32:18,453 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-06-04 14:32:18,453 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-06-04 14:32:18,464 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([247] L714-->L714-1: Formula: (and (= v_~w~0_72 1) (not (= (ite (and (= v_~w~0_73 0) (= v_~r~0_51 0)) 1 0) 0))) InVars {~w~0=v_~w~0_73, ~r~0=v_~r~0_51} OutVars{~w~0=v_~w~0_72, 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_51} AuxVars[] AssignedVars[~w~0, writerThread1of1ForFork2_assume_abort_if_not_~cond#1, writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1][98], [Black: 95#(and (= ~y~0 0) (= 3 ~x~0) (= ~w~0 0)), writerThread1of1ForFork3InUse, writerThread1of1ForFork2InUse, 83#true, readerThread1of1ForFork0InUse, 29#L714-1true, readerThread1of1ForFork1InUse, Black: 101#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), 6#L720true, Black: 103#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~y~0 0) (= ~w~0 0)), Black: 100#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 0)), 109#(= ~r~0 0), 97#true, Black: 76#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), 27#readerEXITtrue, Black: 81#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), Black: 85#(= ~y~0 0), 28#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, Black: 86#(and (= ~w~0 1) (= ~y~0 0)), 11#L744true, Black: 87#(and (= ~w~0 1) (= ~y~0 0) (= 3 ~x~0))]) [2024-06-04 14:32:18,465 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2024-06-04 14:32:18,465 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-06-04 14:32:18,465 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-06-04 14:32:18,465 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-06-04 14:32:18,465 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([247] L714-->L714-1: Formula: (and (= v_~w~0_72 1) (not (= (ite (and (= v_~w~0_73 0) (= v_~r~0_51 0)) 1 0) 0))) InVars {~w~0=v_~w~0_73, ~r~0=v_~r~0_51} OutVars{~w~0=v_~w~0_72, 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_51} AuxVars[] AssignedVars[~w~0, writerThread1of1ForFork2_assume_abort_if_not_~cond#1, writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1][98], [Black: 95#(and (= ~y~0 0) (= 3 ~x~0) (= ~w~0 0)), writerThread1of1ForFork3InUse, writerThread1of1ForFork2InUse, 83#true, 59#L744true, readerThread1of1ForFork0InUse, 29#L714-1true, readerThread1of1ForFork1InUse, Black: 101#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), 6#L720true, Black: 103#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~y~0 0) (= ~w~0 0)), Black: 100#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 0)), 109#(= ~r~0 0), 97#true, Black: 76#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), Black: 81#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), Black: 85#(= ~y~0 0), 28#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, Black: 86#(and (= ~w~0 1) (= ~y~0 0)), Black: 87#(and (= ~w~0 1) (= ~y~0 0) (= 3 ~x~0)), 45#readerEXITtrue]) [2024-06-04 14:32:18,466 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2024-06-04 14:32:18,466 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-06-04 14:32:18,466 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-06-04 14:32:18,466 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-06-04 14:32:18,475 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([242] L714-->L714-1: Formula: (and (= v_~w~0_72 1) (not (= (ite (and (= v_~w~0_73 0) (= v_~r~0_51 0)) 1 0) 0))) InVars {~w~0=v_~w~0_73, ~r~0=v_~r~0_51} OutVars{~w~0=v_~w~0_72, writerThread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_writerThread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~r~0=v_~r~0_51, 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][94], [Black: 95#(and (= ~y~0 0) (= 3 ~x~0) (= ~w~0 0)), writerThread1of1ForFork3InUse, writerThread1of1ForFork2InUse, 83#true, readerThread1of1ForFork0InUse, 16#L720true, Black: 101#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), readerThread1of1ForFork1InUse, Black: 103#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~y~0 0) (= ~w~0 0)), Black: 100#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 0)), 109#(= ~r~0 0), 97#true, Black: 76#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), Black: 81#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), 27#readerEXITtrue, 28#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 12#L714-1true, Black: 85#(= ~y~0 0), Black: 86#(and (= ~w~0 1) (= ~y~0 0)), 11#L744true, Black: 87#(and (= ~w~0 1) (= ~y~0 0) (= 3 ~x~0))]) [2024-06-04 14:32:18,475 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2024-06-04 14:32:18,475 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-06-04 14:32:18,475 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-06-04 14:32:18,475 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-06-04 14:32:18,475 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-06-04 14:32:18,476 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([242] L714-->L714-1: Formula: (and (= v_~w~0_72 1) (not (= (ite (and (= v_~w~0_73 0) (= v_~r~0_51 0)) 1 0) 0))) InVars {~w~0=v_~w~0_73, ~r~0=v_~r~0_51} OutVars{~w~0=v_~w~0_72, writerThread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_writerThread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~r~0=v_~r~0_51, 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][94], [Black: 95#(and (= ~y~0 0) (= 3 ~x~0) (= ~w~0 0)), writerThread1of1ForFork3InUse, writerThread1of1ForFork2InUse, 83#true, 59#L744true, readerThread1of1ForFork0InUse, 16#L720true, Black: 101#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), readerThread1of1ForFork1InUse, Black: 103#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~y~0 0) (= ~w~0 0)), Black: 100#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 0)), 109#(= ~r~0 0), 97#true, Black: 76#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), Black: 81#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), 28#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 12#L714-1true, Black: 85#(= ~y~0 0), Black: 86#(and (= ~w~0 1) (= ~y~0 0)), Black: 87#(and (= ~w~0 1) (= ~y~0 0) (= 3 ~x~0)), 45#readerEXITtrue]) [2024-06-04 14:32:18,476 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2024-06-04 14:32:18,477 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-06-04 14:32:18,477 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-06-04 14:32:18,477 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-06-04 14:32:18,477 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-06-04 14:32:18,480 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([242] L714-->L714-1: Formula: (and (= v_~w~0_72 1) (not (= (ite (and (= v_~w~0_73 0) (= v_~r~0_51 0)) 1 0) 0))) InVars {~w~0=v_~w~0_73, ~r~0=v_~r~0_51} OutVars{~w~0=v_~w~0_72, writerThread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_writerThread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~r~0=v_~r~0_51, 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][94], [Black: 95#(and (= ~y~0 0) (= 3 ~x~0) (= ~w~0 0)), writerThread1of1ForFork3InUse, writerThread1of1ForFork2InUse, 83#true, readerThread1of1ForFork0InUse, 16#L720true, Black: 101#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), readerThread1of1ForFork1InUse, Black: 103#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~y~0 0) (= ~w~0 0)), Black: 100#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 0)), 109#(= ~r~0 0), 97#true, Black: 76#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), 27#readerEXITtrue, Black: 81#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), 12#L714-1true, Black: 85#(= ~y~0 0), 28#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, Black: 86#(and (= ~w~0 1) (= ~y~0 0)), Black: 87#(and (= ~w~0 1) (= ~y~0 0) (= 3 ~x~0)), 45#readerEXITtrue]) [2024-06-04 14:32:18,480 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2024-06-04 14:32:18,480 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-06-04 14:32:18,480 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-06-04 14:32:18,480 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-06-04 14:32:18,483 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([247] L714-->L714-1: Formula: (and (= v_~w~0_72 1) (not (= (ite (and (= v_~w~0_73 0) (= v_~r~0_51 0)) 1 0) 0))) InVars {~w~0=v_~w~0_73, ~r~0=v_~r~0_51} OutVars{~w~0=v_~w~0_72, 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_51} AuxVars[] AssignedVars[~w~0, writerThread1of1ForFork2_assume_abort_if_not_~cond#1, writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1][98], [Black: 95#(and (= ~y~0 0) (= 3 ~x~0) (= ~w~0 0)), writerThread1of1ForFork3InUse, writerThread1of1ForFork2InUse, 83#true, 29#L714-1true, readerThread1of1ForFork0InUse, Black: 101#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), readerThread1of1ForFork1InUse, Black: 103#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~y~0 0) (= ~w~0 0)), 6#L720true, Black: 100#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 0)), 109#(= ~r~0 0), 97#true, Black: 76#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), Black: 81#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), 27#readerEXITtrue, 28#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, Black: 85#(= ~y~0 0), Black: 86#(and (= ~w~0 1) (= ~y~0 0)), Black: 87#(and (= ~w~0 1) (= ~y~0 0) (= 3 ~x~0)), 11#L744true]) [2024-06-04 14:32:18,483 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2024-06-04 14:32:18,483 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-06-04 14:32:18,483 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-06-04 14:32:18,484 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-06-04 14:32:18,484 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-06-04 14:32:18,485 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([247] L714-->L714-1: Formula: (and (= v_~w~0_72 1) (not (= (ite (and (= v_~w~0_73 0) (= v_~r~0_51 0)) 1 0) 0))) InVars {~w~0=v_~w~0_73, ~r~0=v_~r~0_51} OutVars{~w~0=v_~w~0_72, 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_51} AuxVars[] AssignedVars[~w~0, writerThread1of1ForFork2_assume_abort_if_not_~cond#1, writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1][98], [Black: 95#(and (= ~y~0 0) (= 3 ~x~0) (= ~w~0 0)), writerThread1of1ForFork3InUse, writerThread1of1ForFork2InUse, 83#true, 59#L744true, readerThread1of1ForFork0InUse, 29#L714-1true, Black: 101#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), readerThread1of1ForFork1InUse, Black: 103#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~y~0 0) (= ~w~0 0)), 6#L720true, Black: 100#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 0)), 109#(= ~r~0 0), 97#true, Black: 76#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), Black: 81#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), 28#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, Black: 85#(= ~y~0 0), Black: 86#(and (= ~w~0 1) (= ~y~0 0)), Black: 87#(and (= ~w~0 1) (= ~y~0 0) (= 3 ~x~0)), 45#readerEXITtrue]) [2024-06-04 14:32:18,486 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2024-06-04 14:32:18,486 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-06-04 14:32:18,486 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-06-04 14:32:18,486 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-06-04 14:32:18,486 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-06-04 14:32:18,491 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([247] L714-->L714-1: Formula: (and (= v_~w~0_72 1) (not (= (ite (and (= v_~w~0_73 0) (= v_~r~0_51 0)) 1 0) 0))) InVars {~w~0=v_~w~0_73, ~r~0=v_~r~0_51} OutVars{~w~0=v_~w~0_72, 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_51} AuxVars[] AssignedVars[~w~0, writerThread1of1ForFork2_assume_abort_if_not_~cond#1, writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1][98], [Black: 95#(and (= ~y~0 0) (= 3 ~x~0) (= ~w~0 0)), writerThread1of1ForFork3InUse, writerThread1of1ForFork2InUse, 83#true, readerThread1of1ForFork0InUse, 29#L714-1true, readerThread1of1ForFork1InUse, Black: 101#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), 6#L720true, Black: 103#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~y~0 0) (= ~w~0 0)), Black: 100#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 0)), 109#(= ~r~0 0), 97#true, Black: 76#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), 27#readerEXITtrue, Black: 81#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), Black: 85#(= ~y~0 0), 28#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, Black: 86#(and (= ~w~0 1) (= ~y~0 0)), Black: 87#(and (= ~w~0 1) (= ~y~0 0) (= 3 ~x~0)), 45#readerEXITtrue]) [2024-06-04 14:32:18,492 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2024-06-04 14:32:18,492 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-06-04 14:32:18,492 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-06-04 14:32:18,492 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-06-04 14:32:18,500 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([242] L714-->L714-1: Formula: (and (= v_~w~0_72 1) (not (= (ite (and (= v_~w~0_73 0) (= v_~r~0_51 0)) 1 0) 0))) InVars {~w~0=v_~w~0_73, ~r~0=v_~r~0_51} OutVars{~w~0=v_~w~0_72, writerThread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_writerThread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~r~0=v_~r~0_51, 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][94], [Black: 95#(and (= ~y~0 0) (= 3 ~x~0) (= ~w~0 0)), writerThread1of1ForFork3InUse, writerThread1of1ForFork2InUse, 83#true, readerThread1of1ForFork0InUse, 16#L720true, Black: 101#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), readerThread1of1ForFork1InUse, Black: 103#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~y~0 0) (= ~w~0 0)), Black: 100#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 0)), 109#(= ~r~0 0), 97#true, Black: 76#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), Black: 81#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), 27#readerEXITtrue, 28#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 12#L714-1true, Black: 85#(= ~y~0 0), Black: 86#(and (= ~w~0 1) (= ~y~0 0)), Black: 87#(and (= ~w~0 1) (= ~y~0 0) (= 3 ~x~0)), 45#readerEXITtrue]) [2024-06-04 14:32:18,501 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2024-06-04 14:32:18,501 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-06-04 14:32:18,501 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-06-04 14:32:18,501 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-06-04 14:32:18,501 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-06-04 14:32:18,506 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([247] L714-->L714-1: Formula: (and (= v_~w~0_72 1) (not (= (ite (and (= v_~w~0_73 0) (= v_~r~0_51 0)) 1 0) 0))) InVars {~w~0=v_~w~0_73, ~r~0=v_~r~0_51} OutVars{~w~0=v_~w~0_72, 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_51} AuxVars[] AssignedVars[~w~0, writerThread1of1ForFork2_assume_abort_if_not_~cond#1, writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1][98], [Black: 95#(and (= ~y~0 0) (= 3 ~x~0) (= ~w~0 0)), writerThread1of1ForFork3InUse, writerThread1of1ForFork2InUse, 83#true, readerThread1of1ForFork0InUse, 29#L714-1true, Black: 101#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), readerThread1of1ForFork1InUse, Black: 103#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~y~0 0) (= ~w~0 0)), 6#L720true, Black: 100#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= ~w~0 0)), 109#(= ~r~0 0), 97#true, Black: 76#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), 27#readerEXITtrue, Black: 81#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), 28#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, Black: 85#(= ~y~0 0), Black: 86#(and (= ~w~0 1) (= ~y~0 0)), Black: 87#(and (= ~w~0 1) (= ~y~0 0) (= 3 ~x~0)), 45#readerEXITtrue]) [2024-06-04 14:32:18,506 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2024-06-04 14:32:18,506 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-06-04 14:32:18,506 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-06-04 14:32:18,507 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-06-04 14:32:18,507 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-06-04 14:32:18,529 INFO L124 PetriNetUnfolderBase]: 7485/13543 cut-off events. [2024-06-04 14:32:18,529 INFO L125 PetriNetUnfolderBase]: For 50261/52356 co-relation queries the response was YES. [2024-06-04 14:32:18,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44369 conditions, 13543 events. 7485/13543 cut-off events. For 50261/52356 co-relation queries the response was YES. Maximal size of possible extension queue 667. Compared 110947 event pairs, 2690 based on Foata normal form. 842/13595 useless extension candidates. Maximal degree in co-relation 44344. Up to 4829 conditions per place. [2024-06-04 14:32:18,599 INFO L140 encePairwiseOnDemand]: 51/58 looper letters, 63 selfloop transitions, 17 changer transitions 0/117 dead transitions. [2024-06-04 14:32:18,599 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 117 transitions, 795 flow [2024-06-04 14:32:18,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-04 14:32:18,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-04 14:32:18,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 170 transitions. [2024-06-04 14:32:18,600 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7327586206896551 [2024-06-04 14:32:18,601 INFO L175 Difference]: Start difference. First operand has 77 places, 85 transitions, 573 flow. Second operand 4 states and 170 transitions. [2024-06-04 14:32:18,601 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 117 transitions, 795 flow [2024-06-04 14:32:18,628 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 117 transitions, 779 flow, removed 5 selfloop flow, removed 1 redundant places. [2024-06-04 14:32:18,630 INFO L231 Difference]: Finished difference. Result has 82 places, 85 transitions, 627 flow [2024-06-04 14:32:18,630 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=487, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=627, PETRI_PLACES=82, PETRI_TRANSITIONS=85} [2024-06-04 14:32:18,630 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 21 predicate places. [2024-06-04 14:32:18,631 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 85 transitions, 627 flow [2024-06-04 14:32:18,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:32:18,631 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 14:32:18,631 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 14:32:18,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-04 14:32:18,631 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-04 14:32:18,632 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 14:32:18,632 INFO L85 PathProgramCache]: Analyzing trace with hash -1678712225, now seen corresponding path program 1 times [2024-06-04 14:32:18,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 14:32:18,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839450821] [2024-06-04 14:32:18,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 14:32:18,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 14:32:18,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 14:32:18,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 14:32:18,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 14:32:18,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839450821] [2024-06-04 14:32:18,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839450821] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 14:32:18,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 14:32:18,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 14:32:18,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430341153] [2024-06-04 14:32:18,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 14:32:18,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-04 14:32:18,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 14:32:18,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-04 14:32:18,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-06-04 14:32:18,817 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 58 [2024-06-04 14:32:18,818 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 85 transitions, 627 flow. Second operand has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 6 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-06-04 14:32:18,818 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 14:32:18,818 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 58 [2024-06-04 14:32:18,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 14:32:20,939 INFO L124 PetriNetUnfolderBase]: 17559/27535 cut-off events. [2024-06-04 14:32:20,939 INFO L125 PetriNetUnfolderBase]: For 99951/100719 co-relation queries the response was YES. [2024-06-04 14:32:21,000 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95160 conditions, 27535 events. 17559/27535 cut-off events. For 99951/100719 co-relation queries the response was YES. Maximal size of possible extension queue 1114. Compared 201122 event pairs, 2069 based on Foata normal form. 570/27849 useless extension candidates. Maximal degree in co-relation 95130. Up to 10804 conditions per place. [2024-06-04 14:32:21,074 INFO L140 encePairwiseOnDemand]: 43/58 looper letters, 177 selfloop transitions, 35 changer transitions 0/226 dead transitions. [2024-06-04 14:32:21,074 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 226 transitions, 1931 flow [2024-06-04 14:32:21,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 14:32:21,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 14:32:21,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 277 transitions. [2024-06-04 14:32:21,076 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6822660098522167 [2024-06-04 14:32:21,076 INFO L175 Difference]: Start difference. First operand has 82 places, 85 transitions, 627 flow. Second operand 7 states and 277 transitions. [2024-06-04 14:32:21,076 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 226 transitions, 1931 flow [2024-06-04 14:32:21,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 226 transitions, 1899 flow, removed 16 selfloop flow, removed 0 redundant places. [2024-06-04 14:32:21,131 INFO L231 Difference]: Finished difference. Result has 94 places, 117 transitions, 1193 flow [2024-06-04 14:32:21,131 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=615, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1193, PETRI_PLACES=94, PETRI_TRANSITIONS=117} [2024-06-04 14:32:21,132 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 33 predicate places. [2024-06-04 14:32:21,132 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 117 transitions, 1193 flow [2024-06-04 14:32:21,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 6 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-06-04 14:32:21,132 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 14:32:21,132 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 14:32:21,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-04 14:32:21,133 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-04 14:32:21,133 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 14:32:21,133 INFO L85 PathProgramCache]: Analyzing trace with hash 1549403828, now seen corresponding path program 1 times [2024-06-04 14:32:21,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 14:32:21,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965927191] [2024-06-04 14:32:21,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 14:32:21,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 14:32:21,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 14:32:21,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 14:32:21,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 14:32:21,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965927191] [2024-06-04 14:32:21,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965927191] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 14:32:21,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 14:32:21,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-04 14:32:21,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228156778] [2024-06-04 14:32:21,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 14:32:21,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-04 14:32:21,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 14:32:21,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-04 14:32:21,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-06-04 14:32:21,330 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 58 [2024-06-04 14:32:21,330 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 117 transitions, 1193 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-06-04 14:32:21,330 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 14:32:21,330 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 58 [2024-06-04 14:32:21,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 14:32:23,458 INFO L124 PetriNetUnfolderBase]: 15039/24897 cut-off events. [2024-06-04 14:32:23,458 INFO L125 PetriNetUnfolderBase]: For 138912/140036 co-relation queries the response was YES. [2024-06-04 14:32:23,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100912 conditions, 24897 events. 15039/24897 cut-off events. For 138912/140036 co-relation queries the response was YES. Maximal size of possible extension queue 1076. Compared 192358 event pairs, 6611 based on Foata normal form. 262/24658 useless extension candidates. Maximal degree in co-relation 100876. Up to 19750 conditions per place. [2024-06-04 14:32:23,605 INFO L140 encePairwiseOnDemand]: 46/58 looper letters, 122 selfloop transitions, 13 changer transitions 0/158 dead transitions. [2024-06-04 14:32:23,605 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 158 transitions, 1655 flow [2024-06-04 14:32:23,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 14:32:23,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 14:32:23,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 190 transitions. [2024-06-04 14:32:23,607 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5459770114942529 [2024-06-04 14:32:23,607 INFO L175 Difference]: Start difference. First operand has 94 places, 117 transitions, 1193 flow. Second operand 6 states and 190 transitions. [2024-06-04 14:32:23,607 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 158 transitions, 1655 flow [2024-06-04 14:32:23,815 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 158 transitions, 1585 flow, removed 35 selfloop flow, removed 0 redundant places. [2024-06-04 14:32:23,817 INFO L231 Difference]: Finished difference. Result has 100 places, 119 transitions, 1183 flow [2024-06-04 14:32:23,817 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=1123, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1183, PETRI_PLACES=100, PETRI_TRANSITIONS=119} [2024-06-04 14:32:23,820 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 39 predicate places. [2024-06-04 14:32:23,821 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 119 transitions, 1183 flow [2024-06-04 14:32:23,821 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-06-04 14:32:23,821 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 14:32:23,821 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-06-04 14:32:23,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-04 14:32:23,821 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-04 14:32:23,822 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 14:32:23,822 INFO L85 PathProgramCache]: Analyzing trace with hash -2050380768, now seen corresponding path program 1 times [2024-06-04 14:32:23,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 14:32:23,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641237305] [2024-06-04 14:32:23,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 14:32:23,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 14:32:23,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 14:32:24,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 14:32:24,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 14:32:24,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641237305] [2024-06-04 14:32:24,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641237305] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 14:32:24,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 14:32:24,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-04 14:32:24,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063094224] [2024-06-04 14:32:24,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 14:32:24,090 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-04 14:32:24,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 14:32:24,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-04 14:32:24,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-06-04 14:32:24,157 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 58 [2024-06-04 14:32:24,158 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 119 transitions, 1183 flow. Second operand has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 6 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:32:24,158 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 14:32:24,158 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 58 [2024-06-04 14:32:24,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 14:32:26,348 INFO L124 PetriNetUnfolderBase]: 14963/24724 cut-off events. [2024-06-04 14:32:26,349 INFO L125 PetriNetUnfolderBase]: For 158874/159674 co-relation queries the response was YES. [2024-06-04 14:32:26,440 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101807 conditions, 24724 events. 14963/24724 cut-off events. For 158874/159674 co-relation queries the response was YES. Maximal size of possible extension queue 1083. Compared 193029 event pairs, 6765 based on Foata normal form. 311/24444 useless extension candidates. Maximal degree in co-relation 101767. Up to 19848 conditions per place. [2024-06-04 14:32:26,521 INFO L140 encePairwiseOnDemand]: 49/58 looper letters, 115 selfloop transitions, 26 changer transitions 0/170 dead transitions. [2024-06-04 14:32:26,522 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 170 transitions, 1697 flow [2024-06-04 14:32:26,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 14:32:26,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 14:32:26,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 211 transitions. [2024-06-04 14:32:26,523 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5197044334975369 [2024-06-04 14:32:26,523 INFO L175 Difference]: Start difference. First operand has 100 places, 119 transitions, 1183 flow. Second operand 7 states and 211 transitions. [2024-06-04 14:32:26,523 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 170 transitions, 1697 flow [2024-06-04 14:32:26,883 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 170 transitions, 1652 flow, removed 14 selfloop flow, removed 3 redundant places. [2024-06-04 14:32:26,901 INFO L231 Difference]: Finished difference. Result has 105 places, 129 transitions, 1301 flow [2024-06-04 14:32:26,901 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=1147, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1301, PETRI_PLACES=105, PETRI_TRANSITIONS=129} [2024-06-04 14:32:26,903 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 44 predicate places. [2024-06-04 14:32:26,903 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 129 transitions, 1301 flow [2024-06-04 14:32:26,903 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 6 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:32:26,903 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 14:32:26,903 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-06-04 14:32:26,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-04 14:32:26,904 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-04 14:32:26,904 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 14:32:26,904 INFO L85 PathProgramCache]: Analyzing trace with hash 1854631479, now seen corresponding path program 1 times [2024-06-04 14:32:26,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 14:32:26,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994995834] [2024-06-04 14:32:26,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 14:32:26,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 14:32:26,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 14:32:27,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 14:32:27,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 14:32:27,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994995834] [2024-06-04 14:32:27,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994995834] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 14:32:27,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 14:32:27,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-04 14:32:27,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094829717] [2024-06-04 14:32:27,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 14:32:27,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-04 14:32:27,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 14:32:27,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-04 14:32:27,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-06-04 14:32:27,179 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 58 [2024-06-04 14:32:27,180 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 129 transitions, 1301 flow. Second operand has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 6 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-06-04 14:32:27,180 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 14:32:27,180 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 58 [2024-06-04 14:32:27,180 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 14:32:29,846 INFO L124 PetriNetUnfolderBase]: 17437/27924 cut-off events. [2024-06-04 14:32:29,846 INFO L125 PetriNetUnfolderBase]: For 182542/183166 co-relation queries the response was YES. [2024-06-04 14:32:29,959 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115336 conditions, 27924 events. 17437/27924 cut-off events. For 182542/183166 co-relation queries the response was YES. Maximal size of possible extension queue 1123. Compared 207412 event pairs, 6677 based on Foata normal form. 284/27885 useless extension candidates. Maximal degree in co-relation 115293. Up to 22452 conditions per place. [2024-06-04 14:32:30,043 INFO L140 encePairwiseOnDemand]: 45/58 looper letters, 154 selfloop transitions, 45 changer transitions 0/217 dead transitions. [2024-06-04 14:32:30,043 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 217 transitions, 2295 flow [2024-06-04 14:32:30,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 14:32:30,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 14:32:30,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 257 transitions. [2024-06-04 14:32:30,046 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5538793103448276 [2024-06-04 14:32:30,046 INFO L175 Difference]: Start difference. First operand has 105 places, 129 transitions, 1301 flow. Second operand 8 states and 257 transitions. [2024-06-04 14:32:30,046 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 217 transitions, 2295 flow [2024-06-04 14:32:30,336 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 217 transitions, 2261 flow, removed 16 selfloop flow, removed 1 redundant places. [2024-06-04 14:32:30,338 INFO L231 Difference]: Finished difference. Result has 117 places, 151 transitions, 1734 flow [2024-06-04 14:32:30,338 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=1267, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1734, PETRI_PLACES=117, PETRI_TRANSITIONS=151} [2024-06-04 14:32:30,339 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 56 predicate places. [2024-06-04 14:32:30,339 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 151 transitions, 1734 flow [2024-06-04 14:32:30,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 6 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-06-04 14:32:30,339 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 14:32:30,340 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 14:32:30,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-04 14:32:30,340 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-04 14:32:30,340 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 14:32:30,340 INFO L85 PathProgramCache]: Analyzing trace with hash 1659002539, now seen corresponding path program 1 times [2024-06-04 14:32:30,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 14:32:30,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369766765] [2024-06-04 14:32:30,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 14:32:30,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 14:32:30,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 14:32:30,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 14:32:30,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 14:32:30,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369766765] [2024-06-04 14:32:30,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369766765] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 14:32:30,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 14:32:30,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 14:32:30,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112435494] [2024-06-04 14:32:30,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 14:32:30,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 14:32:30,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 14:32:30,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 14:32:30,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-04 14:32:30,530 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 58 [2024-06-04 14:32:30,531 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 151 transitions, 1734 flow. Second operand has 7 states, 7 states have (on average 17.428571428571427) internal successors, (122), 7 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:32:30,531 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 14:32:30,531 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 58 [2024-06-04 14:32:30,531 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 14:32:34,460 INFO L124 PetriNetUnfolderBase]: 23331/36578 cut-off events. [2024-06-04 14:32:34,461 INFO L125 PetriNetUnfolderBase]: For 324788/325480 co-relation queries the response was YES. [2024-06-04 14:32:34,632 INFO L83 FinitePrefix]: Finished finitePrefix Result has 161011 conditions, 36578 events. 23331/36578 cut-off events. For 324788/325480 co-relation queries the response was YES. Maximal size of possible extension queue 1657. Compared 278527 event pairs, 5203 based on Foata normal form. 536/36678 useless extension candidates. Maximal degree in co-relation 160961. Up to 18687 conditions per place. [2024-06-04 14:32:34,744 INFO L140 encePairwiseOnDemand]: 43/58 looper letters, 244 selfloop transitions, 87 changer transitions 0/349 dead transitions. [2024-06-04 14:32:34,745 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 349 transitions, 3790 flow [2024-06-04 14:32:34,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-06-04 14:32:34,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2024-06-04 14:32:34,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 478 transitions. [2024-06-04 14:32:34,746 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5494252873563218 [2024-06-04 14:32:34,746 INFO L175 Difference]: Start difference. First operand has 117 places, 151 transitions, 1734 flow. Second operand 15 states and 478 transitions. [2024-06-04 14:32:34,747 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 349 transitions, 3790 flow [2024-06-04 14:32:35,445 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 349 transitions, 3738 flow, removed 26 selfloop flow, removed 0 redundant places. [2024-06-04 14:32:35,467 INFO L231 Difference]: Finished difference. Result has 138 places, 183 transitions, 2434 flow [2024-06-04 14:32:35,467 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=1684, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=2434, PETRI_PLACES=138, PETRI_TRANSITIONS=183} [2024-06-04 14:32:35,468 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 77 predicate places. [2024-06-04 14:32:35,468 INFO L495 AbstractCegarLoop]: Abstraction has has 138 places, 183 transitions, 2434 flow [2024-06-04 14:32:35,468 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.428571428571427) internal successors, (122), 7 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:32:35,468 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 14:32:35,468 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 14:32:35,469 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-04 14:32:35,469 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-04 14:32:35,469 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 14:32:35,469 INFO L85 PathProgramCache]: Analyzing trace with hash 360468436, now seen corresponding path program 1 times [2024-06-04 14:32:35,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 14:32:35,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464826961] [2024-06-04 14:32:35,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 14:32:35,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 14:32:35,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 14:32:35,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 14:32:35,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 14:32:35,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464826961] [2024-06-04 14:32:35,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464826961] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 14:32:35,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 14:32:35,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 14:32:35,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564110328] [2024-06-04 14:32:35,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 14:32:35,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 14:32:35,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 14:32:35,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 14:32:35,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-04 14:32:35,667 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 58 [2024-06-04 14:32:35,667 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 183 transitions, 2434 flow. Second operand has 7 states, 7 states have (on average 17.571428571428573) internal successors, (123), 7 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-06-04 14:32:35,667 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 14:32:35,667 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 58 [2024-06-04 14:32:35,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 14:32:40,418 INFO L124 PetriNetUnfolderBase]: 26348/41702 cut-off events. [2024-06-04 14:32:40,419 INFO L125 PetriNetUnfolderBase]: For 515233/515957 co-relation queries the response was YES. [2024-06-04 14:32:40,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 204501 conditions, 41702 events. 26348/41702 cut-off events. For 515233/515957 co-relation queries the response was YES. Maximal size of possible extension queue 1944. Compared 328190 event pairs, 5240 based on Foata normal form. 638/41846 useless extension candidates. Maximal degree in co-relation 204442. Up to 18671 conditions per place. [2024-06-04 14:32:40,882 INFO L140 encePairwiseOnDemand]: 44/58 looper letters, 264 selfloop transitions, 80 changer transitions 0/362 dead transitions. [2024-06-04 14:32:40,882 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 362 transitions, 4714 flow [2024-06-04 14:32:40,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-04 14:32:40,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-04 14:32:40,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 417 transitions. [2024-06-04 14:32:40,884 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.553050397877984 [2024-06-04 14:32:40,884 INFO L175 Difference]: Start difference. First operand has 138 places, 183 transitions, 2434 flow. Second operand 13 states and 417 transitions. [2024-06-04 14:32:40,884 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 362 transitions, 4714 flow [2024-06-04 14:32:42,750 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 362 transitions, 4494 flow, removed 65 selfloop flow, removed 7 redundant places. [2024-06-04 14:32:42,754 INFO L231 Difference]: Finished difference. Result has 148 places, 211 transitions, 2932 flow [2024-06-04 14:32:42,754 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=2242, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=2932, PETRI_PLACES=148, PETRI_TRANSITIONS=211} [2024-06-04 14:32:42,755 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 87 predicate places. [2024-06-04 14:32:42,755 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 211 transitions, 2932 flow [2024-06-04 14:32:42,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.571428571428573) internal successors, (123), 7 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-06-04 14:32:42,755 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 14:32:42,755 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 14:32:42,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-04 14:32:42,756 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-04 14:32:42,760 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 14:32:42,760 INFO L85 PathProgramCache]: Analyzing trace with hash -728996352, now seen corresponding path program 1 times [2024-06-04 14:32:42,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 14:32:42,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788660652] [2024-06-04 14:32:42,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 14:32:42,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 14:32:42,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 14:32:42,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 14:32:42,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 14:32:42,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788660652] [2024-06-04 14:32:42,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788660652] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 14:32:42,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 14:32:42,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 14:32:42,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899573245] [2024-06-04 14:32:42,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 14:32:42,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-04 14:32:42,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 14:32:42,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-04 14:32:42,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-06-04 14:32:42,946 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 58 [2024-06-04 14:32:42,947 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 211 transitions, 2932 flow. Second operand has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 6 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:32:42,947 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 14:32:42,947 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 58 [2024-06-04 14:32:42,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 14:32:47,788 INFO L124 PetriNetUnfolderBase]: 24999/39031 cut-off events. [2024-06-04 14:32:47,788 INFO L125 PetriNetUnfolderBase]: For 644173/644880 co-relation queries the response was YES. [2024-06-04 14:32:48,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 210687 conditions, 39031 events. 24999/39031 cut-off events. For 644173/644880 co-relation queries the response was YES. Maximal size of possible extension queue 1924. Compared 304074 event pairs, 3388 based on Foata normal form. 704/38918 useless extension candidates. Maximal degree in co-relation 210622. Up to 18127 conditions per place. [2024-06-04 14:32:48,265 INFO L140 encePairwiseOnDemand]: 45/58 looper letters, 197 selfloop transitions, 86 changer transitions 6/321 dead transitions. [2024-06-04 14:32:48,266 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 321 transitions, 4509 flow [2024-06-04 14:32:48,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 14:32:48,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 14:32:48,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 251 transitions. [2024-06-04 14:32:48,267 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6182266009852216 [2024-06-04 14:32:48,267 INFO L175 Difference]: Start difference. First operand has 148 places, 211 transitions, 2932 flow. Second operand 7 states and 251 transitions. [2024-06-04 14:32:48,267 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 321 transitions, 4509 flow [2024-06-04 14:32:50,397 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 321 transitions, 4359 flow, removed 39 selfloop flow, removed 7 redundant places. [2024-06-04 14:32:50,401 INFO L231 Difference]: Finished difference. Result has 151 places, 224 transitions, 3303 flow [2024-06-04 14:32:50,401 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=2820, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=211, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3303, PETRI_PLACES=151, PETRI_TRANSITIONS=224} [2024-06-04 14:32:50,402 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 90 predicate places. [2024-06-04 14:32:50,402 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 224 transitions, 3303 flow [2024-06-04 14:32:50,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 6 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:32:50,402 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 14:32:50,402 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 14:32:50,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-04 14:32:50,402 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-04 14:32:50,403 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 14:32:50,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1209041438, now seen corresponding path program 1 times [2024-06-04 14:32:50,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 14:32:50,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650306264] [2024-06-04 14:32:50,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 14:32:50,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 14:32:50,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 14:32:50,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 14:32:50,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 14:32:50,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650306264] [2024-06-04 14:32:50,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650306264] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 14:32:50,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 14:32:50,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 14:32:50,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109214761] [2024-06-04 14:32:50,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 14:32:50,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 14:32:50,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 14:32:50,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 14:32:50,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-06-04 14:32:50,616 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 58 [2024-06-04 14:32:50,617 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 224 transitions, 3303 flow. Second operand has 7 states, 7 states have (on average 18.142857142857142) internal successors, (127), 7 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 14:32:50,617 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 14:32:50,617 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 58 [2024-06-04 14:32:50,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand