Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 464K
-rw-r--r-- 1 mcc users 7.7K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 7.7K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 78K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 36K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 97K Jun 2 16:33 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 FireWire-PT-08-LTLCardinality-00
FORMULA_NAME FireWire-PT-08-LTLCardinality-01
FORMULA_NAME FireWire-PT-08-LTLCardinality-02
FORMULA_NAME FireWire-PT-08-LTLCardinality-03
FORMULA_NAME FireWire-PT-08-LTLCardinality-04
FORMULA_NAME FireWire-PT-08-LTLCardinality-05
FORMULA_NAME FireWire-PT-08-LTLCardinality-06
FORMULA_NAME FireWire-PT-08-LTLCardinality-07
FORMULA_NAME FireWire-PT-08-LTLCardinality-08
FORMULA_NAME FireWire-PT-08-LTLCardinality-09
FORMULA_NAME FireWire-PT-08-LTLCardinality-10
FORMULA_NAME FireWire-PT-08-LTLCardinality-11
FORMULA_NAME FireWire-PT-08-LTLCardinality-12
FORMULA_NAME FireWire-PT-08-LTLCardinality-13
FORMULA_NAME FireWire-PT-08-LTLCardinality-14
FORMULA_NAME FireWire-PT-08-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717361145177

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-08
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-06-02 20:45:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-06-02 20:45:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 20:45:46] [INFO ] Load time of PNML (sax parser for PT used): 73 ms
[2024-06-02 20:45:46] [INFO ] Transformed 127 places.
[2024-06-02 20:45:46] [INFO ] Transformed 397 transitions.
[2024-06-02 20:45:46] [INFO ] Found NUPN structural information;
[2024-06-02 20:45:46] [INFO ] Parsed PT model containing 127 places and 397 transitions and 1475 arcs in 168 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 2 formulas.
Ensure Unique test removed 53 transitions
Reduce redundant transitions removed 53 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA FireWire-PT-08-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-08-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-08-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-08-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-08-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-08-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-08-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 25 out of 127 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 344/344 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 124 transition count 337
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 124 transition count 337
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 124 transition count 336
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 9 place count 122 transition count 331
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 122 transition count 331
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 17 place count 122 transition count 325
Applied a total of 17 rules in 39 ms. Remains 122 /127 variables (removed 5) and now considering 325/344 (removed 19) transitions.
[2024-06-02 20:45:46] [INFO ] Flow matrix only has 299 transitions (discarded 26 similar events)
// Phase 1: matrix 299 rows 122 cols
[2024-06-02 20:45:46] [INFO ] Computed 8 invariants in 26 ms
[2024-06-02 20:45:46] [INFO ] Implicit Places using invariants in 219 ms returned []
[2024-06-02 20:45:46] [INFO ] Flow matrix only has 299 transitions (discarded 26 similar events)
[2024-06-02 20:45:46] [INFO ] Invariant cache hit.
[2024-06-02 20:45:46] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-06-02 20:45:47] [INFO ] Implicit Places using invariants and state equation in 253 ms returned []
Implicit Place search using SMT with State Equation took 514 ms to find 0 implicit places.
Running 324 sub problems to find dead transitions.
[2024-06-02 20:45:47] [INFO ] Flow matrix only has 299 transitions (discarded 26 similar events)
[2024-06-02 20:45:47] [INFO ] Invariant cache hit.
[2024-06-02 20:45:47] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 1 (OVERLAPS) 1/122 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 324 unsolved
[2024-06-02 20:45:49] [INFO ] Deduced a trap composed of 41 places in 96 ms of which 17 ms to minimize.
[2024-06-02 20:45:49] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2024-06-02 20:45:49] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 2 ms to minimize.
[2024-06-02 20:45:49] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 1 ms to minimize.
[2024-06-02 20:45:49] [INFO ] Deduced a trap composed of 44 places in 35 ms of which 1 ms to minimize.
[2024-06-02 20:45:49] [INFO ] Deduced a trap composed of 36 places in 29 ms of which 1 ms to minimize.
[2024-06-02 20:45:50] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 4 (OVERLAPS) 298/420 variables, 122/137 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/420 variables, 42/179 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/420 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 7 (OVERLAPS) 1/421 variables, 1/180 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/421 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 9 (OVERLAPS) 0/421 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 324 unsolved
No progress, stopping.
After SMT solving in domain Real declared 421/421 variables, and 180 constraints, problems are : Problem set: 0 solved, 324 unsolved in 13470 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 122/122 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 324/324 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 324 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 1 (OVERLAPS) 1/122 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 4 (OVERLAPS) 298/420 variables, 122/137 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/420 variables, 42/179 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/420 variables, 324/503 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/420 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 8 (OVERLAPS) 1/421 variables, 1/504 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/421 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 10 (OVERLAPS) 0/421 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 324 unsolved
No progress, stopping.
After SMT solving in domain Int declared 421/421 variables, and 504 constraints, problems are : Problem set: 0 solved, 324 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 122/122 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 324/324 constraints, Known Traps: 7/7 constraints]
After SMT, in 43826ms problems are : Problem set: 0 solved, 324 unsolved
Search for dead transitions found 0 dead transitions in 43848ms
Starting structural reductions in LTL mode, iteration 1 : 122/127 places, 325/344 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44422 ms. Remains : 122/127 places, 325/344 transitions.
Support contains 25 out of 122 places after structural reductions.
[2024-06-02 20:46:31] [INFO ] Flatten gal took : 54 ms
[2024-06-02 20:46:31] [INFO ] Flatten gal took : 28 ms
[2024-06-02 20:46:31] [INFO ] Input system was already deterministic with 325 transitions.
Reduction of identical properties reduced properties to check from 16 to 15
RANDOM walk for 40000 steps (2192 resets) in 1122 ms. (35 steps per ms) remains 8/15 properties
BEST_FIRST walk for 40002 steps (624 resets) in 122 ms. (325 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (579 resets) in 128 ms. (310 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (564 resets) in 91 ms. (434 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (562 resets) in 157 ms. (253 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (585 resets) in 149 ms. (266 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (601 resets) in 150 ms. (264 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (620 resets) in 118 ms. (336 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (61 resets) in 117 ms. (339 steps per ms) remains 6/8 properties
[2024-06-02 20:46:32] [INFO ] Flow matrix only has 299 transitions (discarded 26 similar events)
[2024-06-02 20:46:32] [INFO ] Invariant cache hit.
[2024-06-02 20:46:32] [INFO ] State equation strengthened by 43 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 75/84 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-02 20:46:32] [INFO ] Deduced a trap composed of 44 places in 56 ms of which 1 ms to minimize.
[2024-06-02 20:46:32] [INFO ] Deduced a trap composed of 36 places in 55 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 35/119 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/119 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 298/417 variables, 119/129 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/417 variables, 42/171 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/417 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 3/420 variables, 3/174 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-02 20:46:32] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/420 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/420 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 1/421 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/421 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 0/421 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 421/421 variables, and 176 constraints, problems are : Problem set: 0 solved, 6 unsolved in 552 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 122/122 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 75/84 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem AtomicPropp8 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 2/6 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 35/119 variables, 4/10 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/119 variables, 1/11 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/119 variables, 0/11 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 298/417 variables, 119/130 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/417 variables, 42/172 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/417 variables, 4/176 constraints. Problems are: Problem set: 1 solved, 5 unsolved
[2024-06-02 20:46:32] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/417 variables, 1/177 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/417 variables, 0/177 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 3/420 variables, 3/180 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/420 variables, 1/181 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/420 variables, 0/181 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 1/421 variables, 1/182 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/421 variables, 0/182 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 0/421 variables, 0/182 constraints. Problems are: Problem set: 1 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 421/421 variables, and 182 constraints, problems are : Problem set: 1 solved, 5 unsolved in 549 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 122/122 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 5/6 constraints, Known Traps: 4/4 constraints]
After SMT, in 1108ms problems are : Problem set: 1 solved, 5 unsolved
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 702 ms.
Support contains 7 out of 122 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 122/122 places, 325/325 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 122 transition count 322
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 5 place count 120 transition count 317
Iterating global reduction 1 with 2 rules applied. Total rules applied 7 place count 120 transition count 317
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 119 transition count 315
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 119 transition count 315
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 1 with 2 rules applied. Total rules applied 11 place count 118 transition count 314
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 17 place count 115 transition count 320
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 23 place count 115 transition count 314
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 26 place count 115 transition count 311
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 27 place count 115 transition count 313
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 30 place count 114 transition count 311
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 32 place count 114 transition count 309
Applied a total of 32 rules in 84 ms. Remains 114 /122 variables (removed 8) and now considering 309/325 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 84 ms. Remains : 114/122 places, 309/325 transitions.
RANDOM walk for 40000 steps (2190 resets) in 886 ms. (45 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (521 resets) in 117 ms. (339 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (581 resets) in 152 ms. (261 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (524 resets) in 53 ms. (740 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (542 resets) in 54 ms. (727 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (539 resets) in 69 ms. (571 steps per ms) remains 5/5 properties
Finished probabilistic random walk after 205305 steps, run visited all 5 properties in 782 ms. (steps per millisecond=262 )
Probabilistic random walk after 205305 steps, saw 47382 distinct states, run finished after 787 ms. (steps per millisecond=260 ) properties seen :5
Successfully simplified 1 atomic propositions for a total of 9 simplifications.
Computed a total of 21 stabilizing places and 43 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((p0&&X(p0)))||(X(p2)&&p1))))'
Support contains 4 out of 122 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 122/122 places, 325/325 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 120 transition count 320
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 120 transition count 320
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 118 transition count 315
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 118 transition count 315
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 117 transition count 313
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 117 transition count 313
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 116 transition count 310
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 116 transition count 310
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 115 transition count 308
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 115 transition count 308
Applied a total of 14 rules in 13 ms. Remains 115 /122 variables (removed 7) and now considering 308/325 (removed 17) transitions.
[2024-06-02 20:46:35] [INFO ] Flow matrix only has 282 transitions (discarded 26 similar events)
// Phase 1: matrix 282 rows 115 cols
[2024-06-02 20:46:35] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 20:46:35] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-06-02 20:46:35] [INFO ] Flow matrix only has 282 transitions (discarded 26 similar events)
[2024-06-02 20:46:35] [INFO ] Invariant cache hit.
[2024-06-02 20:46:35] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 20:46:35] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 226 ms to find 0 implicit places.
Running 307 sub problems to find dead transitions.
[2024-06-02 20:46:35] [INFO ] Flow matrix only has 282 transitions (discarded 26 similar events)
[2024-06-02 20:46:35] [INFO ] Invariant cache hit.
[2024-06-02 20:46:35] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 1 (OVERLAPS) 1/115 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 307 unsolved
[2024-06-02 20:46:37] [INFO ] Deduced a trap composed of 40 places in 64 ms of which 1 ms to minimize.
[2024-06-02 20:46:37] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-06-02 20:46:37] [INFO ] Deduced a trap composed of 44 places in 40 ms of which 1 ms to minimize.
[2024-06-02 20:46:37] [INFO ] Deduced a trap composed of 36 places in 24 ms of which 0 ms to minimize.
[2024-06-02 20:46:38] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 1 ms to minimize.
[2024-06-02 20:46:38] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 1 ms to minimize.
[2024-06-02 20:46:38] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
[2024-06-02 20:46:38] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 1 ms to minimize.
[2024-06-02 20:46:38] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 0 ms to minimize.
[2024-06-02 20:46:38] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/115 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 4 (OVERLAPS) 281/396 variables, 115/133 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/396 variables, 39/172 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/396 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 7 (OVERLAPS) 1/397 variables, 1/173 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/397 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 9 (OVERLAPS) 0/397 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 307 unsolved
No progress, stopping.
After SMT solving in domain Real declared 397/397 variables, and 173 constraints, problems are : Problem set: 0 solved, 307 unsolved in 12153 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 115/115 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 307/307 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 307 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 1 (OVERLAPS) 1/115 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/115 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 4 (OVERLAPS) 281/396 variables, 115/133 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/396 variables, 39/172 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/396 variables, 307/479 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/396 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 8 (OVERLAPS) 1/397 variables, 1/480 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/397 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 10 (OVERLAPS) 0/397 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 307 unsolved
No progress, stopping.
After SMT solving in domain Int declared 397/397 variables, and 480 constraints, problems are : Problem set: 0 solved, 307 unsolved in 25219 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 115/115 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 307/307 constraints, Known Traps: 10/10 constraints]
After SMT, in 37558ms problems are : Problem set: 0 solved, 307 unsolved
Search for dead transitions found 0 dead transitions in 37562ms
Starting structural reductions in LTL mode, iteration 1 : 115/122 places, 308/325 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37802 ms. Remains : 115/122 places, 308/325 transitions.
Stuttering acceptance computed with spot in 328 ms :[true, (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : FireWire-PT-08-LTLCardinality-02
Product exploration explored 100000 steps with 1 reset in 150 ms.
Product exploration explored 100000 steps with 0 reset in 87 ms.
Computed a total of 16 stabilizing places and 31 stable transitions
Computed a total of 16 stabilizing places and 31 stable transitions
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (AND p0 (NOT p1))), (X p0), (X (NOT p1)), (X (NOT (AND p0 p1))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (AND p0 (NOT p2))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 11 factoid took 141 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 44 ms :[true, (NOT p0)]
RANDOM walk for 40000 steps (2171 resets) in 144 ms. (275 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (558 resets) in 88 ms. (449 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 2568 steps, run visited all 1 properties in 9 ms. (steps per millisecond=285 )
Probabilistic random walk after 2568 steps, saw 1335 distinct states, run finished after 9 ms. (steps per millisecond=285 ) properties seen :1
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (AND p0 (NOT p1))), (X p0), (X (NOT p1)), (X (NOT (AND p0 p1))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (AND p0 (NOT p2))))]
False Knowledge obtained : [(F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 11 factoid took 147 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA FireWire-PT-08-LTLCardinality-02 FALSE TECHNIQUES KNOWLEDGE
Treatment of property FireWire-PT-08-LTLCardinality-02 finished in 38879 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(G(p0))&&F(p1)))))'
Support contains 3 out of 122 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 122/122 places, 325/325 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 119 transition count 319
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 119 transition count 319
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 8 place count 119 transition count 317
Applied a total of 8 rules in 8 ms. Remains 119 /122 variables (removed 3) and now considering 317/325 (removed 8) transitions.
[2024-06-02 20:47:14] [INFO ] Flow matrix only has 291 transitions (discarded 26 similar events)
// Phase 1: matrix 291 rows 119 cols
[2024-06-02 20:47:14] [INFO ] Computed 8 invariants in 3 ms
[2024-06-02 20:47:14] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-06-02 20:47:14] [INFO ] Flow matrix only has 291 transitions (discarded 26 similar events)
[2024-06-02 20:47:14] [INFO ] Invariant cache hit.
[2024-06-02 20:47:14] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-06-02 20:47:14] [INFO ] Implicit Places using invariants and state equation in 180 ms returned []
Implicit Place search using SMT with State Equation took 254 ms to find 0 implicit places.
Running 316 sub problems to find dead transitions.
[2024-06-02 20:47:14] [INFO ] Flow matrix only has 291 transitions (discarded 26 similar events)
[2024-06-02 20:47:14] [INFO ] Invariant cache hit.
[2024-06-02 20:47:14] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 1 (OVERLAPS) 1/119 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 316 unsolved
[2024-06-02 20:47:16] [INFO ] Deduced a trap composed of 41 places in 73 ms of which 1 ms to minimize.
[2024-06-02 20:47:16] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 1 ms to minimize.
[2024-06-02 20:47:16] [INFO ] Deduced a trap composed of 42 places in 58 ms of which 1 ms to minimize.
[2024-06-02 20:47:16] [INFO ] Deduced a trap composed of 40 places in 61 ms of which 1 ms to minimize.
[2024-06-02 20:47:16] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 1 ms to minimize.
[2024-06-02 20:47:16] [INFO ] Deduced a trap composed of 25 places in 59 ms of which 1 ms to minimize.
[2024-06-02 20:47:16] [INFO ] Deduced a trap composed of 43 places in 36 ms of which 5 ms to minimize.
[2024-06-02 20:47:16] [INFO ] Deduced a trap composed of 35 places in 28 ms of which 0 ms to minimize.
[2024-06-02 20:47:17] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
[2024-06-02 20:47:17] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 4 (OVERLAPS) 290/409 variables, 119/137 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/409 variables, 42/179 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/409 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 7 (OVERLAPS) 1/410 variables, 1/180 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/410 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 9 (OVERLAPS) 0/410 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 316 unsolved
No progress, stopping.
After SMT solving in domain Real declared 410/410 variables, and 180 constraints, problems are : Problem set: 0 solved, 316 unsolved in 12836 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 119/119 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 316/316 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 316 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 1 (OVERLAPS) 1/119 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 4 (OVERLAPS) 290/409 variables, 119/137 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/409 variables, 42/179 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/409 variables, 316/495 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/409 variables, 0/495 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 8 (OVERLAPS) 1/410 variables, 1/496 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/410 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 10 (OVERLAPS) 0/410 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 316 unsolved
No progress, stopping.
After SMT solving in domain Int declared 410/410 variables, and 496 constraints, problems are : Problem set: 0 solved, 316 unsolved in 21924 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 119/119 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 316/316 constraints, Known Traps: 10/10 constraints]
After SMT, in 34974ms problems are : Problem set: 0 solved, 316 unsolved
Search for dead transitions found 0 dead transitions in 34978ms
Starting structural reductions in LTL mode, iteration 1 : 119/122 places, 317/325 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35241 ms. Remains : 119/122 places, 317/325 transitions.
Stuttering acceptance computed with spot in 170 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : FireWire-PT-08-LTLCardinality-03
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA FireWire-PT-08-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-08-LTLCardinality-03 finished in 35436 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(X((p0&&X(F(p1)))))))'
Support contains 4 out of 122 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 122/122 places, 325/325 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 118 transition count 316
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 118 transition count 316
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 10 place count 118 transition count 314
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 12 place count 116 transition count 309
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 116 transition count 309
Applied a total of 14 rules in 5 ms. Remains 116 /122 variables (removed 6) and now considering 309/325 (removed 16) transitions.
[2024-06-02 20:47:49] [INFO ] Flow matrix only has 283 transitions (discarded 26 similar events)
// Phase 1: matrix 283 rows 116 cols
[2024-06-02 20:47:49] [INFO ] Computed 8 invariants in 3 ms
[2024-06-02 20:47:49] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-06-02 20:47:49] [INFO ] Flow matrix only has 283 transitions (discarded 26 similar events)
[2024-06-02 20:47:49] [INFO ] Invariant cache hit.
[2024-06-02 20:47:49] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-06-02 20:47:50] [INFO ] Implicit Places using invariants and state equation in 172 ms returned []
Implicit Place search using SMT with State Equation took 244 ms to find 0 implicit places.
Running 308 sub problems to find dead transitions.
[2024-06-02 20:47:50] [INFO ] Flow matrix only has 283 transitions (discarded 26 similar events)
[2024-06-02 20:47:50] [INFO ] Invariant cache hit.
[2024-06-02 20:47:50] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 1 (OVERLAPS) 1/116 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 308 unsolved
[2024-06-02 20:47:51] [INFO ] Deduced a trap composed of 42 places in 60 ms of which 1 ms to minimize.
[2024-06-02 20:47:51] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-06-02 20:47:51] [INFO ] Deduced a trap composed of 43 places in 39 ms of which 0 ms to minimize.
[2024-06-02 20:47:51] [INFO ] Deduced a trap composed of 35 places in 32 ms of which 4 ms to minimize.
[2024-06-02 20:47:52] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-06-02 20:47:52] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 0 ms to minimize.
[2024-06-02 20:47:52] [INFO ] Deduced a trap composed of 17 places in 19 ms of which 1 ms to minimize.
[2024-06-02 20:47:52] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 4 (OVERLAPS) 282/398 variables, 116/132 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/398 variables, 40/172 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/398 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 7 (OVERLAPS) 1/399 variables, 1/173 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/399 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 9 (OVERLAPS) 0/399 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 308 unsolved
No progress, stopping.
After SMT solving in domain Real declared 399/399 variables, and 173 constraints, problems are : Problem set: 0 solved, 308 unsolved in 12005 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 116/116 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 308/308 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 308 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 1 (OVERLAPS) 1/116 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 4 (OVERLAPS) 282/398 variables, 116/132 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/398 variables, 40/172 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/398 variables, 308/480 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/398 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 8 (OVERLAPS) 1/399 variables, 1/481 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/399 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 10 (OVERLAPS) 0/399 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 308 unsolved
No progress, stopping.
After SMT solving in domain Int declared 399/399 variables, and 481 constraints, problems are : Problem set: 0 solved, 308 unsolved in 23476 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 116/116 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 308/308 constraints, Known Traps: 8/8 constraints]
After SMT, in 35635ms problems are : Problem set: 0 solved, 308 unsolved
Search for dead transitions found 0 dead transitions in 35638ms
Starting structural reductions in LTL mode, iteration 1 : 116/122 places, 309/325 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35888 ms. Remains : 116/122 places, 309/325 transitions.
Stuttering acceptance computed with spot in 210 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : FireWire-PT-08-LTLCardinality-05
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-08-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-08-LTLCardinality-05 finished in 36114 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 122 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 122/122 places, 325/325 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 120 transition count 320
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 120 transition count 320
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 120 transition count 319
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 119 transition count 317
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 119 transition count 317
Applied a total of 7 rules in 8 ms. Remains 119 /122 variables (removed 3) and now considering 317/325 (removed 8) transitions.
[2024-06-02 20:48:25] [INFO ] Flow matrix only has 291 transitions (discarded 26 similar events)
// Phase 1: matrix 291 rows 119 cols
[2024-06-02 20:48:25] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 20:48:26] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-06-02 20:48:26] [INFO ] Flow matrix only has 291 transitions (discarded 26 similar events)
[2024-06-02 20:48:26] [INFO ] Invariant cache hit.
[2024-06-02 20:48:26] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-06-02 20:48:26] [INFO ] Implicit Places using invariants and state equation in 260 ms returned []
Implicit Place search using SMT with State Equation took 331 ms to find 0 implicit places.
Running 316 sub problems to find dead transitions.
[2024-06-02 20:48:26] [INFO ] Flow matrix only has 291 transitions (discarded 26 similar events)
[2024-06-02 20:48:26] [INFO ] Invariant cache hit.
[2024-06-02 20:48:26] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 1 (OVERLAPS) 1/119 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 316 unsolved
[2024-06-02 20:48:28] [INFO ] Deduced a trap composed of 41 places in 86 ms of which 2 ms to minimize.
[2024-06-02 20:48:28] [INFO ] Deduced a trap composed of 44 places in 34 ms of which 0 ms to minimize.
[2024-06-02 20:48:28] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
[2024-06-02 20:48:28] [INFO ] Deduced a trap composed of 22 places in 73 ms of which 1 ms to minimize.
[2024-06-02 20:48:28] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 1 ms to minimize.
[2024-06-02 20:48:28] [INFO ] Deduced a trap composed of 36 places in 28 ms of which 1 ms to minimize.
[2024-06-02 20:48:28] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
[2024-06-02 20:48:28] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 4 (OVERLAPS) 290/409 variables, 119/135 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/409 variables, 41/176 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/409 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 7 (OVERLAPS) 1/410 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/410 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 9 (OVERLAPS) 0/410 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 316 unsolved
No progress, stopping.
After SMT solving in domain Real declared 410/410 variables, and 177 constraints, problems are : Problem set: 0 solved, 316 unsolved in 12471 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 119/119 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 316/316 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 316 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 1 (OVERLAPS) 1/119 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 4 (OVERLAPS) 290/409 variables, 119/135 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/409 variables, 41/176 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/409 variables, 316/492 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/409 variables, 0/492 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 8 (OVERLAPS) 1/410 variables, 1/493 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/410 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 10 (OVERLAPS) 0/410 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 316 unsolved
No progress, stopping.
After SMT solving in domain Int declared 410/410 variables, and 493 constraints, problems are : Problem set: 0 solved, 316 unsolved in 25753 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 119/119 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 316/316 constraints, Known Traps: 8/8 constraints]
After SMT, in 38390ms problems are : Problem set: 0 solved, 316 unsolved
Search for dead transitions found 0 dead transitions in 38395ms
Starting structural reductions in LTL mode, iteration 1 : 119/122 places, 317/325 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38736 ms. Remains : 119/122 places, 317/325 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FireWire-PT-08-LTLCardinality-06
Product exploration explored 100000 steps with 50000 reset in 343 ms.
Product exploration explored 100000 steps with 50000 reset in 171 ms.
Computed a total of 21 stabilizing places and 43 stable transitions
Computed a total of 21 stabilizing places and 43 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 68 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FireWire-PT-08-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FireWire-PT-08-LTLCardinality-06 finished in 39413 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 122 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 122/122 places, 325/325 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 117 transition count 315
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 117 transition count 315
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 10 place count 117 transition count 313
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 12 place count 115 transition count 308
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 115 transition count 308
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 114 transition count 306
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 114 transition count 306
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 113 transition count 303
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 113 transition count 303
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 112 transition count 301
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 112 transition count 301
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 111 transition count 298
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 111 transition count 298
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 110 transition count 296
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 110 transition count 296
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 109 transition count 293
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 109 transition count 293
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 108 transition count 291
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 108 transition count 291
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 107 transition count 289
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 107 transition count 289
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 31 place count 106 transition count 287
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 106 transition count 287
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 1 with 2 rules applied. Total rules applied 34 place count 105 transition count 286
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 38 place count 103 transition count 290
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 42 place count 103 transition count 286
Applied a total of 42 rules in 52 ms. Remains 103 /122 variables (removed 19) and now considering 286/325 (removed 39) transitions.
[2024-06-02 20:49:05] [INFO ] Flow matrix only has 256 transitions (discarded 30 similar events)
// Phase 1: matrix 256 rows 103 cols
[2024-06-02 20:49:05] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 20:49:05] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-06-02 20:49:05] [INFO ] Flow matrix only has 256 transitions (discarded 30 similar events)
[2024-06-02 20:49:05] [INFO ] Invariant cache hit.
[2024-06-02 20:49:05] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-06-02 20:49:05] [INFO ] Implicit Places using invariants and state equation in 226 ms returned []
Implicit Place search using SMT with State Equation took 281 ms to find 0 implicit places.
[2024-06-02 20:49:05] [INFO ] Redundant transitions in 13 ms returned []
Running 283 sub problems to find dead transitions.
[2024-06-02 20:49:05] [INFO ] Flow matrix only has 256 transitions (discarded 30 similar events)
[2024-06-02 20:49:05] [INFO ] Invariant cache hit.
[2024-06-02 20:49:05] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-06-02 20:49:06] [INFO ] Deduced a trap composed of 36 places in 59 ms of which 1 ms to minimize.
[2024-06-02 20:49:06] [INFO ] Deduced a trap composed of 33 places in 55 ms of which 1 ms to minimize.
[2024-06-02 20:49:06] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2024-06-02 20:49:06] [INFO ] Deduced a trap composed of 16 places in 19 ms of which 1 ms to minimize.
[2024-06-02 20:49:07] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 0 ms to minimize.
[2024-06-02 20:49:07] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 1 ms to minimize.
[2024-06-02 20:49:07] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 3 (OVERLAPS) 255/357 variables, 102/117 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/357 variables, 38/155 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-06-02 20:49:09] [INFO ] Deduced a trap composed of 40 places in 53 ms of which 1 ms to minimize.
[2024-06-02 20:49:09] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/357 variables, 2/157 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/357 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 7 (OVERLAPS) 1/358 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/358 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 9 (OVERLAPS) 0/358 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 283 unsolved
No progress, stopping.
After SMT solving in domain Real declared 358/359 variables, and 158 constraints, problems are : Problem set: 0 solved, 283 unsolved in 12198 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 103/103 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 283/283 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 283 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 3 (OVERLAPS) 255/357 variables, 102/119 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/357 variables, 38/157 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/357 variables, 283/440 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/357 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 7 (OVERLAPS) 1/358 variables, 1/441 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/358 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-06-02 20:49:28] [INFO ] Deduced a trap composed of 32 places in 40 ms of which 0 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/358 variables, 1/442 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/358 variables, 0/442 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 11 (OVERLAPS) 0/358 variables, 0/442 constraints. Problems are: Problem set: 0 solved, 283 unsolved
No progress, stopping.
After SMT solving in domain Int declared 358/359 variables, and 442 constraints, problems are : Problem set: 0 solved, 283 unsolved in 25671 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 103/103 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 283/283 constraints, Known Traps: 10/10 constraints]
After SMT, in 38017ms problems are : Problem set: 0 solved, 283 unsolved
Search for dead transitions found 0 dead transitions in 38019ms
Starting structural reductions in SI_LTL mode, iteration 1 : 103/122 places, 286/325 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 38379 ms. Remains : 103/122 places, 286/325 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FireWire-PT-08-LTLCardinality-08
Product exploration explored 100000 steps with 3 reset in 95 ms.
Product exploration explored 100000 steps with 1 reset in 79 ms.
Computed a total of 8 stabilizing places and 15 stable transitions
Computed a total of 8 stabilizing places and 15 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 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 64 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 707 steps (41 resets) in 6 ms. (101 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 86 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 67 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 103 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 103/103 places, 286/286 transitions.
Applied a total of 0 rules in 10 ms. Remains 103 /103 variables (removed 0) and now considering 286/286 (removed 0) transitions.
[2024-06-02 20:49:44] [INFO ] Flow matrix only has 256 transitions (discarded 30 similar events)
[2024-06-02 20:49:44] [INFO ] Invariant cache hit.
[2024-06-02 20:49:44] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-06-02 20:49:44] [INFO ] Flow matrix only has 256 transitions (discarded 30 similar events)
[2024-06-02 20:49:44] [INFO ] Invariant cache hit.
[2024-06-02 20:49:44] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-06-02 20:49:44] [INFO ] Implicit Places using invariants and state equation in 229 ms returned []
Implicit Place search using SMT with State Equation took 293 ms to find 0 implicit places.
[2024-06-02 20:49:44] [INFO ] Redundant transitions in 6 ms returned []
Running 283 sub problems to find dead transitions.
[2024-06-02 20:49:44] [INFO ] Flow matrix only has 256 transitions (discarded 30 similar events)
[2024-06-02 20:49:44] [INFO ] Invariant cache hit.
[2024-06-02 20:49:44] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-06-02 20:49:45] [INFO ] Deduced a trap composed of 36 places in 50 ms of which 2 ms to minimize.
[2024-06-02 20:49:45] [INFO ] Deduced a trap composed of 33 places in 46 ms of which 1 ms to minimize.
[2024-06-02 20:49:45] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
[2024-06-02 20:49:45] [INFO ] Deduced a trap composed of 16 places in 18 ms of which 1 ms to minimize.
[2024-06-02 20:49:45] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 0 ms to minimize.
[2024-06-02 20:49:46] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
[2024-06-02 20:49:46] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 3 (OVERLAPS) 255/357 variables, 102/117 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/357 variables, 38/155 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-06-02 20:49:48] [INFO ] Deduced a trap composed of 40 places in 55 ms of which 2 ms to minimize.
[2024-06-02 20:49:48] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/357 variables, 2/157 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/357 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 7 (OVERLAPS) 1/358 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/358 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 9 (OVERLAPS) 0/358 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 283 unsolved
No progress, stopping.
After SMT solving in domain Real declared 358/359 variables, and 158 constraints, problems are : Problem set: 0 solved, 283 unsolved in 11897 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 103/103 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 283/283 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 283 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 3 (OVERLAPS) 255/357 variables, 102/119 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/357 variables, 38/157 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/357 variables, 283/440 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/357 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 7 (OVERLAPS) 1/358 variables, 1/441 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/358 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-06-02 20:50:07] [INFO ] Deduced a trap composed of 32 places in 36 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/358 variables, 1/442 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/358 variables, 0/442 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 11 (OVERLAPS) 0/358 variables, 0/442 constraints. Problems are: Problem set: 0 solved, 283 unsolved
No progress, stopping.
After SMT solving in domain Int declared 358/359 variables, and 442 constraints, problems are : Problem set: 0 solved, 283 unsolved in 25356 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 103/103 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 283/283 constraints, Known Traps: 10/10 constraints]
After SMT, in 37404ms problems are : Problem set: 0 solved, 283 unsolved
Search for dead transitions found 0 dead transitions in 37409ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 37723 ms. Remains : 103/103 places, 286/286 transitions.
Computed a total of 8 stabilizing places and 15 stable transitions
Computed a total of 8 stabilizing places and 15 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 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 66 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 243 steps (11 resets) in 4 ms. (48 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 87 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)]
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1 reset in 50 ms.
Product exploration explored 100000 steps with 0 reset in 156 ms.
Built C files in :
/tmp/ltsmin10826525899844584248
[2024-06-02 20:50:22] [INFO ] Computing symmetric may disable matrix : 286 transitions.
[2024-06-02 20:50:22] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 20:50:22] [INFO ] Computing symmetric may enable matrix : 286 transitions.
[2024-06-02 20:50:22] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 20:50:22] [INFO ] Computing Do-Not-Accords matrix : 286 transitions.
[2024-06-02 20:50:22] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 20:50:22] [INFO ] Built C files in 49ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10826525899844584248
Running compilation step : cd /tmp/ltsmin10826525899844584248;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 724 ms.
Running link step : cd /tmp/ltsmin10826525899844584248;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin10826525899844584248;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased5138268310892404296.hoa' '--buchi-type=spotba'
LTSmin run took 636 ms.
FORMULA FireWire-PT-08-LTLCardinality-08 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property FireWire-PT-08-LTLCardinality-08 finished in 78931 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 122 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 122/122 places, 325/325 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 117 transition count 315
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 117 transition count 315
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 10 place count 117 transition count 313
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 12 place count 115 transition count 308
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 115 transition count 308
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 114 transition count 306
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 114 transition count 306
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 113 transition count 303
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 113 transition count 303
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 112 transition count 301
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 112 transition count 301
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 111 transition count 298
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 111 transition count 298
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 110 transition count 296
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 110 transition count 296
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 109 transition count 293
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 109 transition count 293
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 1 with 2 rules applied. Total rules applied 28 place count 108 transition count 292
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 34 place count 105 transition count 298
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 40 place count 105 transition count 292
Applied a total of 40 rules in 35 ms. Remains 105 /122 variables (removed 17) and now considering 292/325 (removed 33) transitions.
[2024-06-02 20:50:24] [INFO ] Flow matrix only has 259 transitions (discarded 33 similar events)
// Phase 1: matrix 259 rows 105 cols
[2024-06-02 20:50:24] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 20:50:24] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-06-02 20:50:24] [INFO ] Flow matrix only has 259 transitions (discarded 33 similar events)
[2024-06-02 20:50:24] [INFO ] Invariant cache hit.
[2024-06-02 20:50:24] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-06-02 20:50:24] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 197 ms to find 0 implicit places.
[2024-06-02 20:50:24] [INFO ] Redundant transitions in 3 ms returned []
Running 289 sub problems to find dead transitions.
[2024-06-02 20:50:24] [INFO ] Flow matrix only has 259 transitions (discarded 33 similar events)
[2024-06-02 20:50:24] [INFO ] Invariant cache hit.
[2024-06-02 20:50:24] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-06-02 20:50:25] [INFO ] Deduced a trap composed of 39 places in 50 ms of which 1 ms to minimize.
[2024-06-02 20:50:25] [INFO ] Deduced a trap composed of 33 places in 25 ms of which 1 ms to minimize.
[2024-06-02 20:50:25] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 1 ms to minimize.
[2024-06-02 20:50:25] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2024-06-02 20:50:25] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
[2024-06-02 20:50:25] [INFO ] Deduced a trap composed of 41 places in 31 ms of which 1 ms to minimize.
[2024-06-02 20:50:26] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 3 (OVERLAPS) 258/362 variables, 104/119 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/362 variables, 38/157 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-06-02 20:50:28] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
[2024-06-02 20:50:28] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/362 variables, 2/159 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/362 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 7 (OVERLAPS) 1/363 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/363 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 9 (OVERLAPS) 0/363 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 289 unsolved
No progress, stopping.
After SMT solving in domain Real declared 363/364 variables, and 160 constraints, problems are : Problem set: 0 solved, 289 unsolved in 12321 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 105/105 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 289/289 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 289 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 3 (OVERLAPS) 258/362 variables, 104/121 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/362 variables, 38/159 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/362 variables, 289/448 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/362 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 7 (OVERLAPS) 1/363 variables, 1/449 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/363 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-06-02 20:50:50] [INFO ] Deduced a trap composed of 36 places in 54 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/363 variables, 1/450 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/363 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 11 (OVERLAPS) 0/363 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 289 unsolved
No progress, stopping.
After SMT solving in domain Int declared 363/364 variables, and 450 constraints, problems are : Problem set: 0 solved, 289 unsolved in 24455 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 105/105 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 289/289 constraints, Known Traps: 10/10 constraints]
After SMT, in 36934ms problems are : Problem set: 0 solved, 289 unsolved
Search for dead transitions found 0 dead transitions in 36936ms
Starting structural reductions in SI_LTL mode, iteration 1 : 105/122 places, 292/325 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 37179 ms. Remains : 105/122 places, 292/325 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : FireWire-PT-08-LTLCardinality-09
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-08-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-08-LTLCardinality-09 finished in 37229 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 122 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 122/122 places, 325/325 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 117 transition count 315
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 117 transition count 315
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 10 place count 117 transition count 313
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 12 place count 115 transition count 308
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 115 transition count 308
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 114 transition count 306
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 114 transition count 306
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 113 transition count 303
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 113 transition count 303
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 112 transition count 301
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 112 transition count 301
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 1 with 2 rules applied. Total rules applied 22 place count 111 transition count 300
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 28 place count 108 transition count 306
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 34 place count 108 transition count 300
Applied a total of 34 rules in 23 ms. Remains 108 /122 variables (removed 14) and now considering 300/325 (removed 25) transitions.
[2024-06-02 20:51:01] [INFO ] Flow matrix only has 267 transitions (discarded 33 similar events)
// Phase 1: matrix 267 rows 108 cols
[2024-06-02 20:51:01] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 20:51:01] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-06-02 20:51:01] [INFO ] Flow matrix only has 267 transitions (discarded 33 similar events)
[2024-06-02 20:51:01] [INFO ] Invariant cache hit.
[2024-06-02 20:51:01] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 20:51:01] [INFO ] Implicit Places using invariants and state equation in 172 ms returned []
Implicit Place search using SMT with State Equation took 242 ms to find 0 implicit places.
[2024-06-02 20:51:01] [INFO ] Redundant transitions in 3 ms returned []
Running 297 sub problems to find dead transitions.
[2024-06-02 20:51:01] [INFO ] Flow matrix only has 267 transitions (discarded 33 similar events)
[2024-06-02 20:51:01] [INFO ] Invariant cache hit.
[2024-06-02 20:51:01] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 297 unsolved
[2024-06-02 20:51:02] [INFO ] Deduced a trap composed of 38 places in 53 ms of which 1 ms to minimize.
[2024-06-02 20:51:02] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
[2024-06-02 20:51:02] [INFO ] Deduced a trap composed of 43 places in 55 ms of which 0 ms to minimize.
[2024-06-02 20:51:02] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2024-06-02 20:51:02] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 1 ms to minimize.
[2024-06-02 20:51:03] [INFO ] Deduced a trap composed of 33 places in 37 ms of which 1 ms to minimize.
[2024-06-02 20:51:03] [INFO ] Deduced a trap composed of 41 places in 31 ms of which 1 ms to minimize.
[2024-06-02 20:51:03] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 297 unsolved
[2024-06-02 20:51:03] [INFO ] Deduced a trap composed of 39 places in 51 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 4 (OVERLAPS) 266/373 variables, 107/124 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/373 variables, 40/164 constraints. Problems are: Problem set: 0 solved, 297 unsolved
[2024-06-02 20:51:07] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/373 variables, 1/165 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/373 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 8 (OVERLAPS) 1/374 variables, 1/166 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/374 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 10 (OVERLAPS) 0/374 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 297 unsolved
No progress, stopping.
After SMT solving in domain Real declared 374/375 variables, and 166 constraints, problems are : Problem set: 0 solved, 297 unsolved in 13204 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 108/108 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 297/297 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 297 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 3 (OVERLAPS) 266/373 variables, 107/125 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/373 variables, 40/165 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/373 variables, 297/462 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/373 variables, 0/462 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 7 (OVERLAPS) 1/374 variables, 1/463 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/374 variables, 0/463 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 9 (OVERLAPS) 0/374 variables, 0/463 constraints. Problems are: Problem set: 0 solved, 297 unsolved
No progress, stopping.
After SMT solving in domain Int declared 374/375 variables, and 463 constraints, problems are : Problem set: 0 solved, 297 unsolved in 15517 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 108/108 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 297/297 constraints, Known Traps: 10/10 constraints]
After SMT, in 28888ms problems are : Problem set: 0 solved, 297 unsolved
Search for dead transitions found 0 dead transitions in 28892ms
Starting structural reductions in SI_LTL mode, iteration 1 : 108/122 places, 300/325 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 29167 ms. Remains : 108/122 places, 300/325 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FireWire-PT-08-LTLCardinality-12
Product exploration explored 100000 steps with 0 reset in 36 ms.
Product exploration explored 100000 steps with 1 reset in 42 ms.
Computed a total of 14 stabilizing places and 29 stable transitions
Computed a total of 14 stabilizing places and 29 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 71 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 772 steps (48 resets) in 6 ms. (110 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 93 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 85 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 108/108 places, 300/300 transitions.
Applied a total of 0 rules in 5 ms. Remains 108 /108 variables (removed 0) and now considering 300/300 (removed 0) transitions.
[2024-06-02 20:51:31] [INFO ] Flow matrix only has 267 transitions (discarded 33 similar events)
[2024-06-02 20:51:31] [INFO ] Invariant cache hit.
[2024-06-02 20:51:31] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-06-02 20:51:31] [INFO ] Flow matrix only has 267 transitions (discarded 33 similar events)
[2024-06-02 20:51:31] [INFO ] Invariant cache hit.
[2024-06-02 20:51:31] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 20:51:31] [INFO ] Implicit Places using invariants and state equation in 161 ms returned []
Implicit Place search using SMT with State Equation took 227 ms to find 0 implicit places.
[2024-06-02 20:51:31] [INFO ] Redundant transitions in 1 ms returned []
Running 297 sub problems to find dead transitions.
[2024-06-02 20:51:31] [INFO ] Flow matrix only has 267 transitions (discarded 33 similar events)
[2024-06-02 20:51:31] [INFO ] Invariant cache hit.
[2024-06-02 20:51:31] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 297 unsolved
[2024-06-02 20:51:32] [INFO ] Deduced a trap composed of 38 places in 50 ms of which 1 ms to minimize.
[2024-06-02 20:51:32] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2024-06-02 20:51:32] [INFO ] Deduced a trap composed of 43 places in 56 ms of which 0 ms to minimize.
[2024-06-02 20:51:32] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2024-06-02 20:51:32] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 1 ms to minimize.
[2024-06-02 20:51:32] [INFO ] Deduced a trap composed of 33 places in 36 ms of which 1 ms to minimize.
[2024-06-02 20:51:32] [INFO ] Deduced a trap composed of 41 places in 26 ms of which 1 ms to minimize.
[2024-06-02 20:51:33] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 297 unsolved
[2024-06-02 20:51:33] [INFO ] Deduced a trap composed of 39 places in 59 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 4 (OVERLAPS) 266/373 variables, 107/124 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/373 variables, 40/164 constraints. Problems are: Problem set: 0 solved, 297 unsolved
[2024-06-02 20:51:36] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/373 variables, 1/165 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/373 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 8 (OVERLAPS) 1/374 variables, 1/166 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/374 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 10 (OVERLAPS) 0/374 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 297 unsolved
No progress, stopping.
After SMT solving in domain Real declared 374/375 variables, and 166 constraints, problems are : Problem set: 0 solved, 297 unsolved in 13195 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 108/108 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 297/297 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 297 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 3 (OVERLAPS) 266/373 variables, 107/125 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/373 variables, 40/165 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/373 variables, 297/462 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/373 variables, 0/462 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 7 (OVERLAPS) 1/374 variables, 1/463 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/374 variables, 0/463 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 9 (OVERLAPS) 0/374 variables, 0/463 constraints. Problems are: Problem set: 0 solved, 297 unsolved
No progress, stopping.
After SMT solving in domain Int declared 374/375 variables, and 463 constraints, problems are : Problem set: 0 solved, 297 unsolved in 15595 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 108/108 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 297/297 constraints, Known Traps: 10/10 constraints]
After SMT, in 28953ms problems are : Problem set: 0 solved, 297 unsolved
Search for dead transitions found 0 dead transitions in 28955ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 29193 ms. Remains : 108/108 places, 300/300 transitions.
Computed a total of 14 stabilizing places and 29 stable transitions
Computed a total of 14 stabilizing places and 29 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 97 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 393 steps (23 resets) in 6 ms. (56 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 123 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 66 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 52 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2 reset in 41 ms.
Product exploration explored 100000 steps with 0 reset in 41 ms.
Built C files in :
/tmp/ltsmin8015656336631985364
[2024-06-02 20:52:01] [INFO ] Computing symmetric may disable matrix : 300 transitions.
[2024-06-02 20:52:01] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 20:52:01] [INFO ] Computing symmetric may enable matrix : 300 transitions.
[2024-06-02 20:52:01] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 20:52:01] [INFO ] Computing Do-Not-Accords matrix : 300 transitions.
[2024-06-02 20:52:01] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 20:52:01] [INFO ] Built C files in 42ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8015656336631985364
Running compilation step : cd /tmp/ltsmin8015656336631985364;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 630 ms.
Running link step : cd /tmp/ltsmin8015656336631985364;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin8015656336631985364;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased5301889052144911377.hoa' '--buchi-type=spotba'
LTSmin run took 1174 ms.
FORMULA FireWire-PT-08-LTLCardinality-12 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property FireWire-PT-08-LTLCardinality-12 finished in 61449 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 122 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 122/122 places, 325/325 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 117 transition count 315
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 117 transition count 315
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 10 place count 117 transition count 313
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 12 place count 115 transition count 308
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 115 transition count 308
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 114 transition count 306
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 114 transition count 306
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 113 transition count 303
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 113 transition count 303
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 112 transition count 301
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 112 transition count 301
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 111 transition count 298
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 111 transition count 298
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 110 transition count 296
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 110 transition count 296
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 109 transition count 293
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 109 transition count 293
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 108 transition count 291
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 108 transition count 291
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 107 transition count 289
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 107 transition count 289
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 31 place count 106 transition count 287
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 106 transition count 287
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 1 with 2 rules applied. Total rules applied 34 place count 105 transition count 286
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 38 place count 103 transition count 290
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 42 place count 103 transition count 286
Applied a total of 42 rules in 25 ms. Remains 103 /122 variables (removed 19) and now considering 286/325 (removed 39) transitions.
[2024-06-02 20:52:02] [INFO ] Flow matrix only has 256 transitions (discarded 30 similar events)
// Phase 1: matrix 256 rows 103 cols
[2024-06-02 20:52:02] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 20:52:03] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-06-02 20:52:03] [INFO ] Flow matrix only has 256 transitions (discarded 30 similar events)
[2024-06-02 20:52:03] [INFO ] Invariant cache hit.
[2024-06-02 20:52:03] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-06-02 20:52:03] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 211 ms to find 0 implicit places.
[2024-06-02 20:52:03] [INFO ] Redundant transitions in 2 ms returned []
Running 283 sub problems to find dead transitions.
[2024-06-02 20:52:03] [INFO ] Flow matrix only has 256 transitions (discarded 30 similar events)
[2024-06-02 20:52:03] [INFO ] Invariant cache hit.
[2024-06-02 20:52:03] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-06-02 20:52:04] [INFO ] Deduced a trap composed of 54 places in 52 ms of which 1 ms to minimize.
[2024-06-02 20:52:04] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 1 ms to minimize.
[2024-06-02 20:52:04] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
[2024-06-02 20:52:04] [INFO ] Deduced a trap composed of 33 places in 31 ms of which 0 ms to minimize.
[2024-06-02 20:52:04] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
[2024-06-02 20:52:04] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-06-02 20:52:04] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-06-02 20:52:05] [INFO ] Deduced a trap composed of 36 places in 56 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-06-02 20:52:05] [INFO ] Deduced a trap composed of 35 places in 57 ms of which 1 ms to minimize.
[2024-06-02 20:52:05] [INFO ] Deduced a trap composed of 37 places in 45 ms of which 1 ms to minimize.
[2024-06-02 20:52:06] [INFO ] Deduced a trap composed of 35 places in 46 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 5 (OVERLAPS) 255/357 variables, 102/121 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/357 variables, 38/159 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/357 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 8 (OVERLAPS) 1/358 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/358 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 10 (OVERLAPS) 0/358 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 283 unsolved
No progress, stopping.
After SMT solving in domain Real declared 358/359 variables, and 160 constraints, problems are : Problem set: 0 solved, 283 unsolved in 11722 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 103/103 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 283/283 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 283 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 11/19 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 3 (OVERLAPS) 255/357 variables, 102/121 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/357 variables, 38/159 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/357 variables, 283/442 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/357 variables, 0/442 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 7 (OVERLAPS) 1/358 variables, 1/443 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/358 variables, 0/443 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 9 (OVERLAPS) 0/358 variables, 0/443 constraints. Problems are: Problem set: 0 solved, 283 unsolved
No progress, stopping.
After SMT solving in domain Int declared 358/359 variables, and 443 constraints, problems are : Problem set: 0 solved, 283 unsolved in 15766 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 103/103 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 283/283 constraints, Known Traps: 11/11 constraints]
After SMT, in 27646ms problems are : Problem set: 0 solved, 283 unsolved
Search for dead transitions found 0 dead transitions in 27651ms
Starting structural reductions in SI_LTL mode, iteration 1 : 103/122 places, 286/325 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 27895 ms. Remains : 103/122 places, 286/325 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FireWire-PT-08-LTLCardinality-13
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-08-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-08-LTLCardinality-13 finished in 27974 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X((X(G(p2))||p1))))'
Support contains 4 out of 122 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 122/122 places, 325/325 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 118 transition count 316
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 118 transition count 316
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 10 place count 118 transition count 314
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 12 place count 116 transition count 309
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 116 transition count 309
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 115 transition count 307
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 115 transition count 307
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 114 transition count 304
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 114 transition count 304
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 113 transition count 302
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 113 transition count 302
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 112 transition count 299
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 112 transition count 299
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 111 transition count 297
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 111 transition count 297
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 110 transition count 294
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 110 transition count 294
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 109 transition count 292
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 109 transition count 292
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 108 transition count 290
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 108 transition count 290
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 31 place count 107 transition count 288
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 107 transition count 288
Applied a total of 32 rules in 10 ms. Remains 107 /122 variables (removed 15) and now considering 288/325 (removed 37) transitions.
[2024-06-02 20:52:30] [INFO ] Flow matrix only has 262 transitions (discarded 26 similar events)
// Phase 1: matrix 262 rows 107 cols
[2024-06-02 20:52:30] [INFO ] Computed 8 invariants in 3 ms
[2024-06-02 20:52:31] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-06-02 20:52:31] [INFO ] Flow matrix only has 262 transitions (discarded 26 similar events)
[2024-06-02 20:52:31] [INFO ] Invariant cache hit.
[2024-06-02 20:52:31] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-06-02 20:52:31] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 215 ms to find 0 implicit places.
Running 287 sub problems to find dead transitions.
[2024-06-02 20:52:31] [INFO ] Flow matrix only has 262 transitions (discarded 26 similar events)
[2024-06-02 20:52:31] [INFO ] Invariant cache hit.
[2024-06-02 20:52:31] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 287 unsolved
[2024-06-02 20:52:32] [INFO ] Deduced a trap composed of 36 places in 53 ms of which 1 ms to minimize.
[2024-06-02 20:52:32] [INFO ] Deduced a trap composed of 35 places in 28 ms of which 1 ms to minimize.
[2024-06-02 20:52:32] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-06-02 20:52:33] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 0 ms to minimize.
[2024-06-02 20:52:33] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 0 ms to minimize.
[2024-06-02 20:52:33] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 4 (OVERLAPS) 261/368 variables, 107/121 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/368 variables, 37/158 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/368 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 7 (OVERLAPS) 1/369 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 287 unsolved
[2024-06-02 20:52:37] [INFO ] Deduced a trap composed of 41 places in 56 ms of which 1 ms to minimize.
[2024-06-02 20:52:38] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/369 variables, 2/161 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/369 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 10 (OVERLAPS) 0/369 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 287 unsolved
No progress, stopping.
After SMT solving in domain Real declared 369/369 variables, and 161 constraints, problems are : Problem set: 0 solved, 287 unsolved in 10951 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 107/107 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 287/287 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 287 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 4 (OVERLAPS) 261/368 variables, 107/123 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/368 variables, 37/160 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/368 variables, 287/447 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/368 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 8 (OVERLAPS) 1/369 variables, 1/448 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/369 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 10 (OVERLAPS) 0/369 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 287 unsolved
No progress, stopping.
After SMT solving in domain Int declared 369/369 variables, and 448 constraints, problems are : Problem set: 0 solved, 287 unsolved in 19060 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 107/107 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 287/287 constraints, Known Traps: 8/8 constraints]
After SMT, in 30177ms problems are : Problem set: 0 solved, 287 unsolved
Search for dead transitions found 0 dead transitions in 30181ms
Starting structural reductions in LTL mode, iteration 1 : 107/122 places, 288/325 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30408 ms. Remains : 107/122 places, 288/325 transitions.
Stuttering acceptance computed with spot in 175 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), true, (AND (NOT p1) (NOT p2))]
Running random walk in product with property : FireWire-PT-08-LTLCardinality-15
Product exploration explored 100000 steps with 50000 reset in 118 ms.
Product exploration explored 100000 steps with 50000 reset in 118 ms.
Computed a total of 10 stabilizing places and 17 stable transitions
Computed a total of 10 stabilizing places and 17 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) p2))), (X p0), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 13 factoid took 18 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FireWire-PT-08-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FireWire-PT-08-LTLCardinality-15 finished in 30855 ms.
All properties solved by simple procedures.
Total runtime 435517 ms.

BK_STOP 1717361581843

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="FireWire-PT-08"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
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 itstools"
echo " Input is FireWire-PT-08, 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 r550-tall-171734898900227"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FireWire-PT-08.tgz
mv FireWire-PT-08 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 ;