Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r472-tajo-171620399000179.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is BridgeAndVehicles-PT-V20P10N10, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r472-tajo-171620399000179
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.3M
-rw-r--r-- 1 mcc users 14K Apr 13 01:26 CTLCardinality.txt
-rw-r--r-- 1 mcc users 98K Apr 13 01:26 CTLCardinality.xml
-rw-r--r-- 1 mcc users 84K Apr 13 01:24 CTLFireability.txt
-rw-r--r-- 1 mcc users 347K Apr 13 01:24 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 5.6K Apr 22 14:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Apr 22 14:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 16K Apr 22 14:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 22 14:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 13 01:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 87K Apr 13 01:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 207K Apr 13 01:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 842K Apr 13 01:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.8K Apr 22 14:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.8K Apr 22 14:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 434K 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 BridgeAndVehicles-PT-V20P10N10-LTLCardinality-00
FORMULA_NAME BridgeAndVehicles-PT-V20P10N10-LTLCardinality-01
FORMULA_NAME BridgeAndVehicles-PT-V20P10N10-LTLCardinality-02
FORMULA_NAME BridgeAndVehicles-PT-V20P10N10-LTLCardinality-03
FORMULA_NAME BridgeAndVehicles-PT-V20P10N10-LTLCardinality-04
FORMULA_NAME BridgeAndVehicles-PT-V20P10N10-LTLCardinality-05
FORMULA_NAME BridgeAndVehicles-PT-V20P10N10-LTLCardinality-06
FORMULA_NAME BridgeAndVehicles-PT-V20P10N10-LTLCardinality-07
FORMULA_NAME BridgeAndVehicles-PT-V20P10N10-LTLCardinality-08
FORMULA_NAME BridgeAndVehicles-PT-V20P10N10-LTLCardinality-09
FORMULA_NAME BridgeAndVehicles-PT-V20P10N10-LTLCardinality-10
FORMULA_NAME BridgeAndVehicles-PT-V20P10N10-LTLCardinality-11
FORMULA_NAME BridgeAndVehicles-PT-V20P10N10-LTLCardinality-12
FORMULA_NAME BridgeAndVehicles-PT-V20P10N10-LTLCardinality-13
FORMULA_NAME BridgeAndVehicles-PT-V20P10N10-LTLCardinality-14
FORMULA_NAME BridgeAndVehicles-PT-V20P10N10-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717219636780

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-PT-V20P10N10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 05:27:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 05:27:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 05:27:18] [INFO ] Load time of PNML (sax parser for PT used): 85 ms
[2024-06-01 05:27:18] [INFO ] Transformed 68 places.
[2024-06-01 05:27:18] [INFO ] Transformed 548 transitions.
[2024-06-01 05:27:18] [INFO ] Parsed PT model containing 68 places and 548 transitions and 4070 arcs in 192 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA BridgeAndVehicles-PT-V20P10N10-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V20P10N10-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V20P10N10-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V20P10N10-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V20P10N10-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 19 out of 68 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 548/548 transitions.
Applied a total of 0 rules in 17 ms. Remains 68 /68 variables (removed 0) and now considering 548/548 (removed 0) transitions.
Running 545 sub problems to find dead transitions.
[2024-06-01 05:27:18] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 68 cols
[2024-06-01 05:27:18] [INFO ] Computed 7 invariants in 13 ms
[2024-06-01 05:27:18] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 545 unsolved
[2024-06-01 05:27:20] [INFO ] Deduced a trap composed of 5 places in 85 ms of which 8 ms to minimize.
[2024-06-01 05:27:21] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 1 ms to minimize.
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
[2024-06-01 05:27:22] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 2 ms to minimize.
Problem TDEAD88 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD297 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 3/8 constraints. Problems are: Problem set: 40 solved, 505 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/8 constraints. Problems are: Problem set: 40 solved, 505 unsolved
At refinement iteration 3 (OVERLAPS) 2/68 variables, 2/10 constraints. Problems are: Problem set: 40 solved, 505 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/10 constraints. Problems are: Problem set: 40 solved, 505 unsolved
Problem TDEAD20 is UNSAT
Problem TDEAD65 is UNSAT
At refinement iteration 5 (OVERLAPS) 130/198 variables, 68/78 constraints. Problems are: Problem set: 42 solved, 503 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 22/100 constraints. Problems are: Problem set: 42 solved, 503 unsolved
[2024-06-01 05:27:27] [INFO ] Deduced a trap composed of 7 places in 93 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/198 variables, 1/101 constraints. Problems are: Problem set: 42 solved, 503 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/198 variables, 0/101 constraints. Problems are: Problem set: 42 solved, 503 unsolved
At refinement iteration 9 (OVERLAPS) 0/198 variables, 0/101 constraints. Problems are: Problem set: 42 solved, 503 unsolved
No progress, stopping.
After SMT solving in domain Real declared 198/198 variables, and 101 constraints, problems are : Problem set: 42 solved, 503 unsolved in 14600 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 68/68 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 545/545 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 42 solved, 503 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 5/5 constraints. Problems are: Problem set: 42 solved, 503 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 3/8 constraints. Problems are: Problem set: 42 solved, 503 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/8 constraints. Problems are: Problem set: 42 solved, 503 unsolved
At refinement iteration 3 (OVERLAPS) 2/68 variables, 2/10 constraints. Problems are: Problem set: 42 solved, 503 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 1/11 constraints. Problems are: Problem set: 42 solved, 503 unsolved
[2024-06-01 05:27:36] [INFO ] Deduced a trap composed of 6 places in 85 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 1/12 constraints. Problems are: Problem set: 42 solved, 503 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 0/12 constraints. Problems are: Problem set: 42 solved, 503 unsolved
At refinement iteration 7 (OVERLAPS) 130/198 variables, 68/80 constraints. Problems are: Problem set: 42 solved, 503 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/198 variables, 22/102 constraints. Problems are: Problem set: 42 solved, 503 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/198 variables, 503/605 constraints. Problems are: Problem set: 42 solved, 503 unsolved
[2024-06-01 05:27:44] [INFO ] Deduced a trap composed of 6 places in 77 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/198 variables, 1/606 constraints. Problems are: Problem set: 42 solved, 503 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 198/198 variables, and 606 constraints, problems are : Problem set: 42 solved, 503 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 68/68 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 503/545 constraints, Known Traps: 6/6 constraints]
After SMT, in 35883ms problems are : Problem set: 42 solved, 503 unsolved
Search for dead transitions found 42 dead transitions in 35910ms
Found 42 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 42 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 42 transitions.
[2024-06-01 05:27:54] [INFO ] Flow matrix only has 126 transitions (discarded 380 similar events)
// Phase 1: matrix 126 rows 68 cols
[2024-06-01 05:27:54] [INFO ] Computed 9 invariants in 5 ms
[2024-06-01 05:27:54] [INFO ] Implicit Places using invariants in 121 ms returned []
[2024-06-01 05:27:54] [INFO ] Flow matrix only has 126 transitions (discarded 380 similar events)
[2024-06-01 05:27:54] [INFO ] Invariant cache hit.
[2024-06-01 05:27:54] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-06-01 05:27:54] [INFO ] Implicit Places using invariants and state equation in 165 ms returned []
Implicit Place search using SMT with State Equation took 292 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 68/68 places, 506/548 transitions.
Applied a total of 0 rules in 11 ms. Remains 68 /68 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36277 ms. Remains : 68/68 places, 506/548 transitions.
Support contains 19 out of 68 places after structural reductions.
[2024-06-01 05:27:54] [INFO ] Flatten gal took : 59 ms
[2024-06-01 05:27:54] [INFO ] Flatten gal took : 32 ms
[2024-06-01 05:27:54] [INFO ] Input system was already deterministic with 506 transitions.
RANDOM walk for 40003 steps (224 resets) in 2012 ms. (19 steps per ms) remains 4/20 properties
BEST_FIRST walk for 40004 steps (108 resets) in 218 ms. (182 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40005 steps (76 resets) in 98 ms. (404 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40002 steps (72 resets) in 98 ms. (404 steps per ms) remains 2/2 properties
[2024-06-01 05:27:55] [INFO ] Flow matrix only has 126 transitions (discarded 380 similar events)
[2024-06-01 05:27:55] [INFO ] Invariant cache hit.
[2024-06-01 05:27:55] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp0 is UNSAT
At refinement iteration 1 (OVERLAPS) 4/7 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 20/27 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 3/30 variables, 1/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/32 variables, 1/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-06-01 05:27:55] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/32 variables, 1/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/32 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 3/35 variables, 1/6 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/35 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Problem AtomicPropp16 is UNSAT
After SMT solving in domain Real declared 57/194 variables, and 9 constraints, problems are : Problem set: 2 solved, 0 unsolved in 84 ms.
Refiners :[Positive P Invariants (semi-flows): 4/5 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/68 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 111ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 2 atomic propositions for a total of 11 simplifications.
FORMULA BridgeAndVehicles-PT-V20P10N10-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 51 stabilizing places and 82 stable transitions
Graph (complete) has 1139 edges and 68 vertex of which 66 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.8 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)||G(p1)) U (p2&&X(p3)&&F(p0)))))'
Support contains 8 out of 68 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 506/506 transitions.
Applied a total of 0 rules in 5 ms. Remains 68 /68 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Running 503 sub problems to find dead transitions.
[2024-06-01 05:27:55] [INFO ] Flow matrix only has 126 transitions (discarded 380 similar events)
[2024-06-01 05:27:55] [INFO ] Invariant cache hit.
[2024-06-01 05:27:55] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-06-01 05:27:57] [INFO ] Deduced a trap composed of 5 places in 81 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 4 (OVERLAPS) 2/68 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-06-01 05:28:02] [INFO ] Deduced a trap composed of 6 places in 72 ms of which 1 ms to minimize.
[2024-06-01 05:28:02] [INFO ] Deduced a trap composed of 7 places in 87 ms of which 0 ms to minimize.
[2024-06-01 05:28:02] [INFO ] Deduced a trap composed of 6 places in 74 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 7 (OVERLAPS) 126/194 variables, 68/81 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/194 variables, 20/101 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/194 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 10 (OVERLAPS) 0/194 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 503 unsolved
No progress, stopping.
After SMT solving in domain Real declared 194/194 variables, and 101 constraints, problems are : Problem set: 0 solved, 503 unsolved in 14717 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 68/68 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 503/503 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 503 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 4 (OVERLAPS) 2/68 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 7 (OVERLAPS) 126/194 variables, 68/81 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/194 variables, 20/101 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/194 variables, 503/604 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/194 variables, 0/604 constraints. Problems are: Problem set: 0 solved, 503 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 194/194 variables, and 604 constraints, problems are : Problem set: 0 solved, 503 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 68/68 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 503/503 constraints, Known Traps: 4/4 constraints]
After SMT, in 35581ms problems are : Problem set: 0 solved, 503 unsolved
Search for dead transitions found 0 dead transitions in 35586ms
[2024-06-01 05:28:31] [INFO ] Flow matrix only has 126 transitions (discarded 380 similar events)
[2024-06-01 05:28:31] [INFO ] Invariant cache hit.
[2024-06-01 05:28:31] [INFO ] Implicit Places using invariants in 92 ms returned [49]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 98 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 67/68 places, 506/506 transitions.
Applied a total of 0 rules in 6 ms. Remains 67 /67 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 35697 ms. Remains : 67/68 places, 506/506 transitions.
Stuttering acceptance computed with spot in 474 ms :[(OR (NOT p0) (NOT p2) (NOT p3)), (OR (NOT p0) (NOT p2) (NOT p3)), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p3), (NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p0) (NOT p3)), true, (NOT p1)]
Running random walk in product with property : BridgeAndVehicles-PT-V20P10N10-LTLCardinality-05
Product exploration explored 100000 steps with 30380 reset in 448 ms.
Product exploration explored 100000 steps with 30448 reset in 425 ms.
Computed a total of 50 stabilizing places and 82 stable transitions
Graph (complete) has 1096 edges and 67 vertex of which 65 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.12 ms
Computed a total of 50 stabilizing places and 82 stable transitions
Detected a total of 50/67 stabilizing places and 82/506 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/4 atomic propositions.
Knowledge obtained : [(AND p2 p1 p0 p3), (X (NOT (AND p2 (NOT p1)))), (X p2), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND (NOT p2) p1))), (X (AND p2 p1)), (X p0), (X (NOT (AND (NOT p2) (NOT p1)))), (X p1), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) p1 (NOT p3))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p2 p1))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p2) p1 (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X p2)), (X (X (NOT (AND p2 (NOT p0) (NOT p3))))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3))))), (X (X (NOT (AND p2 (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X p0)), (X (X p1)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X p3)), (X (X (NOT p3))), (X (X (AND p2 p1 (NOT p3)))), (X (X (NOT (AND p2 p1 (NOT p3))))), (X (X (AND p2 (NOT p3)))), (X (X (NOT (AND p2 (NOT p3)))))]
Knowledge based reduction with 30 factoid took 1015 ms. Reduced automaton from 10 states, 25 edges and 4 AP (stutter sensitive) to 10 states, 25 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 451 ms :[(OR (NOT p0) (NOT p2) (NOT p3)), (OR (NOT p0) (NOT p2) (NOT p3)), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p3), (NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p0) (NOT p3)), true, (NOT p1)]
RANDOM walk for 40000 steps (224 resets) in 711 ms. (56 steps per ms) remains 8/21 properties
BEST_FIRST walk for 1177 steps (0 resets) in 15 ms. (73 steps per ms) remains 0/8 properties
Knowledge obtained : [(AND p2 p1 p0 p3), (X (NOT (AND p2 (NOT p1)))), (X p2), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND (NOT p2) p1))), (X (AND p2 p1)), (X p0), (X (NOT (AND (NOT p2) (NOT p1)))), (X p1), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) p1 (NOT p3))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p2 p1))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p2) p1 (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X p2)), (X (X (NOT (AND p2 (NOT p0) (NOT p3))))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3))))), (X (X (NOT (AND p2 (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X p0)), (X (X p1)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X p3)), (X (X (NOT p3))), (X (X (AND p2 p1 (NOT p3)))), (X (X (NOT (AND p2 p1 (NOT p3))))), (X (X (AND p2 (NOT p3)))), (X (X (NOT (AND p2 (NOT p3))))), (F (NOT (OR p1 p2 p3))), (F (NOT (OR p1 (NOT p2)))), (F (NOT (OR p0 p3))), (F (NOT (OR (NOT p1) p2 p3))), (F (NOT (OR (NOT p1) p0))), (F (NOT (OR p2 p3))), (F (NOT (OR (NOT p2) p0))), (F (NOT (OR p1 p2))), (F (NOT (OR p1 (NOT p2) p3))), (F (NOT (AND p1 p2))), (F (NOT (OR p1 p0 p3))), (F (NOT (OR (NOT p1) p2))), (F (NOT (OR p1 p0))), (F (NOT p1)), (F (NOT (OR (NOT p1) (NOT p2) p3))), (F (NOT p0)), (F (NOT (OR (NOT p2) p3))), (F (NOT p3)), (F (NOT (OR (NOT p2) p0 p3))), (F (NOT p2)), (F (NOT (OR (NOT p1) p0 p3)))]
Knowledge based reduction with 30 factoid took 3370 ms. Reduced automaton from 10 states, 25 edges and 4 AP (stutter sensitive) to 10 states, 25 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 417 ms :[(OR (NOT p0) (NOT p2) (NOT p3)), (OR (NOT p0) (NOT p2) (NOT p3)), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p3), (NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p0) (NOT p3)), true, (NOT p1)]
Stuttering acceptance computed with spot in 475 ms :[(OR (NOT p0) (NOT p2) (NOT p3)), (OR (NOT p0) (NOT p2) (NOT p3)), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p3), (NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p0) (NOT p3)), true, (NOT p1)]
Support contains 8 out of 67 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 506/506 transitions.
Applied a total of 0 rules in 7 ms. Remains 67 /67 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Running 503 sub problems to find dead transitions.
[2024-06-01 05:28:38] [INFO ] Flow matrix only has 126 transitions (discarded 380 similar events)
// Phase 1: matrix 126 rows 67 cols
[2024-06-01 05:28:38] [INFO ] Computed 8 invariants in 2 ms
[2024-06-01 05:28:38] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-06-01 05:28:40] [INFO ] Deduced a trap composed of 5 places in 46 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 4 (OVERLAPS) 2/67 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-06-01 05:28:44] [INFO ] Deduced a trap composed of 6 places in 76 ms of which 1 ms to minimize.
[2024-06-01 05:28:44] [INFO ] Deduced a trap composed of 7 places in 63 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/67 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 7 (OVERLAPS) 126/193 variables, 67/78 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/193 variables, 20/98 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-06-01 05:28:48] [INFO ] Deduced a trap composed of 14 places in 78 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/193 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/193 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 11 (OVERLAPS) 0/193 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 503 unsolved
No progress, stopping.
After SMT solving in domain Real declared 193/193 variables, and 99 constraints, problems are : Problem set: 0 solved, 503 unsolved in 15146 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 67/67 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 503/503 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 503 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 4 (OVERLAPS) 2/67 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/67 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 7 (OVERLAPS) 126/193 variables, 67/79 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/193 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/193 variables, 503/602 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/193 variables, 0/602 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 11 (OVERLAPS) 0/193 variables, 0/602 constraints. Problems are: Problem set: 0 solved, 503 unsolved
No progress, stopping.
After SMT solving in domain Int declared 193/193 variables, and 602 constraints, problems are : Problem set: 0 solved, 503 unsolved in 20009 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 67/67 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 503/503 constraints, Known Traps: 4/4 constraints]
After SMT, in 36023ms problems are : Problem set: 0 solved, 503 unsolved
Search for dead transitions found 0 dead transitions in 36030ms
[2024-06-01 05:29:15] [INFO ] Flow matrix only has 126 transitions (discarded 380 similar events)
[2024-06-01 05:29:15] [INFO ] Invariant cache hit.
[2024-06-01 05:29:15] [INFO ] Implicit Places using invariants in 118 ms returned []
[2024-06-01 05:29:15] [INFO ] Flow matrix only has 126 transitions (discarded 380 similar events)
[2024-06-01 05:29:15] [INFO ] Invariant cache hit.
[2024-06-01 05:29:15] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-06-01 05:29:15] [INFO ] Implicit Places using invariants and state equation in 206 ms returned []
Implicit Place search using SMT with State Equation took 329 ms to find 0 implicit places.
Running 503 sub problems to find dead transitions.
[2024-06-01 05:29:15] [INFO ] Flow matrix only has 126 transitions (discarded 380 similar events)
[2024-06-01 05:29:15] [INFO ] Invariant cache hit.
[2024-06-01 05:29:15] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-06-01 05:29:17] [INFO ] Deduced a trap composed of 5 places in 78 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 4 (OVERLAPS) 2/67 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-06-01 05:29:21] [INFO ] Deduced a trap composed of 6 places in 50 ms of which 0 ms to minimize.
[2024-06-01 05:29:21] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 1 ms to minimize.
[2024-06-01 05:29:21] [INFO ] Deduced a trap composed of 6 places in 58 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/67 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 7 (OVERLAPS) 126/193 variables, 67/79 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/193 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-06-01 05:29:25] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/193 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/193 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-06-01 05:29:28] [INFO ] Deduced a trap composed of 5 places in 46 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/193 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/193 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 13 (OVERLAPS) 0/193 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 503 unsolved
No progress, stopping.
After SMT solving in domain Real declared 193/193 variables, and 101 constraints, problems are : Problem set: 0 solved, 503 unsolved in 19107 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 67/67 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 503/503 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 503 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 4 (OVERLAPS) 2/67 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/67 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 7 (OVERLAPS) 126/193 variables, 67/81 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/193 variables, 20/101 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/193 variables, 503/604 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/193 variables, 0/604 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 11 (OVERLAPS) 0/193 variables, 0/604 constraints. Problems are: Problem set: 0 solved, 503 unsolved
No progress, stopping.
After SMT solving in domain Int declared 193/193 variables, and 604 constraints, problems are : Problem set: 0 solved, 503 unsolved in 23710 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 67/67 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 503/503 constraints, Known Traps: 6/6 constraints]
After SMT, in 43514ms problems are : Problem set: 0 solved, 503 unsolved
Search for dead transitions found 0 dead transitions in 43519ms
Finished structural reductions in LTL mode , in 1 iterations and 79888 ms. Remains : 67/67 places, 506/506 transitions.
Computed a total of 50 stabilizing places and 82 stable transitions
Graph (complete) has 1096 edges and 67 vertex of which 65 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 ms
Computed a total of 50 stabilizing places and 82 stable transitions
Detected a total of 50/67 stabilizing places and 82/506 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/4 atomic propositions.
Knowledge obtained : [(AND p2 p1 p0 p3), (X (NOT (AND p1 (NOT p2)))), (X p2), (X (AND p1 p2)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND (NOT p1) p2))), (X p0), (X p1), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X p2)), (X (X (NOT (AND p2 (NOT p0) (NOT p3))))), (X (X (AND p1 p2))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0) (NOT p3))))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X p3)), (X (X (NOT p3))), (X (X (AND p1 p2 (NOT p3)))), (X (X (NOT (AND p1 p2 (NOT p3))))), (X (X (AND p2 (NOT p3)))), (X (X (NOT (AND p2 (NOT p3)))))]
Knowledge based reduction with 30 factoid took 1017 ms. Reduced automaton from 10 states, 25 edges and 4 AP (stutter sensitive) to 10 states, 25 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 462 ms :[(OR (NOT p0) (NOT p2) (NOT p3)), (OR (NOT p0) (NOT p2) (NOT p3)), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p3), (NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p0) (NOT p3)), true, (NOT p1)]
RANDOM walk for 40000 steps (224 resets) in 450 ms. (88 steps per ms) remains 8/21 properties
BEST_FIRST walk for 1179 steps (0 resets) in 8 ms. (131 steps per ms) remains 0/8 properties
Knowledge obtained : [(AND p2 p1 p0 p3), (X (NOT (AND p1 (NOT p2)))), (X p2), (X (AND p1 p2)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND (NOT p1) p2))), (X p0), (X p1), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X p2)), (X (X (NOT (AND p2 (NOT p0) (NOT p3))))), (X (X (AND p1 p2))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0) (NOT p3))))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X p3)), (X (X (NOT p3))), (X (X (AND p1 p2 (NOT p3)))), (X (X (NOT (AND p1 p2 (NOT p3))))), (X (X (AND p2 (NOT p3)))), (X (X (NOT (AND p2 (NOT p3))))), (F (NOT (OR p1 p2 p3))), (F (NOT (OR p1 (NOT p2)))), (F (NOT (OR p0 p3))), (F (NOT (OR (NOT p1) p2 p3))), (F (NOT (OR (NOT p1) p0))), (F (NOT (OR p2 p3))), (F (NOT (OR (NOT p2) p0))), (F (NOT (OR p1 p2))), (F (NOT (OR p1 (NOT p2) p3))), (F (NOT (AND p1 p2))), (F (NOT (OR p1 p0 p3))), (F (NOT (OR (NOT p1) p2))), (F (NOT (OR p1 p0))), (F (NOT p1)), (F (NOT (OR (NOT p1) (NOT p2) p3))), (F (NOT p0)), (F (NOT (OR (NOT p2) p3))), (F (NOT p3)), (F (NOT (OR (NOT p2) p0 p3))), (F (NOT p2)), (F (NOT (OR (NOT p1) p0 p3)))]
Knowledge based reduction with 30 factoid took 3466 ms. Reduced automaton from 10 states, 25 edges and 4 AP (stutter sensitive) to 10 states, 25 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 442 ms :[(OR (NOT p0) (NOT p2) (NOT p3)), (OR (NOT p0) (NOT p2) (NOT p3)), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p3), (NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p0) (NOT p3)), true, (NOT p1)]
Stuttering acceptance computed with spot in 442 ms :[(OR (NOT p0) (NOT p2) (NOT p3)), (OR (NOT p0) (NOT p2) (NOT p3)), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p3), (NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p0) (NOT p3)), true, (NOT p1)]
Stuttering acceptance computed with spot in 398 ms :[(OR (NOT p0) (NOT p2) (NOT p3)), (OR (NOT p0) (NOT p2) (NOT p3)), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p3), (NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p0) (NOT p3)), true, (NOT p1)]
Product exploration explored 100000 steps with 30406 reset in 360 ms.
Product exploration explored 100000 steps with 30461 reset in 362 ms.
Applying partial POR strategy [false, false, true, true, false, true, true, true, true, true]
Stuttering acceptance computed with spot in 343 ms :[(OR (NOT p0) (NOT p2) (NOT p3)), (OR (NOT p0) (NOT p2) (NOT p3)), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p3), (NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p0) (NOT p3)), true, (NOT p1)]
Support contains 8 out of 67 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 67/67 places, 506/506 transitions.
Applied a total of 0 rules in 60 ms. Remains 67 /67 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Running 503 sub problems to find dead transitions.
[2024-06-01 05:30:06] [INFO ] Flow matrix only has 126 transitions (discarded 380 similar events)
[2024-06-01 05:30:06] [INFO ] Invariant cache hit.
[2024-06-01 05:30:06] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-06-01 05:30:08] [INFO ] Deduced a trap composed of 5 places in 57 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 4 (OVERLAPS) 2/67 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-06-01 05:30:12] [INFO ] Deduced a trap composed of 6 places in 65 ms of which 0 ms to minimize.
[2024-06-01 05:30:12] [INFO ] Deduced a trap composed of 7 places in 62 ms of which 1 ms to minimize.
[2024-06-01 05:30:12] [INFO ] Deduced a trap composed of 6 places in 56 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/67 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 7 (OVERLAPS) 126/193 variables, 67/79 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/193 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-06-01 05:30:16] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/193 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/193 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-06-01 05:30:21] [INFO ] Deduced a trap composed of 5 places in 53 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/193 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/193 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 13 (OVERLAPS) 0/193 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 503 unsolved
No progress, stopping.
After SMT solving in domain Real declared 193/193 variables, and 101 constraints, problems are : Problem set: 0 solved, 503 unsolved in 19908 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 67/67 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 503/503 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 503 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 4 (OVERLAPS) 2/67 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/67 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 7 (OVERLAPS) 126/193 variables, 67/81 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/193 variables, 20/101 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/193 variables, 503/604 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/193 variables, 0/604 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 11 (OVERLAPS) 0/193 variables, 0/604 constraints. Problems are: Problem set: 0 solved, 503 unsolved
No progress, stopping.
After SMT solving in domain Int declared 193/193 variables, and 604 constraints, problems are : Problem set: 0 solved, 503 unsolved in 20011 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 67/67 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 503/503 constraints, Known Traps: 6/6 constraints]
After SMT, in 40801ms problems are : Problem set: 0 solved, 503 unsolved
Search for dead transitions found 0 dead transitions in 40807ms
[2024-06-01 05:30:47] [INFO ] Redundant transitions in 33 ms returned []
Running 503 sub problems to find dead transitions.
[2024-06-01 05:30:47] [INFO ] Flow matrix only has 126 transitions (discarded 380 similar events)
[2024-06-01 05:30:47] [INFO ] Invariant cache hit.
[2024-06-01 05:30:47] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-06-01 05:30:49] [INFO ] Deduced a trap composed of 5 places in 98 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 4 (OVERLAPS) 2/67 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-06-01 05:30:52] [INFO ] Deduced a trap composed of 6 places in 70 ms of which 1 ms to minimize.
[2024-06-01 05:30:53] [INFO ] Deduced a trap composed of 7 places in 74 ms of which 1 ms to minimize.
[2024-06-01 05:30:53] [INFO ] Deduced a trap composed of 6 places in 85 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/67 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 7 (OVERLAPS) 126/193 variables, 67/79 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/193 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-06-01 05:30:56] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/193 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/193 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-06-01 05:31:00] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/193 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/193 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 13 (OVERLAPS) 0/193 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 503 unsolved
No progress, stopping.
After SMT solving in domain Real declared 193/193 variables, and 101 constraints, problems are : Problem set: 0 solved, 503 unsolved in 18636 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 67/67 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 503/503 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 503 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 4 (OVERLAPS) 2/67 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/67 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 7 (OVERLAPS) 126/193 variables, 67/81 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/193 variables, 20/101 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/193 variables, 503/604 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/193 variables, 0/604 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 11 (OVERLAPS) 0/193 variables, 0/604 constraints. Problems are: Problem set: 0 solved, 503 unsolved
No progress, stopping.
After SMT solving in domain Int declared 193/193 variables, and 604 constraints, problems are : Problem set: 0 solved, 503 unsolved in 23358 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 67/67 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 503/503 constraints, Known Traps: 6/6 constraints]
After SMT, in 42930ms problems are : Problem set: 0 solved, 503 unsolved
Search for dead transitions found 0 dead transitions in 42938ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 83848 ms. Remains : 67/67 places, 506/506 transitions.
Support contains 8 out of 67 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 506/506 transitions.
Applied a total of 0 rules in 2 ms. Remains 67 /67 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Running 503 sub problems to find dead transitions.
[2024-06-01 05:31:30] [INFO ] Flow matrix only has 126 transitions (discarded 380 similar events)
[2024-06-01 05:31:30] [INFO ] Invariant cache hit.
[2024-06-01 05:31:30] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-06-01 05:31:32] [INFO ] Deduced a trap composed of 5 places in 75 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 4 (OVERLAPS) 2/67 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-06-01 05:31:35] [INFO ] Deduced a trap composed of 6 places in 55 ms of which 2 ms to minimize.
[2024-06-01 05:31:35] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 1 ms to minimize.
[2024-06-01 05:31:35] [INFO ] Deduced a trap composed of 6 places in 77 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/67 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 7 (OVERLAPS) 126/193 variables, 67/79 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/193 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-06-01 05:31:39] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/193 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/193 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-06-01 05:31:43] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 3 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/193 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/193 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 13 (OVERLAPS) 0/193 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 503 unsolved
No progress, stopping.
After SMT solving in domain Real declared 193/193 variables, and 101 constraints, problems are : Problem set: 0 solved, 503 unsolved in 19264 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 67/67 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 503/503 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 503 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 4 (OVERLAPS) 2/67 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/67 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 7 (OVERLAPS) 126/193 variables, 67/81 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/193 variables, 20/101 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/193 variables, 503/604 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/193 variables, 0/604 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 11 (OVERLAPS) 0/193 variables, 0/604 constraints. Problems are: Problem set: 0 solved, 503 unsolved
No progress, stopping.
After SMT solving in domain Int declared 193/193 variables, and 604 constraints, problems are : Problem set: 0 solved, 503 unsolved in 20014 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 67/67 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 503/503 constraints, Known Traps: 6/6 constraints]
After SMT, in 40012ms problems are : Problem set: 0 solved, 503 unsolved
Search for dead transitions found 0 dead transitions in 40017ms
[2024-06-01 05:32:10] [INFO ] Flow matrix only has 126 transitions (discarded 380 similar events)
[2024-06-01 05:32:10] [INFO ] Invariant cache hit.
[2024-06-01 05:32:10] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-06-01 05:32:10] [INFO ] Flow matrix only has 126 transitions (discarded 380 similar events)
[2024-06-01 05:32:10] [INFO ] Invariant cache hit.
[2024-06-01 05:32:10] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-06-01 05:32:10] [INFO ] Implicit Places using invariants and state equation in 156 ms returned []
Implicit Place search using SMT with State Equation took 242 ms to find 0 implicit places.
Running 503 sub problems to find dead transitions.
[2024-06-01 05:32:10] [INFO ] Flow matrix only has 126 transitions (discarded 380 similar events)
[2024-06-01 05:32:10] [INFO ] Invariant cache hit.
[2024-06-01 05:32:10] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-06-01 05:32:12] [INFO ] Deduced a trap composed of 5 places in 81 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 4 (OVERLAPS) 2/67 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-06-01 05:32:16] [INFO ] Deduced a trap composed of 6 places in 76 ms of which 1 ms to minimize.
[2024-06-01 05:32:16] [INFO ] Deduced a trap composed of 7 places in 76 ms of which 1 ms to minimize.
[2024-06-01 05:32:16] [INFO ] Deduced a trap composed of 6 places in 76 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/67 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 7 (OVERLAPS) 126/193 variables, 67/79 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/193 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-06-01 05:32:20] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/193 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/193 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-06-01 05:32:24] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/193 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/193 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 13 (OVERLAPS) 0/193 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 503 unsolved
No progress, stopping.
After SMT solving in domain Real declared 193/193 variables, and 101 constraints, problems are : Problem set: 0 solved, 503 unsolved in 19196 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 67/67 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 503/503 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 503 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 4 (OVERLAPS) 2/67 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/67 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 7 (OVERLAPS) 126/193 variables, 67/81 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/193 variables, 20/101 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/193 variables, 503/604 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/193 variables, 0/604 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 11 (OVERLAPS) 0/193 variables, 0/604 constraints. Problems are: Problem set: 0 solved, 503 unsolved
No progress, stopping.
After SMT solving in domain Int declared 193/193 variables, and 604 constraints, problems are : Problem set: 0 solved, 503 unsolved in 23346 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 67/67 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 503/503 constraints, Known Traps: 6/6 constraints]
After SMT, in 43268ms problems are : Problem set: 0 solved, 503 unsolved
Search for dead transitions found 0 dead transitions in 43276ms
Finished structural reductions in LTL mode , in 1 iterations and 83539 ms. Remains : 67/67 places, 506/506 transitions.
Treatment of property BridgeAndVehicles-PT-V20P10N10-LTLCardinality-05 finished in 298338 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(!p0)||(!p0&&F(p1))))'
Support contains 7 out of 68 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 68/68 places, 506/506 transitions.
Applied a total of 0 rules in 27 ms. Remains 68 /68 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Running 503 sub problems to find dead transitions.
[2024-06-01 05:32:54] [INFO ] Flow matrix only has 126 transitions (discarded 380 similar events)
// Phase 1: matrix 126 rows 68 cols
[2024-06-01 05:32:54] [INFO ] Computed 9 invariants in 4 ms
[2024-06-01 05:32:54] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-06-01 05:32:56] [INFO ] Deduced a trap composed of 5 places in 73 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 4 (OVERLAPS) 2/68 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-06-01 05:33:00] [INFO ] Deduced a trap composed of 6 places in 73 ms of which 2 ms to minimize.
[2024-06-01 05:33:00] [INFO ] Deduced a trap composed of 7 places in 74 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 7 (OVERLAPS) 126/194 variables, 68/80 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/194 variables, 20/100 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-06-01 05:33:03] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/194 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/194 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 11 (OVERLAPS) 0/194 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 503 unsolved
No progress, stopping.
After SMT solving in domain Real declared 194/194 variables, and 101 constraints, problems are : Problem set: 0 solved, 503 unsolved in 14675 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 68/68 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 503/503 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 503 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 4 (OVERLAPS) 2/68 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-06-01 05:33:12] [INFO ] Deduced a trap composed of 6 places in 95 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/68 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 8 (OVERLAPS) 126/194 variables, 68/82 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/194 variables, 20/102 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/194 variables, 503/605 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/194 variables, 0/605 constraints. Problems are: Problem set: 0 solved, 503 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 194/194 variables, and 605 constraints, problems are : Problem set: 0 solved, 503 unsolved in 20012 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 68/68 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 503/503 constraints, Known Traps: 5/5 constraints]
After SMT, in 35489ms problems are : Problem set: 0 solved, 503 unsolved
Search for dead transitions found 0 dead transitions in 35495ms
[2024-06-01 05:33:29] [INFO ] Flow matrix only has 126 transitions (discarded 380 similar events)
[2024-06-01 05:33:29] [INFO ] Invariant cache hit.
[2024-06-01 05:33:29] [INFO ] Implicit Places using invariants in 124 ms returned [22, 49]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 125 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 66/68 places, 506/506 transitions.
Applied a total of 0 rules in 18 ms. Remains 66 /66 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 35669 ms. Remains : 66/68 places, 506/506 transitions.
Stuttering acceptance computed with spot in 104 ms :[true, (NOT p1), p0, (AND (NOT p1) p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V20P10N10-LTLCardinality-06
Product exploration explored 100000 steps with 1419 reset in 349 ms.
Product exploration explored 100000 steps with 1419 reset in 218 ms.
Computed a total of 49 stabilizing places and 82 stable transitions
Graph (complete) has 1053 edges and 66 vertex of which 64 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Computed a total of 49 stabilizing places and 82 stable transitions
Detected a total of 49/66 stabilizing places and 82/506 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 193 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter insensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 192 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (NOT p1)]
RANDOM walk for 6224 steps (34 resets) in 37 ms. (163 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p0), (F (NOT (OR p0 (NOT p1)))), (F p1), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 10 factoid took 409 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 174 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (NOT p1)]
Stuttering acceptance computed with spot in 160 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (NOT p1)]
Support contains 7 out of 66 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 66/66 places, 506/506 transitions.
Applied a total of 0 rules in 20 ms. Remains 66 /66 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Running 503 sub problems to find dead transitions.
[2024-06-01 05:33:31] [INFO ] Flow matrix only has 126 transitions (discarded 380 similar events)
// Phase 1: matrix 126 rows 66 cols
[2024-06-01 05:33:31] [INFO ] Computed 7 invariants in 1 ms
[2024-06-01 05:33:31] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-06-01 05:33:33] [INFO ] Deduced a trap composed of 5 places in 63 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 3 (OVERLAPS) 2/66 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-06-01 05:33:37] [INFO ] Deduced a trap composed of 6 places in 75 ms of which 1 ms to minimize.
[2024-06-01 05:33:37] [INFO ] Deduced a trap composed of 7 places in 63 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-06-01 05:33:38] [INFO ] Deduced a trap composed of 6 places in 84 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 7 (OVERLAPS) 126/192 variables, 66/77 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/192 variables, 20/97 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/192 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 10 (OVERLAPS) 0/192 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 503 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 97 constraints, problems are : Problem set: 0 solved, 503 unsolved in 13371 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 66/66 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 503/503 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 503 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 3 (OVERLAPS) 2/66 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 6 (OVERLAPS) 126/192 variables, 66/77 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 20/97 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/192 variables, 503/600 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-06-01 05:33:55] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/192 variables, 1/601 constraints. Problems are: Problem set: 0 solved, 503 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 192/192 variables, and 601 constraints, problems are : Problem set: 0 solved, 503 unsolved in 20015 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 66/66 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 503/503 constraints, Known Traps: 5/5 constraints]
After SMT, in 34321ms problems are : Problem set: 0 solved, 503 unsolved
Search for dead transitions found 0 dead transitions in 34327ms
[2024-06-01 05:34:06] [INFO ] Flow matrix only has 126 transitions (discarded 380 similar events)
[2024-06-01 05:34:06] [INFO ] Invariant cache hit.
[2024-06-01 05:34:06] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-06-01 05:34:06] [INFO ] Flow matrix only has 126 transitions (discarded 380 similar events)
[2024-06-01 05:34:06] [INFO ] Invariant cache hit.
[2024-06-01 05:34:06] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-06-01 05:34:06] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 221 ms to find 0 implicit places.
[2024-06-01 05:34:06] [INFO ] Redundant transitions in 4 ms returned []
Running 503 sub problems to find dead transitions.
[2024-06-01 05:34:06] [INFO ] Flow matrix only has 126 transitions (discarded 380 similar events)
[2024-06-01 05:34:06] [INFO ] Invariant cache hit.
[2024-06-01 05:34:06] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-06-01 05:34:08] [INFO ] Deduced a trap composed of 5 places in 54 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 3 (OVERLAPS) 2/66 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-06-01 05:34:11] [INFO ] Deduced a trap composed of 6 places in 56 ms of which 3 ms to minimize.
[2024-06-01 05:34:12] [INFO ] Deduced a trap composed of 7 places in 78 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-06-01 05:34:13] [INFO ] Deduced a trap composed of 6 places in 72 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 7 (OVERLAPS) 126/192 variables, 66/77 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/192 variables, 20/97 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/192 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 10 (OVERLAPS) 0/192 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 503 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 97 constraints, problems are : Problem set: 0 solved, 503 unsolved in 13894 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 66/66 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 503/503 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 503 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 3 (OVERLAPS) 2/66 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 6 (OVERLAPS) 126/192 variables, 66/77 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 20/97 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/192 variables, 503/600 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-06-01 05:34:28] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-06-01 05:34:31] [INFO ] Deduced a trap composed of 5 places in 98 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/192 variables, 2/602 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/192 variables, 0/602 constraints. Problems are: Problem set: 0 solved, 503 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 192/192 variables, and 602 constraints, problems are : Problem set: 0 solved, 503 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 66/66 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 503/503 constraints, Known Traps: 6/6 constraints]
After SMT, in 44756ms problems are : Problem set: 0 solved, 503 unsolved
Search for dead transitions found 0 dead transitions in 44763ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 79343 ms. Remains : 66/66 places, 506/506 transitions.
Computed a total of 49 stabilizing places and 82 stable transitions
Graph (complete) has 1053 edges and 66 vertex of which 64 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Computed a total of 49 stabilizing places and 82 stable transitions
Detected a total of 49/66 stabilizing places and 82/506 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 190 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 185 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (NOT p1)]
RANDOM walk for 3214 steps (17 resets) in 16 ms. (189 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p0), (F (NOT (OR p0 (NOT p1)))), (F p1), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 14 factoid took 538 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 192 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (NOT p1)]
Stuttering acceptance computed with spot in 194 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (NOT p1)]
Stuttering acceptance computed with spot in 185 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (NOT p1)]
Product exploration explored 100000 steps with 1419 reset in 280 ms.
Product exploration explored 100000 steps with 1430 reset in 293 ms.
Support contains 7 out of 66 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 66/66 places, 506/506 transitions.
Applied a total of 0 rules in 16 ms. Remains 66 /66 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Running 503 sub problems to find dead transitions.
[2024-06-01 05:34:53] [INFO ] Flow matrix only has 126 transitions (discarded 380 similar events)
[2024-06-01 05:34:53] [INFO ] Invariant cache hit.
[2024-06-01 05:34:53] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-06-01 05:34:54] [INFO ] Deduced a trap composed of 5 places in 52 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 3 (OVERLAPS) 2/66 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-06-01 05:34:58] [INFO ] Deduced a trap composed of 6 places in 81 ms of which 1 ms to minimize.
[2024-06-01 05:34:58] [INFO ] Deduced a trap composed of 7 places in 83 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-06-01 05:35:00] [INFO ] Deduced a trap composed of 6 places in 56 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 7 (OVERLAPS) 126/192 variables, 66/77 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/192 variables, 20/97 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/192 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 10 (OVERLAPS) 0/192 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 503 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 97 constraints, problems are : Problem set: 0 solved, 503 unsolved in 13756 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 66/66 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 503/503 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 503 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 3 (OVERLAPS) 2/66 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 6 (OVERLAPS) 126/192 variables, 66/77 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 20/97 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/192 variables, 503/600 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-06-01 05:35:15] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 0 ms to minimize.
[2024-06-01 05:35:18] [INFO ] Deduced a trap composed of 5 places in 76 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/192 variables, 2/602 constraints. Problems are: Problem set: 0 solved, 503 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 192/192 variables, and 602 constraints, problems are : Problem set: 0 solved, 503 unsolved in 20014 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 66/66 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 503/503 constraints, Known Traps: 6/6 constraints]
After SMT, in 34482ms problems are : Problem set: 0 solved, 503 unsolved
Search for dead transitions found 0 dead transitions in 34488ms
[2024-06-01 05:35:27] [INFO ] Flow matrix only has 126 transitions (discarded 380 similar events)
[2024-06-01 05:35:27] [INFO ] Invariant cache hit.
[2024-06-01 05:35:27] [INFO ] Implicit Places using invariants in 126 ms returned []
[2024-06-01 05:35:27] [INFO ] Flow matrix only has 126 transitions (discarded 380 similar events)
[2024-06-01 05:35:27] [INFO ] Invariant cache hit.
[2024-06-01 05:35:27] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-06-01 05:35:27] [INFO ] Implicit Places using invariants and state equation in 171 ms returned []
Implicit Place search using SMT with State Equation took 298 ms to find 0 implicit places.
[2024-06-01 05:35:27] [INFO ] Redundant transitions in 2 ms returned []
Running 503 sub problems to find dead transitions.
[2024-06-01 05:35:27] [INFO ] Flow matrix only has 126 transitions (discarded 380 similar events)
[2024-06-01 05:35:27] [INFO ] Invariant cache hit.
[2024-06-01 05:35:27] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-06-01 05:35:29] [INFO ] Deduced a trap composed of 5 places in 85 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 3 (OVERLAPS) 2/66 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-06-01 05:35:33] [INFO ] Deduced a trap composed of 6 places in 75 ms of which 1 ms to minimize.
[2024-06-01 05:35:33] [INFO ] Deduced a trap composed of 7 places in 72 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-06-01 05:35:34] [INFO ] Deduced a trap composed of 6 places in 71 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 7 (OVERLAPS) 126/192 variables, 66/77 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/192 variables, 20/97 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/192 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 10 (OVERLAPS) 0/192 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 503 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 97 constraints, problems are : Problem set: 0 solved, 503 unsolved in 14170 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 66/66 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 503/503 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 503 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 3 (OVERLAPS) 2/66 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 6 (OVERLAPS) 126/192 variables, 66/77 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 20/97 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/192 variables, 503/600 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-06-01 05:35:50] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 1 ms to minimize.
[2024-06-01 05:35:52] [INFO ] Deduced a trap composed of 5 places in 102 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/192 variables, 2/602 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/192 variables, 0/602 constraints. Problems are: Problem set: 0 solved, 503 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 192/192 variables, and 602 constraints, problems are : Problem set: 0 solved, 503 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 66/66 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 503/503 constraints, Known Traps: 6/6 constraints]
After SMT, in 44919ms problems are : Problem set: 0 solved, 503 unsolved
Search for dead transitions found 0 dead transitions in 44924ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 79735 ms. Remains : 66/66 places, 506/506 transitions.
Treatment of property BridgeAndVehicles-PT-V20P10N10-LTLCardinality-06 finished in 198827 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(F(X(G((X(G(p0)) U p1)))))))'
Support contains 3 out of 68 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 68/68 places, 506/506 transitions.
Graph (complete) has 1139 edges and 68 vertex of which 66 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 65 transition count 505
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 65 transition count 505
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 63 transition count 504
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 62 transition count 503
Applied a total of 8 rules in 83 ms. Remains 62 /68 variables (removed 6) and now considering 503/506 (removed 3) transitions.
[2024-06-01 05:36:13] [INFO ] Flow matrix only has 123 transitions (discarded 380 similar events)
// Phase 1: matrix 123 rows 62 cols
[2024-06-01 05:36:13] [INFO ] Computed 6 invariants in 2 ms
[2024-06-01 05:36:13] [INFO ] Implicit Places using invariants in 86 ms returned [22]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 90 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 61/68 places, 503/506 transitions.
Applied a total of 0 rules in 24 ms. Remains 61 /61 variables (removed 0) and now considering 503/503 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 197 ms. Remains : 61/68 places, 503/506 transitions.
Stuttering acceptance computed with spot in 93 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BridgeAndVehicles-PT-V20P10N10-LTLCardinality-08
Stuttering criterion allowed to conclude after 127 steps with 0 reset in 1 ms.
FORMULA BridgeAndVehicles-PT-V20P10N10-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V20P10N10-LTLCardinality-08 finished in 309 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((!p0&&G(p1))))'
Support contains 3 out of 68 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 506/506 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 67 transition count 506
Applied a total of 1 rules in 6 ms. Remains 67 /68 variables (removed 1) and now considering 506/506 (removed 0) transitions.
Running 503 sub problems to find dead transitions.
[2024-06-01 05:36:13] [INFO ] Flow matrix only has 126 transitions (discarded 380 similar events)
// Phase 1: matrix 126 rows 67 cols
[2024-06-01 05:36:13] [INFO ] Computed 8 invariants in 1 ms
[2024-06-01 05:36:13] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-06-01 05:36:15] [INFO ] Deduced a trap composed of 5 places in 69 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 4 (OVERLAPS) 1/67 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-06-01 05:36:19] [INFO ] Deduced a trap composed of 6 places in 75 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/67 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 7 (OVERLAPS) 126/193 variables, 67/77 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/193 variables, 20/97 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/193 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 10 (OVERLAPS) 0/193 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 503 unsolved
No progress, stopping.
After SMT solving in domain Real declared 193/193 variables, and 97 constraints, problems are : Problem set: 0 solved, 503 unsolved in 12737 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 67/67 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 503/503 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 503 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 4 (OVERLAPS) 1/67 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/67 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 7 (OVERLAPS) 126/193 variables, 67/77 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/193 variables, 20/97 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/193 variables, 503/600 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-06-01 05:36:34] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/193 variables, 1/601 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/193 variables, 0/601 constraints. Problems are: Problem set: 0 solved, 503 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 193/193 variables, and 601 constraints, problems are : Problem set: 0 solved, 503 unsolved in 20015 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 67/67 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 503/503 constraints, Known Traps: 3/3 constraints]
After SMT, in 33550ms problems are : Problem set: 0 solved, 503 unsolved
Search for dead transitions found 0 dead transitions in 33556ms
[2024-06-01 05:36:46] [INFO ] Flow matrix only has 126 transitions (discarded 380 similar events)
[2024-06-01 05:36:46] [INFO ] Invariant cache hit.
[2024-06-01 05:36:47] [INFO ] Implicit Places using invariants in 140 ms returned [22, 48]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 143 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 65/68 places, 506/506 transitions.
Applied a total of 0 rules in 4 ms. Remains 65 /65 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 33711 ms. Remains : 65/68 places, 506/506 transitions.
Stuttering acceptance computed with spot in 111 ms :[true, (OR (NOT p1) p0), (NOT p1), (OR (NOT p1) p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V20P10N10-LTLCardinality-09
Entered a terminal (fully accepting) state of product in 83 steps with 0 reset in 1 ms.
FORMULA BridgeAndVehicles-PT-V20P10N10-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V20P10N10-LTLCardinality-09 finished in 33834 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 68 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 68/68 places, 506/506 transitions.
Graph (complete) has 1139 edges and 68 vertex of which 66 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 65 transition count 505
Applied a total of 3 rules in 25 ms. Remains 65 /68 variables (removed 3) and now considering 505/506 (removed 1) transitions.
Running 502 sub problems to find dead transitions.
[2024-06-01 05:36:47] [INFO ] Flow matrix only has 125 transitions (discarded 380 similar events)
// Phase 1: matrix 125 rows 65 cols
[2024-06-01 05:36:47] [INFO ] Computed 7 invariants in 1 ms
[2024-06-01 05:36:47] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2024-06-01 05:36:49] [INFO ] Deduced a trap composed of 5 places in 60 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 4 (OVERLAPS) 125/190 variables, 65/73 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 20/93 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 7 (OVERLAPS) 0/190 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 502 unsolved
No progress, stopping.
After SMT solving in domain Real declared 190/190 variables, and 93 constraints, problems are : Problem set: 0 solved, 502 unsolved in 8892 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 65/65 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 502/502 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 502 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 4 (OVERLAPS) 125/190 variables, 65/73 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 20/93 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 502/595 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2024-06-01 05:37:03] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/190 variables, 1/596 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/190 variables, 0/596 constraints. Problems are: Problem set: 0 solved, 502 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 190/190 variables, and 596 constraints, problems are : Problem set: 0 solved, 502 unsolved in 20013 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 65/65 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 502/502 constraints, Known Traps: 2/2 constraints]
After SMT, in 29715ms problems are : Problem set: 0 solved, 502 unsolved
Search for dead transitions found 0 dead transitions in 29720ms
[2024-06-01 05:37:16] [INFO ] Flow matrix only has 125 transitions (discarded 380 similar events)
[2024-06-01 05:37:16] [INFO ] Invariant cache hit.
[2024-06-01 05:37:17] [INFO ] Implicit Places using invariants in 137 ms returned [22, 47]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 138 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 63/68 places, 505/506 transitions.
Applied a total of 0 rules in 14 ms. Remains 63 /63 variables (removed 0) and now considering 505/505 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 29899 ms. Remains : 63/68 places, 505/506 transitions.
Stuttering acceptance computed with spot in 55 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V20P10N10-LTLCardinality-10
Product exploration explored 100000 steps with 1805 reset in 246 ms.
Product exploration explored 100000 steps with 1792 reset in 262 ms.
Computed a total of 46 stabilizing places and 81 stable transitions
Computed a total of 46 stabilizing places and 81 stable transitions
Detected a total of 46/63 stabilizing places and 81/505 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 72 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 59 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 251 steps (0 resets) in 4 ms. (50 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 102 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 51 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 49 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 63 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 63/63 places, 505/505 transitions.
Applied a total of 0 rules in 17 ms. Remains 63 /63 variables (removed 0) and now considering 505/505 (removed 0) transitions.
Running 502 sub problems to find dead transitions.
[2024-06-01 05:37:17] [INFO ] Flow matrix only has 125 transitions (discarded 380 similar events)
// Phase 1: matrix 125 rows 63 cols
[2024-06-01 05:37:17] [INFO ] Computed 5 invariants in 1 ms
[2024-06-01 05:37:17] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2024-06-01 05:37:19] [INFO ] Deduced a trap composed of 5 places in 61 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 3 (OVERLAPS) 125/188 variables, 63/69 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 20/89 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 6 (OVERLAPS) 0/188 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 502 unsolved
No progress, stopping.
After SMT solving in domain Real declared 188/188 variables, and 89 constraints, problems are : Problem set: 0 solved, 502 unsolved in 9666 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 63/63 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 502/502 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 502 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 3 (OVERLAPS) 125/188 variables, 63/69 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 20/89 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 502/591 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2024-06-01 05:37:34] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 1 ms to minimize.
[2024-06-01 05:37:34] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/188 variables, 2/593 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/188 variables, 0/593 constraints. Problems are: Problem set: 0 solved, 502 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 188/188 variables, and 593 constraints, problems are : Problem set: 0 solved, 502 unsolved in 20014 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 63/63 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 502/502 constraints, Known Traps: 3/3 constraints]
After SMT, in 30399ms problems are : Problem set: 0 solved, 502 unsolved
Search for dead transitions found 0 dead transitions in 30404ms
[2024-06-01 05:37:48] [INFO ] Flow matrix only has 125 transitions (discarded 380 similar events)
[2024-06-01 05:37:48] [INFO ] Invariant cache hit.
[2024-06-01 05:37:48] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-06-01 05:37:48] [INFO ] Flow matrix only has 125 transitions (discarded 380 similar events)
[2024-06-01 05:37:48] [INFO ] Invariant cache hit.
[2024-06-01 05:37:48] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-06-01 05:37:48] [INFO ] Implicit Places using invariants and state equation in 192 ms returned []
Implicit Place search using SMT with State Equation took 294 ms to find 0 implicit places.
[2024-06-01 05:37:48] [INFO ] Redundant transitions in 2 ms returned []
Running 502 sub problems to find dead transitions.
[2024-06-01 05:37:48] [INFO ] Flow matrix only has 125 transitions (discarded 380 similar events)
[2024-06-01 05:37:48] [INFO ] Invariant cache hit.
[2024-06-01 05:37:48] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2024-06-01 05:37:50] [INFO ] Deduced a trap composed of 5 places in 72 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 3 (OVERLAPS) 125/188 variables, 63/69 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 20/89 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 6 (OVERLAPS) 0/188 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 502 unsolved
No progress, stopping.
After SMT solving in domain Real declared 188/188 variables, and 89 constraints, problems are : Problem set: 0 solved, 502 unsolved in 10474 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 63/63 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 502/502 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 502 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 3 (OVERLAPS) 125/188 variables, 63/69 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 20/89 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 502/591 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/188 variables, 0/591 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 7 (OVERLAPS) 0/188 variables, 0/591 constraints. Problems are: Problem set: 0 solved, 502 unsolved
No progress, stopping.
After SMT solving in domain Int declared 188/188 variables, and 591 constraints, problems are : Problem set: 0 solved, 502 unsolved in 23718 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 63/63 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 502/502 constraints, Known Traps: 1/1 constraints]
After SMT, in 34874ms problems are : Problem set: 0 solved, 502 unsolved
Search for dead transitions found 0 dead transitions in 34878ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 65603 ms. Remains : 63/63 places, 505/505 transitions.
Computed a total of 46 stabilizing places and 81 stable transitions
Computed a total of 46 stabilizing places and 81 stable transitions
Detected a total of 46/63 stabilizing places and 81/505 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 104 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 56 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 194 steps (0 resets) in 4 ms. (38 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 106 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 63 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1756 reset in 248 ms.
Product exploration explored 100000 steps with 1744 reset in 259 ms.
Support contains 2 out of 63 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 63/63 places, 505/505 transitions.
Applied a total of 0 rules in 16 ms. Remains 63 /63 variables (removed 0) and now considering 505/505 (removed 0) transitions.
Running 502 sub problems to find dead transitions.
[2024-06-01 05:38:24] [INFO ] Flow matrix only has 125 transitions (discarded 380 similar events)
[2024-06-01 05:38:24] [INFO ] Invariant cache hit.
[2024-06-01 05:38:24] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2024-06-01 05:38:26] [INFO ] Deduced a trap composed of 5 places in 55 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 3 (OVERLAPS) 125/188 variables, 63/69 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 20/89 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 6 (OVERLAPS) 0/188 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 502 unsolved
No progress, stopping.
After SMT solving in domain Real declared 188/188 variables, and 89 constraints, problems are : Problem set: 0 solved, 502 unsolved in 10124 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 63/63 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 502/502 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 502 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 3 (OVERLAPS) 125/188 variables, 63/69 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 20/89 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 502/591 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/188 variables, 0/591 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 7 (OVERLAPS) 0/188 variables, 0/591 constraints. Problems are: Problem set: 0 solved, 502 unsolved
No progress, stopping.
After SMT solving in domain Int declared 188/188 variables, and 591 constraints, problems are : Problem set: 0 solved, 502 unsolved in 20009 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 63/63 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 502/502 constraints, Known Traps: 1/1 constraints]
After SMT, in 30831ms problems are : Problem set: 0 solved, 502 unsolved
Search for dead transitions found 0 dead transitions in 30836ms
[2024-06-01 05:38:55] [INFO ] Flow matrix only has 125 transitions (discarded 380 similar events)
[2024-06-01 05:38:55] [INFO ] Invariant cache hit.
[2024-06-01 05:38:55] [INFO ] Implicit Places using invariants in 125 ms returned []
[2024-06-01 05:38:55] [INFO ] Flow matrix only has 125 transitions (discarded 380 similar events)
[2024-06-01 05:38:55] [INFO ] Invariant cache hit.
[2024-06-01 05:38:55] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-06-01 05:38:55] [INFO ] Implicit Places using invariants and state equation in 198 ms returned []
Implicit Place search using SMT with State Equation took 325 ms to find 0 implicit places.
[2024-06-01 05:38:55] [INFO ] Redundant transitions in 2 ms returned []
Running 502 sub problems to find dead transitions.
[2024-06-01 05:38:55] [INFO ] Flow matrix only has 125 transitions (discarded 380 similar events)
[2024-06-01 05:38:55] [INFO ] Invariant cache hit.
[2024-06-01 05:38:55] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2024-06-01 05:38:57] [INFO ] Deduced a trap composed of 5 places in 75 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 3 (OVERLAPS) 125/188 variables, 63/69 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 20/89 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 6 (OVERLAPS) 0/188 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 502 unsolved
No progress, stopping.
After SMT solving in domain Real declared 188/188 variables, and 89 constraints, problems are : Problem set: 0 solved, 502 unsolved in 11290 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 63/63 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 502/502 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 502 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 3 (OVERLAPS) 125/188 variables, 63/69 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 20/89 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 502/591 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/188 variables, 0/591 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 7 (OVERLAPS) 0/188 variables, 0/591 constraints. Problems are: Problem set: 0 solved, 502 unsolved
No progress, stopping.
After SMT solving in domain Int declared 188/188 variables, and 591 constraints, problems are : Problem set: 0 solved, 502 unsolved in 21964 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 63/63 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 502/502 constraints, Known Traps: 1/1 constraints]
After SMT, in 33937ms problems are : Problem set: 0 solved, 502 unsolved
Search for dead transitions found 0 dead transitions in 33941ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 65129 ms. Remains : 63/63 places, 505/505 transitions.
Treatment of property BridgeAndVehicles-PT-V20P10N10-LTLCardinality-10 finished in 162594 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 U (p1||G(p0)))))'
Support contains 3 out of 68 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 68/68 places, 506/506 transitions.
Graph (complete) has 1139 edges and 68 vertex of which 66 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 65 transition count 505
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 65 transition count 505
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 63 transition count 504
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 10 place count 61 transition count 502
Applied a total of 10 rules in 24 ms. Remains 61 /68 variables (removed 7) and now considering 502/506 (removed 4) transitions.
[2024-06-01 05:39:29] [INFO ] Flow matrix only has 122 transitions (discarded 380 similar events)
// Phase 1: matrix 122 rows 61 cols
[2024-06-01 05:39:29] [INFO ] Computed 6 invariants in 0 ms
[2024-06-01 05:39:29] [INFO ] Implicit Places using invariants in 75 ms returned [22]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 76 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 60/68 places, 502/506 transitions.
Applied a total of 0 rules in 12 ms. Remains 60 /60 variables (removed 0) and now considering 502/502 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 112 ms. Remains : 60/68 places, 502/506 transitions.
Stuttering acceptance computed with spot in 35 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : BridgeAndVehicles-PT-V20P10N10-LTLCardinality-11
Product exploration explored 100000 steps with 852 reset in 269 ms.
Product exploration explored 100000 steps with 853 reset in 274 ms.
Computed a total of 45 stabilizing places and 80 stable transitions
Computed a total of 45 stabilizing places and 80 stable transitions
Detected a total of 45/60 stabilizing places and 80/502 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (X (AND (NOT p1) p0)), (X p0), (X (NOT p1)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Knowledge based reduction with 7 factoid took 339 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 53 ms :[(AND (NOT p0) (NOT p1))]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 465 steps (0 resets) in 7 ms. (58 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p1) p0), (X (AND (NOT p1) p0)), (X p0), (X (NOT p1)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F p1), (F (NOT (AND p0 (NOT p1)))), (F (NOT p0)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 7 factoid took 484 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 39 ms :[(AND (NOT p0) (NOT p1))]
Support contains 3 out of 60 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 60/60 places, 502/502 transitions.
Applied a total of 0 rules in 19 ms. Remains 60 /60 variables (removed 0) and now considering 502/502 (removed 0) transitions.
[2024-06-01 05:39:31] [INFO ] Flow matrix only has 122 transitions (discarded 380 similar events)
// Phase 1: matrix 122 rows 60 cols
[2024-06-01 05:39:31] [INFO ] Computed 5 invariants in 1 ms
[2024-06-01 05:39:31] [INFO ] Implicit Places using invariants in 118 ms returned []
[2024-06-01 05:39:31] [INFO ] Flow matrix only has 122 transitions (discarded 380 similar events)
[2024-06-01 05:39:31] [INFO ] Invariant cache hit.
[2024-06-01 05:39:31] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-06-01 05:39:31] [INFO ] Implicit Places using invariants and state equation in 203 ms returned []
Implicit Place search using SMT with State Equation took 324 ms to find 0 implicit places.
[2024-06-01 05:39:31] [INFO ] Redundant transitions in 3 ms returned []
Running 499 sub problems to find dead transitions.
[2024-06-01 05:39:31] [INFO ] Flow matrix only has 122 transitions (discarded 380 similar events)
[2024-06-01 05:39:31] [INFO ] Invariant cache hit.
[2024-06-01 05:39:31] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 2 (OVERLAPS) 122/182 variables, 60/65 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/182 variables, 20/85 constraints. Problems are: Problem set: 0 solved, 499 unsolved
[2024-06-01 05:39:36] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/182 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/182 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 6 (OVERLAPS) 0/182 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 499 unsolved
No progress, stopping.
After SMT solving in domain Real declared 182/182 variables, and 86 constraints, problems are : Problem set: 0 solved, 499 unsolved in 9789 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 60/60 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 499/499 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 499 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 3 (OVERLAPS) 122/182 variables, 60/66 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/182 variables, 20/86 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/182 variables, 499/585 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/182 variables, 0/585 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 7 (OVERLAPS) 0/182 variables, 0/585 constraints. Problems are: Problem set: 0 solved, 499 unsolved
No progress, stopping.
After SMT solving in domain Int declared 182/182 variables, and 585 constraints, problems are : Problem set: 0 solved, 499 unsolved in 25812 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 60/60 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 499/499 constraints, Known Traps: 1/1 constraints]
After SMT, in 36345ms problems are : Problem set: 0 solved, 499 unsolved
Search for dead transitions found 0 dead transitions in 36350ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 36704 ms. Remains : 60/60 places, 502/502 transitions.
Computed a total of 45 stabilizing places and 80 stable transitions
Computed a total of 45 stabilizing places and 80 stable transitions
Detected a total of 45/60 stabilizing places and 80/502 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 7 factoid took 358 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(AND (NOT p0) (NOT p1))]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 446 steps (0 resets) in 6 ms. (63 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (F p1), (F (NOT (AND p0 (NOT p1)))), (F (NOT p0)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 7 factoid took 512 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 41 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 37 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 854 reset in 321 ms.
Product exploration explored 100000 steps with 852 reset in 291 ms.
Support contains 3 out of 60 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 60/60 places, 502/502 transitions.
Applied a total of 0 rules in 13 ms. Remains 60 /60 variables (removed 0) and now considering 502/502 (removed 0) transitions.
[2024-06-01 05:40:09] [INFO ] Flow matrix only has 122 transitions (discarded 380 similar events)
[2024-06-01 05:40:09] [INFO ] Invariant cache hit.
[2024-06-01 05:40:09] [INFO ] Implicit Places using invariants in 119 ms returned []
[2024-06-01 05:40:09] [INFO ] Flow matrix only has 122 transitions (discarded 380 similar events)
[2024-06-01 05:40:09] [INFO ] Invariant cache hit.
[2024-06-01 05:40:09] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-06-01 05:40:10] [INFO ] Implicit Places using invariants and state equation in 168 ms returned []
Implicit Place search using SMT with State Equation took 288 ms to find 0 implicit places.
[2024-06-01 05:40:10] [INFO ] Redundant transitions in 2 ms returned []
Running 499 sub problems to find dead transitions.
[2024-06-01 05:40:10] [INFO ] Flow matrix only has 122 transitions (discarded 380 similar events)
[2024-06-01 05:40:10] [INFO ] Invariant cache hit.
[2024-06-01 05:40:10] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 2 (OVERLAPS) 122/182 variables, 60/65 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/182 variables, 20/85 constraints. Problems are: Problem set: 0 solved, 499 unsolved
[2024-06-01 05:40:14] [INFO ] Deduced a trap composed of 12 places in 61 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/182 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/182 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 6 (OVERLAPS) 0/182 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 499 unsolved
No progress, stopping.
After SMT solving in domain Real declared 182/182 variables, and 86 constraints, problems are : Problem set: 0 solved, 499 unsolved in 10317 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 60/60 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 499/499 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 499 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 3 (OVERLAPS) 122/182 variables, 60/66 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/182 variables, 20/86 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/182 variables, 499/585 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/182 variables, 0/585 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 7 (OVERLAPS) 0/182 variables, 0/585 constraints. Problems are: Problem set: 0 solved, 499 unsolved
No progress, stopping.
After SMT solving in domain Int declared 182/182 variables, and 585 constraints, problems are : Problem set: 0 solved, 499 unsolved in 26336 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 60/60 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 499/499 constraints, Known Traps: 1/1 constraints]
After SMT, in 37312ms problems are : Problem set: 0 solved, 499 unsolved
Search for dead transitions found 0 dead transitions in 37317ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 37629 ms. Remains : 60/60 places, 502/502 transitions.
Treatment of property BridgeAndVehicles-PT-V20P10N10-LTLCardinality-11 finished in 77713 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(F(p0))||G(p1))))'
Support contains 2 out of 68 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 68/68 places, 506/506 transitions.
Graph (complete) has 1139 edges and 68 vertex of which 67 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 66 transition count 505
Applied a total of 3 rules in 16 ms. Remains 66 /68 variables (removed 2) and now considering 505/506 (removed 1) transitions.
Running 502 sub problems to find dead transitions.
[2024-06-01 05:40:47] [INFO ] Flow matrix only has 125 transitions (discarded 380 similar events)
// Phase 1: matrix 125 rows 66 cols
[2024-06-01 05:40:47] [INFO ] Computed 8 invariants in 1 ms
[2024-06-01 05:40:47] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2024-06-01 05:40:49] [INFO ] Deduced a trap composed of 5 places in 83 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 4 (OVERLAPS) 1/66 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2024-06-01 05:40:53] [INFO ] Deduced a trap composed of 6 places in 65 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 7 (OVERLAPS) 125/191 variables, 66/76 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/191 variables, 20/96 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/191 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 10 (OVERLAPS) 0/191 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 502 unsolved
No progress, stopping.
After SMT solving in domain Real declared 191/191 variables, and 96 constraints, problems are : Problem set: 0 solved, 502 unsolved in 13551 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 66/66 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 502/502 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 502 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 4 (OVERLAPS) 1/66 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 7 (OVERLAPS) 125/191 variables, 66/76 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/191 variables, 20/96 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/191 variables, 502/598 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/191 variables, 0/598 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2024-06-01 05:41:16] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 191/191 variables, and 599 constraints, problems are : Problem set: 0 solved, 502 unsolved in 20014 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 66/66 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 502/502 constraints, Known Traps: 3/3 constraints]
After SMT, in 34300ms problems are : Problem set: 0 solved, 502 unsolved
Search for dead transitions found 0 dead transitions in 34304ms
[2024-06-01 05:41:21] [INFO ] Flow matrix only has 125 transitions (discarded 380 similar events)
[2024-06-01 05:41:21] [INFO ] Invariant cache hit.
[2024-06-01 05:41:21] [INFO ] Implicit Places using invariants in 143 ms returned [22, 47]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 146 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 64/68 places, 505/506 transitions.
Applied a total of 0 rules in 16 ms. Remains 64 /64 variables (removed 0) and now considering 505/505 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 34484 ms. Remains : 64/68 places, 505/506 transitions.
Stuttering acceptance computed with spot in 63 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BridgeAndVehicles-PT-V20P10N10-LTLCardinality-12
Product exploration explored 100000 steps with 1708 reset in 262 ms.
Product exploration explored 100000 steps with 1709 reset in 272 ms.
Computed a total of 47 stabilizing places and 81 stable transitions
Graph (complete) has 1050 edges and 64 vertex of which 63 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 47 stabilizing places and 81 stable transitions
Detected a total of 47/64 stabilizing places and 81/505 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (X (AND (NOT p1) (NOT p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 347 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 423 steps (1 resets) in 6 ms. (60 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (X (AND (NOT p1) (NOT p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 11 factoid took 545 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2024-06-01 05:41:23] [INFO ] Flow matrix only has 125 transitions (discarded 380 similar events)
// Phase 1: matrix 125 rows 64 cols
[2024-06-01 05:41:23] [INFO ] Computed 6 invariants in 1 ms
[2024-06-01 05:41:23] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-06-01 05:41:23] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2024-06-01 05:41:23] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:41:24] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-06-01 05:41:24] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2024-06-01 05:41:24] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-06-01 05:41:24] [INFO ] [Nat]Added 20 Read/Feed constraints in 41 ms returned sat
[2024-06-01 05:41:24] [INFO ] Deduced a trap composed of 5 places in 91 ms of which 1 ms to minimize.
[2024-06-01 05:41:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 119 ms
[2024-06-01 05:41:24] [INFO ] Computed and/alt/rep : 48/96/48 causal constraints (skipped 74 transitions) in 21 ms.
[2024-06-01 05:41:24] [INFO ] Added : 34 causal constraints over 7 iterations in 128 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 2 out of 64 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 505/505 transitions.
Applied a total of 0 rules in 12 ms. Remains 64 /64 variables (removed 0) and now considering 505/505 (removed 0) transitions.
Running 502 sub problems to find dead transitions.
[2024-06-01 05:41:24] [INFO ] Flow matrix only has 125 transitions (discarded 380 similar events)
[2024-06-01 05:41:24] [INFO ] Invariant cache hit.
[2024-06-01 05:41:24] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2024-06-01 05:41:26] [INFO ] Deduced a trap composed of 5 places in 72 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 3 (OVERLAPS) 1/64 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2024-06-01 05:41:29] [INFO ] Deduced a trap composed of 6 places in 48 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 6 (OVERLAPS) 125/189 variables, 64/72 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2024-06-01 05:41:34] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 1 ms to minimize.
[2024-06-01 05:41:34] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 2/94 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/189 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 10 (OVERLAPS) 0/189 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 502 unsolved
No progress, stopping.
After SMT solving in domain Real declared 189/189 variables, and 94 constraints, problems are : Problem set: 0 solved, 502 unsolved in 15605 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 64/64 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 502/502 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 502 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 3 (OVERLAPS) 1/64 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 6 (OVERLAPS) 125/189 variables, 64/74 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 20/94 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 502/596 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/189 variables, 0/596 constraints. Problems are: Problem set: 0 solved, 502 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 189/189 variables, and 596 constraints, problems are : Problem set: 0 solved, 502 unsolved in 20014 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 64/64 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 502/502 constraints, Known Traps: 4/4 constraints]
After SMT, in 36335ms problems are : Problem set: 0 solved, 502 unsolved
Search for dead transitions found 0 dead transitions in 36341ms
[2024-06-01 05:42:00] [INFO ] Flow matrix only has 125 transitions (discarded 380 similar events)
[2024-06-01 05:42:00] [INFO ] Invariant cache hit.
[2024-06-01 05:42:00] [INFO ] Implicit Places using invariants in 125 ms returned []
[2024-06-01 05:42:00] [INFO ] Flow matrix only has 125 transitions (discarded 380 similar events)
[2024-06-01 05:42:00] [INFO ] Invariant cache hit.
[2024-06-01 05:42:00] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-06-01 05:42:01] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 256 ms to find 0 implicit places.
[2024-06-01 05:42:01] [INFO ] Redundant transitions in 3 ms returned []
Running 502 sub problems to find dead transitions.
[2024-06-01 05:42:01] [INFO ] Flow matrix only has 125 transitions (discarded 380 similar events)
[2024-06-01 05:42:01] [INFO ] Invariant cache hit.
[2024-06-01 05:42:01] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2024-06-01 05:42:02] [INFO ] Deduced a trap composed of 5 places in 78 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 3 (OVERLAPS) 1/64 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2024-06-01 05:42:06] [INFO ] Deduced a trap composed of 6 places in 78 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 6 (OVERLAPS) 125/189 variables, 64/72 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2024-06-01 05:42:10] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 0 ms to minimize.
[2024-06-01 05:42:10] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 2/94 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/189 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 10 (OVERLAPS) 0/189 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 502 unsolved
No progress, stopping.
After SMT solving in domain Real declared 189/189 variables, and 94 constraints, problems are : Problem set: 0 solved, 502 unsolved in 14509 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 64/64 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 502/502 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 502 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 3 (OVERLAPS) 1/64 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 6 (OVERLAPS) 125/189 variables, 64/74 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 20/94 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 502/596 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/189 variables, 0/596 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 10 (OVERLAPS) 0/189 variables, 0/596 constraints. Problems are: Problem set: 0 solved, 502 unsolved
No progress, stopping.
After SMT solving in domain Int declared 189/189 variables, and 596 constraints, problems are : Problem set: 0 solved, 502 unsolved in 26053 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 64/64 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 502/502 constraints, Known Traps: 4/4 constraints]
After SMT, in 41328ms problems are : Problem set: 0 solved, 502 unsolved
Search for dead transitions found 0 dead transitions in 41333ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 77953 ms. Remains : 64/64 places, 505/505 transitions.
Computed a total of 47 stabilizing places and 81 stable transitions
Graph (complete) has 1050 edges and 64 vertex of which 63 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 47 stabilizing places and 81 stable transitions
Detected a total of 47/64 stabilizing places and 81/505 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 326 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 93 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 701 steps (3 resets) in 8 ms. (77 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 11 factoid took 564 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2024-06-01 05:42:43] [INFO ] Flow matrix only has 125 transitions (discarded 380 similar events)
[2024-06-01 05:42:43] [INFO ] Invariant cache hit.
[2024-06-01 05:42:43] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-06-01 05:42:43] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2024-06-01 05:42:43] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:42:43] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-06-01 05:42:43] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2024-06-01 05:42:43] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-06-01 05:42:44] [INFO ] [Nat]Added 20 Read/Feed constraints in 56 ms returned sat
[2024-06-01 05:42:44] [INFO ] Deduced a trap composed of 5 places in 91 ms of which 1 ms to minimize.
[2024-06-01 05:42:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 135 ms
[2024-06-01 05:42:44] [INFO ] Computed and/alt/rep : 48/96/48 causal constraints (skipped 74 transitions) in 41 ms.
[2024-06-01 05:42:44] [INFO ] Added : 27 causal constraints over 6 iterations in 135 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 89 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1717 reset in 243 ms.
Product exploration explored 100000 steps with 1738 reset in 207 ms.
Support contains 2 out of 64 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 505/505 transitions.
Applied a total of 0 rules in 12 ms. Remains 64 /64 variables (removed 0) and now considering 505/505 (removed 0) transitions.
Running 502 sub problems to find dead transitions.
[2024-06-01 05:42:44] [INFO ] Flow matrix only has 125 transitions (discarded 380 similar events)
[2024-06-01 05:42:44] [INFO ] Invariant cache hit.
[2024-06-01 05:42:44] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2024-06-01 05:42:46] [INFO ] Deduced a trap composed of 5 places in 75 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 3 (OVERLAPS) 1/64 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2024-06-01 05:42:50] [INFO ] Deduced a trap composed of 6 places in 72 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 6 (OVERLAPS) 125/189 variables, 64/72 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2024-06-01 05:42:54] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
[2024-06-01 05:42:55] [INFO ] Deduced a trap composed of 14 places in 83 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 2/94 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/189 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 10 (OVERLAPS) 0/189 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 502 unsolved
No progress, stopping.
After SMT solving in domain Real declared 189/189 variables, and 94 constraints, problems are : Problem set: 0 solved, 502 unsolved in 15842 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 64/64 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 502/502 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 502 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 3 (OVERLAPS) 1/64 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 6 (OVERLAPS) 125/189 variables, 64/74 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 20/94 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 502/596 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/189 variables, 0/596 constraints. Problems are: Problem set: 0 solved, 502 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 189/189 variables, and 596 constraints, problems are : Problem set: 0 solved, 502 unsolved in 20012 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 64/64 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 502/502 constraints, Known Traps: 4/4 constraints]
After SMT, in 36557ms problems are : Problem set: 0 solved, 502 unsolved
Search for dead transitions found 0 dead transitions in 36561ms
[2024-06-01 05:43:21] [INFO ] Flow matrix only has 125 transitions (discarded 380 similar events)
[2024-06-01 05:43:21] [INFO ] Invariant cache hit.
[2024-06-01 05:43:21] [INFO ] Implicit Places using invariants in 107 ms returned []
[2024-06-01 05:43:21] [INFO ] Flow matrix only has 125 transitions (discarded 380 similar events)
[2024-06-01 05:43:21] [INFO ] Invariant cache hit.
[2024-06-01 05:43:21] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-06-01 05:43:21] [INFO ] Implicit Places using invariants and state equation in 201 ms returned []
Implicit Place search using SMT with State Equation took 310 ms to find 0 implicit places.
[2024-06-01 05:43:21] [INFO ] Redundant transitions in 3 ms returned []
Running 502 sub problems to find dead transitions.
[2024-06-01 05:43:21] [INFO ] Flow matrix only has 125 transitions (discarded 380 similar events)
[2024-06-01 05:43:21] [INFO ] Invariant cache hit.
[2024-06-01 05:43:21] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2024-06-01 05:43:23] [INFO ] Deduced a trap composed of 5 places in 53 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 3 (OVERLAPS) 1/64 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2024-06-01 05:43:27] [INFO ] Deduced a trap composed of 6 places in 84 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 6 (OVERLAPS) 125/189 variables, 64/72 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2024-06-01 05:43:31] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 1 ms to minimize.
[2024-06-01 05:43:31] [INFO ] Deduced a trap composed of 14 places in 80 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 2/94 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/189 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 10 (OVERLAPS) 0/189 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 502 unsolved
No progress, stopping.
After SMT solving in domain Real declared 189/189 variables, and 94 constraints, problems are : Problem set: 0 solved, 502 unsolved in 15196 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 64/64 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 502/502 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 502 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 3 (OVERLAPS) 1/64 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 6 (OVERLAPS) 125/189 variables, 64/74 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 20/94 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 502/596 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/189 variables, 0/596 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 10 (OVERLAPS) 0/189 variables, 0/596 constraints. Problems are: Problem set: 0 solved, 502 unsolved
No progress, stopping.
After SMT solving in domain Int declared 189/189 variables, and 596 constraints, problems are : Problem set: 0 solved, 502 unsolved in 25839 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 64/64 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 502/502 constraints, Known Traps: 4/4 constraints]
After SMT, in 41745ms problems are : Problem set: 0 solved, 502 unsolved
Search for dead transitions found 0 dead transitions in 41750ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 78642 ms. Remains : 64/64 places, 505/505 transitions.
Treatment of property BridgeAndVehicles-PT-V20P10N10-LTLCardinality-12 finished in 196091 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 1 out of 68 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 68/68 places, 506/506 transitions.
Graph (complete) has 1139 edges and 68 vertex of which 66 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 65 transition count 505
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 65 transition count 505
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 63 transition count 504
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 10 place count 61 transition count 502
Applied a total of 10 rules in 29 ms. Remains 61 /68 variables (removed 7) and now considering 502/506 (removed 4) transitions.
[2024-06-01 05:44:03] [INFO ] Flow matrix only has 122 transitions (discarded 380 similar events)
// Phase 1: matrix 122 rows 61 cols
[2024-06-01 05:44:03] [INFO ] Computed 6 invariants in 2 ms
[2024-06-01 05:44:03] [INFO ] Implicit Places using invariants in 137 ms returned [46]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 138 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 60/68 places, 502/506 transitions.
Applied a total of 0 rules in 15 ms. Remains 60 /60 variables (removed 0) and now considering 502/502 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 183 ms. Remains : 60/68 places, 502/506 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V20P10N10-LTLCardinality-13
Stuttering criterion allowed to conclude after 126 steps with 0 reset in 0 ms.
FORMULA BridgeAndVehicles-PT-V20P10N10-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V20P10N10-LTLCardinality-13 finished in 236 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))||F((p1&&G(F(p1))))))'
Support contains 3 out of 68 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 506/506 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 66 transition count 506
Applied a total of 2 rules in 2 ms. Remains 66 /68 variables (removed 2) and now considering 506/506 (removed 0) transitions.
Running 503 sub problems to find dead transitions.
[2024-06-01 05:44:03] [INFO ] Flow matrix only has 126 transitions (discarded 380 similar events)
// Phase 1: matrix 126 rows 66 cols
[2024-06-01 05:44:03] [INFO ] Computed 7 invariants in 1 ms
[2024-06-01 05:44:03] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-06-01 05:44:05] [INFO ] Deduced a trap composed of 5 places in 159 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 4 (OVERLAPS) 126/192 variables, 66/74 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/192 variables, 20/94 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-06-01 05:44:09] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 0 ms to minimize.
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/192 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 8 (OVERLAPS) 0/192 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 503 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 95 constraints, problems are : Problem set: 0 solved, 503 unsolved in 11793 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 66/66 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 503/503 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 503 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 4 (OVERLAPS) 126/192 variables, 66/75 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/192 variables, 20/95 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/192 variables, 503/598 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 0/598 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-06-01 05:44:34] [INFO ] Deduced a trap composed of 5 places in 72 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/192 variables, 1/599 constraints. Problems are: Problem set: 0 solved, 503 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 192/192 variables, and 599 constraints, problems are : Problem set: 0 solved, 503 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 66/66 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 503/503 constraints, Known Traps: 3/3 constraints]
After SMT, in 32600ms problems are : Problem set: 0 solved, 503 unsolved
Search for dead transitions found 0 dead transitions in 32604ms
[2024-06-01 05:44:36] [INFO ] Flow matrix only has 126 transitions (discarded 380 similar events)
[2024-06-01 05:44:36] [INFO ] Invariant cache hit.
[2024-06-01 05:44:36] [INFO ] Implicit Places using invariants in 135 ms returned [22, 48]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 137 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 64/68 places, 506/506 transitions.
Applied a total of 0 rules in 1 ms. Remains 64 /64 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 32749 ms. Remains : 64/68 places, 506/506 transitions.
Stuttering acceptance computed with spot in 171 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : BridgeAndVehicles-PT-V20P10N10-LTLCardinality-14
Product exploration explored 100000 steps with 33333 reset in 290 ms.
Product exploration explored 100000 steps with 33333 reset in 266 ms.
Computed a total of 47 stabilizing places and 82 stable transitions
Computed a total of 47 stabilizing places and 82 stable transitions
Detected a total of 47/64 stabilizing places and 82/506 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 21 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BridgeAndVehicles-PT-V20P10N10-LTLCardinality-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BridgeAndVehicles-PT-V20P10N10-LTLCardinality-14 finished in 33513 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 2 out of 68 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 68/68 places, 506/506 transitions.
Graph (complete) has 1139 edges and 68 vertex of which 66 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 65 transition count 505
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 65 transition count 505
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 63 transition count 504
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 62 transition count 503
Applied a total of 8 rules in 40 ms. Remains 62 /68 variables (removed 6) and now considering 503/506 (removed 3) transitions.
[2024-06-01 05:44:37] [INFO ] Flow matrix only has 123 transitions (discarded 380 similar events)
// Phase 1: matrix 123 rows 62 cols
[2024-06-01 05:44:37] [INFO ] Computed 6 invariants in 2 ms
[2024-06-01 05:44:37] [INFO ] Implicit Places using invariants in 113 ms returned [22, 46]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 114 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 60/68 places, 503/506 transitions.
Applied a total of 0 rules in 16 ms. Remains 60 /60 variables (removed 0) and now considering 503/503 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 173 ms. Remains : 60/68 places, 503/506 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V20P10N10-LTLCardinality-15
Product exploration explored 100000 steps with 777 reset in 234 ms.
Product exploration explored 100000 steps with 777 reset in 236 ms.
Computed a total of 44 stabilizing places and 80 stable transitions
Computed a total of 44 stabilizing places and 80 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 75 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
RANDOM walk for 100 steps (0 resets) in 4 ms. (20 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 101 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Support contains 2 out of 60 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 60/60 places, 503/503 transitions.
Applied a total of 0 rules in 14 ms. Remains 60 /60 variables (removed 0) and now considering 503/503 (removed 0) transitions.
[2024-06-01 05:44:38] [INFO ] Flow matrix only has 123 transitions (discarded 380 similar events)
// Phase 1: matrix 123 rows 60 cols
[2024-06-01 05:44:38] [INFO ] Computed 4 invariants in 1 ms
[2024-06-01 05:44:38] [INFO ] Implicit Places using invariants in 115 ms returned []
[2024-06-01 05:44:38] [INFO ] Flow matrix only has 123 transitions (discarded 380 similar events)
[2024-06-01 05:44:38] [INFO ] Invariant cache hit.
[2024-06-01 05:44:38] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-06-01 05:44:38] [INFO ] Implicit Places using invariants and state equation in 175 ms returned []
Implicit Place search using SMT with State Equation took 291 ms to find 0 implicit places.
[2024-06-01 05:44:38] [INFO ] Redundant transitions in 3 ms returned []
Running 500 sub problems to find dead transitions.
[2024-06-01 05:44:38] [INFO ] Flow matrix only has 123 transitions (discarded 380 similar events)
[2024-06-01 05:44:38] [INFO ] Invariant cache hit.
[2024-06-01 05:44:38] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 500 unsolved
[2024-06-01 05:44:40] [INFO ] Deduced a trap composed of 5 places in 89 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 3 (OVERLAPS) 123/183 variables, 60/65 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/183 variables, 20/85 constraints. Problems are: Problem set: 0 solved, 500 unsolved
[2024-06-01 05:44:44] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/183 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/183 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 7 (OVERLAPS) 0/183 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 500 unsolved
No progress, stopping.
After SMT solving in domain Real declared 183/183 variables, and 86 constraints, problems are : Problem set: 0 solved, 500 unsolved in 11583 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 60/60 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 500/500 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 500 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 3 (OVERLAPS) 123/183 variables, 60/66 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/183 variables, 20/86 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/183 variables, 500/586 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/183 variables, 0/586 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 7 (OVERLAPS) 0/183 variables, 0/586 constraints. Problems are: Problem set: 0 solved, 500 unsolved
No progress, stopping.
After SMT solving in domain Int declared 183/183 variables, and 586 constraints, problems are : Problem set: 0 solved, 500 unsolved in 19498 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 60/60 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 500/500 constraints, Known Traps: 2/2 constraints]
After SMT, in 31794ms problems are : Problem set: 0 solved, 500 unsolved
Search for dead transitions found 0 dead transitions in 31800ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 32115 ms. Remains : 60/60 places, 503/503 transitions.
Computed a total of 44 stabilizing places and 80 stable transitions
Computed a total of 44 stabilizing places and 80 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 96 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
RANDOM walk for 247 steps (0 resets) in 4 ms. (49 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 105 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Product exploration explored 100000 steps with 777 reset in 300 ms.
Product exploration explored 100000 steps with 777 reset in 290 ms.
Support contains 2 out of 60 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 60/60 places, 503/503 transitions.
Applied a total of 0 rules in 29 ms. Remains 60 /60 variables (removed 0) and now considering 503/503 (removed 0) transitions.
[2024-06-01 05:45:11] [INFO ] Flow matrix only has 123 transitions (discarded 380 similar events)
[2024-06-01 05:45:11] [INFO ] Invariant cache hit.
[2024-06-01 05:45:11] [INFO ] Implicit Places using invariants in 100 ms returned []
[2024-06-01 05:45:11] [INFO ] Flow matrix only has 123 transitions (discarded 380 similar events)
[2024-06-01 05:45:11] [INFO ] Invariant cache hit.
[2024-06-01 05:45:11] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-06-01 05:45:11] [INFO ] Implicit Places using invariants and state equation in 207 ms returned []
Implicit Place search using SMT with State Equation took 309 ms to find 0 implicit places.
[2024-06-01 05:45:11] [INFO ] Redundant transitions in 3 ms returned []
Running 500 sub problems to find dead transitions.
[2024-06-01 05:45:11] [INFO ] Flow matrix only has 123 transitions (discarded 380 similar events)
[2024-06-01 05:45:11] [INFO ] Invariant cache hit.
[2024-06-01 05:45:11] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 500 unsolved
[2024-06-01 05:45:13] [INFO ] Deduced a trap composed of 5 places in 81 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 3 (OVERLAPS) 123/183 variables, 60/65 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/183 variables, 20/85 constraints. Problems are: Problem set: 0 solved, 500 unsolved
[2024-06-01 05:45:17] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/183 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/183 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 7 (OVERLAPS) 0/183 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 500 unsolved
No progress, stopping.
After SMT solving in domain Real declared 183/183 variables, and 86 constraints, problems are : Problem set: 0 solved, 500 unsolved in 10964 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 60/60 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 500/500 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 500 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 3 (OVERLAPS) 123/183 variables, 60/66 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/183 variables, 20/86 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/183 variables, 500/586 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/183 variables, 0/586 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 7 (OVERLAPS) 0/183 variables, 0/586 constraints. Problems are: Problem set: 0 solved, 500 unsolved
No progress, stopping.
After SMT solving in domain Int declared 183/183 variables, and 586 constraints, problems are : Problem set: 0 solved, 500 unsolved in 18416 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 60/60 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 500/500 constraints, Known Traps: 2/2 constraints]
After SMT, in 30194ms problems are : Problem set: 0 solved, 500 unsolved
Search for dead transitions found 0 dead transitions in 30199ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 30548 ms. Remains : 60/60 places, 503/503 transitions.
Treatment of property BridgeAndVehicles-PT-V20P10N10-LTLCardinality-15 finished in 64645 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)||G(p1)) U (p2&&X(p3)&&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' '!((G(!p0)||(!p0&&F(p1))))'
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' '!(F((p0 U (p1||G(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' '!(F((G(F(p0))||G(p1))))'
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)))'
[2024-06-01 05:45:42] [INFO ] Flatten gal took : 51 ms
[2024-06-01 05:45:42] [INFO ] Export to MCC of 6 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-06-01 05:45:42] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 68 places, 506 transitions and 3742 arcs took 11 ms.
Total runtime 1104913 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA BridgeAndVehicles-PT-V20P10N10-LTLCardinality-05 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA BridgeAndVehicles-PT-V20P10N10-LTLCardinality-06 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA BridgeAndVehicles-PT-V20P10N10-LTLCardinality-10 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA BridgeAndVehicles-PT-V20P10N10-LTLCardinality-11 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA BridgeAndVehicles-PT-V20P10N10-LTLCardinality-12 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA BridgeAndVehicles-PT-V20P10N10-LTLCardinality-15 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717220866494

--------------------
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 LTLCardinality -timeout 360 -rebuildPNML
mcc2024
ltl formula name BridgeAndVehicles-PT-V20P10N10-LTLCardinality-05
ltl formula formula --ltl=/tmp/2520/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 68 places, 506 transitions and 3742 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.060 real 0.010 user 0.020 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2520/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2520/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2520/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2520/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 15 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 69 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 69, there are 573 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Accepting cycle FOUND at depth ~170!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 86
pnml2lts-mc( 0/ 4): unique states count: 645
pnml2lts-mc( 0/ 4): unique transitions count: 1479
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 82
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 732
pnml2lts-mc( 0/ 4): - cum. max stack depth: 628
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 732 states 1646 transitions, fanout: 2.249
pnml2lts-mc( 0/ 4): Total exploration time 0.020 sec (0.020 sec minimum, 0.020 sec on average)
pnml2lts-mc( 0/ 4): States per second: 36600, Transitions per second: 82300
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 31.0 B/state, compr.: 11.2%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 518 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name BridgeAndVehicles-PT-V20P10N10-LTLCardinality-06
ltl formula formula --ltl=/tmp/2520/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 68 places, 506 transitions and 3742 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.050 real 0.020 user 0.020 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2520/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2520/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2520/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2520/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 69 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 69, there are 513 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4): ~141 levels ~10000 states ~24672 transitions
pnml2lts-mc( 2/ 4): ~147 levels ~20000 states ~47268 transitions
pnml2lts-mc( 2/ 4): ~147 levels ~40000 states ~100736 transitions
pnml2lts-mc( 2/ 4): ~147 levels ~80000 states ~212928 transitions
pnml2lts-mc( 2/ 4): ~147 levels ~160000 states ~451264 transitions
pnml2lts-mc( 2/ 4): ~147 levels ~320000 states ~939048 transitions
pnml2lts-mc( 2/ 4): ~147 levels ~640000 states ~1956960 transitions
pnml2lts-mc( 2/ 4): ~147 levels ~1280000 states ~4072716 transitions
pnml2lts-mc( 2/ 4): ~147 levels ~2560000 states ~8533892 transitions
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 4010072
pnml2lts-mc( 0/ 4): unique states count: 4010072
pnml2lts-mc( 0/ 4): unique transitions count: 13118601
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 9185491
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 4064207
pnml2lts-mc( 0/ 4): - cum. max stack depth: 551
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 4064207 states 13309445 transitions, fanout: 3.275
pnml2lts-mc( 0/ 4): Total exploration time 12.510 sec (12.510 sec minimum, 12.510 sec on average)
pnml2lts-mc( 0/ 4): States per second: 324877, Transitions per second: 1063904
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 31.0MB, 8.1 B/state, compr.: 2.9%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 11.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 518 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 31.0MB (~256.0MB paged-in)
ltl formula name BridgeAndVehicles-PT-V20P10N10-LTLCardinality-10
ltl formula formula --ltl=/tmp/2520/ltl_2_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 68 places, 506 transitions and 3742 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.070 real 0.030 user 0.020 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2520/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2520/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2520/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2520/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 69 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 69, there are 509 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4): ~175 levels ~10000 states ~31772 transitions
pnml2lts-mc( 1/ 4): ~175 levels ~20000 states ~71664 transitions
pnml2lts-mc( 3/ 4): ~174 levels ~40000 states ~117540 transitions
pnml2lts-mc( 3/ 4): ~174 levels ~80000 states ~240924 transitions
pnml2lts-mc( 0/ 4): ~178 levels ~160000 states ~503184 transitions
pnml2lts-mc( 0/ 4): ~178 levels ~320000 states ~1087752 transitions
pnml2lts-mc( 0/ 4): ~178 levels ~640000 states ~2284852 transitions
pnml2lts-mc( 0/ 4): ~178 levels ~1280000 states ~4808152 transitions
pnml2lts-mc( 0/ 4): ~178 levels ~2560000 states ~10284212 transitions
pnml2lts-mc( 3/ 4): ~174 levels ~5120000 states ~20831724 transitions
pnml2lts-mc( 3/ 4): ~174 levels ~10240000 states ~39969320 transitions
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 9963147
pnml2lts-mc( 0/ 4): unique states count: 9963147
pnml2lts-mc( 0/ 4): unique transitions count: 42825857
pnml2lts-mc( 0/ 4): - self-loop count: 21
pnml2lts-mc( 0/ 4): - claim dead count: 34324563
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 10570630
pnml2lts-mc( 0/ 4): - cum. max stack depth: 702
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 10570630 states 45880437 transitions, fanout: 4.340
pnml2lts-mc( 0/ 4): Total exploration time 31.970 sec (31.970 sec minimum, 31.970 sec on average)
pnml2lts-mc( 0/ 4): States per second: 330642, Transitions per second: 1435109
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 76.6MB, 8.1 B/state, compr.: 2.9%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 29.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 518 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 76.6MB (~256.0MB paged-in)
ltl formula name BridgeAndVehicles-PT-V20P10N10-LTLCardinality-11
ltl formula formula --ltl=/tmp/2520/ltl_3_
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 68 places, 506 transitions and 3742 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.070 real 0.040 user 0.010 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2520/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2520/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2520/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2520/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): There are 68 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 69, there are 510 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4): ~108 levels ~10000 states ~24392 transitions
pnml2lts-mc( 1/ 4): ~111 levels ~20000 states ~49372 transitions
pnml2lts-mc( 1/ 4): ~120 levels ~40000 states ~99152 transitions
pnml2lts-mc( 1/ 4): ~136 levels ~80000 states ~198328 transitions
pnml2lts-mc( 1/ 4): ~184 levels ~160000 states ~410928 transitions
pnml2lts-mc( 1/ 4): ~184 levels ~320000 states ~901516 transitions
pnml2lts-mc( 1/ 4): ~184 levels ~640000 states ~1913952 transitions
pnml2lts-mc( 1/ 4): ~184 levels ~1280000 states ~4082952 transitions
pnml2lts-mc( 2/ 4): ~178 levels ~2560000 states ~8695828 transitions
pnml2lts-mc( 2/ 4): ~178 levels ~5120000 states ~17779588 transitions
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 7523371
pnml2lts-mc( 0/ 4): unique states count: 7523371
pnml2lts-mc( 0/ 4): unique transitions count: 26313443
pnml2lts-mc( 0/ 4): - self-loop count: 15
pnml2lts-mc( 0/ 4): - claim dead count: 18928285
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 7614146
pnml2lts-mc( 0/ 4): - cum. max stack depth: 708
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 7614146 states 26637122 transitions, fanout: 3.498
pnml2lts-mc( 0/ 4): Total exploration time 22.860 sec (22.860 sec minimum, 22.860 sec on average)
pnml2lts-mc( 0/ 4): States per second: 333077, Transitions per second: 1165228
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 58.0MB, 8.1 B/state, compr.: 2.9%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 22.0%/1.0%
pnml2lts-mc( 0/ 4): Stored 518 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 58.0MB (~256.0MB paged-in)
ltl formula name BridgeAndVehicles-PT-V20P10N10-LTLCardinality-12
ltl formula formula --ltl=/tmp/2520/ltl_4_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 68 places, 506 transitions and 3742 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.070 real 0.020 user 0.030 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2520/ltl_4_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2520/ltl_4_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2520/ltl_4_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2520/ltl_4_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): There are 68 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 69, there are 512 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4): ~67 levels ~10000 states ~19280 transitions
pnml2lts-mc( 1/ 4): ~67 levels ~20000 states ~36920 transitions
pnml2lts-mc( 1/ 4): ~67 levels ~40000 states ~85448 transitions
pnml2lts-mc( 1/ 4): ~95 levels ~80000 states ~211436 transitions
pnml2lts-mc( 1/ 4): ~95 levels ~160000 states ~412120 transitions
pnml2lts-mc( 1/ 4): ~95 levels ~320000 states ~740268 transitions
pnml2lts-mc( 2/ 4): ~130 levels ~640000 states ~1654192 transitions
pnml2lts-mc( 2/ 4): ~174 levels ~1280000 states ~3634776 transitions
pnml2lts-mc( 1/ 4): ~184 levels ~2560000 states ~8226296 transitions
pnml2lts-mc( 1/ 4): ~184 levels ~5120000 states ~17281160 transitions
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 7615452
pnml2lts-mc( 0/ 4): unique states count: 7615452
pnml2lts-mc( 0/ 4): unique transitions count: 27978510
pnml2lts-mc( 0/ 4): - self-loop count: 20
pnml2lts-mc( 0/ 4): - claim dead count: 20802224
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 7803540
pnml2lts-mc( 0/ 4): - cum. max stack depth: 712
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 7803540 states 28799379 transitions, fanout: 3.691
pnml2lts-mc( 0/ 4): Total exploration time 24.220 sec (24.220 sec minimum, 24.220 sec on average)
pnml2lts-mc( 0/ 4): States per second: 322194, Transitions per second: 1189074
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 58.7MB, 8.1 B/state, compr.: 2.9%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 22.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 518 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 58.7MB (~256.0MB paged-in)
ltl formula name BridgeAndVehicles-PT-V20P10N10-LTLCardinality-15
ltl formula formula --ltl=/tmp/2520/ltl_5_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 68 places, 506 transitions and 3742 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.070 real 0.020 user 0.010 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2520/ltl_5_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2520/ltl_5_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2520/ltl_5_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2520/ltl_5_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): There are 68 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 69, there are 510 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4): ~175 levels ~10000 states ~26284 transitions
pnml2lts-mc( 1/ 4): ~175 levels ~20000 states ~56384 transitions
pnml2lts-mc( 1/ 4): ~175 levels ~40000 states ~116984 transitions
pnml2lts-mc( 1/ 4): ~175 levels ~80000 states ~246492 transitions
pnml2lts-mc( 1/ 4): ~175 levels ~160000 states ~506736 transitions
pnml2lts-mc( 0/ 4): ~180 levels ~320000 states ~956392 transitions
pnml2lts-mc( 0/ 4): ~180 levels ~640000 states ~2003088 transitions
pnml2lts-mc( 0/ 4): ~180 levels ~1280000 states ~4157792 transitions
pnml2lts-mc( 0/ 4): ~180 levels ~2560000 states ~8568328 transitions
pnml2lts-mc( 2/ 4): ~178 levels ~5120000 states ~17823104 transitions
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 9553415
pnml2lts-mc( 0/ 4): unique states count: 9553415
pnml2lts-mc( 0/ 4): unique transitions count: 33611735
pnml2lts-mc( 0/ 4): - self-loop count: 20
pnml2lts-mc( 0/ 4): - claim dead count: 24222777
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 9653107
pnml2lts-mc( 0/ 4): - cum. max stack depth: 711
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 9653107 states 33980227 transitions, fanout: 3.520
pnml2lts-mc( 0/ 4): Total exploration time 29.700 sec (29.700 sec minimum, 29.700 sec on average)
pnml2lts-mc( 0/ 4): States per second: 325020, Transitions per second: 1144115
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 73.5MB, 8.1 B/state, compr.: 2.9%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 28.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 518 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 73.5MB (~256.0MB paged-in)

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="BridgeAndVehicles-PT-V20P10N10"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is BridgeAndVehicles-PT-V20P10N10, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r472-tajo-171620399000179"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-PT-V20P10N10.tgz
mv BridgeAndVehicles-PT-V20P10N10 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;