Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r223-tall-171649610900204.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is LamportFastMutEx-COL-2, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r223-tall-171649610900204
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 472K
-rw-r--r-- 1 mcc users 11K Apr 13 07:34 CTLCardinality.txt
-rw-r--r-- 1 mcc users 112K Apr 13 07:34 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Apr 13 07:33 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Apr 13 07:33 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.1K Apr 13 07:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 71K Apr 13 07:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Apr 13 07:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K Apr 13 07:35 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 22 14:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:51 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_pt
-rw-r--r-- 1 mcc users 2 May 18 16:42 instance
-rw-r--r-- 1 mcc users 5 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 38K May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME LamportFastMutEx-COL-2-LTLFireability-00
FORMULA_NAME LamportFastMutEx-COL-2-LTLFireability-01
FORMULA_NAME LamportFastMutEx-COL-2-LTLFireability-02
FORMULA_NAME LamportFastMutEx-COL-2-LTLFireability-03
FORMULA_NAME LamportFastMutEx-COL-2-LTLFireability-04
FORMULA_NAME LamportFastMutEx-COL-2-LTLFireability-05
FORMULA_NAME LamportFastMutEx-COL-2-LTLFireability-06
FORMULA_NAME LamportFastMutEx-COL-2-LTLFireability-07
FORMULA_NAME LamportFastMutEx-COL-2-LTLFireability-08
FORMULA_NAME LamportFastMutEx-COL-2-LTLFireability-09
FORMULA_NAME LamportFastMutEx-COL-2-LTLFireability-10
FORMULA_NAME LamportFastMutEx-COL-2-LTLFireability-11
FORMULA_NAME LamportFastMutEx-COL-2-LTLFireability-12
FORMULA_NAME LamportFastMutEx-COL-2-LTLFireability-13
FORMULA_NAME LamportFastMutEx-COL-2-LTLFireability-14
FORMULA_NAME LamportFastMutEx-COL-2-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716522941095

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LamportFastMutEx-COL-2
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-24 03:55:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-24 03:55:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 03:55:42] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-24 03:55:42] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-24 03:55:42] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 598 ms
[2024-05-24 03:55:42] [INFO ] Imported 18 HL places and 17 HL transitions for a total of 69 PT places and 117.0 transition bindings in 17 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2024-05-24 03:55:43] [INFO ] Built PT skeleton of HLPN with 18 places and 17 transitions 68 arcs in 4 ms.
[2024-05-24 03:55:43] [INFO ] Skeletonized 12 HLPN properties in 2 ms. Removed 4 properties that had guard overlaps.
Initial state reduction rules removed 1 formulas.
FORMULA LamportFastMutEx-COL-2-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 3 stabilizing places and 0 stable transitions
Remains 11 properties that can be checked using skeleton over-approximation.
Reduce places removed 3 places and 0 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
RANDOM walk for 19308 steps (4 resets) in 317 ms. (60 steps per ms) remains 0/13 properties
[2024-05-24 03:55:43] [INFO ] Flatten gal took : 14 ms
[2024-05-24 03:55:43] [INFO ] Flatten gal took : 3 ms
Domain [pid(3), pid(3)] of place P_wait breaks symmetries in sort pid
Symmetric sort wr.t. initial and guards and successors and join/free detected :P_bool
Arc [3:1*[$i, 1]] contains constants of sort P_bool
Transition T_setbi_2 : constants on arcs in [[3:1*[$i, 1]]] introduces in P_bool(2) partition with 1 elements that refines current partition to 2 subsets.
[2024-05-24 03:55:43] [INFO ] Unfolded HLPN to a Petri net with 69 places and 96 transitions 402 arcs in 19 ms.
[2024-05-24 03:55:43] [INFO ] Unfolded 15 HLPN properties in 1 ms.
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 34 transitions.
Support contains 40 out of 44 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 44/44 places, 62/62 transitions.
Applied a total of 0 rules in 6 ms. Remains 44 /44 variables (removed 0) and now considering 62/62 (removed 0) transitions.
[2024-05-24 03:55:43] [INFO ] Flow matrix only has 56 transitions (discarded 6 similar events)
// Phase 1: matrix 56 rows 44 cols
[2024-05-24 03:55:43] [INFO ] Computed 10 invariants in 15 ms
[2024-05-24 03:55:43] [INFO ] Implicit Places using invariants in 152 ms returned []
[2024-05-24 03:55:43] [INFO ] Flow matrix only has 56 transitions (discarded 6 similar events)
[2024-05-24 03:55:43] [INFO ] Invariant cache hit.
[2024-05-24 03:55:43] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-05-24 03:55:43] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 250 ms to find 0 implicit places.
Running 60 sub problems to find dead transitions.
[2024-05-24 03:55:43] [INFO ] Flow matrix only has 56 transitions (discarded 6 similar events)
[2024-05-24 03:55:43] [INFO ] Invariant cache hit.
[2024-05-24 03:55:43] [INFO ] State equation strengthened by 16 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-05-24 03:55:43] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 8 ms to minimize.
Problem TDEAD2 is UNSAT
[2024-05-24 03:55:44] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 2 ms to minimize.
[2024-05-24 03:55:44] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
[2024-05-24 03:55:44] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 1 ms to minimize.
Problem TDEAD3 is UNSAT
[2024-05-24 03:55:44] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
Problem TDEAD10 is UNSAT
[2024-05-24 03:55:44] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
Problem TDEAD13 is UNSAT
[2024-05-24 03:55:44] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 1 ms to minimize.
Problem TDEAD14 is UNSAT
[2024-05-24 03:55:44] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 0 ms to minimize.
Problem TDEAD15 is UNSAT
[2024-05-24 03:55:44] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
[2024-05-24 03:55:44] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
[2024-05-24 03:55:44] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 1 ms to minimize.
[2024-05-24 03:55:44] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 0 ms to minimize.
Problem TDEAD24 is UNSAT
Problem TDEAD27 is UNSAT
[2024-05-24 03:55:44] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-05-24 03:55:44] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
Problem TDEAD28 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
[2024-05-24 03:55:44] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2024-05-24 03:55:44] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
[2024-05-24 03:55:44] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 0 ms to minimize.
[2024-05-24 03:55:44] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 0 ms to minimize.
[2024-05-24 03:55:44] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 19/29 constraints. Problems are: Problem set: 12 solved, 48 unsolved
[2024-05-24 03:55:44] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
[2024-05-24 03:55:44] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 2/31 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 0/31 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 4 (OVERLAPS) 56/100 variables, 44/75 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 16/91 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 0/91 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 7 (OVERLAPS) 0/100 variables, 0/91 constraints. Problems are: Problem set: 12 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Real declared 100/100 variables, and 91 constraints, problems are : Problem set: 12 solved, 48 unsolved in 1596 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 44/44 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 12 solved, 48 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 4/4 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 13/17 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/17 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 3 (OVERLAPS) 2/44 variables, 6/23 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 8/31 constraints. Problems are: Problem set: 12 solved, 48 unsolved
[2024-05-24 03:55:45] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 1/32 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/44 variables, 0/32 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 7 (OVERLAPS) 56/100 variables, 44/76 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/100 variables, 16/92 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/100 variables, 48/140 constraints. Problems are: Problem set: 12 solved, 48 unsolved
[2024-05-24 03:55:46] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/100 variables, 1/141 constraints. Problems are: Problem set: 12 solved, 48 unsolved
[2024-05-24 03:55:46] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/100 variables, 1/142 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/100 variables, 0/142 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 13 (OVERLAPS) 0/100 variables, 0/142 constraints. Problems are: Problem set: 12 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Int declared 100/100 variables, and 142 constraints, problems are : Problem set: 12 solved, 48 unsolved in 1606 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 44/44 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 48/60 constraints, Known Traps: 24/24 constraints]
After SMT, in 3255ms problems are : Problem set: 12 solved, 48 unsolved
Search for dead transitions found 12 dead transitions in 3270ms
Found 12 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 12 transitions
Dead transitions reduction (with SMT) removed 12 transitions
Starting structural reductions in LTL mode, iteration 1 : 44/44 places, 50/62 transitions.
Applied a total of 0 rules in 1 ms. Remains 44 /44 variables (removed 0) and now considering 50/50 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3542 ms. Remains : 44/44 places, 50/62 transitions.
Support contains 40 out of 44 places after structural reductions.
[2024-05-24 03:55:46] [INFO ] Flatten gal took : 19 ms
[2024-05-24 03:55:47] [INFO ] Flatten gal took : 25 ms
[2024-05-24 03:55:47] [INFO ] Input system was already deterministic with 50 transitions.
Reduction of identical properties reduced properties to check from 20 to 17
RANDOM walk for 40000 steps (8 resets) in 689 ms. (57 steps per ms) remains 1/17 properties
BEST_FIRST walk for 40004 steps (8 resets) in 307 ms. (129 steps per ms) remains 1/1 properties
[2024-05-24 03:55:47] [INFO ] Flow matrix only has 48 transitions (discarded 2 similar events)
// Phase 1: matrix 48 rows 44 cols
[2024-05-24 03:55:47] [INFO ] Computed 10 invariants in 1 ms
[2024-05-24 03:55:47] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 26/34 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 48/82 variables, 34/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 14/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/82 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 10/92 variables, 10/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/92 variables, 4/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 03:55:47] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 0 ms to minimize.
[2024-05-24 03:55:47] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 0 ms to minimize.
[2024-05-24 03:55:47] [INFO ] Deduced a trap composed of 12 places in 288 ms of which 12 ms to minimize.
Problem AtomicPropp4 is UNSAT
After SMT solving in domain Real declared 92/92 variables, and 71 constraints, problems are : Problem set: 1 solved, 0 unsolved in 410 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 44/44 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 417ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA LamportFastMutEx-COL-2-LTLFireability-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
Computed a total of 1 stabilizing places and 2 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F(G((p1 U p2)))))'
Support contains 13 out of 44 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 44/44 places, 50/50 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 42 transition count 48
Applied a total of 4 rules in 11 ms. Remains 42 /44 variables (removed 2) and now considering 48/50 (removed 2) transitions.
[2024-05-24 03:55:48] [INFO ] Flow matrix only has 46 transitions (discarded 2 similar events)
// Phase 1: matrix 46 rows 42 cols
[2024-05-24 03:55:48] [INFO ] Computed 10 invariants in 1 ms
[2024-05-24 03:55:48] [INFO ] Implicit Places using invariants in 42 ms returned [28, 29]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 44 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 40/44 places, 48/50 transitions.
Applied a total of 0 rules in 3 ms. Remains 40 /40 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 58 ms. Remains : 40/44 places, 48/50 transitions.
Stuttering acceptance computed with spot in 230 ms :[(AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2)]
Running random walk in product with property : LamportFastMutEx-COL-2-LTLFireability-00
Product exploration explored 100000 steps with 336 reset in 359 ms.
Stack based approach found an accepted trace after 54 steps with 0 reset with depth 55 and stack size 55 in 1 ms.
FORMULA LamportFastMutEx-COL-2-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property LamportFastMutEx-COL-2-LTLFireability-00 finished in 713 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 11 out of 44 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 44/44 places, 50/50 transitions.
Applied a total of 0 rules in 2 ms. Remains 44 /44 variables (removed 0) and now considering 50/50 (removed 0) transitions.
[2024-05-24 03:55:48] [INFO ] Flow matrix only has 48 transitions (discarded 2 similar events)
// Phase 1: matrix 48 rows 44 cols
[2024-05-24 03:55:48] [INFO ] Computed 10 invariants in 2 ms
[2024-05-24 03:55:48] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-24 03:55:48] [INFO ] Flow matrix only has 48 transitions (discarded 2 similar events)
[2024-05-24 03:55:48] [INFO ] Invariant cache hit.
[2024-05-24 03:55:48] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-24 03:55:49] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
[2024-05-24 03:55:49] [INFO ] Redundant transitions in 0 ms returned []
Running 48 sub problems to find dead transitions.
[2024-05-24 03:55:49] [INFO ] Flow matrix only has 48 transitions (discarded 2 similar events)
[2024-05-24 03:55:49] [INFO ] Invariant cache hit.
[2024-05-24 03:55:49] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (OVERLAPS) 2/44 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-05-24 03:55:49] [INFO ] Deduced a trap composed of 6 places in 50 ms of which 2 ms to minimize.
[2024-05-24 03:55:49] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 2 ms to minimize.
[2024-05-24 03:55:49] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 5 ms to minimize.
[2024-05-24 03:55:49] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2024-05-24 03:55:49] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 1 ms to minimize.
[2024-05-24 03:55:49] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 1 ms to minimize.
[2024-05-24 03:55:49] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 1 ms to minimize.
[2024-05-24 03:55:49] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 4 ms to minimize.
[2024-05-24 03:55:49] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 1 ms to minimize.
[2024-05-24 03:55:49] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 0 ms to minimize.
[2024-05-24 03:55:49] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 0 ms to minimize.
[2024-05-24 03:55:49] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 1 ms to minimize.
[2024-05-24 03:55:49] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 1 ms to minimize.
[2024-05-24 03:55:49] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 1 ms to minimize.
[2024-05-24 03:55:49] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 0 ms to minimize.
[2024-05-24 03:55:49] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
[2024-05-24 03:55:49] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 1 ms to minimize.
[2024-05-24 03:55:49] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 1 ms to minimize.
[2024-05-24 03:55:49] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 1 ms to minimize.
[2024-05-24 03:55:49] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-05-24 03:55:49] [INFO ] Deduced a trap composed of 11 places in 18 ms of which 0 ms to minimize.
[2024-05-24 03:55:49] [INFO ] Deduced a trap composed of 9 places in 17 ms of which 0 ms to minimize.
[2024-05-24 03:55:49] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
[2024-05-24 03:55:50] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 1 ms to minimize.
[2024-05-24 03:55:50] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 1 ms to minimize.
[2024-05-24 03:55:50] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 6/36 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-05-24 03:55:50] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/44 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (OVERLAPS) 48/92 variables, 44/81 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/92 variables, 14/95 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-05-24 03:55:50] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/92 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/92 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 11 (OVERLAPS) 0/92 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Real declared 92/92 variables, and 96 constraints, problems are : Problem set: 0 solved, 48 unsolved in 1821 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 44/44 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 28/28 constraints]
Escalating to Integer solving :Problem set: 0 solved, 48 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 16/20 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (OVERLAPS) 2/44 variables, 6/26 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 12/38 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (OVERLAPS) 48/92 variables, 44/82 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/92 variables, 14/96 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/92 variables, 48/144 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-05-24 03:55:51] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 8 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/92 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/92 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-05-24 03:55:51] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 1 ms to minimize.
[2024-05-24 03:55:51] [INFO ] Deduced a trap composed of 6 places in 18 ms of which 0 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/92 variables, 2/147 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/92 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 13 (OVERLAPS) 0/92 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Int declared 92/92 variables, and 147 constraints, problems are : Problem set: 0 solved, 48 unsolved in 1419 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 44/44 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 31/31 constraints]
After SMT, in 3253ms problems are : Problem set: 0 solved, 48 unsolved
Search for dead transitions found 0 dead transitions in 3254ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 3358 ms. Remains : 44/44 places, 50/50 transitions.
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : LamportFastMutEx-COL-2-LTLFireability-02
Product exploration explored 100000 steps with 2777 reset in 160 ms.
Product exploration explored 100000 steps with 2718 reset in 189 ms.
Computed a total of 1 stabilizing places and 2 stable transitions
Computed a total of 1 stabilizing places and 2 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 73 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 70 steps (0 resets) in 5 ms. (11 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 247 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Support contains 11 out of 44 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 44/44 places, 50/50 transitions.
Applied a total of 0 rules in 4 ms. Remains 44 /44 variables (removed 0) and now considering 50/50 (removed 0) transitions.
[2024-05-24 03:55:53] [INFO ] Flow matrix only has 48 transitions (discarded 2 similar events)
[2024-05-24 03:55:53] [INFO ] Invariant cache hit.
[2024-05-24 03:55:53] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-24 03:55:53] [INFO ] Flow matrix only has 48 transitions (discarded 2 similar events)
[2024-05-24 03:55:53] [INFO ] Invariant cache hit.
[2024-05-24 03:55:53] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-24 03:55:53] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 119 ms to find 0 implicit places.
[2024-05-24 03:55:53] [INFO ] Redundant transitions in 0 ms returned []
Running 48 sub problems to find dead transitions.
[2024-05-24 03:55:53] [INFO ] Flow matrix only has 48 transitions (discarded 2 similar events)
[2024-05-24 03:55:53] [INFO ] Invariant cache hit.
[2024-05-24 03:55:53] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (OVERLAPS) 2/44 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-05-24 03:55:53] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 1 ms to minimize.
[2024-05-24 03:55:53] [INFO ] Deduced a trap composed of 8 places in 19 ms of which 0 ms to minimize.
[2024-05-24 03:55:53] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-24 03:55:53] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-24 03:55:53] [INFO ] Deduced a trap composed of 16 places in 21 ms of which 1 ms to minimize.
[2024-05-24 03:55:53] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-05-24 03:55:53] [INFO ] Deduced a trap composed of 16 places in 20 ms of which 1 ms to minimize.
[2024-05-24 03:55:53] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 1 ms to minimize.
[2024-05-24 03:55:53] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
[2024-05-24 03:55:53] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
[2024-05-24 03:55:53] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 0 ms to minimize.
[2024-05-24 03:55:53] [INFO ] Deduced a trap composed of 11 places in 21 ms of which 1 ms to minimize.
[2024-05-24 03:55:53] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 1 ms to minimize.
[2024-05-24 03:55:53] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 1 ms to minimize.
[2024-05-24 03:55:53] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 0 ms to minimize.
[2024-05-24 03:55:53] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
[2024-05-24 03:55:53] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 0 ms to minimize.
[2024-05-24 03:55:53] [INFO ] Deduced a trap composed of 11 places in 19 ms of which 1 ms to minimize.
[2024-05-24 03:55:54] [INFO ] Deduced a trap composed of 8 places in 19 ms of which 0 ms to minimize.
[2024-05-24 03:55:54] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-05-24 03:55:54] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 1 ms to minimize.
[2024-05-24 03:55:54] [INFO ] Deduced a trap composed of 9 places in 17 ms of which 0 ms to minimize.
[2024-05-24 03:55:54] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 0 ms to minimize.
[2024-05-24 03:55:54] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 1 ms to minimize.
[2024-05-24 03:55:54] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 1 ms to minimize.
[2024-05-24 03:55:54] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 6/36 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-05-24 03:55:54] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/44 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (OVERLAPS) 48/92 variables, 44/81 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/92 variables, 14/95 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-05-24 03:55:54] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/92 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/92 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 11 (OVERLAPS) 0/92 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Real declared 92/92 variables, and 96 constraints, problems are : Problem set: 0 solved, 48 unsolved in 1611 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 44/44 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 28/28 constraints]
Escalating to Integer solving :Problem set: 0 solved, 48 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 16/20 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (OVERLAPS) 2/44 variables, 6/26 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 12/38 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (OVERLAPS) 48/92 variables, 44/82 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/92 variables, 14/96 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/92 variables, 48/144 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-05-24 03:55:55] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/92 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/92 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-05-24 03:55:55] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
[2024-05-24 03:55:55] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/92 variables, 2/147 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/92 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 13 (OVERLAPS) 0/92 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Int declared 92/92 variables, and 147 constraints, problems are : Problem set: 0 solved, 48 unsolved in 1281 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 44/44 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 31/31 constraints]
After SMT, in 2902ms problems are : Problem set: 0 solved, 48 unsolved
Search for dead transitions found 0 dead transitions in 2903ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 3030 ms. Remains : 44/44 places, 50/50 transitions.
Computed a total of 1 stabilizing places and 2 stable transitions
Computed a total of 1 stabilizing places and 2 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 74 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 96 steps (0 resets) in 4 ms. (19 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 91 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2679 reset in 120 ms.
Product exploration explored 100000 steps with 2709 reset in 135 ms.
Support contains 11 out of 44 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 44/44 places, 50/50 transitions.
Applied a total of 0 rules in 3 ms. Remains 44 /44 variables (removed 0) and now considering 50/50 (removed 0) transitions.
[2024-05-24 03:55:57] [INFO ] Flow matrix only has 48 transitions (discarded 2 similar events)
[2024-05-24 03:55:57] [INFO ] Invariant cache hit.
[2024-05-24 03:55:57] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-24 03:55:57] [INFO ] Flow matrix only has 48 transitions (discarded 2 similar events)
[2024-05-24 03:55:57] [INFO ] Invariant cache hit.
[2024-05-24 03:55:57] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-24 03:55:57] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
[2024-05-24 03:55:57] [INFO ] Redundant transitions in 0 ms returned []
Running 48 sub problems to find dead transitions.
[2024-05-24 03:55:57] [INFO ] Flow matrix only has 48 transitions (discarded 2 similar events)
[2024-05-24 03:55:57] [INFO ] Invariant cache hit.
[2024-05-24 03:55:57] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (OVERLAPS) 2/44 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-05-24 03:55:57] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 1 ms to minimize.
[2024-05-24 03:55:57] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 0 ms to minimize.
[2024-05-24 03:55:57] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-24 03:55:57] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-24 03:55:57] [INFO ] Deduced a trap composed of 16 places in 20 ms of which 0 ms to minimize.
[2024-05-24 03:55:57] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 1 ms to minimize.
[2024-05-24 03:55:57] [INFO ] Deduced a trap composed of 16 places in 19 ms of which 0 ms to minimize.
[2024-05-24 03:55:57] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 1 ms to minimize.
[2024-05-24 03:55:57] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-05-24 03:55:57] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 0 ms to minimize.
[2024-05-24 03:55:57] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 0 ms to minimize.
[2024-05-24 03:55:57] [INFO ] Deduced a trap composed of 11 places in 20 ms of which 0 ms to minimize.
[2024-05-24 03:55:57] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 1 ms to minimize.
[2024-05-24 03:55:57] [INFO ] Deduced a trap composed of 11 places in 21 ms of which 1 ms to minimize.
[2024-05-24 03:55:57] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 0 ms to minimize.
[2024-05-24 03:55:57] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2024-05-24 03:55:57] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 0 ms to minimize.
[2024-05-24 03:55:57] [INFO ] Deduced a trap composed of 11 places in 20 ms of which 0 ms to minimize.
[2024-05-24 03:55:57] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 0 ms to minimize.
[2024-05-24 03:55:57] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-05-24 03:55:57] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 1 ms to minimize.
[2024-05-24 03:55:57] [INFO ] Deduced a trap composed of 9 places in 16 ms of which 0 ms to minimize.
[2024-05-24 03:55:57] [INFO ] Deduced a trap composed of 13 places in 21 ms of which 0 ms to minimize.
[2024-05-24 03:55:57] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 1 ms to minimize.
[2024-05-24 03:55:58] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 1 ms to minimize.
[2024-05-24 03:55:58] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 6/36 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-05-24 03:55:58] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/44 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (OVERLAPS) 48/92 variables, 44/81 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/92 variables, 14/95 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-05-24 03:55:58] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/92 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/92 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 11 (OVERLAPS) 0/92 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Real declared 92/92 variables, and 96 constraints, problems are : Problem set: 0 solved, 48 unsolved in 1640 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 44/44 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 28/28 constraints]
Escalating to Integer solving :Problem set: 0 solved, 48 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 16/20 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (OVERLAPS) 2/44 variables, 6/26 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 12/38 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (OVERLAPS) 48/92 variables, 44/82 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/92 variables, 14/96 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/92 variables, 48/144 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-05-24 03:55:59] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/92 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/92 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-05-24 03:55:59] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
[2024-05-24 03:55:59] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/92 variables, 2/147 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/92 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 13 (OVERLAPS) 0/92 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Int declared 92/92 variables, and 147 constraints, problems are : Problem set: 0 solved, 48 unsolved in 1361 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 44/44 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 31/31 constraints]
After SMT, in 3011ms problems are : Problem set: 0 solved, 48 unsolved
Search for dead transitions found 0 dead transitions in 3012ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 3128 ms. Remains : 44/44 places, 50/50 transitions.
Treatment of property LamportFastMutEx-COL-2-LTLFireability-02 finished in 11265 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(p0)) U (!p0 U X(G(p1)))))'
Support contains 7 out of 44 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 44/44 places, 50/50 transitions.
Applied a total of 0 rules in 1 ms. Remains 44 /44 variables (removed 0) and now considering 50/50 (removed 0) transitions.
[2024-05-24 03:56:00] [INFO ] Flow matrix only has 48 transitions (discarded 2 similar events)
[2024-05-24 03:56:00] [INFO ] Invariant cache hit.
[2024-05-24 03:56:00] [INFO ] Implicit Places using invariants in 39 ms returned [30, 31]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 39 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 42/44 places, 50/50 transitions.
Applied a total of 0 rules in 1 ms. Remains 42 /42 variables (removed 0) and now considering 50/50 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 41 ms. Remains : 42/44 places, 50/50 transitions.
Stuttering acceptance computed with spot in 302 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p0), true, (NOT p1), (NOT p1)]
Running random walk in product with property : LamportFastMutEx-COL-2-LTLFireability-03
Entered a terminal (fully accepting) state of product in 11 steps with 1 reset in 0 ms.
FORMULA LamportFastMutEx-COL-2-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LamportFastMutEx-COL-2-LTLFireability-03 finished in 361 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(F(!p0))&&(G(!p1)||X(G(p2))))))'
Support contains 14 out of 44 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 44/44 places, 50/50 transitions.
Applied a total of 0 rules in 1 ms. Remains 44 /44 variables (removed 0) and now considering 50/50 (removed 0) transitions.
[2024-05-24 03:56:00] [INFO ] Flow matrix only has 48 transitions (discarded 2 similar events)
[2024-05-24 03:56:00] [INFO ] Invariant cache hit.
[2024-05-24 03:56:00] [INFO ] Implicit Places using invariants in 35 ms returned [30, 31]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 35 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 42/44 places, 50/50 transitions.
Applied a total of 0 rules in 2 ms. Remains 42 /42 variables (removed 0) and now considering 50/50 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 38 ms. Remains : 42/44 places, 50/50 transitions.
Stuttering acceptance computed with spot in 252 ms :[(OR p0 (AND p1 (NOT p2))), (OR p0 (AND p1 (NOT p2))), p0, (NOT p2), (AND (NOT p2) p1), true, p1]
Running random walk in product with property : LamportFastMutEx-COL-2-LTLFireability-04
Entered a terminal (fully accepting) state of product in 7 steps with 0 reset in 0 ms.
FORMULA LamportFastMutEx-COL-2-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LamportFastMutEx-COL-2-LTLFireability-04 finished in 314 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((!p1 U (p2||G(!p1)))||p0)))'
Support contains 19 out of 44 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 44/44 places, 50/50 transitions.
Applied a total of 0 rules in 1 ms. Remains 44 /44 variables (removed 0) and now considering 50/50 (removed 0) transitions.
[2024-05-24 03:56:00] [INFO ] Flow matrix only has 48 transitions (discarded 2 similar events)
[2024-05-24 03:56:00] [INFO ] Invariant cache hit.
[2024-05-24 03:56:00] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-24 03:56:00] [INFO ] Flow matrix only has 48 transitions (discarded 2 similar events)
[2024-05-24 03:56:00] [INFO ] Invariant cache hit.
[2024-05-24 03:56:00] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-24 03:56:00] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
Running 48 sub problems to find dead transitions.
[2024-05-24 03:56:00] [INFO ] Flow matrix only has 48 transitions (discarded 2 similar events)
[2024-05-24 03:56:00] [INFO ] Invariant cache hit.
[2024-05-24 03:56:00] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (OVERLAPS) 2/44 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-05-24 03:56:01] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 1 ms to minimize.
[2024-05-24 03:56:01] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 0 ms to minimize.
[2024-05-24 03:56:01] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-24 03:56:01] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-24 03:56:01] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
[2024-05-24 03:56:01] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
[2024-05-24 03:56:01] [INFO ] Deduced a trap composed of 16 places in 19 ms of which 0 ms to minimize.
[2024-05-24 03:56:01] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-05-24 03:56:01] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 0 ms to minimize.
[2024-05-24 03:56:01] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
[2024-05-24 03:56:01] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 1 ms to minimize.
[2024-05-24 03:56:01] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 1 ms to minimize.
[2024-05-24 03:56:01] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 0 ms to minimize.
[2024-05-24 03:56:01] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 1 ms to minimize.
[2024-05-24 03:56:01] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 0 ms to minimize.
[2024-05-24 03:56:01] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2024-05-24 03:56:01] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 1 ms to minimize.
[2024-05-24 03:56:01] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 1 ms to minimize.
[2024-05-24 03:56:01] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 1 ms to minimize.
[2024-05-24 03:56:01] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-05-24 03:56:01] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 0 ms to minimize.
[2024-05-24 03:56:01] [INFO ] Deduced a trap composed of 9 places in 17 ms of which 0 ms to minimize.
[2024-05-24 03:56:01] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 2 ms to minimize.
[2024-05-24 03:56:01] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 1 ms to minimize.
[2024-05-24 03:56:01] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 0 ms to minimize.
[2024-05-24 03:56:01] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 6/36 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-05-24 03:56:01] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/44 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (OVERLAPS) 48/92 variables, 44/81 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/92 variables, 14/95 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-05-24 03:56:02] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/92 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/92 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 11 (OVERLAPS) 0/92 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Real declared 92/92 variables, and 96 constraints, problems are : Problem set: 0 solved, 48 unsolved in 1596 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 44/44 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 28/28 constraints]
Escalating to Integer solving :Problem set: 0 solved, 48 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 16/20 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (OVERLAPS) 2/44 variables, 6/26 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 12/38 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (OVERLAPS) 48/92 variables, 44/82 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/92 variables, 14/96 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/92 variables, 48/144 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-05-24 03:56:02] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/92 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/92 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-05-24 03:56:03] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 0 ms to minimize.
[2024-05-24 03:56:03] [INFO ] Deduced a trap composed of 6 places in 17 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/92 variables, 2/147 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/92 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 13 (OVERLAPS) 0/92 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Int declared 92/92 variables, and 147 constraints, problems are : Problem set: 0 solved, 48 unsolved in 1357 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 44/44 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 31/31 constraints]
After SMT, in 2963ms problems are : Problem set: 0 solved, 48 unsolved
Search for dead transitions found 0 dead transitions in 2964ms
Finished structural reductions in LTL mode , in 1 iterations and 3040 ms. Remains : 44/44 places, 50/50 transitions.
Stuttering acceptance computed with spot in 120 ms :[true, (AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) p1), (AND (NOT p2) p1 (NOT p0))]
Running random walk in product with property : LamportFastMutEx-COL-2-LTLFireability-05
Product exploration explored 100000 steps with 50000 reset in 136 ms.
Product exploration explored 100000 steps with 50000 reset in 136 ms.
Computed a total of 1 stabilizing places and 2 stable transitions
Computed a total of 1 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X p2), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT p0)), (X (NOT p1)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 11 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA LamportFastMutEx-COL-2-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property LamportFastMutEx-COL-2-LTLFireability-05 finished in 3461 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(!p1)&&p0)))'
Support contains 10 out of 44 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 44/44 places, 50/50 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 42 transition count 48
Applied a total of 4 rules in 4 ms. Remains 42 /44 variables (removed 2) and now considering 48/50 (removed 2) transitions.
[2024-05-24 03:56:04] [INFO ] Flow matrix only has 46 transitions (discarded 2 similar events)
// Phase 1: matrix 46 rows 42 cols
[2024-05-24 03:56:04] [INFO ] Computed 10 invariants in 1 ms
[2024-05-24 03:56:04] [INFO ] Implicit Places using invariants in 32 ms returned [28, 29]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 34 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 40/44 places, 48/50 transitions.
Applied a total of 0 rules in 3 ms. Remains 40 /40 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 41 ms. Remains : 40/44 places, 48/50 transitions.
Stuttering acceptance computed with spot in 87 ms :[(OR (NOT p0) p1), p1]
Running random walk in product with property : LamportFastMutEx-COL-2-LTLFireability-06
Product exploration explored 100000 steps with 0 reset in 127 ms.
Stack based approach found an accepted trace after 52 steps with 0 reset with depth 53 and stack size 53 in 0 ms.
FORMULA LamportFastMutEx-COL-2-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property LamportFastMutEx-COL-2-LTLFireability-06 finished in 267 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X(F(p1))&&p0))))'
Support contains 7 out of 44 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 44/44 places, 50/50 transitions.
Applied a total of 0 rules in 1 ms. Remains 44 /44 variables (removed 0) and now considering 50/50 (removed 0) transitions.
[2024-05-24 03:56:04] [INFO ] Flow matrix only has 48 transitions (discarded 2 similar events)
// Phase 1: matrix 48 rows 44 cols
[2024-05-24 03:56:04] [INFO ] Computed 10 invariants in 2 ms
[2024-05-24 03:56:04] [INFO ] Implicit Places using invariants in 42 ms returned [30, 31]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 43 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 42/44 places, 50/50 transitions.
Applied a total of 0 rules in 0 ms. Remains 42 /42 variables (removed 0) and now considering 50/50 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 44 ms. Remains : 42/44 places, 50/50 transitions.
Stuttering acceptance computed with spot in 98 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : LamportFastMutEx-COL-2-LTLFireability-07
Product exploration explored 100000 steps with 6270 reset in 83 ms.
Stack based approach found an accepted trace after 32 steps with 1 reset with depth 22 and stack size 22 in 0 ms.
FORMULA LamportFastMutEx-COL-2-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property LamportFastMutEx-COL-2-LTLFireability-07 finished in 241 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 5 out of 44 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 44/44 places, 50/50 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 42 transition count 48
Applied a total of 4 rules in 3 ms. Remains 42 /44 variables (removed 2) and now considering 48/50 (removed 2) transitions.
[2024-05-24 03:56:04] [INFO ] Flow matrix only has 46 transitions (discarded 2 similar events)
// Phase 1: matrix 46 rows 42 cols
[2024-05-24 03:56:04] [INFO ] Computed 10 invariants in 1 ms
[2024-05-24 03:56:04] [INFO ] Implicit Places using invariants in 38 ms returned [28, 29]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 39 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 40/44 places, 48/50 transitions.
Applied a total of 0 rules in 1 ms. Remains 40 /40 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 45 ms. Remains : 40/44 places, 48/50 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : LamportFastMutEx-COL-2-LTLFireability-08
Product exploration explored 100000 steps with 1396 reset in 98 ms.
Stack based approach found an accepted trace after 26 steps with 0 reset with depth 27 and stack size 27 in 0 ms.
FORMULA LamportFastMutEx-COL-2-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property LamportFastMutEx-COL-2-LTLFireability-08 finished in 196 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p0)||X(F(!p1))))))'
Support contains 11 out of 44 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 44/44 places, 50/50 transitions.
Applied a total of 0 rules in 3 ms. Remains 44 /44 variables (removed 0) and now considering 50/50 (removed 0) transitions.
[2024-05-24 03:56:05] [INFO ] Flow matrix only has 48 transitions (discarded 2 similar events)
// Phase 1: matrix 48 rows 44 cols
[2024-05-24 03:56:05] [INFO ] Computed 10 invariants in 1 ms
[2024-05-24 03:56:05] [INFO ] Implicit Places using invariants in 35 ms returned [30, 31]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 36 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 42/44 places, 50/50 transitions.
Applied a total of 0 rules in 1 ms. Remains 42 /42 variables (removed 0) and now considering 50/50 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 40 ms. Remains : 42/44 places, 50/50 transitions.
Stuttering acceptance computed with spot in 212 ms :[p1, (AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Running random walk in product with property : LamportFastMutEx-COL-2-LTLFireability-09
Product exploration explored 100000 steps with 25000 reset in 88 ms.
Product exploration explored 100000 steps with 25000 reset in 99 ms.
Computed a total of 1 stabilizing places and 2 stable transitions
Computed a total of 1 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 72 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 124 ms :[p1, p1, p1, p1]
RANDOM walk for 39 steps (0 resets) in 4 ms. (7 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 2 factoid took 87 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 141 ms :[p1, p1, p1, p1]
Stuttering acceptance computed with spot in 132 ms :[p1, p1, p1, p1]
Support contains 6 out of 42 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 42/42 places, 50/50 transitions.
Applied a total of 0 rules in 2 ms. Remains 42 /42 variables (removed 0) and now considering 50/50 (removed 0) transitions.
[2024-05-24 03:56:06] [INFO ] Flow matrix only has 48 transitions (discarded 2 similar events)
// Phase 1: matrix 48 rows 42 cols
[2024-05-24 03:56:06] [INFO ] Computed 8 invariants in 0 ms
[2024-05-24 03:56:06] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-24 03:56:06] [INFO ] Flow matrix only has 48 transitions (discarded 2 similar events)
[2024-05-24 03:56:06] [INFO ] Invariant cache hit.
[2024-05-24 03:56:06] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-24 03:56:06] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
Running 48 sub problems to find dead transitions.
[2024-05-24 03:56:06] [INFO ] Flow matrix only has 48 transitions (discarded 2 similar events)
[2024-05-24 03:56:06] [INFO ] Invariant cache hit.
[2024-05-24 03:56:06] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (OVERLAPS) 2/42 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-05-24 03:56:06] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 1 ms to minimize.
[2024-05-24 03:56:06] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 0 ms to minimize.
[2024-05-24 03:56:06] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-24 03:56:06] [INFO ] Deduced a trap composed of 6 places in 17 ms of which 0 ms to minimize.
[2024-05-24 03:56:06] [INFO ] Deduced a trap composed of 14 places in 19 ms of which 1 ms to minimize.
[2024-05-24 03:56:06] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 0 ms to minimize.
[2024-05-24 03:56:06] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
[2024-05-24 03:56:06] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 1 ms to minimize.
[2024-05-24 03:56:06] [INFO ] Deduced a trap composed of 7 places in 19 ms of which 0 ms to minimize.
[2024-05-24 03:56:06] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
[2024-05-24 03:56:06] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 1 ms to minimize.
[2024-05-24 03:56:06] [INFO ] Deduced a trap composed of 11 places in 19 ms of which 1 ms to minimize.
[2024-05-24 03:56:06] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 1 ms to minimize.
[2024-05-24 03:56:06] [INFO ] Deduced a trap composed of 9 places in 16 ms of which 0 ms to minimize.
[2024-05-24 03:56:06] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 1 ms to minimize.
[2024-05-24 03:56:06] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 0 ms to minimize.
[2024-05-24 03:56:06] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 1 ms to minimize.
[2024-05-24 03:56:06] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 1 ms to minimize.
[2024-05-24 03:56:06] [INFO ] Deduced a trap composed of 9 places in 14 ms of which 1 ms to minimize.
[2024-05-24 03:56:06] [INFO ] Deduced a trap composed of 10 places in 18 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-05-24 03:56:06] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-24 03:56:06] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2024-05-24 03:56:06] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 1 ms to minimize.
[2024-05-24 03:56:06] [INFO ] Deduced a trap composed of 10 places in 17 ms of which 1 ms to minimize.
[2024-05-24 03:56:06] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-24 03:56:07] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
[2024-05-24 03:56:07] [INFO ] Deduced a trap composed of 10 places in 16 ms of which 1 ms to minimize.
[2024-05-24 03:56:07] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 8/36 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-05-24 03:56:07] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/42 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/42 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (OVERLAPS) 48/90 variables, 42/79 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/90 variables, 10/89 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/90 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 10 (OVERLAPS) 0/90 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Real declared 90/90 variables, and 89 constraints, problems are : Problem set: 0 solved, 48 unsolved in 1520 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 42/42 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 29/29 constraints]
Escalating to Integer solving :Problem set: 0 solved, 48 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 16/20 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (OVERLAPS) 2/42 variables, 4/24 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 13/37 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/42 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (OVERLAPS) 48/90 variables, 42/79 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/90 variables, 10/89 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/90 variables, 48/137 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-05-24 03:56:08] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/90 variables, 1/138 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-05-24 03:56:08] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/90 variables, 1/139 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/90 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 12 (OVERLAPS) 0/90 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Int declared 90/90 variables, and 139 constraints, problems are : Problem set: 0 solved, 48 unsolved in 1144 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 42/42 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 31/31 constraints]
After SMT, in 2674ms problems are : Problem set: 0 solved, 48 unsolved
Search for dead transitions found 0 dead transitions in 2674ms
Finished structural reductions in LTL mode , in 1 iterations and 2759 ms. Remains : 42/42 places, 50/50 transitions.
Computed a total of 1 stabilizing places and 2 stable transitions
Computed a total of 1 stabilizing places and 2 stable transitions
Knowledge obtained : [(NOT p1)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 81 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 122 ms :[p1, p1, p1, p1]
RANDOM walk for 82 steps (0 resets) in 4 ms. (16 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p1)]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 1 factoid took 97 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 135 ms :[p1, p1, p1, p1]
Stuttering acceptance computed with spot in 133 ms :[p1, p1, p1, p1]
Stuttering acceptance computed with spot in 124 ms :[p1, p1, p1, p1]
Product exploration explored 100000 steps with 25000 reset in 69 ms.
Product exploration explored 100000 steps with 25000 reset in 73 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 145 ms :[p1, p1, p1, p1]
Support contains 6 out of 42 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 42/42 places, 50/50 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 42 transition count 54
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 42 transition count 54
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 42 transition count 54
Deduced a syphon composed of 4 places in 0 ms
Applied a total of 4 rules in 9 ms. Remains 42 /42 variables (removed 0) and now considering 54/50 (removed -4) transitions.
[2024-05-24 03:56:10] [INFO ] Redundant transitions in 1 ms returned []
Running 52 sub problems to find dead transitions.
[2024-05-24 03:56:10] [INFO ] Flow matrix only has 50 transitions (discarded 4 similar events)
// Phase 1: matrix 50 rows 42 cols
[2024-05-24 03:56:10] [INFO ] Computed 8 invariants in 0 ms
[2024-05-24 03:56:10] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (OVERLAPS) 2/42 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 52 unsolved
[2024-05-24 03:56:10] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 0 ms to minimize.
[2024-05-24 03:56:10] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 0 ms to minimize.
[2024-05-24 03:56:10] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-24 03:56:10] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 0 ms to minimize.
[2024-05-24 03:56:10] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-24 03:56:10] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 1 ms to minimize.
[2024-05-24 03:56:10] [INFO ] Deduced a trap composed of 13 places in 20 ms of which 1 ms to minimize.
[2024-05-24 03:56:10] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 1 ms to minimize.
[2024-05-24 03:56:10] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 1 ms to minimize.
[2024-05-24 03:56:10] [INFO ] Deduced a trap composed of 9 places in 17 ms of which 1 ms to minimize.
[2024-05-24 03:56:10] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 0 ms to minimize.
[2024-05-24 03:56:10] [INFO ] Deduced a trap composed of 11 places in 18 ms of which 1 ms to minimize.
[2024-05-24 03:56:10] [INFO ] Deduced a trap composed of 9 places in 15 ms of which 1 ms to minimize.
[2024-05-24 03:56:10] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 9 ms to minimize.
[2024-05-24 03:56:10] [INFO ] Deduced a trap composed of 7 places in 19 ms of which 1 ms to minimize.
[2024-05-24 03:56:10] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 1 ms to minimize.
[2024-05-24 03:56:10] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 1 ms to minimize.
[2024-05-24 03:56:10] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 1 ms to minimize.
[2024-05-24 03:56:10] [INFO ] Deduced a trap composed of 7 places in 21 ms of which 1 ms to minimize.
Problem TDEAD22 is UNSAT
[2024-05-24 03:56:10] [INFO ] Deduced a trap composed of 7 places in 19 ms of which 0 ms to minimize.
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 20/28 constraints. Problems are: Problem set: 8 solved, 44 unsolved
[2024-05-24 03:56:10] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
[2024-05-24 03:56:10] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 1 ms to minimize.
[2024-05-24 03:56:10] [INFO ] Deduced a trap composed of 12 places in 18 ms of which 0 ms to minimize.
[2024-05-24 03:56:10] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 1 ms to minimize.
[2024-05-24 03:56:10] [INFO ] Deduced a trap composed of 10 places in 18 ms of which 0 ms to minimize.
[2024-05-24 03:56:10] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 6/34 constraints. Problems are: Problem set: 8 solved, 44 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/42 variables, 0/34 constraints. Problems are: Problem set: 8 solved, 44 unsolved
At refinement iteration 6 (OVERLAPS) 50/92 variables, 42/76 constraints. Problems are: Problem set: 8 solved, 44 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/92 variables, 12/88 constraints. Problems are: Problem set: 8 solved, 44 unsolved
[2024-05-24 03:56:11] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/92 variables, 1/89 constraints. Problems are: Problem set: 8 solved, 44 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/92 variables, 0/89 constraints. Problems are: Problem set: 8 solved, 44 unsolved
[2024-05-24 03:56:11] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 0 ms to minimize.
[2024-05-24 03:56:11] [INFO ] Deduced a trap composed of 15 places in 22 ms of which 1 ms to minimize.
[2024-05-24 03:56:11] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 0 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/92 variables, 3/92 constraints. Problems are: Problem set: 8 solved, 44 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/92 variables, 0/92 constraints. Problems are: Problem set: 8 solved, 44 unsolved
At refinement iteration 12 (OVERLAPS) 0/92 variables, 0/92 constraints. Problems are: Problem set: 8 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Real declared 92/92 variables, and 92 constraints, problems are : Problem set: 8 solved, 44 unsolved in 1863 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 42/42 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 30/30 constraints]
Escalating to Integer solving :Problem set: 8 solved, 44 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 4/4 constraints. Problems are: Problem set: 8 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 13/17 constraints. Problems are: Problem set: 8 solved, 44 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/17 constraints. Problems are: Problem set: 8 solved, 44 unsolved
At refinement iteration 3 (OVERLAPS) 6/42 variables, 4/21 constraints. Problems are: Problem set: 8 solved, 44 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 17/38 constraints. Problems are: Problem set: 8 solved, 44 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/42 variables, 0/38 constraints. Problems are: Problem set: 8 solved, 44 unsolved
At refinement iteration 6 (OVERLAPS) 50/92 variables, 42/80 constraints. Problems are: Problem set: 8 solved, 44 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/92 variables, 12/92 constraints. Problems are: Problem set: 8 solved, 44 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/92 variables, 44/136 constraints. Problems are: Problem set: 8 solved, 44 unsolved
[2024-05-24 03:56:12] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/92 variables, 1/137 constraints. Problems are: Problem set: 8 solved, 44 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/92 variables, 0/137 constraints. Problems are: Problem set: 8 solved, 44 unsolved
At refinement iteration 11 (OVERLAPS) 0/92 variables, 0/137 constraints. Problems are: Problem set: 8 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Int declared 92/92 variables, and 137 constraints, problems are : Problem set: 8 solved, 44 unsolved in 810 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 42/42 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 44/52 constraints, Known Traps: 31/31 constraints]
After SMT, in 2684ms problems are : Problem set: 8 solved, 44 unsolved
Search for dead transitions found 8 dead transitions in 2685ms
Found 8 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 8 transitions
Dead transitions reduction (with SMT) removed 8 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 42/42 places, 46/50 transitions.
Graph (complete) has 147 edges and 42 vertex of which 38 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 4 ms. Remains 38 /42 variables (removed 4) and now considering 46/46 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 38/42 places, 46/50 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2703 ms. Remains : 38/42 places, 46/50 transitions.
Support contains 6 out of 42 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 42/42 places, 50/50 transitions.
Applied a total of 0 rules in 1 ms. Remains 42 /42 variables (removed 0) and now considering 50/50 (removed 0) transitions.
[2024-05-24 03:56:12] [INFO ] Flow matrix only has 48 transitions (discarded 2 similar events)
// Phase 1: matrix 48 rows 42 cols
[2024-05-24 03:56:12] [INFO ] Computed 8 invariants in 0 ms
[2024-05-24 03:56:12] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-24 03:56:12] [INFO ] Flow matrix only has 48 transitions (discarded 2 similar events)
[2024-05-24 03:56:12] [INFO ] Invariant cache hit.
[2024-05-24 03:56:12] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-24 03:56:12] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
Running 48 sub problems to find dead transitions.
[2024-05-24 03:56:12] [INFO ] Flow matrix only has 48 transitions (discarded 2 similar events)
[2024-05-24 03:56:12] [INFO ] Invariant cache hit.
[2024-05-24 03:56:12] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (OVERLAPS) 2/42 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-05-24 03:56:12] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 1 ms to minimize.
[2024-05-24 03:56:12] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 0 ms to minimize.
[2024-05-24 03:56:12] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-24 03:56:13] [INFO ] Deduced a trap composed of 6 places in 14 ms of which 0 ms to minimize.
[2024-05-24 03:56:13] [INFO ] Deduced a trap composed of 14 places in 20 ms of which 1 ms to minimize.
[2024-05-24 03:56:13] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 0 ms to minimize.
[2024-05-24 03:56:13] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 1 ms to minimize.
[2024-05-24 03:56:13] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 1 ms to minimize.
[2024-05-24 03:56:13] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 0 ms to minimize.
[2024-05-24 03:56:13] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 0 ms to minimize.
[2024-05-24 03:56:13] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
[2024-05-24 03:56:13] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 1 ms to minimize.
[2024-05-24 03:56:13] [INFO ] Deduced a trap composed of 12 places in 19 ms of which 1 ms to minimize.
[2024-05-24 03:56:13] [INFO ] Deduced a trap composed of 9 places in 15 ms of which 0 ms to minimize.
[2024-05-24 03:56:13] [INFO ] Deduced a trap composed of 11 places in 20 ms of which 0 ms to minimize.
[2024-05-24 03:56:13] [INFO ] Deduced a trap composed of 9 places in 16 ms of which 1 ms to minimize.
[2024-05-24 03:56:13] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 0 ms to minimize.
[2024-05-24 03:56:13] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 1 ms to minimize.
[2024-05-24 03:56:13] [INFO ] Deduced a trap composed of 9 places in 16 ms of which 1 ms to minimize.
[2024-05-24 03:56:13] [INFO ] Deduced a trap composed of 10 places in 18 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-05-24 03:56:13] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-24 03:56:13] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2024-05-24 03:56:13] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 1 ms to minimize.
[2024-05-24 03:56:13] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 1 ms to minimize.
[2024-05-24 03:56:13] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-24 03:56:13] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 1 ms to minimize.
[2024-05-24 03:56:13] [INFO ] Deduced a trap composed of 10 places in 15 ms of which 0 ms to minimize.
[2024-05-24 03:56:13] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 8/36 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-05-24 03:56:13] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/42 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/42 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (OVERLAPS) 48/90 variables, 42/79 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/90 variables, 10/89 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/90 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 10 (OVERLAPS) 0/90 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Real declared 90/90 variables, and 89 constraints, problems are : Problem set: 0 solved, 48 unsolved in 1461 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 42/42 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 29/29 constraints]
Escalating to Integer solving :Problem set: 0 solved, 48 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 16/20 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (OVERLAPS) 2/42 variables, 4/24 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 13/37 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/42 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (OVERLAPS) 48/90 variables, 42/79 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/90 variables, 10/89 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/90 variables, 48/137 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-05-24 03:56:14] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/90 variables, 1/138 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-05-24 03:56:14] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/90 variables, 1/139 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/90 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 12 (OVERLAPS) 0/90 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Int declared 90/90 variables, and 139 constraints, problems are : Problem set: 0 solved, 48 unsolved in 1139 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 42/42 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 31/31 constraints]
After SMT, in 2609ms problems are : Problem set: 0 solved, 48 unsolved
Search for dead transitions found 0 dead transitions in 2610ms
Finished structural reductions in LTL mode , in 1 iterations and 2691 ms. Remains : 42/42 places, 50/50 transitions.
Treatment of property LamportFastMutEx-COL-2-LTLFireability-09 finished in 10397 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0||F(!p1)))))'
Support contains 7 out of 44 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 44/44 places, 50/50 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 42 transition count 48
Applied a total of 4 rules in 2 ms. Remains 42 /44 variables (removed 2) and now considering 48/50 (removed 2) transitions.
[2024-05-24 03:56:15] [INFO ] Flow matrix only has 46 transitions (discarded 2 similar events)
// Phase 1: matrix 46 rows 42 cols
[2024-05-24 03:56:15] [INFO ] Computed 10 invariants in 0 ms
[2024-05-24 03:56:15] [INFO ] Implicit Places using invariants in 35 ms returned [28, 29]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 36 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 40/44 places, 48/50 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 40 transition count 46
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 38 transition count 46
Applied a total of 4 rules in 2 ms. Remains 38 /40 variables (removed 2) and now considering 46/48 (removed 2) transitions.
[2024-05-24 03:56:15] [INFO ] Flow matrix only has 44 transitions (discarded 2 similar events)
// Phase 1: matrix 44 rows 38 cols
[2024-05-24 03:56:15] [INFO ] Computed 8 invariants in 0 ms
[2024-05-24 03:56:15] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-24 03:56:15] [INFO ] Flow matrix only has 44 transitions (discarded 2 similar events)
[2024-05-24 03:56:15] [INFO ] Invariant cache hit.
[2024-05-24 03:56:15] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-24 03:56:15] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 165 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 38/44 places, 46/50 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 207 ms. Remains : 38/44 places, 46/50 transitions.
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Running random walk in product with property : LamportFastMutEx-COL-2-LTLFireability-10
Product exploration explored 100000 steps with 2169 reset in 101 ms.
Stack based approach found an accepted trace after 14595 steps with 304 reset with depth 13 and stack size 13 in 16 ms.
FORMULA LamportFastMutEx-COL-2-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property LamportFastMutEx-COL-2-LTLFireability-10 finished in 404 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&((X(p2)||p1) U X(p3))))'
Support contains 12 out of 44 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 44/44 places, 50/50 transitions.
Applied a total of 0 rules in 2 ms. Remains 44 /44 variables (removed 0) and now considering 50/50 (removed 0) transitions.
[2024-05-24 03:56:15] [INFO ] Flow matrix only has 48 transitions (discarded 2 similar events)
// Phase 1: matrix 48 rows 44 cols
[2024-05-24 03:56:15] [INFO ] Computed 10 invariants in 0 ms
[2024-05-24 03:56:15] [INFO ] Implicit Places using invariants in 36 ms returned [30, 31]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 37 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 42/44 places, 50/50 transitions.
Applied a total of 0 rules in 1 ms. Remains 42 /42 variables (removed 0) and now considering 50/50 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 40 ms. Remains : 42/44 places, 50/50 transitions.
Stuttering acceptance computed with spot in 164 ms :[(OR (NOT p0) (NOT p3)), (NOT p0), (AND (NOT p2) (NOT p3)), (NOT p3), true]
Running random walk in product with property : LamportFastMutEx-COL-2-LTLFireability-12
Entered a terminal (fully accepting) state of product in 7 steps with 0 reset in 0 ms.
FORMULA LamportFastMutEx-COL-2-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LamportFastMutEx-COL-2-LTLFireability-12 finished in 220 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 6 out of 44 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 44/44 places, 50/50 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 42 transition count 48
Applied a total of 4 rules in 7 ms. Remains 42 /44 variables (removed 2) and now considering 48/50 (removed 2) transitions.
[2024-05-24 03:56:16] [INFO ] Flow matrix only has 46 transitions (discarded 2 similar events)
// Phase 1: matrix 46 rows 42 cols
[2024-05-24 03:56:16] [INFO ] Computed 10 invariants in 1 ms
[2024-05-24 03:56:16] [INFO ] Implicit Places using invariants in 43 ms returned [28, 29]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 43 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 40/44 places, 48/50 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 40 transition count 46
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 38 transition count 46
Applied a total of 4 rules in 3 ms. Remains 38 /40 variables (removed 2) and now considering 46/48 (removed 2) transitions.
[2024-05-24 03:56:16] [INFO ] Flow matrix only has 44 transitions (discarded 2 similar events)
// Phase 1: matrix 44 rows 38 cols
[2024-05-24 03:56:16] [INFO ] Computed 8 invariants in 1 ms
[2024-05-24 03:56:16] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-24 03:56:16] [INFO ] Flow matrix only has 44 transitions (discarded 2 similar events)
[2024-05-24 03:56:16] [INFO ] Invariant cache hit.
[2024-05-24 03:56:16] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-24 03:56:16] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 38/44 places, 46/50 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 137 ms. Remains : 38/44 places, 46/50 transitions.
Stuttering acceptance computed with spot in 126 ms :[(NOT p0)]
Running random walk in product with property : LamportFastMutEx-COL-2-LTLFireability-13
Product exploration explored 100000 steps with 0 reset in 117 ms.
Stack based approach found an accepted trace after 17 steps with 0 reset with depth 18 and stack size 18 in 0 ms.
FORMULA LamportFastMutEx-COL-2-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property LamportFastMutEx-COL-2-LTLFireability-13 finished in 392 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!p0 U (G(!p0)||(X(F(p0))&&p1))))'
Support contains 7 out of 44 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 44/44 places, 50/50 transitions.
Applied a total of 0 rules in 1 ms. Remains 44 /44 variables (removed 0) and now considering 50/50 (removed 0) transitions.
[2024-05-24 03:56:16] [INFO ] Flow matrix only has 48 transitions (discarded 2 similar events)
// Phase 1: matrix 48 rows 44 cols
[2024-05-24 03:56:16] [INFO ] Computed 10 invariants in 1 ms
[2024-05-24 03:56:16] [INFO ] Implicit Places using invariants in 33 ms returned [30, 31]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 34 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 42/44 places, 50/50 transitions.
Applied a total of 0 rules in 0 ms. Remains 42 /42 variables (removed 0) and now considering 50/50 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 35 ms. Remains : 42/44 places, 50/50 transitions.
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p1) p0), true, (NOT p0)]
Running random walk in product with property : LamportFastMutEx-COL-2-LTLFireability-14
Initial state of product has no viable successors after 0 steps with 0 reset in 0 ms.
FORMULA LamportFastMutEx-COL-2-LTLFireability-14 TRUE TECHNIQUES STUTTER_TEST
Treatment of property LamportFastMutEx-COL-2-LTLFireability-14 finished in 134 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 44 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 44/44 places, 50/50 transitions.
Applied a total of 0 rules in 3 ms. Remains 44 /44 variables (removed 0) and now considering 50/50 (removed 0) transitions.
[2024-05-24 03:56:16] [INFO ] Flow matrix only has 48 transitions (discarded 2 similar events)
[2024-05-24 03:56:16] [INFO ] Invariant cache hit.
[2024-05-24 03:56:16] [INFO ] Implicit Places using invariants in 43 ms returned [30, 31]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 57 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 42/44 places, 50/50 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 42 transition count 48
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 40 transition count 48
Applied a total of 4 rules in 2 ms. Remains 40 /42 variables (removed 2) and now considering 48/50 (removed 2) transitions.
[2024-05-24 03:56:16] [INFO ] Flow matrix only has 46 transitions (discarded 2 similar events)
// Phase 1: matrix 46 rows 40 cols
[2024-05-24 03:56:16] [INFO ] Computed 8 invariants in 0 ms
[2024-05-24 03:56:16] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-05-24 03:56:16] [INFO ] Flow matrix only has 46 transitions (discarded 2 similar events)
[2024-05-24 03:56:16] [INFO ] Invariant cache hit.
[2024-05-24 03:56:16] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-24 03:56:16] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 40/44 places, 48/50 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 154 ms. Remains : 40/44 places, 48/50 transitions.
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : LamportFastMutEx-COL-2-LTLFireability-15
Product exploration explored 100000 steps with 6330 reset in 84 ms.
Stack based approach found an accepted trace after 14 steps with 0 reset with depth 15 and stack size 15 in 0 ms.
FORMULA LamportFastMutEx-COL-2-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property LamportFastMutEx-COL-2-LTLFireability-15 finished in 312 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p0)||X(F(!p1))))))'
[2024-05-24 03:56:17] [INFO ] Flatten gal took : 9 ms
[2024-05-24 03:56:17] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-05-24 03:56:17] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 44 places, 50 transitions and 208 arcs took 3 ms.
Total runtime 34905 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running LamportFastMutEx-COL-2

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/415/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 44
TRANSITIONS: 50
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.001s, Sys 0.000s]


SAVING FILE /home/mcc/execution/415/model (.net / .def) ...
EXPORT TIME: [User 0.000s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 1951
MODEL NAME: /home/mcc/execution/415/model
44 places, 50 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA LamportFastMutEx-COL-2-LTLFireability-02 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA LamportFastMutEx-COL-2-LTLFireability-09 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716522977719

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="LamportFastMutEx-COL-2"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is LamportFastMutEx-COL-2, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r223-tall-171649610900204"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/LamportFastMutEx-COL-2.tgz
mv LamportFastMutEx-COL-2 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;