About the Execution of ITS-Tools for PolyORBLF-COL-S02J06T06
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16205.436 | 3241895.00 | 3518872.00 | 1335.40 | ?T??????T?????F? | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2024-input.r290-tajo-171654446400098.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is PolyORBLF-COL-S02J06T06, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r290-tajo-171654446400098
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 552K
-rw-r--r-- 1 mcc users 7.9K Apr 11 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Apr 11 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Apr 11 16:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Apr 11 16:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 5.1K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.8K Apr 11 17:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 81K Apr 11 17:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Apr 11 17:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 11 17:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 154K May 18 16:43 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 PolyORBLF-COL-S02J06T06-CTLFireability-2024-00
FORMULA_NAME PolyORBLF-COL-S02J06T06-CTLFireability-2024-01
FORMULA_NAME PolyORBLF-COL-S02J06T06-CTLFireability-2024-02
FORMULA_NAME PolyORBLF-COL-S02J06T06-CTLFireability-2024-03
FORMULA_NAME PolyORBLF-COL-S02J06T06-CTLFireability-2024-04
FORMULA_NAME PolyORBLF-COL-S02J06T06-CTLFireability-2024-05
FORMULA_NAME PolyORBLF-COL-S02J06T06-CTLFireability-2024-06
FORMULA_NAME PolyORBLF-COL-S02J06T06-CTLFireability-2024-07
FORMULA_NAME PolyORBLF-COL-S02J06T06-CTLFireability-2024-08
FORMULA_NAME PolyORBLF-COL-S02J06T06-CTLFireability-2024-09
FORMULA_NAME PolyORBLF-COL-S02J06T06-CTLFireability-2024-10
FORMULA_NAME PolyORBLF-COL-S02J06T06-CTLFireability-2024-11
FORMULA_NAME PolyORBLF-COL-S02J06T06-CTLFireability-2024-12
FORMULA_NAME PolyORBLF-COL-S02J06T06-CTLFireability-2024-13
FORMULA_NAME PolyORBLF-COL-S02J06T06-CTLFireability-2024-14
FORMULA_NAME PolyORBLF-COL-S02J06T06-CTLFireability-2024-15
=== Now, execution of the tool begins
BK_START 1716905243694
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-COL-S02J06T06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
CTLFireability COL
Running Version 202405141337
[2024-05-28 14:07:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-28 14:07:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 14:07:25] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-28 14:07:25] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-28 14:07:25] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 691 ms
[2024-05-28 14:07:26] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 536 PT places and 1096.0 transition bindings in 37 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 20 ms.
[2024-05-28 14:07:26] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 6 ms.
[2024-05-28 14:07:26] [INFO ] Skeletonized 13 HLPN properties in 3 ms. Removed 3 properties that had guard overlaps.
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 10 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
RANDOM walk for 40000 steps (14 resets) in 1136 ms. (35 steps per ms) remains 5/28 properties
BEST_FIRST walk for 40001 steps (21 resets) in 585 ms. (68 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40003 steps (10 resets) in 227 ms. (175 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (39 resets) in 128 ms. (310 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (22 resets) in 141 ms. (281 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (16 resets) in 137 ms. (289 steps per ms) remains 4/4 properties
[2024-05-28 14:07:27] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2024-05-28 14:07:27] [INFO ] Computed 26 invariants in 14 ms
[2024-05-28 14:07:27] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem AtomicPropp23 is UNSAT
At refinement iteration 1 (OVERLAPS) 39/53 variables, 9/9 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 2/55 variables, 1/10 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 3 unsolved
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp27 is UNSAT
At refinement iteration 5 (OVERLAPS) 24/79 variables, 15/25 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/79 variables, 0/25 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 64/143 variables, 79/104 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/143 variables, 8/112 constraints. Problems are: Problem set: 3 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/143 variables, 0/112 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/145 variables, 2/114 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/145 variables, 1/115 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/145 variables, 0/115 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/145 variables, 0/115 constraints. Problems are: Problem set: 3 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 145/145 variables, and 115 constraints, problems are : Problem set: 3 solved, 1 unsolved in 419 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 81/81 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 13/14 variables, 2/2 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/23 variables, 2/4 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 23/46 variables, 3/7 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/46 variables, 0/7 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 3/49 variables, 2/9 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/49 variables, 0/9 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 24/73 variables, 12/21 constraints. Problems are: Problem set: 3 solved, 1 unsolved
[2024-05-28 14:07:27] [INFO ] Deduced a trap composed of 27 places in 89 ms of which 7 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/73 variables, 1/22 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/73 variables, 0/22 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 5/78 variables, 3/25 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/78 variables, 0/25 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/79 variables, 1/26 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/79 variables, 0/26 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 64/143 variables, 79/105 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/143 variables, 8/113 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/143 variables, 1/114 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/143 variables, 0/114 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/145 variables, 2/116 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/145 variables, 1/117 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/145 variables, 0/117 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/145 variables, 0/117 constraints. Problems are: Problem set: 3 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 145/145 variables, and 117 constraints, problems are : Problem set: 3 solved, 1 unsolved in 290 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 81/81 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 1/4 constraints, Known Traps: 1/1 constraints]
After SMT, in 785ms problems are : Problem set: 3 solved, 1 unsolved
Parikh walk visited 0 properties in 9 ms.
Support contains 1 out of 81 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 65/65 transitions.
Ensure Unique test removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 80 transition count 56
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 19 place count 71 transition count 56
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 19 place count 71 transition count 53
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 25 place count 68 transition count 53
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 39 place count 61 transition count 46
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 41 place count 61 transition count 44
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 43 place count 59 transition count 44
Applied a total of 43 rules in 28 ms. Remains 59 /81 variables (removed 22) and now considering 44/65 (removed 21) transitions.
Running 43 sub problems to find dead transitions.
[2024-05-28 14:07:27] [INFO ] Flow matrix only has 43 transitions (discarded 1 similar events)
// Phase 1: matrix 43 rows 59 cols
[2024-05-28 14:07:27] [INFO ] Computed 25 invariants in 3 ms
[2024-05-28 14:07:27] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 15/24 constraints. Problems are: Problem set: 0 solved, 43 unsolved
[2024-05-28 14:07:28] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 2 ms to minimize.
[2024-05-28 14:07:28] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 0 ms to minimize.
[2024-05-28 14:07:28] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 0 ms to minimize.
[2024-05-28 14:07:28] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 1 ms to minimize.
[2024-05-28 14:07:28] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 5/29 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 43 unsolved
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
At refinement iteration 4 (OVERLAPS) 1/59 variables, 1/30 constraints. Problems are: Problem set: 2 solved, 41 unsolved
[2024-05-28 14:07:28] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 0 ms to minimize.
[2024-05-28 14:07:28] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 11 ms to minimize.
[2024-05-28 14:07:28] [INFO ] Deduced a trap composed of 6 places in 44 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 3/33 constraints. Problems are: Problem set: 2 solved, 41 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 0/33 constraints. Problems are: Problem set: 2 solved, 41 unsolved
At refinement iteration 7 (OVERLAPS) 43/102 variables, 59/92 constraints. Problems are: Problem set: 2 solved, 41 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/102 variables, 8/100 constraints. Problems are: Problem set: 2 solved, 41 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/102 variables, 0/100 constraints. Problems are: Problem set: 2 solved, 41 unsolved
At refinement iteration 10 (OVERLAPS) 0/102 variables, 0/100 constraints. Problems are: Problem set: 2 solved, 41 unsolved
No progress, stopping.
After SMT solving in domain Real declared 102/102 variables, and 100 constraints, problems are : Problem set: 2 solved, 41 unsolved in 1356 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 59/59 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 43/43 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 2 solved, 41 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 9/9 constraints. Problems are: Problem set: 2 solved, 41 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 15/24 constraints. Problems are: Problem set: 2 solved, 41 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 6/30 constraints. Problems are: Problem set: 2 solved, 41 unsolved
[2024-05-28 14:07:29] [INFO ] Deduced a trap composed of 10 places in 16 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 1/31 constraints. Problems are: Problem set: 2 solved, 41 unsolved
[2024-05-28 14:07:29] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
[2024-05-28 14:07:30] [INFO ] Deduced a trap composed of 16 places in 698 ms of which 1 ms to minimize.
[2024-05-28 14:07:30] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
[2024-05-28 14:07:30] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-05-28 14:07:30] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-05-28 14:07:30] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 6/37 constraints. Problems are: Problem set: 2 solved, 41 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/58 variables, 0/37 constraints. Problems are: Problem set: 2 solved, 41 unsolved
At refinement iteration 6 (OVERLAPS) 1/59 variables, 1/38 constraints. Problems are: Problem set: 2 solved, 41 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/59 variables, 2/40 constraints. Problems are: Problem set: 2 solved, 41 unsolved
[2024-05-28 14:07:30] [INFO ] Deduced a trap composed of 18 places in 293 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/59 variables, 1/41 constraints. Problems are: Problem set: 2 solved, 41 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/59 variables, 0/41 constraints. Problems are: Problem set: 2 solved, 41 unsolved
At refinement iteration 10 (OVERLAPS) 43/102 variables, 59/100 constraints. Problems are: Problem set: 2 solved, 41 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/102 variables, 8/108 constraints. Problems are: Problem set: 2 solved, 41 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/102 variables, 41/149 constraints. Problems are: Problem set: 2 solved, 41 unsolved
[2024-05-28 14:07:31] [INFO ] Deduced a trap composed of 10 places in 19 ms of which 1 ms to minimize.
[2024-05-28 14:07:31] [INFO ] Deduced a trap composed of 14 places in 19 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/102 variables, 2/151 constraints. Problems are: Problem set: 2 solved, 41 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/102 variables, 0/151 constraints. Problems are: Problem set: 2 solved, 41 unsolved
At refinement iteration 15 (OVERLAPS) 0/102 variables, 0/151 constraints. Problems are: Problem set: 2 solved, 41 unsolved
No progress, stopping.
After SMT solving in domain Int declared 102/102 variables, and 151 constraints, problems are : Problem set: 2 solved, 41 unsolved in 3252 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 59/59 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 41/43 constraints, Known Traps: 18/18 constraints]
After SMT, in 4649ms problems are : Problem set: 2 solved, 41 unsolved
Search for dead transitions found 2 dead transitions in 4651ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 2 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 59/81 places, 42/65 transitions.
Reduce places removed 2 places and 2 transitions.
Graph (complete) has 194 edges and 57 vertex of which 1 are kept as prefixes of interest. Removing 56 places using SCC suffix rule.1 ms
Discarding 56 places :
Also discarding 39 output transitions
Drop transitions (Output transitions of discarded places.) removed 39 transitions
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 1 transition count 1
Reduce places removed 0 places and 1 transitions.
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 3 rules in 5 ms. Remains 1 /59 variables (removed 58) and now considering 0/42 (removed 42) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 4696 ms. Remains : 1/81 places, 0/65 transitions.
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Successfully simplified 4 atomic propositions for a total of 10 simplifications.
[2024-05-28 14:07:32] [INFO ] Flatten gal took : 40 ms
[2024-05-28 14:07:32] [INFO ] Flatten gal took : 17 ms
Transition GoPerformWork forces synchronizations/join behavior on parameter j of sort Jobs
Transition T_2315 forces synchronizations/join behavior on parameter t of sort Threads
Transition T_0376 forces synchronizations/join behavior on parameter s of sort Sources
[2024-05-28 14:07:32] [INFO ] Unfolded HLPN to a Petri net with 536 places and 1064 transitions 4866 arcs in 53 ms.
[2024-05-28 14:07:32] [INFO ] Unfolded 16 HLPN properties in 1 ms.
[2024-05-28 14:07:32] [INFO ] Reduced 6 identical enabling conditions.
[2024-05-28 14:07:32] [INFO ] Reduced 66 identical enabling conditions.
[2024-05-28 14:07:32] [INFO ] Reduced 66 identical enabling conditions.
Ensure Unique test removed 96 transitions
Reduce redundant transitions removed 96 transitions.
Support contains 421 out of 536 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 536/536 places, 968/968 transitions.
Applied a total of 0 rules in 24 ms. Remains 536 /536 variables (removed 0) and now considering 968/968 (removed 0) transitions.
Running 966 sub problems to find dead transitions.
[2024-05-28 14:07:32] [INFO ] Flow matrix only has 956 transitions (discarded 12 similar events)
// Phase 1: matrix 956 rows 536 cols
[2024-05-28 14:07:32] [INFO ] Computed 50 invariants in 48 ms
[2024-05-28 14:07:32] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/532 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 966 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/532 variables, 31/46 constraints. Problems are: Problem set: 0 solved, 966 unsolved
[2024-05-28 14:07:40] [INFO ] Deduced a trap composed of 73 places in 88 ms of which 2 ms to minimize.
[2024-05-28 14:07:40] [INFO ] Deduced a trap composed of 73 places in 99 ms of which 1 ms to minimize.
[2024-05-28 14:07:40] [INFO ] Deduced a trap composed of 73 places in 77 ms of which 15 ms to minimize.
[2024-05-28 14:07:41] [INFO ] Deduced a trap composed of 74 places in 337 ms of which 13 ms to minimize.
[2024-05-28 14:07:41] [INFO ] Deduced a trap composed of 73 places in 66 ms of which 1 ms to minimize.
[2024-05-28 14:07:41] [INFO ] Deduced a trap composed of 280 places in 205 ms of which 3 ms to minimize.
[2024-05-28 14:07:42] [INFO ] Deduced a trap composed of 280 places in 257 ms of which 4 ms to minimize.
[2024-05-28 14:07:42] [INFO ] Deduced a trap composed of 146 places in 200 ms of which 4 ms to minimize.
[2024-05-28 14:07:42] [INFO ] Deduced a trap composed of 292 places in 178 ms of which 3 ms to minimize.
[2024-05-28 14:07:43] [INFO ] Deduced a trap composed of 298 places in 255 ms of which 4 ms to minimize.
[2024-05-28 14:07:43] [INFO ] Deduced a trap composed of 268 places in 239 ms of which 3 ms to minimize.
[2024-05-28 14:07:43] [INFO ] Deduced a trap composed of 261 places in 220 ms of which 3 ms to minimize.
[2024-05-28 14:07:43] [INFO ] Deduced a trap composed of 74 places in 41 ms of which 1 ms to minimize.
[2024-05-28 14:07:53] [INFO ] Deduced a trap composed of 276 places in 257 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/532 variables, 14/60 constraints. Problems are: Problem set: 0 solved, 966 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 532/1492 variables, and 60 constraints, problems are : Problem set: 0 solved, 966 unsolved in 20046 ms.
Refiners :[Positive P Invariants (semi-flows): 15/17 constraints, Generalized P Invariants (flows): 31/33 constraints, State Equation: 0/536 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 966/966 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 966 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/532 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 966 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/532 variables, 31/46 constraints. Problems are: Problem set: 0 solved, 966 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/532 variables, 14/60 constraints. Problems are: Problem set: 0 solved, 966 unsolved
[2024-05-28 14:07:56] [INFO ] Deduced a trap composed of 15 places in 151 ms of which 3 ms to minimize.
[2024-05-28 14:07:56] [INFO ] Deduced a trap composed of 247 places in 227 ms of which 3 ms to minimize.
[2024-05-28 14:08:01] [INFO ] Deduced a trap composed of 364 places in 267 ms of which 4 ms to minimize.
[2024-05-28 14:08:01] [INFO ] Deduced a trap composed of 371 places in 244 ms of which 3 ms to minimize.
[2024-05-28 14:08:01] [INFO ] Deduced a trap composed of 350 places in 219 ms of which 4 ms to minimize.
[2024-05-28 14:08:02] [INFO ] Deduced a trap composed of 364 places in 179 ms of which 3 ms to minimize.
[2024-05-28 14:08:06] [INFO ] Deduced a trap composed of 63 places in 216 ms of which 4 ms to minimize.
[2024-05-28 14:08:06] [INFO ] Deduced a trap composed of 158 places in 228 ms of which 3 ms to minimize.
[2024-05-28 14:08:06] [INFO ] Deduced a trap composed of 267 places in 184 ms of which 2 ms to minimize.
[2024-05-28 14:08:08] [INFO ] Deduced a trap composed of 372 places in 252 ms of which 4 ms to minimize.
[2024-05-28 14:08:08] [INFO ] Deduced a trap composed of 310 places in 209 ms of which 3 ms to minimize.
[2024-05-28 14:08:08] [INFO ] Deduced a trap composed of 291 places in 201 ms of which 3 ms to minimize.
[2024-05-28 14:08:09] [INFO ] Deduced a trap composed of 311 places in 265 ms of which 4 ms to minimize.
[2024-05-28 14:08:09] [INFO ] Deduced a trap composed of 373 places in 179 ms of which 3 ms to minimize.
[2024-05-28 14:08:09] [INFO ] Deduced a trap composed of 319 places in 222 ms of which 3 ms to minimize.
[2024-05-28 14:08:09] [INFO ] Deduced a trap composed of 423 places in 202 ms of which 3 ms to minimize.
[2024-05-28 14:08:10] [INFO ] Deduced a trap composed of 420 places in 204 ms of which 3 ms to minimize.
[2024-05-28 14:08:10] [INFO ] Deduced a trap composed of 413 places in 201 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/532 variables, 18/78 constraints. Problems are: Problem set: 0 solved, 966 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 532/1492 variables, and 78 constraints, problems are : Problem set: 0 solved, 966 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 15/17 constraints, Generalized P Invariants (flows): 31/33 constraints, State Equation: 0/536 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/966 constraints, Known Traps: 32/32 constraints]
After SMT, in 41378ms problems are : Problem set: 0 solved, 966 unsolved
Search for dead transitions found 0 dead transitions in 41399ms
[2024-05-28 14:08:14] [INFO ] Flow matrix only has 956 transitions (discarded 12 similar events)
[2024-05-28 14:08:14] [INFO ] Invariant cache hit.
[2024-05-28 14:08:14] [INFO ] Implicit Places using invariants in 168 ms returned []
[2024-05-28 14:08:14] [INFO ] Flow matrix only has 956 transitions (discarded 12 similar events)
[2024-05-28 14:08:14] [INFO ] Invariant cache hit.
[2024-05-28 14:08:14] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 14:08:15] [INFO ] Implicit Places using invariants and state equation in 1555 ms returned []
Implicit Place search using SMT with State Equation took 1728 ms to find 0 implicit places.
Running 966 sub problems to find dead transitions.
[2024-05-28 14:08:15] [INFO ] Flow matrix only has 956 transitions (discarded 12 similar events)
[2024-05-28 14:08:15] [INFO ] Invariant cache hit.
[2024-05-28 14:08:15] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/532 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 966 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/532 variables, 31/46 constraints. Problems are: Problem set: 0 solved, 966 unsolved
[2024-05-28 14:08:24] [INFO ] Deduced a trap composed of 73 places in 71 ms of which 1 ms to minimize.
[2024-05-28 14:08:24] [INFO ] Deduced a trap composed of 74 places in 46 ms of which 1 ms to minimize.
[2024-05-28 14:08:24] [INFO ] Deduced a trap composed of 73 places in 43 ms of which 1 ms to minimize.
[2024-05-28 14:08:24] [INFO ] Deduced a trap composed of 74 places in 44 ms of which 1 ms to minimize.
[2024-05-28 14:08:24] [INFO ] Deduced a trap composed of 74 places in 42 ms of which 0 ms to minimize.
[2024-05-28 14:08:24] [INFO ] Deduced a trap composed of 294 places in 244 ms of which 4 ms to minimize.
[2024-05-28 14:08:24] [INFO ] Deduced a trap composed of 294 places in 264 ms of which 5 ms to minimize.
[2024-05-28 14:08:25] [INFO ] Deduced a trap composed of 146 places in 231 ms of which 3 ms to minimize.
[2024-05-28 14:08:25] [INFO ] Deduced a trap composed of 74 places in 61 ms of which 2 ms to minimize.
[2024-05-28 14:08:26] [INFO ] Deduced a trap composed of 286 places in 269 ms of which 4 ms to minimize.
[2024-05-28 14:08:26] [INFO ] Deduced a trap composed of 269 places in 264 ms of which 4 ms to minimize.
[2024-05-28 14:08:26] [INFO ] Deduced a trap composed of 286 places in 249 ms of which 4 ms to minimize.
[2024-05-28 14:08:27] [INFO ] Deduced a trap composed of 317 places in 240 ms of which 5 ms to minimize.
[2024-05-28 14:08:27] [INFO ] Deduced a trap composed of 368 places in 256 ms of which 4 ms to minimize.
[2024-05-28 14:08:27] [INFO ] Deduced a trap composed of 339 places in 254 ms of which 4 ms to minimize.
[2024-05-28 14:08:27] [INFO ] Deduced a trap composed of 297 places in 191 ms of which 3 ms to minimize.
[2024-05-28 14:08:28] [INFO ] Deduced a trap composed of 292 places in 188 ms of which 3 ms to minimize.
[2024-05-28 14:08:28] [INFO ] Deduced a trap composed of 260 places in 187 ms of which 3 ms to minimize.
[2024-05-28 14:08:35] [INFO ] Deduced a trap composed of 275 places in 273 ms of which 4 ms to minimize.
[2024-05-28 14:08:35] [INFO ] Deduced a trap composed of 269 places in 257 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/532 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 966 unsolved
[2024-05-28 14:08:45] [INFO ] Deduced a trap composed of 270 places in 303 ms of which 4 ms to minimize.
[2024-05-28 14:08:45] [INFO ] Deduced a trap composed of 275 places in 260 ms of which 4 ms to minimize.
[2024-05-28 14:08:45] [INFO ] Deduced a trap composed of 280 places in 263 ms of which 4 ms to minimize.
[2024-05-28 14:08:45] [INFO ] Deduced a trap composed of 262 places in 242 ms of which 4 ms to minimize.
[2024-05-28 14:08:46] [INFO ] Deduced a trap composed of 38 places in 278 ms of which 4 ms to minimize.
[2024-05-28 14:08:46] [INFO ] Deduced a trap composed of 37 places in 142 ms of which 2 ms to minimize.
[2024-05-28 14:08:46] [INFO ] Deduced a trap composed of 15 places in 135 ms of which 2 ms to minimize.
[2024-05-28 14:08:47] [INFO ] Deduced a trap composed of 269 places in 265 ms of which 4 ms to minimize.
SMT process timed out in 31301ms, After SMT, problems are : Problem set: 0 solved, 966 unsolved
Search for dead transitions found 0 dead transitions in 31320ms
Finished structural reductions in LTL mode , in 1 iterations and 74482 ms. Remains : 536/536 places, 968/968 transitions.
Support contains 421 out of 536 places after structural reductions.
[2024-05-28 14:08:47] [INFO ] Flatten gal took : 120 ms
[2024-05-28 14:08:47] [INFO ] Flatten gal took : 103 ms
[2024-05-28 14:08:47] [INFO ] Input system was already deterministic with 968 transitions.
Reduction of identical properties reduced properties to check from 57 to 52
RANDOM walk for 40000 steps (15 resets) in 1310 ms. (30 steps per ms) remains 13/52 properties
BEST_FIRST walk for 40002 steps (8 resets) in 697 ms. (57 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (10 resets) in 503 ms. (79 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (10 resets) in 423 ms. (94 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (9 resets) in 345 ms. (115 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (9 resets) in 364 ms. (109 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (9 resets) in 1151 ms. (34 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (8 resets) in 370 ms. (107 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (11 resets) in 415 ms. (96 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (32 resets) in 461 ms. (86 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40000 steps (15 resets) in 404 ms. (98 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (10 resets) in 383 ms. (104 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40000 steps (17 resets) in 541 ms. (73 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40000 steps (11 resets) in 461 ms. (86 steps per ms) remains 13/13 properties
[2024-05-28 14:08:50] [INFO ] Flow matrix only has 956 transitions (discarded 12 similar events)
[2024-05-28 14:08:50] [INFO ] Invariant cache hit.
[2024-05-28 14:08:50] [INFO ] State equation strengthened by 72 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/192 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Problem AtomicPropp54 is UNSAT
At refinement iteration 3 (OVERLAPS) 297/489 variables, 15/18 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/489 variables, 1/19 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/489 variables, 0/19 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 7/496 variables, 1/20 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/496 variables, 6/26 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/496 variables, 0/26 constraints. Problems are: Problem set: 1 solved, 12 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp40 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp56 is UNSAT
At refinement iteration 9 (OVERLAPS) 40/536 variables, 24/50 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/536 variables, 0/50 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 956/1492 variables, 536/586 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1492 variables, 72/658 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1492 variables, 0/658 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 0/1492 variables, 0/658 constraints. Problems are: Problem set: 9 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1492/1492 variables, and 658 constraints, problems are : Problem set: 9 solved, 4 unsolved in 2059 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 33/33 constraints, State Equation: 536/536 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 9 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 150/170 variables, 2/2 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 1/3 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 0/3 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 34/204 variables, 2/5 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/204 variables, 0/5 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 243/447 variables, 8/13 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/447 variables, 0/13 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 9/456 variables, 3/16 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/456 variables, 0/16 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 77/533 variables, 32/48 constraints. Problems are: Problem set: 9 solved, 4 unsolved
[2024-05-28 14:08:53] [INFO ] Deduced a trap composed of 74 places in 181 ms of which 3 ms to minimize.
[2024-05-28 14:08:53] [INFO ] Deduced a trap composed of 73 places in 86 ms of which 2 ms to minimize.
[2024-05-28 14:08:53] [INFO ] Deduced a trap composed of 73 places in 62 ms of which 2 ms to minimize.
[2024-05-28 14:08:53] [INFO ] Deduced a trap composed of 73 places in 62 ms of which 1 ms to minimize.
[2024-05-28 14:08:53] [INFO ] Deduced a trap composed of 73 places in 41 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/533 variables, 5/53 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/533 variables, 0/53 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 1/534 variables, 1/54 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/534 variables, 0/54 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 956/1490 variables, 534/588 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1490 variables, 72/660 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1490 variables, 4/664 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1490 variables, 0/664 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 2/1492 variables, 2/666 constraints. Problems are: Problem set: 9 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1492 variables, 1/667 constraints. Problems are: Problem set: 9 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1492/1492 variables, and 667 constraints, problems are : Problem set: 9 solved, 4 unsolved in 5018 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 33/33 constraints, State Equation: 536/536 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 4/13 constraints, Known Traps: 5/5 constraints]
After SMT, in 7298ms problems are : Problem set: 9 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 20 out of 536 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 536/536 places, 968/968 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 44 rules applied. Total rules applied 44 place count 534 transition count 926
Reduce places removed 42 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 48 rules applied. Total rules applied 92 place count 492 transition count 920
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 98 place count 486 transition count 920
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 60 Pre rules applied. Total rules applied 98 place count 486 transition count 860
Deduced a syphon composed of 60 places in 2 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 3 with 120 rules applied. Total rules applied 218 place count 426 transition count 860
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 2 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 314 place count 378 transition count 812
Free-agglomeration rule (complex) applied 12 times.
Iterating global reduction 3 with 12 rules applied. Total rules applied 326 place count 378 transition count 800
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 338 place count 366 transition count 800
Applied a total of 338 rules in 217 ms. Remains 366 /536 variables (removed 170) and now considering 800/968 (removed 168) transitions.
Running 798 sub problems to find dead transitions.
[2024-05-28 14:08:58] [INFO ] Flow matrix only has 788 transitions (discarded 12 similar events)
// Phase 1: matrix 788 rows 366 cols
[2024-05-28 14:08:58] [INFO ] Computed 48 invariants in 27 ms
[2024-05-28 14:08:58] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/364 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 798 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/364 variables, 34/46 constraints. Problems are: Problem set: 0 solved, 798 unsolved
[2024-05-28 14:09:03] [INFO ] Deduced a trap composed of 46 places in 75 ms of which 2 ms to minimize.
[2024-05-28 14:09:03] [INFO ] Deduced a trap composed of 46 places in 57 ms of which 2 ms to minimize.
[2024-05-28 14:09:03] [INFO ] Deduced a trap composed of 45 places in 33 ms of which 1 ms to minimize.
[2024-05-28 14:09:03] [INFO ] Deduced a trap composed of 46 places in 34 ms of which 1 ms to minimize.
[2024-05-28 14:09:03] [INFO ] Deduced a trap composed of 45 places in 44 ms of which 1 ms to minimize.
[2024-05-28 14:09:04] [INFO ] Deduced a trap composed of 46 places in 179 ms of which 2 ms to minimize.
[2024-05-28 14:09:04] [INFO ] Deduced a trap composed of 146 places in 156 ms of which 2 ms to minimize.
[2024-05-28 14:09:06] [INFO ] Deduced a trap composed of 210 places in 183 ms of which 3 ms to minimize.
[2024-05-28 14:09:09] [INFO ] Deduced a trap composed of 123 places in 204 ms of which 3 ms to minimize.
[2024-05-28 14:09:09] [INFO ] Deduced a trap composed of 102 places in 194 ms of which 3 ms to minimize.
[2024-05-28 14:09:09] [INFO ] Deduced a trap composed of 139 places in 197 ms of which 2 ms to minimize.
[2024-05-28 14:09:10] [INFO ] Deduced a trap composed of 135 places in 200 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/364 variables, 12/58 constraints. Problems are: Problem set: 0 solved, 798 unsolved
[2024-05-28 14:09:11] [INFO ] Deduced a trap composed of 26 places in 119 ms of which 2 ms to minimize.
[2024-05-28 14:09:12] [INFO ] Deduced a trap composed of 25 places in 176 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/364 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 798 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 364/1154 variables, and 60 constraints, problems are : Problem set: 0 solved, 798 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 34/36 constraints, State Equation: 0/366 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 798/798 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 798 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/364 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 798 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/364 variables, 34/46 constraints. Problems are: Problem set: 0 solved, 798 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/364 variables, 14/60 constraints. Problems are: Problem set: 0 solved, 798 unsolved
[2024-05-28 14:09:22] [INFO ] Deduced a trap composed of 15 places in 103 ms of which 2 ms to minimize.
[2024-05-28 14:09:25] [INFO ] Deduced a trap composed of 220 places in 202 ms of which 2 ms to minimize.
[2024-05-28 14:09:25] [INFO ] Deduced a trap composed of 114 places in 195 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/364 variables, 3/63 constraints. Problems are: Problem set: 0 solved, 798 unsolved
[2024-05-28 14:09:32] [INFO ] Deduced a trap composed of 53 places in 201 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/364 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 798 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 364/1154 variables, and 64 constraints, problems are : Problem set: 0 solved, 798 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 34/36 constraints, State Equation: 0/366 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/798 constraints, Known Traps: 18/18 constraints]
After SMT, in 41517ms problems are : Problem set: 0 solved, 798 unsolved
Search for dead transitions found 0 dead transitions in 41530ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41749 ms. Remains : 366/536 places, 800/968 transitions.
RANDOM walk for 40000 steps (21 resets) in 720 ms. (55 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (13 resets) in 213 ms. (186 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (13 resets) in 283 ms. (140 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (10 resets) in 292 ms. (136 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (13 resets) in 218 ms. (182 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 163970 steps, run timeout after 3001 ms. (steps per millisecond=54 ) properties seen :0 out of 4
Probabilistic random walk after 163970 steps, saw 95018 distinct states, run finished after 3006 ms. (steps per millisecond=54 ) properties seen :0
[2024-05-28 14:09:43] [INFO ] Flow matrix only has 788 transitions (discarded 12 similar events)
[2024-05-28 14:09:43] [INFO ] Invariant cache hit.
[2024-05-28 14:09:43] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 157/177 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/177 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 15/192 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 156/348 variables, 26/37 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/348 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 2/350 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 14:09:43] [INFO ] Deduced a trap composed of 45 places in 72 ms of which 1 ms to minimize.
[2024-05-28 14:09:43] [INFO ] Deduced a trap composed of 45 places in 59 ms of which 1 ms to minimize.
[2024-05-28 14:09:43] [INFO ] Deduced a trap composed of 45 places in 71 ms of which 2 ms to minimize.
[2024-05-28 14:09:43] [INFO ] Deduced a trap composed of 45 places in 34 ms of which 1 ms to minimize.
[2024-05-28 14:09:43] [INFO ] Deduced a trap composed of 45 places in 46 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/350 variables, 5/44 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/350 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 13/363 variables, 7/51 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/363 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 1/364 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/364 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 788/1152 variables, 364/416 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1152 variables, 72/488 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1152 variables, 0/488 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 2/1154 variables, 2/490 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1154 variables, 1/491 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1154 variables, 0/491 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 0/1154 variables, 0/491 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1154/1154 variables, and 491 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1696 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 36/36 constraints, State Equation: 366/366 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 157/177 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/177 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 15/192 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 156/348 variables, 26/37 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/348 variables, 5/42 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 14:09:45] [INFO ] Deduced a trap composed of 45 places in 53 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/348 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/348 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 2/350 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/350 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 13/363 variables, 7/52 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/363 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 1/364 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 14:09:46] [INFO ] Deduced a trap composed of 147 places in 242 ms of which 3 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/364 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/364 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 788/1152 variables, 364/418 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1152 variables, 72/490 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1152 variables, 4/494 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1152 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 2/1154 variables, 2/496 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1154 variables, 1/497 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1154 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1154/1154 variables, and 497 constraints, problems are : Problem set: 0 solved, 4 unsolved in 45014 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 36/36 constraints, State Equation: 366/366 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 7/7 constraints]
After SMT, in 46723ms problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 20 out of 366 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 366/366 places, 800/800 transitions.
Applied a total of 0 rules in 43 ms. Remains 366 /366 variables (removed 0) and now considering 800/800 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 366/366 places, 800/800 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 366/366 places, 800/800 transitions.
Applied a total of 0 rules in 44 ms. Remains 366 /366 variables (removed 0) and now considering 800/800 (removed 0) transitions.
[2024-05-28 14:10:30] [INFO ] Flow matrix only has 788 transitions (discarded 12 similar events)
[2024-05-28 14:10:30] [INFO ] Invariant cache hit.
[2024-05-28 14:10:30] [INFO ] Implicit Places using invariants in 410 ms returned [330, 331, 332, 333, 334, 335]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 414 ms to find 6 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 360/366 places, 800/800 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 354 transition count 794
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 354 transition count 794
Applied a total of 12 rules in 23 ms. Remains 354 /360 variables (removed 6) and now considering 794/800 (removed 6) transitions.
[2024-05-28 14:10:30] [INFO ] Flow matrix only has 782 transitions (discarded 12 similar events)
// Phase 1: matrix 782 rows 354 cols
[2024-05-28 14:10:30] [INFO ] Computed 42 invariants in 26 ms
[2024-05-28 14:10:31] [INFO ] Implicit Places using invariants in 402 ms returned []
[2024-05-28 14:10:31] [INFO ] Flow matrix only has 782 transitions (discarded 12 similar events)
[2024-05-28 14:10:31] [INFO ] Invariant cache hit.
[2024-05-28 14:10:31] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 14:10:34] [INFO ] Implicit Places using invariants and state equation in 3002 ms returned []
Implicit Place search using SMT with State Equation took 3422 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 354/366 places, 794/800 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 3904 ms. Remains : 354/366 places, 794/800 transitions.
Successfully simplified 9 atomic propositions for a total of 16 simplifications.
FORMULA PolyORBLF-COL-S02J06T06-CTLFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 14:10:34] [INFO ] Flatten gal took : 88 ms
[2024-05-28 14:10:34] [INFO ] Flatten gal took : 64 ms
[2024-05-28 14:10:34] [INFO ] Input system was already deterministic with 968 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 536/536 places, 968/968 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 536 transition count 938
Reduce places removed 30 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 36 rules applied. Total rules applied 66 place count 506 transition count 932
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 72 place count 500 transition count 932
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 60 Pre rules applied. Total rules applied 72 place count 500 transition count 872
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 3 with 120 rules applied. Total rules applied 192 place count 440 transition count 872
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 204 place count 434 transition count 866
Applied a total of 204 rules in 88 ms. Remains 434 /536 variables (removed 102) and now considering 866/968 (removed 102) transitions.
Running 864 sub problems to find dead transitions.
[2024-05-28 14:10:34] [INFO ] Flow matrix only has 854 transitions (discarded 12 similar events)
// Phase 1: matrix 854 rows 434 cols
[2024-05-28 14:10:34] [INFO ] Computed 50 invariants in 13 ms
[2024-05-28 14:10:34] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/430 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 864 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/430 variables, 32/46 constraints. Problems are: Problem set: 0 solved, 864 unsolved
[2024-05-28 14:10:41] [INFO ] Deduced a trap composed of 66 places in 96 ms of which 2 ms to minimize.
[2024-05-28 14:10:41] [INFO ] Deduced a trap composed of 56 places in 57 ms of which 1 ms to minimize.
[2024-05-28 14:10:41] [INFO ] Deduced a trap composed of 56 places in 45 ms of which 1 ms to minimize.
[2024-05-28 14:10:41] [INFO ] Deduced a trap composed of 57 places in 52 ms of which 0 ms to minimize.
[2024-05-28 14:10:41] [INFO ] Deduced a trap composed of 56 places in 98 ms of which 1 ms to minimize.
[2024-05-28 14:10:41] [INFO ] Deduced a trap composed of 85 places in 104 ms of which 1 ms to minimize.
[2024-05-28 14:10:41] [INFO ] Deduced a trap composed of 56 places in 47 ms of which 1 ms to minimize.
[2024-05-28 14:10:42] [INFO ] Deduced a trap composed of 173 places in 185 ms of which 2 ms to minimize.
[2024-05-28 14:10:42] [INFO ] Deduced a trap composed of 159 places in 147 ms of which 2 ms to minimize.
[2024-05-28 14:10:42] [INFO ] Deduced a trap composed of 173 places in 176 ms of which 3 ms to minimize.
[2024-05-28 14:10:43] [INFO ] Deduced a trap composed of 56 places in 54 ms of which 0 ms to minimize.
[2024-05-28 14:10:48] [INFO ] Deduced a trap composed of 142 places in 151 ms of which 3 ms to minimize.
[2024-05-28 14:10:48] [INFO ] Deduced a trap composed of 148 places in 229 ms of which 4 ms to minimize.
[2024-05-28 14:10:48] [INFO ] Deduced a trap composed of 83 places in 224 ms of which 5 ms to minimize.
[2024-05-28 14:10:49] [INFO ] Deduced a trap composed of 83 places in 129 ms of which 2 ms to minimize.
[2024-05-28 14:10:49] [INFO ] Deduced a trap composed of 167 places in 152 ms of which 3 ms to minimize.
[2024-05-28 14:10:50] [INFO ] Deduced a trap composed of 74 places in 160 ms of which 2 ms to minimize.
[2024-05-28 14:10:50] [INFO ] Deduced a trap composed of 97 places in 133 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/430 variables, 18/64 constraints. Problems are: Problem set: 0 solved, 864 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 430/1288 variables, and 64 constraints, problems are : Problem set: 0 solved, 864 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 14/16 constraints, Generalized P Invariants (flows): 32/34 constraints, State Equation: 0/434 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 864/864 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 864 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/430 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 864 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/430 variables, 32/46 constraints. Problems are: Problem set: 0 solved, 864 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/430 variables, 18/64 constraints. Problems are: Problem set: 0 solved, 864 unsolved
[2024-05-28 14:10:56] [INFO ] Deduced a trap composed of 187 places in 211 ms of which 3 ms to minimize.
[2024-05-28 14:10:57] [INFO ] Deduced a trap composed of 15 places in 121 ms of which 2 ms to minimize.
[2024-05-28 14:11:00] [INFO ] Deduced a trap composed of 165 places in 255 ms of which 3 ms to minimize.
[2024-05-28 14:11:02] [INFO ] Deduced a trap composed of 156 places in 149 ms of which 2 ms to minimize.
[2024-05-28 14:11:03] [INFO ] Deduced a trap composed of 42 places in 223 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/430 variables, 5/69 constraints. Problems are: Problem set: 0 solved, 864 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/430 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 864 unsolved
Problem TDEAD560 is UNSAT
Problem TDEAD561 is UNSAT
Problem TDEAD562 is UNSAT
Problem TDEAD563 is UNSAT
Problem TDEAD564 is UNSAT
Problem TDEAD565 is UNSAT
Problem TDEAD578 is UNSAT
Problem TDEAD579 is UNSAT
Problem TDEAD580 is UNSAT
Problem TDEAD581 is UNSAT
Problem TDEAD582 is UNSAT
Problem TDEAD583 is UNSAT
Problem TDEAD584 is UNSAT
Problem TDEAD585 is UNSAT
Problem TDEAD586 is UNSAT
Problem TDEAD587 is UNSAT
Problem TDEAD588 is UNSAT
Problem TDEAD589 is UNSAT
Problem TDEAD602 is UNSAT
Problem TDEAD603 is UNSAT
Problem TDEAD604 is UNSAT
Problem TDEAD605 is UNSAT
Problem TDEAD606 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD608 is UNSAT
Problem TDEAD609 is UNSAT
Problem TDEAD610 is UNSAT
Problem TDEAD611 is UNSAT
Problem TDEAD612 is UNSAT
Problem TDEAD613 is UNSAT
Problem TDEAD614 is UNSAT
Problem TDEAD615 is UNSAT
Problem TDEAD616 is UNSAT
Problem TDEAD617 is UNSAT
Problem TDEAD618 is UNSAT
Problem TDEAD619 is UNSAT
At refinement iteration 5 (OVERLAPS) 2/432 variables, 2/71 constraints. Problems are: Problem set: 36 solved, 828 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 432/1288 variables, and 71 constraints, problems are : Problem set: 36 solved, 828 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 32/34 constraints, State Equation: 0/434 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/864 constraints, Known Traps: 23/23 constraints]
After SMT, in 41254ms problems are : Problem set: 36 solved, 828 unsolved
Search for dead transitions found 36 dead transitions in 41278ms
Found 36 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 36 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 36 transitions.
[2024-05-28 14:11:15] [INFO ] Flow matrix only has 818 transitions (discarded 12 similar events)
// Phase 1: matrix 818 rows 434 cols
[2024-05-28 14:11:15] [INFO ] Computed 50 invariants in 10 ms
[2024-05-28 14:11:16] [INFO ] Implicit Places using invariants in 326 ms returned [386, 387, 388, 389, 390, 391]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 329 ms to find 6 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 428/536 places, 830/968 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 422 transition count 824
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 422 transition count 824
Applied a total of 12 rules in 43 ms. Remains 422 /428 variables (removed 6) and now considering 824/830 (removed 6) transitions.
[2024-05-28 14:11:16] [INFO ] Flow matrix only has 812 transitions (discarded 12 similar events)
// Phase 1: matrix 812 rows 422 cols
[2024-05-28 14:11:16] [INFO ] Computed 44 invariants in 16 ms
[2024-05-28 14:11:16] [INFO ] Implicit Places using invariants in 298 ms returned []
[2024-05-28 14:11:16] [INFO ] Flow matrix only has 812 transitions (discarded 12 similar events)
[2024-05-28 14:11:16] [INFO ] Invariant cache hit.
[2024-05-28 14:11:16] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 14:11:19] [INFO ] Implicit Places using invariants and state equation in 2632 ms returned []
Implicit Place search using SMT with State Equation took 2946 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 422/536 places, 824/968 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 44695 ms. Remains : 422/536 places, 824/968 transitions.
[2024-05-28 14:11:19] [INFO ] Flatten gal took : 41 ms
[2024-05-28 14:11:19] [INFO ] Flatten gal took : 52 ms
[2024-05-28 14:11:19] [INFO ] Input system was already deterministic with 824 transitions.
[2024-05-28 14:11:19] [INFO ] Flatten gal took : 50 ms
[2024-05-28 14:11:19] [INFO ] Flatten gal took : 38 ms
[2024-05-28 14:11:19] [INFO ] Time to serialize gal into /tmp/CTLFireability2190321235633666008.gal : 43 ms
[2024-05-28 14:11:19] [INFO ] Time to serialize properties into /tmp/CTLFireability2969258463477891564.ctl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2190321235633666008.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2969258463477891564.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-28 14:11:49] [INFO ] Flatten gal took : 35 ms
[2024-05-28 14:11:49] [INFO ] Applying decomposition
[2024-05-28 14:11:49] [INFO ] Flatten gal took : 30 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph2899001410780185973.txt' '-o' '/tmp/graph2899001410780185973.bin' '-w' '/tmp/graph2899001410780185973.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2899001410780185973.bin' '-l' '-1' '-v' '-w' '/tmp/graph2899001410780185973.weights' '-q' '0' '-e' '0.001'
[2024-05-28 14:11:50] [INFO ] Decomposing Gal with order
[2024-05-28 14:11:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 14:11:50] [INFO ] Removed a total of 465 redundant transitions.
[2024-05-28 14:11:50] [INFO ] Flatten gal took : 259 ms
[2024-05-28 14:11:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 508 labels/synchronizations in 49 ms.
[2024-05-28 14:11:50] [INFO ] Time to serialize gal into /tmp/CTLFireability12053709531961427756.gal : 24 ms
[2024-05-28 14:11:50] [INFO ] Time to serialize properties into /tmp/CTLFireability11749380079859113017.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability12053709531961427756.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11749380079859113017.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 536/536 places, 968/968 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 534 transition count 932
Reduce places removed 36 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 42 rules applied. Total rules applied 78 place count 498 transition count 926
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 84 place count 492 transition count 926
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 60 Pre rules applied. Total rules applied 84 place count 492 transition count 866
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 3 with 120 rules applied. Total rules applied 204 place count 432 transition count 866
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 300 place count 384 transition count 818
Applied a total of 300 rules in 71 ms. Remains 384 /536 variables (removed 152) and now considering 818/968 (removed 150) transitions.
Running 816 sub problems to find dead transitions.
[2024-05-28 14:12:20] [INFO ] Flow matrix only has 806 transitions (discarded 12 similar events)
// Phase 1: matrix 806 rows 384 cols
[2024-05-28 14:12:20] [INFO ] Computed 48 invariants in 13 ms
[2024-05-28 14:12:20] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/382 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 816 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/382 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 816 unsolved
[2024-05-28 14:12:25] [INFO ] Deduced a trap composed of 48 places in 79 ms of which 2 ms to minimize.
[2024-05-28 14:12:25] [INFO ] Deduced a trap composed of 48 places in 38 ms of which 1 ms to minimize.
[2024-05-28 14:12:25] [INFO ] Deduced a trap composed of 49 places in 32 ms of which 1 ms to minimize.
[2024-05-28 14:12:25] [INFO ] Deduced a trap composed of 48 places in 33 ms of which 1 ms to minimize.
[2024-05-28 14:12:25] [INFO ] Deduced a trap composed of 48 places in 41 ms of which 9 ms to minimize.
[2024-05-28 14:12:26] [INFO ] Deduced a trap composed of 147 places in 230 ms of which 2 ms to minimize.
[2024-05-28 14:12:26] [INFO ] Deduced a trap composed of 181 places in 180 ms of which 2 ms to minimize.
[2024-05-28 14:12:26] [INFO ] Deduced a trap composed of 157 places in 140 ms of which 2 ms to minimize.
[2024-05-28 14:12:26] [INFO ] Deduced a trap composed of 145 places in 129 ms of which 2 ms to minimize.
[2024-05-28 14:12:27] [INFO ] Deduced a trap composed of 48 places in 45 ms of which 2 ms to minimize.
[2024-05-28 14:12:28] [INFO ] Deduced a trap composed of 228 places in 140 ms of which 2 ms to minimize.
[2024-05-28 14:12:32] [INFO ] Deduced a trap composed of 114 places in 200 ms of which 3 ms to minimize.
[2024-05-28 14:12:32] [INFO ] Deduced a trap composed of 163 places in 125 ms of which 2 ms to minimize.
[2024-05-28 14:12:32] [INFO ] Deduced a trap composed of 50 places in 214 ms of which 3 ms to minimize.
[2024-05-28 14:12:33] [INFO ] Deduced a trap composed of 69 places in 151 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/382 variables, 15/60 constraints. Problems are: Problem set: 0 solved, 816 unsolved
[2024-05-28 14:12:33] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
[2024-05-28 14:12:33] [INFO ] Deduced a trap composed of 45 places in 95 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/382 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 816 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 382/1190 variables, and 62 constraints, problems are : Problem set: 0 solved, 816 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 33/36 constraints, State Equation: 0/384 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 816/816 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 816 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/382 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 816 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/382 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 816 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/382 variables, 17/62 constraints. Problems are: Problem set: 0 solved, 816 unsolved
[2024-05-28 14:12:43] [INFO ] Deduced a trap composed of 3 places in 182 ms of which 2 ms to minimize.
[2024-05-28 14:12:45] [INFO ] Deduced a trap composed of 140 places in 142 ms of which 2 ms to minimize.
[2024-05-28 14:12:49] [INFO ] Deduced a trap composed of 127 places in 147 ms of which 2 ms to minimize.
[2024-05-28 14:12:50] [INFO ] Deduced a trap composed of 172 places in 143 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/382 variables, 4/66 constraints. Problems are: Problem set: 0 solved, 816 unsolved
[2024-05-28 14:12:58] [INFO ] Deduced a trap composed of 132 places in 142 ms of which 2 ms to minimize.
[2024-05-28 14:12:58] [INFO ] Deduced a trap composed of 195 places in 174 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/382 variables, 2/68 constraints. Problems are: Problem set: 0 solved, 816 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 382/1190 variables, and 68 constraints, problems are : Problem set: 0 solved, 816 unsolved in 20016 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 33/36 constraints, State Equation: 0/384 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/816 constraints, Known Traps: 23/23 constraints]
After SMT, in 41014ms problems are : Problem set: 0 solved, 816 unsolved
Search for dead transitions found 0 dead transitions in 41026ms
[2024-05-28 14:13:01] [INFO ] Flow matrix only has 806 transitions (discarded 12 similar events)
[2024-05-28 14:13:01] [INFO ] Invariant cache hit.
[2024-05-28 14:13:01] [INFO ] Implicit Places using invariants in 255 ms returned [336, 337, 338, 339, 340, 341]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 270 ms to find 6 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 378/536 places, 818/968 transitions.
Applied a total of 0 rules in 16 ms. Remains 378 /378 variables (removed 0) and now considering 818/818 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 41386 ms. Remains : 378/536 places, 818/968 transitions.
[2024-05-28 14:13:02] [INFO ] Flatten gal took : 34 ms
[2024-05-28 14:13:02] [INFO ] Flatten gal took : 41 ms
[2024-05-28 14:13:02] [INFO ] Input system was already deterministic with 818 transitions.
RANDOM walk for 168 steps (0 resets) in 4 ms. (33 steps per ms) remains 0/1 properties
FORMULA PolyORBLF-COL-S02J06T06-CTLFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-28 14:13:02] [INFO ] Flatten gal took : 34 ms
[2024-05-28 14:13:02] [INFO ] Flatten gal took : 27 ms
[2024-05-28 14:13:02] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9631961302496042202.gal : 4 ms
[2024-05-28 14:13:02] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5811521460169904179.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality9631961302496042202.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5811521460169904179.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 536/536 places, 968/968 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 534 transition count 968
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 8 place count 528 transition count 962
Iterating global reduction 1 with 6 rules applied. Total rules applied 14 place count 528 transition count 962
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 20 place count 522 transition count 956
Iterating global reduction 1 with 6 rules applied. Total rules applied 26 place count 522 transition count 956
Applied a total of 26 rules in 14 ms. Remains 522 /536 variables (removed 14) and now considering 956/968 (removed 12) transitions.
Running 954 sub problems to find dead transitions.
[2024-05-28 14:13:02] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
// Phase 1: matrix 944 rows 522 cols
[2024-05-28 14:13:02] [INFO ] Computed 48 invariants in 15 ms
[2024-05-28 14:13:02] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/520 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/520 variables, 31/46 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-05-28 14:13:09] [INFO ] Deduced a trap composed of 71 places in 67 ms of which 1 ms to minimize.
[2024-05-28 14:13:10] [INFO ] Deduced a trap composed of 71 places in 44 ms of which 1 ms to minimize.
[2024-05-28 14:13:10] [INFO ] Deduced a trap composed of 71 places in 45 ms of which 1 ms to minimize.
[2024-05-28 14:13:10] [INFO ] Deduced a trap composed of 71 places in 42 ms of which 1 ms to minimize.
[2024-05-28 14:13:10] [INFO ] Deduced a trap composed of 71 places in 43 ms of which 0 ms to minimize.
[2024-05-28 14:13:10] [INFO ] Deduced a trap composed of 292 places in 164 ms of which 3 ms to minimize.
[2024-05-28 14:13:10] [INFO ] Deduced a trap composed of 304 places in 166 ms of which 3 ms to minimize.
[2024-05-28 14:13:10] [INFO ] Deduced a trap composed of 281 places in 201 ms of which 2 ms to minimize.
[2024-05-28 14:13:11] [INFO ] Deduced a trap composed of 240 places in 136 ms of which 2 ms to minimize.
[2024-05-28 14:13:11] [INFO ] Deduced a trap composed of 124 places in 217 ms of which 4 ms to minimize.
[2024-05-28 14:13:11] [INFO ] Deduced a trap composed of 71 places in 43 ms of which 0 ms to minimize.
[2024-05-28 14:13:12] [INFO ] Deduced a trap composed of 281 places in 265 ms of which 3 ms to minimize.
[2024-05-28 14:13:12] [INFO ] Deduced a trap composed of 243 places in 175 ms of which 3 ms to minimize.
[2024-05-28 14:13:20] [INFO ] Deduced a trap composed of 221 places in 171 ms of which 2 ms to minimize.
[2024-05-28 14:13:21] [INFO ] Deduced a trap composed of 214 places in 209 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/520 variables, 15/61 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 520/1466 variables, and 61 constraints, problems are : Problem set: 0 solved, 954 unsolved in 20015 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 31/32 constraints, State Equation: 0/522 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 954/954 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 954 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/520 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/520 variables, 31/46 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/520 variables, 15/61 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-05-28 14:13:24] [INFO ] Deduced a trap composed of 290 places in 162 ms of which 3 ms to minimize.
[2024-05-28 14:13:28] [INFO ] Deduced a trap composed of 15 places in 153 ms of which 2 ms to minimize.
[2024-05-28 14:13:31] [INFO ] Deduced a trap composed of 270 places in 171 ms of which 3 ms to minimize.
[2024-05-28 14:13:32] [INFO ] Deduced a trap composed of 274 places in 203 ms of which 3 ms to minimize.
[2024-05-28 14:13:32] [INFO ] Deduced a trap composed of 62 places in 197 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/520 variables, 5/66 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-05-28 14:13:39] [INFO ] Deduced a trap composed of 259 places in 247 ms of which 4 ms to minimize.
[2024-05-28 14:13:40] [INFO ] Deduced a trap composed of 358 places in 265 ms of which 3 ms to minimize.
[2024-05-28 14:13:40] [INFO ] Deduced a trap composed of 323 places in 176 ms of which 3 ms to minimize.
[2024-05-28 14:13:40] [INFO ] Deduced a trap composed of 274 places in 245 ms of which 4 ms to minimize.
[2024-05-28 14:13:40] [INFO ] Deduced a trap composed of 37 places in 128 ms of which 2 ms to minimize.
[2024-05-28 14:13:41] [INFO ] Deduced a trap composed of 313 places in 171 ms of which 3 ms to minimize.
[2024-05-28 14:13:41] [INFO ] Deduced a trap composed of 278 places in 251 ms of which 4 ms to minimize.
[2024-05-28 14:13:41] [INFO ] Deduced a trap composed of 359 places in 268 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 520/1466 variables, and 74 constraints, problems are : Problem set: 0 solved, 954 unsolved in 20015 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 31/32 constraints, State Equation: 0/522 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/954 constraints, Known Traps: 28/28 constraints]
After SMT, in 40944ms problems are : Problem set: 0 solved, 954 unsolved
Search for dead transitions found 0 dead transitions in 40953ms
[2024-05-28 14:13:43] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
[2024-05-28 14:13:43] [INFO ] Invariant cache hit.
[2024-05-28 14:13:43] [INFO ] Implicit Places using invariants in 247 ms returned [414, 415, 416, 417, 418, 419]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 261 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 516/536 places, 956/968 transitions.
Applied a total of 0 rules in 4 ms. Remains 516 /516 variables (removed 0) and now considering 956/956 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 41235 ms. Remains : 516/536 places, 956/968 transitions.
[2024-05-28 14:13:43] [INFO ] Flatten gal took : 26 ms
[2024-05-28 14:13:43] [INFO ] Flatten gal took : 27 ms
[2024-05-28 14:13:43] [INFO ] Input system was already deterministic with 956 transitions.
[2024-05-28 14:13:43] [INFO ] Flatten gal took : 26 ms
[2024-05-28 14:13:43] [INFO ] Flatten gal took : 26 ms
[2024-05-28 14:13:43] [INFO ] Time to serialize gal into /tmp/CTLFireability1798478396288617638.gal : 4 ms
[2024-05-28 14:13:43] [INFO ] Time to serialize properties into /tmp/CTLFireability7609965742397184359.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1798478396288617638.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7609965742397184359.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-28 14:14:13] [INFO ] Flatten gal took : 29 ms
[2024-05-28 14:14:13] [INFO ] Applying decomposition
[2024-05-28 14:14:13] [INFO ] Flatten gal took : 27 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph5584663299474041105.txt' '-o' '/tmp/graph5584663299474041105.bin' '-w' '/tmp/graph5584663299474041105.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5584663299474041105.bin' '-l' '-1' '-v' '-w' '/tmp/graph5584663299474041105.weights' '-q' '0' '-e' '0.001'
[2024-05-28 14:14:13] [INFO ] Decomposing Gal with order
[2024-05-28 14:14:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 14:14:14] [INFO ] Removed a total of 830 redundant transitions.
[2024-05-28 14:14:14] [INFO ] Flatten gal took : 155 ms
[2024-05-28 14:14:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 187 labels/synchronizations in 52 ms.
[2024-05-28 14:14:14] [INFO ] Time to serialize gal into /tmp/CTLFireability17140524494083851462.gal : 18 ms
[2024-05-28 14:14:14] [INFO ] Time to serialize properties into /tmp/CTLFireability10412280772615780432.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17140524494083851462.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10412280772615780432.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 536/536 places, 968/968 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 530 transition count 962
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 530 transition count 962
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 524 transition count 956
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 524 transition count 956
Applied a total of 24 rules in 28 ms. Remains 524 /536 variables (removed 12) and now considering 956/968 (removed 12) transitions.
Running 954 sub problems to find dead transitions.
[2024-05-28 14:14:44] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
// Phase 1: matrix 944 rows 524 cols
[2024-05-28 14:14:44] [INFO ] Computed 50 invariants in 22 ms
[2024-05-28 14:14:44] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/520 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/520 variables, 32/46 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-05-28 14:14:51] [INFO ] Deduced a trap composed of 72 places in 70 ms of which 1 ms to minimize.
[2024-05-28 14:14:52] [INFO ] Deduced a trap composed of 71 places in 47 ms of which 1 ms to minimize.
[2024-05-28 14:14:52] [INFO ] Deduced a trap composed of 71 places in 61 ms of which 1 ms to minimize.
[2024-05-28 14:14:52] [INFO ] Deduced a trap composed of 71 places in 51 ms of which 1 ms to minimize.
[2024-05-28 14:14:52] [INFO ] Deduced a trap composed of 71 places in 73 ms of which 2 ms to minimize.
[2024-05-28 14:14:52] [INFO ] Deduced a trap composed of 254 places in 280 ms of which 4 ms to minimize.
[2024-05-28 14:14:52] [INFO ] Deduced a trap composed of 148 places in 191 ms of which 3 ms to minimize.
[2024-05-28 14:14:53] [INFO ] Deduced a trap composed of 71 places in 44 ms of which 1 ms to minimize.
[2024-05-28 14:14:53] [INFO ] Deduced a trap composed of 281 places in 193 ms of which 3 ms to minimize.
[2024-05-28 14:14:53] [INFO ] Deduced a trap composed of 294 places in 174 ms of which 3 ms to minimize.
[2024-05-28 14:14:54] [INFO ] Deduced a trap composed of 297 places in 244 ms of which 3 ms to minimize.
[2024-05-28 14:14:54] [INFO ] Deduced a trap composed of 279 places in 258 ms of which 4 ms to minimize.
[2024-05-28 14:14:54] [INFO ] Deduced a trap composed of 289 places in 180 ms of which 3 ms to minimize.
[2024-05-28 14:15:01] [INFO ] Deduced a trap composed of 272 places in 233 ms of which 4 ms to minimize.
[2024-05-28 14:15:02] [INFO ] Deduced a trap composed of 247 places in 222 ms of which 4 ms to minimize.
[2024-05-28 14:15:02] [INFO ] Deduced a trap composed of 37 places in 103 ms of which 1 ms to minimize.
[2024-05-28 14:15:05] [INFO ] Deduced a trap composed of 299 places in 197 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/520 variables, 17/63 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 520/1468 variables, and 63 constraints, problems are : Problem set: 0 solved, 954 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 14/16 constraints, Generalized P Invariants (flows): 32/34 constraints, State Equation: 0/524 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 954/954 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 954 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/520 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/520 variables, 32/46 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/520 variables, 17/63 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-05-28 14:15:11] [INFO ] Deduced a trap composed of 353 places in 175 ms of which 2 ms to minimize.
[2024-05-28 14:15:11] [INFO ] Deduced a trap composed of 349 places in 167 ms of which 3 ms to minimize.
[2024-05-28 14:15:11] [INFO ] Deduced a trap composed of 354 places in 181 ms of which 2 ms to minimize.
[2024-05-28 14:15:12] [INFO ] Deduced a trap composed of 349 places in 185 ms of which 3 ms to minimize.
[2024-05-28 14:15:12] [INFO ] Deduced a trap composed of 349 places in 170 ms of which 3 ms to minimize.
[2024-05-28 14:15:12] [INFO ] Deduced a trap composed of 349 places in 177 ms of which 3 ms to minimize.
[2024-05-28 14:15:12] [INFO ] Deduced a trap composed of 349 places in 174 ms of which 3 ms to minimize.
[2024-05-28 14:15:17] [INFO ] Deduced a trap composed of 297 places in 181 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/520 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 520/1468 variables, and 71 constraints, problems are : Problem set: 0 solved, 954 unsolved in 20014 ms.
Refiners :[Positive P Invariants (semi-flows): 14/16 constraints, Generalized P Invariants (flows): 32/34 constraints, State Equation: 0/524 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/954 constraints, Known Traps: 25/25 constraints]
After SMT, in 41061ms problems are : Problem set: 0 solved, 954 unsolved
Search for dead transitions found 0 dead transitions in 41077ms
[2024-05-28 14:15:25] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
[2024-05-28 14:15:25] [INFO ] Invariant cache hit.
[2024-05-28 14:15:25] [INFO ] Implicit Places using invariants in 250 ms returned []
[2024-05-28 14:15:25] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
[2024-05-28 14:15:25] [INFO ] Invariant cache hit.
[2024-05-28 14:15:26] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 14:15:28] [INFO ] Implicit Places using invariants and state equation in 3023 ms returned []
Implicit Place search using SMT with State Equation took 3309 ms to find 0 implicit places.
Running 954 sub problems to find dead transitions.
[2024-05-28 14:15:28] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
[2024-05-28 14:15:28] [INFO ] Invariant cache hit.
[2024-05-28 14:15:28] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/520 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/520 variables, 32/46 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-05-28 14:15:35] [INFO ] Deduced a trap composed of 72 places in 54 ms of which 1 ms to minimize.
[2024-05-28 14:15:35] [INFO ] Deduced a trap composed of 71 places in 52 ms of which 1 ms to minimize.
[2024-05-28 14:15:35] [INFO ] Deduced a trap composed of 71 places in 39 ms of which 1 ms to minimize.
[2024-05-28 14:15:35] [INFO ] Deduced a trap composed of 71 places in 53 ms of which 1 ms to minimize.
[2024-05-28 14:15:35] [INFO ] Deduced a trap composed of 71 places in 45 ms of which 1 ms to minimize.
[2024-05-28 14:15:36] [INFO ] Deduced a trap composed of 274 places in 190 ms of which 3 ms to minimize.
[2024-05-28 14:15:36] [INFO ] Deduced a trap composed of 115 places in 152 ms of which 2 ms to minimize.
[2024-05-28 14:15:36] [INFO ] Deduced a trap composed of 147 places in 170 ms of which 2 ms to minimize.
[2024-05-28 14:15:36] [INFO ] Deduced a trap composed of 121 places in 209 ms of which 3 ms to minimize.
[2024-05-28 14:15:37] [INFO ] Deduced a trap composed of 273 places in 192 ms of which 3 ms to minimize.
[2024-05-28 14:15:37] [INFO ] Deduced a trap composed of 279 places in 208 ms of which 3 ms to minimize.
[2024-05-28 14:15:37] [INFO ] Deduced a trap composed of 296 places in 196 ms of which 2 ms to minimize.
[2024-05-28 14:15:38] [INFO ] Deduced a trap composed of 271 places in 211 ms of which 3 ms to minimize.
[2024-05-28 14:15:38] [INFO ] Deduced a trap composed of 287 places in 192 ms of which 3 ms to minimize.
[2024-05-28 14:15:38] [INFO ] Deduced a trap composed of 280 places in 179 ms of which 3 ms to minimize.
[2024-05-28 14:15:38] [INFO ] Deduced a trap composed of 71 places in 50 ms of which 0 ms to minimize.
[2024-05-28 14:15:44] [INFO ] Deduced a trap composed of 277 places in 182 ms of which 2 ms to minimize.
[2024-05-28 14:15:44] [INFO ] Deduced a trap composed of 276 places in 184 ms of which 3 ms to minimize.
[2024-05-28 14:15:45] [INFO ] Deduced a trap composed of 246 places in 191 ms of which 2 ms to minimize.
[2024-05-28 14:15:45] [INFO ] Deduced a trap composed of 37 places in 103 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/520 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-05-28 14:15:46] [INFO ] Deduced a trap composed of 41 places in 86 ms of which 1 ms to minimize.
[2024-05-28 14:15:47] [INFO ] Deduced a trap composed of 15 places in 106 ms of which 2 ms to minimize.
[2024-05-28 14:15:51] [INFO ] Deduced a trap composed of 284 places in 254 ms of which 3 ms to minimize.
[2024-05-28 14:15:52] [INFO ] Deduced a trap composed of 325 places in 210 ms of which 4 ms to minimize.
[2024-05-28 14:15:53] [INFO ] Deduced a trap composed of 286 places in 210 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/520 variables, 5/71 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 520/1468 variables, and 71 constraints, problems are : Problem set: 0 solved, 954 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 14/16 constraints, Generalized P Invariants (flows): 32/34 constraints, State Equation: 0/524 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 954/954 constraints, Known Traps: 25/25 constraints]
Escalating to Integer solving :Problem set: 0 solved, 954 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/520 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/520 variables, 32/46 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/520 variables, 25/71 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/520 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Problem TDEAD614 is UNSAT
Problem TDEAD615 is UNSAT
Problem TDEAD616 is UNSAT
Problem TDEAD617 is UNSAT
Problem TDEAD618 is UNSAT
Problem TDEAD619 is UNSAT
Problem TDEAD632 is UNSAT
Problem TDEAD633 is UNSAT
Problem TDEAD634 is UNSAT
Problem TDEAD635 is UNSAT
Problem TDEAD636 is UNSAT
Problem TDEAD637 is UNSAT
Problem TDEAD638 is UNSAT
Problem TDEAD639 is UNSAT
Problem TDEAD640 is UNSAT
Problem TDEAD641 is UNSAT
Problem TDEAD642 is UNSAT
Problem TDEAD643 is UNSAT
Problem TDEAD656 is UNSAT
Problem TDEAD657 is UNSAT
Problem TDEAD658 is UNSAT
Problem TDEAD659 is UNSAT
Problem TDEAD660 is UNSAT
Problem TDEAD661 is UNSAT
Problem TDEAD662 is UNSAT
Problem TDEAD663 is UNSAT
Problem TDEAD664 is UNSAT
Problem TDEAD665 is UNSAT
Problem TDEAD666 is UNSAT
Problem TDEAD667 is UNSAT
Problem TDEAD668 is UNSAT
Problem TDEAD669 is UNSAT
Problem TDEAD670 is UNSAT
Problem TDEAD671 is UNSAT
Problem TDEAD672 is UNSAT
Problem TDEAD673 is UNSAT
At refinement iteration 4 (OVERLAPS) 2/522 variables, 2/73 constraints. Problems are: Problem set: 36 solved, 918 unsolved
[2024-05-28 14:16:18] [INFO ] Deduced a trap composed of 266 places in 194 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/522 variables, 1/74 constraints. Problems are: Problem set: 36 solved, 918 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 522/1468 variables, and 74 constraints, problems are : Problem set: 36 solved, 918 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 32/34 constraints, State Equation: 0/524 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/954 constraints, Known Traps: 26/26 constraints]
After SMT, in 60917ms problems are : Problem set: 36 solved, 918 unsolved
Search for dead transitions found 36 dead transitions in 60933ms
Found 36 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 36 transitions
Dead transitions reduction (with SMT) removed 36 transitions
Starting structural reductions in LTL mode, iteration 1 : 524/536 places, 920/968 transitions.
Applied a total of 0 rules in 9 ms. Remains 524 /524 variables (removed 0) and now considering 920/920 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 105368 ms. Remains : 524/536 places, 920/968 transitions.
[2024-05-28 14:16:29] [INFO ] Flatten gal took : 25 ms
[2024-05-28 14:16:29] [INFO ] Flatten gal took : 27 ms
[2024-05-28 14:16:29] [INFO ] Input system was already deterministic with 920 transitions.
[2024-05-28 14:16:29] [INFO ] Flatten gal took : 25 ms
[2024-05-28 14:16:29] [INFO ] Flatten gal took : 25 ms
[2024-05-28 14:16:30] [INFO ] Time to serialize gal into /tmp/CTLFireability9664639644648496500.gal : 5 ms
[2024-05-28 14:16:30] [INFO ] Time to serialize properties into /tmp/CTLFireability13905026954460048877.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9664639644648496500.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13905026954460048877.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-28 14:17:00] [INFO ] Flatten gal took : 79 ms
[2024-05-28 14:17:00] [INFO ] Applying decomposition
[2024-05-28 14:17:00] [INFO ] Flatten gal took : 39 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph3715929455073025577.txt' '-o' '/tmp/graph3715929455073025577.bin' '-w' '/tmp/graph3715929455073025577.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3715929455073025577.bin' '-l' '-1' '-v' '-w' '/tmp/graph3715929455073025577.weights' '-q' '0' '-e' '0.001'
[2024-05-28 14:17:00] [INFO ] Decomposing Gal with order
[2024-05-28 14:17:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 14:17:00] [INFO ] Removed a total of 761 redundant transitions.
[2024-05-28 14:17:00] [INFO ] Flatten gal took : 95 ms
[2024-05-28 14:17:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 124 labels/synchronizations in 28 ms.
[2024-05-28 14:17:00] [INFO ] Time to serialize gal into /tmp/CTLFireability6916812744494594980.gal : 12 ms
[2024-05-28 14:17:00] [INFO ] Time to serialize properties into /tmp/CTLFireability10927928776086209321.ctl : 14 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6916812744494594980.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10927928776086209321.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 536/536 places, 968/968 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 48 place count 534 transition count 920
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 96 place count 486 transition count 920
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 60 Pre rules applied. Total rules applied 96 place count 486 transition count 860
Deduced a syphon composed of 60 places in 0 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 216 place count 426 transition count 860
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 1 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 288 place count 390 transition count 824
Applied a total of 288 rules in 57 ms. Remains 390 /536 variables (removed 146) and now considering 824/968 (removed 144) transitions.
Running 822 sub problems to find dead transitions.
[2024-05-28 14:17:30] [INFO ] Flow matrix only has 812 transitions (discarded 12 similar events)
// Phase 1: matrix 812 rows 390 cols
[2024-05-28 14:17:30] [INFO ] Computed 48 invariants in 14 ms
[2024-05-28 14:17:30] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/388 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/388 variables, 32/46 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2024-05-28 14:17:36] [INFO ] Deduced a trap composed of 49 places in 101 ms of which 2 ms to minimize.
[2024-05-28 14:17:36] [INFO ] Deduced a trap composed of 49 places in 65 ms of which 1 ms to minimize.
[2024-05-28 14:17:36] [INFO ] Deduced a trap composed of 49 places in 40 ms of which 1 ms to minimize.
[2024-05-28 14:17:36] [INFO ] Deduced a trap composed of 50 places in 38 ms of which 1 ms to minimize.
[2024-05-28 14:17:36] [INFO ] Deduced a trap composed of 49 places in 43 ms of which 1 ms to minimize.
[2024-05-28 14:17:36] [INFO ] Deduced a trap composed of 160 places in 241 ms of which 3 ms to minimize.
[2024-05-28 14:17:36] [INFO ] Deduced a trap composed of 49 places in 26 ms of which 1 ms to minimize.
[2024-05-28 14:17:41] [INFO ] Deduced a trap composed of 67 places in 226 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/388 variables, 8/54 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2024-05-28 14:17:43] [INFO ] Deduced a trap composed of 43 places in 131 ms of which 2 ms to minimize.
[2024-05-28 14:17:44] [INFO ] Deduced a trap composed of 234 places in 201 ms of which 3 ms to minimize.
[2024-05-28 14:17:46] [INFO ] Deduced a trap composed of 168 places in 241 ms of which 5 ms to minimize.
[2024-05-28 14:17:48] [INFO ] Deduced a trap composed of 131 places in 155 ms of which 3 ms to minimize.
[2024-05-28 14:17:48] [INFO ] Deduced a trap composed of 15 places in 159 ms of which 3 ms to minimize.
[2024-05-28 14:17:49] [INFO ] Deduced a trap composed of 149 places in 227 ms of which 4 ms to minimize.
[2024-05-28 14:17:49] [INFO ] Deduced a trap composed of 3 places in 237 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/388 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 822 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 388/1202 variables, and 61 constraints, problems are : Problem set: 0 solved, 822 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 32/34 constraints, State Equation: 0/390 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 822/822 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 822 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/388 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/388 variables, 32/46 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/388 variables, 15/61 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2024-05-28 14:17:58] [INFO ] Deduced a trap composed of 132 places in 131 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/388 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 822 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 388/1202 variables, and 62 constraints, problems are : Problem set: 0 solved, 822 unsolved in 20013 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 32/34 constraints, State Equation: 0/390 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/822 constraints, Known Traps: 16/16 constraints]
After SMT, in 41071ms problems are : Problem set: 0 solved, 822 unsolved
Search for dead transitions found 0 dead transitions in 41083ms
[2024-05-28 14:18:11] [INFO ] Flow matrix only has 812 transitions (discarded 12 similar events)
[2024-05-28 14:18:11] [INFO ] Invariant cache hit.
[2024-05-28 14:18:12] [INFO ] Implicit Places using invariants in 280 ms returned [354, 355, 356, 357, 358, 359]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 284 ms to find 6 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 384/536 places, 824/968 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 378 transition count 818
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 378 transition count 818
Applied a total of 12 rules in 15 ms. Remains 378 /384 variables (removed 6) and now considering 818/824 (removed 6) transitions.
[2024-05-28 14:18:12] [INFO ] Flow matrix only has 806 transitions (discarded 12 similar events)
// Phase 1: matrix 806 rows 378 cols
[2024-05-28 14:18:12] [INFO ] Computed 42 invariants in 20 ms
[2024-05-28 14:18:12] [INFO ] Implicit Places using invariants in 298 ms returned []
[2024-05-28 14:18:12] [INFO ] Flow matrix only has 806 transitions (discarded 12 similar events)
[2024-05-28 14:18:12] [INFO ] Invariant cache hit.
[2024-05-28 14:18:12] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 14:18:15] [INFO ] Implicit Places using invariants and state equation in 3140 ms returned []
Implicit Place search using SMT with State Equation took 3455 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 378/536 places, 818/968 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 44898 ms. Remains : 378/536 places, 818/968 transitions.
[2024-05-28 14:18:15] [INFO ] Flatten gal took : 45 ms
[2024-05-28 14:18:15] [INFO ] Flatten gal took : 65 ms
[2024-05-28 14:18:15] [INFO ] Input system was already deterministic with 818 transitions.
[2024-05-28 14:18:15] [INFO ] Flatten gal took : 23 ms
[2024-05-28 14:18:15] [INFO ] Flatten gal took : 23 ms
[2024-05-28 14:18:15] [INFO ] Time to serialize gal into /tmp/CTLFireability18405995224639468098.gal : 5 ms
[2024-05-28 14:18:15] [INFO ] Time to serialize properties into /tmp/CTLFireability3698652649043377394.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability18405995224639468098.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3698652649043377394.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-28 14:18:45] [INFO ] Flatten gal took : 23 ms
[2024-05-28 14:18:45] [INFO ] Applying decomposition
[2024-05-28 14:18:45] [INFO ] Flatten gal took : 23 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph84391701119761073.txt' '-o' '/tmp/graph84391701119761073.bin' '-w' '/tmp/graph84391701119761073.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph84391701119761073.bin' '-l' '-1' '-v' '-w' '/tmp/graph84391701119761073.weights' '-q' '0' '-e' '0.001'
[2024-05-28 14:18:45] [INFO ] Decomposing Gal with order
[2024-05-28 14:18:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 14:18:45] [INFO ] Removed a total of 494 redundant transitions.
[2024-05-28 14:18:45] [INFO ] Flatten gal took : 60 ms
[2024-05-28 14:18:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 518 labels/synchronizations in 10 ms.
[2024-05-28 14:18:46] [INFO ] Time to serialize gal into /tmp/CTLFireability16078300623032232409.gal : 5 ms
[2024-05-28 14:18:46] [INFO ] Time to serialize properties into /tmp/CTLFireability5607964787299277134.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16078300623032232409.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5607964787299277134.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 536/536 places, 968/968 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 534 transition count 932
Reduce places removed 36 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 42 rules applied. Total rules applied 78 place count 498 transition count 926
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 84 place count 492 transition count 926
Performed 66 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 66 Pre rules applied. Total rules applied 84 place count 492 transition count 860
Deduced a syphon composed of 66 places in 1 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 3 with 132 rules applied. Total rules applied 216 place count 426 transition count 860
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 222 place count 420 transition count 854
Iterating global reduction 3 with 6 rules applied. Total rules applied 228 place count 420 transition count 854
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 3 with 72 rules applied. Total rules applied 300 place count 384 transition count 818
Applied a total of 300 rules in 53 ms. Remains 384 /536 variables (removed 152) and now considering 818/968 (removed 150) transitions.
Running 816 sub problems to find dead transitions.
[2024-05-28 14:19:16] [INFO ] Flow matrix only has 806 transitions (discarded 12 similar events)
// Phase 1: matrix 806 rows 384 cols
[2024-05-28 14:19:16] [INFO ] Computed 48 invariants in 21 ms
[2024-05-28 14:19:16] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/382 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 816 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/382 variables, 34/46 constraints. Problems are: Problem set: 0 solved, 816 unsolved
[2024-05-28 14:19:20] [INFO ] Deduced a trap composed of 48 places in 73 ms of which 2 ms to minimize.
[2024-05-28 14:19:21] [INFO ] Deduced a trap composed of 48 places in 70 ms of which 1 ms to minimize.
[2024-05-28 14:19:21] [INFO ] Deduced a trap composed of 48 places in 55 ms of which 1 ms to minimize.
[2024-05-28 14:19:21] [INFO ] Deduced a trap composed of 48 places in 28 ms of which 1 ms to minimize.
[2024-05-28 14:19:21] [INFO ] Deduced a trap composed of 48 places in 27 ms of which 2 ms to minimize.
[2024-05-28 14:19:21] [INFO ] Deduced a trap composed of 156 places in 120 ms of which 2 ms to minimize.
[2024-05-28 14:19:21] [INFO ] Deduced a trap composed of 174 places in 137 ms of which 2 ms to minimize.
[2024-05-28 14:19:21] [INFO ] Deduced a trap composed of 143 places in 137 ms of which 2 ms to minimize.
[2024-05-28 14:19:21] [INFO ] Deduced a trap composed of 189 places in 170 ms of which 2 ms to minimize.
[2024-05-28 14:19:22] [INFO ] Deduced a trap composed of 161 places in 146 ms of which 2 ms to minimize.
[2024-05-28 14:19:22] [INFO ] Deduced a trap composed of 141 places in 142 ms of which 2 ms to minimize.
[2024-05-28 14:19:22] [INFO ] Deduced a trap composed of 148 places in 160 ms of which 2 ms to minimize.
[2024-05-28 14:19:22] [INFO ] Deduced a trap composed of 158 places in 146 ms of which 2 ms to minimize.
[2024-05-28 14:19:22] [INFO ] Deduced a trap composed of 143 places in 146 ms of which 2 ms to minimize.
[2024-05-28 14:19:23] [INFO ] Deduced a trap composed of 48 places in 60 ms of which 1 ms to minimize.
[2024-05-28 14:19:24] [INFO ] Deduced a trap composed of 228 places in 215 ms of which 2 ms to minimize.
[2024-05-28 14:19:27] [INFO ] Deduced a trap composed of 63 places in 80 ms of which 1 ms to minimize.
[2024-05-28 14:19:28] [INFO ] Deduced a trap composed of 113 places in 126 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/382 variables, 18/64 constraints. Problems are: Problem set: 0 solved, 816 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/382 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 816 unsolved
SMT process timed out in 20857ms, After SMT, problems are : Problem set: 0 solved, 816 unsolved
Search for dead transitions found 0 dead transitions in 20864ms
[2024-05-28 14:19:36] [INFO ] Flow matrix only has 806 transitions (discarded 12 similar events)
[2024-05-28 14:19:36] [INFO ] Invariant cache hit.
[2024-05-28 14:19:37] [INFO ] Implicit Places using invariants in 406 ms returned [348, 349, 350, 351, 352, 353]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 420 ms to find 6 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 378/536 places, 818/968 transitions.
Applied a total of 0 rules in 10 ms. Remains 378 /378 variables (removed 0) and now considering 818/818 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 21350 ms. Remains : 378/536 places, 818/968 transitions.
[2024-05-28 14:19:37] [INFO ] Flatten gal took : 19 ms
[2024-05-28 14:19:37] [INFO ] Flatten gal took : 21 ms
[2024-05-28 14:19:37] [INFO ] Input system was already deterministic with 818 transitions.
[2024-05-28 14:19:37] [INFO ] Flatten gal took : 21 ms
[2024-05-28 14:19:37] [INFO ] Flatten gal took : 22 ms
[2024-05-28 14:19:37] [INFO ] Time to serialize gal into /tmp/CTLFireability13836319537838056940.gal : 4 ms
[2024-05-28 14:19:37] [INFO ] Time to serialize properties into /tmp/CTLFireability5950293074795652339.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13836319537838056940.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5950293074795652339.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-28 14:20:07] [INFO ] Flatten gal took : 41 ms
[2024-05-28 14:20:07] [INFO ] Applying decomposition
[2024-05-28 14:20:07] [INFO ] Flatten gal took : 34 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph3116864719133772702.txt' '-o' '/tmp/graph3116864719133772702.bin' '-w' '/tmp/graph3116864719133772702.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3116864719133772702.bin' '-l' '-1' '-v' '-w' '/tmp/graph3116864719133772702.weights' '-q' '0' '-e' '0.001'
[2024-05-28 14:20:07] [INFO ] Decomposing Gal with order
[2024-05-28 14:20:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 14:20:07] [INFO ] Removed a total of 481 redundant transitions.
[2024-05-28 14:20:07] [INFO ] Flatten gal took : 81 ms
[2024-05-28 14:20:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 571 labels/synchronizations in 12 ms.
[2024-05-28 14:20:07] [INFO ] Time to serialize gal into /tmp/CTLFireability1545381785220638337.gal : 9 ms
[2024-05-28 14:20:07] [INFO ] Time to serialize properties into /tmp/CTLFireability7633493817484666013.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1545381785220638337.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7633493817484666013.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 536/536 places, 968/968 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 534 transition count 968
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 8 place count 528 transition count 962
Iterating global reduction 1 with 6 rules applied. Total rules applied 14 place count 528 transition count 962
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 20 place count 522 transition count 956
Iterating global reduction 1 with 6 rules applied. Total rules applied 26 place count 522 transition count 956
Applied a total of 26 rules in 18 ms. Remains 522 /536 variables (removed 14) and now considering 956/968 (removed 12) transitions.
Running 954 sub problems to find dead transitions.
[2024-05-28 14:20:38] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
// Phase 1: matrix 944 rows 522 cols
[2024-05-28 14:20:38] [INFO ] Computed 48 invariants in 25 ms
[2024-05-28 14:20:38] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/520 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/520 variables, 31/46 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-05-28 14:20:45] [INFO ] Deduced a trap composed of 71 places in 57 ms of which 2 ms to minimize.
[2024-05-28 14:20:45] [INFO ] Deduced a trap composed of 71 places in 44 ms of which 1 ms to minimize.
[2024-05-28 14:20:45] [INFO ] Deduced a trap composed of 71 places in 55 ms of which 1 ms to minimize.
[2024-05-28 14:20:45] [INFO ] Deduced a trap composed of 71 places in 53 ms of which 0 ms to minimize.
[2024-05-28 14:20:45] [INFO ] Deduced a trap composed of 71 places in 52 ms of which 1 ms to minimize.
[2024-05-28 14:20:45] [INFO ] Deduced a trap composed of 292 places in 189 ms of which 2 ms to minimize.
[2024-05-28 14:20:46] [INFO ] Deduced a trap composed of 304 places in 189 ms of which 2 ms to minimize.
[2024-05-28 14:20:46] [INFO ] Deduced a trap composed of 281 places in 189 ms of which 3 ms to minimize.
[2024-05-28 14:20:46] [INFO ] Deduced a trap composed of 240 places in 183 ms of which 2 ms to minimize.
[2024-05-28 14:20:46] [INFO ] Deduced a trap composed of 124 places in 168 ms of which 2 ms to minimize.
[2024-05-28 14:20:46] [INFO ] Deduced a trap composed of 71 places in 53 ms of which 1 ms to minimize.
[2024-05-28 14:20:47] [INFO ] Deduced a trap composed of 281 places in 206 ms of which 3 ms to minimize.
[2024-05-28 14:20:47] [INFO ] Deduced a trap composed of 243 places in 207 ms of which 3 ms to minimize.
[2024-05-28 14:20:55] [INFO ] Deduced a trap composed of 221 places in 182 ms of which 3 ms to minimize.
[2024-05-28 14:20:56] [INFO ] Deduced a trap composed of 214 places in 202 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/520 variables, 15/61 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 520/1466 variables, and 61 constraints, problems are : Problem set: 0 solved, 954 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 31/32 constraints, State Equation: 0/522 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 954/954 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 954 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/520 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/520 variables, 31/46 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/520 variables, 15/61 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-05-28 14:21:00] [INFO ] Deduced a trap composed of 290 places in 202 ms of which 3 ms to minimize.
[2024-05-28 14:21:03] [INFO ] Deduced a trap composed of 15 places in 102 ms of which 2 ms to minimize.
[2024-05-28 14:21:07] [INFO ] Deduced a trap composed of 270 places in 195 ms of which 2 ms to minimize.
[2024-05-28 14:21:07] [INFO ] Deduced a trap composed of 274 places in 192 ms of which 3 ms to minimize.
[2024-05-28 14:21:08] [INFO ] Deduced a trap composed of 62 places in 194 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/520 variables, 5/66 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-05-28 14:21:16] [INFO ] Deduced a trap composed of 259 places in 206 ms of which 3 ms to minimize.
[2024-05-28 14:21:16] [INFO ] Deduced a trap composed of 358 places in 183 ms of which 3 ms to minimize.
[2024-05-28 14:21:16] [INFO ] Deduced a trap composed of 323 places in 193 ms of which 3 ms to minimize.
[2024-05-28 14:21:16] [INFO ] Deduced a trap composed of 274 places in 184 ms of which 2 ms to minimize.
[2024-05-28 14:21:16] [INFO ] Deduced a trap composed of 37 places in 120 ms of which 2 ms to minimize.
[2024-05-28 14:21:16] [INFO ] Deduced a trap composed of 313 places in 179 ms of which 3 ms to minimize.
[2024-05-28 14:21:17] [INFO ] Deduced a trap composed of 278 places in 179 ms of which 2 ms to minimize.
[2024-05-28 14:21:17] [INFO ] Deduced a trap composed of 359 places in 179 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 520/1466 variables, and 74 constraints, problems are : Problem set: 0 solved, 954 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 31/32 constraints, State Equation: 0/522 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/954 constraints, Known Traps: 28/28 constraints]
After SMT, in 40930ms problems are : Problem set: 0 solved, 954 unsolved
Search for dead transitions found 0 dead transitions in 40953ms
[2024-05-28 14:21:19] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
[2024-05-28 14:21:19] [INFO ] Invariant cache hit.
[2024-05-28 14:21:19] [INFO ] Implicit Places using invariants in 254 ms returned [414, 415, 416, 417, 418, 419]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 256 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 516/536 places, 956/968 transitions.
Applied a total of 0 rules in 4 ms. Remains 516 /516 variables (removed 0) and now considering 956/956 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 41234 ms. Remains : 516/536 places, 956/968 transitions.
[2024-05-28 14:21:19] [INFO ] Flatten gal took : 23 ms
[2024-05-28 14:21:19] [INFO ] Flatten gal took : 25 ms
[2024-05-28 14:21:19] [INFO ] Input system was already deterministic with 956 transitions.
[2024-05-28 14:21:19] [INFO ] Flatten gal took : 23 ms
[2024-05-28 14:21:19] [INFO ] Flatten gal took : 24 ms
[2024-05-28 14:21:19] [INFO ] Time to serialize gal into /tmp/CTLFireability14217928139555951051.gal : 17 ms
[2024-05-28 14:21:19] [INFO ] Time to serialize properties into /tmp/CTLFireability14294593996118264806.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14217928139555951051.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14294593996118264806.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-28 14:21:49] [INFO ] Flatten gal took : 24 ms
[2024-05-28 14:21:49] [INFO ] Applying decomposition
[2024-05-28 14:21:49] [INFO ] Flatten gal took : 24 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph13972840746220059851.txt' '-o' '/tmp/graph13972840746220059851.bin' '-w' '/tmp/graph13972840746220059851.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13972840746220059851.bin' '-l' '-1' '-v' '-w' '/tmp/graph13972840746220059851.weights' '-q' '0' '-e' '0.001'
[2024-05-28 14:21:49] [INFO ] Decomposing Gal with order
[2024-05-28 14:21:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 14:21:49] [INFO ] Removed a total of 830 redundant transitions.
[2024-05-28 14:21:49] [INFO ] Flatten gal took : 150 ms
[2024-05-28 14:21:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 125 labels/synchronizations in 19 ms.
[2024-05-28 14:21:49] [INFO ] Time to serialize gal into /tmp/CTLFireability14734363294955334391.gal : 31 ms
[2024-05-28 14:21:49] [INFO ] Time to serialize properties into /tmp/CTLFireability11533249217028887049.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14734363294955334391.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11533249217028887049.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 536/536 places, 968/968 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 536 transition count 950
Reduce places removed 18 places and 0 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Iterating post reduction 1 with 30 rules applied. Total rules applied 48 place count 518 transition count 938
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 60 place count 506 transition count 938
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 60 Pre rules applied. Total rules applied 60 place count 506 transition count 878
Deduced a syphon composed of 60 places in 0 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 3 with 120 rules applied. Total rules applied 180 place count 446 transition count 878
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 228 place count 422 transition count 854
Applied a total of 228 rules in 44 ms. Remains 422 /536 variables (removed 114) and now considering 854/968 (removed 114) transitions.
Running 852 sub problems to find dead transitions.
[2024-05-28 14:22:20] [INFO ] Flow matrix only has 842 transitions (discarded 12 similar events)
// Phase 1: matrix 842 rows 422 cols
[2024-05-28 14:22:20] [INFO ] Computed 50 invariants in 10 ms
[2024-05-28 14:22:20] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/418 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 852 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/418 variables, 31/46 constraints. Problems are: Problem set: 0 solved, 852 unsolved
[2024-05-28 14:22:25] [INFO ] Deduced a trap composed of 54 places in 83 ms of which 1 ms to minimize.
[2024-05-28 14:22:25] [INFO ] Deduced a trap composed of 54 places in 93 ms of which 2 ms to minimize.
[2024-05-28 14:22:25] [INFO ] Deduced a trap composed of 54 places in 67 ms of which 1 ms to minimize.
[2024-05-28 14:22:25] [INFO ] Deduced a trap composed of 54 places in 58 ms of which 0 ms to minimize.
[2024-05-28 14:22:25] [INFO ] Deduced a trap composed of 54 places in 44 ms of which 1 ms to minimize.
[2024-05-28 14:22:25] [INFO ] Deduced a trap composed of 167 places in 156 ms of which 3 ms to minimize.
[2024-05-28 14:22:26] [INFO ] Deduced a trap composed of 174 places in 175 ms of which 2 ms to minimize.
[2024-05-28 14:22:26] [INFO ] Deduced a trap composed of 191 places in 158 ms of which 3 ms to minimize.
[2024-05-28 14:22:26] [INFO ] Deduced a trap composed of 169 places in 154 ms of which 2 ms to minimize.
[2024-05-28 14:22:26] [INFO ] Deduced a trap composed of 161 places in 156 ms of which 2 ms to minimize.
[2024-05-28 14:22:26] [INFO ] Deduced a trap composed of 54 places in 34 ms of which 1 ms to minimize.
[2024-05-28 14:22:27] [INFO ] Deduced a trap composed of 57 places in 93 ms of which 2 ms to minimize.
[2024-05-28 14:22:30] [INFO ] Deduced a trap composed of 228 places in 174 ms of which 2 ms to minimize.
[2024-05-28 14:22:31] [INFO ] Deduced a trap composed of 103 places in 137 ms of which 2 ms to minimize.
[2024-05-28 14:22:31] [INFO ] Deduced a trap composed of 37 places in 120 ms of which 1 ms to minimize.
[2024-05-28 14:22:33] [INFO ] Deduced a trap composed of 170 places in 136 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/418 variables, 16/62 constraints. Problems are: Problem set: 0 solved, 852 unsolved
[2024-05-28 14:22:34] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 1 ms to minimize.
[2024-05-28 14:22:37] [INFO ] Deduced a trap composed of 206 places in 163 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/418 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 852 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 418/1264 variables, and 64 constraints, problems are : Problem set: 0 solved, 852 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 15/17 constraints, Generalized P Invariants (flows): 31/33 constraints, State Equation: 0/422 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 852/852 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 852 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/418 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 852 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/418 variables, 31/46 constraints. Problems are: Problem set: 0 solved, 852 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/418 variables, 18/64 constraints. Problems are: Problem set: 0 solved, 852 unsolved
[2024-05-28 14:22:43] [INFO ] Deduced a trap composed of 272 places in 158 ms of which 2 ms to minimize.
[2024-05-28 14:22:48] [INFO ] Deduced a trap composed of 162 places in 138 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/418 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 852 unsolved
[2024-05-28 14:22:49] [INFO ] Deduced a trap composed of 229 places in 143 ms of which 2 ms to minimize.
[2024-05-28 14:22:49] [INFO ] Deduced a trap composed of 208 places in 152 ms of which 2 ms to minimize.
[2024-05-28 14:22:49] [INFO ] Deduced a trap composed of 245 places in 149 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/418 variables, 3/69 constraints. Problems are: Problem set: 0 solved, 852 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 418/1264 variables, and 69 constraints, problems are : Problem set: 0 solved, 852 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 15/17 constraints, Generalized P Invariants (flows): 31/33 constraints, State Equation: 0/422 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/852 constraints, Known Traps: 23/23 constraints]
After SMT, in 40895ms problems are : Problem set: 0 solved, 852 unsolved
Search for dead transitions found 0 dead transitions in 40904ms
[2024-05-28 14:23:00] [INFO ] Flow matrix only has 842 transitions (discarded 12 similar events)
[2024-05-28 14:23:00] [INFO ] Invariant cache hit.
[2024-05-28 14:23:01] [INFO ] Implicit Places using invariants in 258 ms returned [374, 375, 376, 377, 378, 379]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 260 ms to find 6 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 416/536 places, 854/968 transitions.
Applied a total of 0 rules in 22 ms. Remains 416 /416 variables (removed 0) and now considering 854/854 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 41232 ms. Remains : 416/536 places, 854/968 transitions.
[2024-05-28 14:23:01] [INFO ] Flatten gal took : 22 ms
[2024-05-28 14:23:01] [INFO ] Flatten gal took : 23 ms
[2024-05-28 14:23:01] [INFO ] Input system was already deterministic with 854 transitions.
[2024-05-28 14:23:01] [INFO ] Flatten gal took : 23 ms
[2024-05-28 14:23:01] [INFO ] Flatten gal took : 23 ms
[2024-05-28 14:23:01] [INFO ] Time to serialize gal into /tmp/CTLFireability14237251921509900175.gal : 4 ms
[2024-05-28 14:23:01] [INFO ] Time to serialize properties into /tmp/CTLFireability13154476432547127933.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14237251921509900175.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13154476432547127933.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-28 14:23:31] [INFO ] Flatten gal took : 50 ms
[2024-05-28 14:23:31] [INFO ] Applying decomposition
[2024-05-28 14:23:31] [INFO ] Flatten gal took : 39 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph12383960178240589427.txt' '-o' '/tmp/graph12383960178240589427.bin' '-w' '/tmp/graph12383960178240589427.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12383960178240589427.bin' '-l' '-1' '-v' '-w' '/tmp/graph12383960178240589427.weights' '-q' '0' '-e' '0.001'
[2024-05-28 14:23:31] [INFO ] Decomposing Gal with order
[2024-05-28 14:23:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 14:23:31] [INFO ] Removed a total of 549 redundant transitions.
[2024-05-28 14:23:31] [INFO ] Flatten gal took : 117 ms
[2024-05-28 14:23:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 504 labels/synchronizations in 27 ms.
[2024-05-28 14:23:31] [INFO ] Time to serialize gal into /tmp/CTLFireability13740597249103543487.gal : 12 ms
[2024-05-28 14:23:31] [INFO ] Time to serialize properties into /tmp/CTLFireability3713494321472841127.ctl : 11 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13740597249103543487.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3713494321472841127.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 536/536 places, 968/968 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 534 transition count 968
Applied a total of 2 rules in 8 ms. Remains 534 /536 variables (removed 2) and now considering 968/968 (removed 0) transitions.
Running 966 sub problems to find dead transitions.
[2024-05-28 14:24:01] [INFO ] Flow matrix only has 956 transitions (discarded 12 similar events)
// Phase 1: matrix 956 rows 534 cols
[2024-05-28 14:24:02] [INFO ] Computed 48 invariants in 10 ms
[2024-05-28 14:24:02] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/532 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 966 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/532 variables, 32/46 constraints. Problems are: Problem set: 0 solved, 966 unsolved
[2024-05-28 14:24:09] [INFO ] Deduced a trap composed of 74 places in 45 ms of which 1 ms to minimize.
[2024-05-28 14:24:09] [INFO ] Deduced a trap composed of 74 places in 44 ms of which 1 ms to minimize.
[2024-05-28 14:24:09] [INFO ] Deduced a trap composed of 73 places in 53 ms of which 1 ms to minimize.
[2024-05-28 14:24:09] [INFO ] Deduced a trap composed of 74 places in 44 ms of which 0 ms to minimize.
[2024-05-28 14:24:09] [INFO ] Deduced a trap composed of 74 places in 64 ms of which 1 ms to minimize.
[2024-05-28 14:24:09] [INFO ] Deduced a trap composed of 255 places in 210 ms of which 3 ms to minimize.
[2024-05-28 14:24:10] [INFO ] Deduced a trap composed of 148 places in 160 ms of which 3 ms to minimize.
[2024-05-28 14:24:10] [INFO ] Deduced a trap composed of 146 places in 165 ms of which 3 ms to minimize.
[2024-05-28 14:24:10] [INFO ] Deduced a trap composed of 74 places in 60 ms of which 1 ms to minimize.
[2024-05-28 14:24:10] [INFO ] Deduced a trap composed of 311 places in 183 ms of which 3 ms to minimize.
[2024-05-28 14:24:11] [INFO ] Deduced a trap composed of 286 places in 194 ms of which 3 ms to minimize.
[2024-05-28 14:24:11] [INFO ] Deduced a trap composed of 288 places in 184 ms of which 3 ms to minimize.
[2024-05-28 14:24:11] [INFO ] Deduced a trap composed of 292 places in 199 ms of which 3 ms to minimize.
[2024-05-28 14:24:11] [INFO ] Deduced a trap composed of 310 places in 208 ms of which 2 ms to minimize.
[2024-05-28 14:24:12] [INFO ] Deduced a trap composed of 15 places in 199 ms of which 3 ms to minimize.
[2024-05-28 14:24:12] [INFO ] Deduced a trap composed of 276 places in 191 ms of which 3 ms to minimize.
[2024-05-28 14:24:12] [INFO ] Deduced a trap composed of 274 places in 217 ms of which 3 ms to minimize.
[2024-05-28 14:24:12] [INFO ] Deduced a trap composed of 290 places in 197 ms of which 3 ms to minimize.
[2024-05-28 14:24:12] [INFO ] Deduced a trap composed of 281 places in 220 ms of which 2 ms to minimize.
[2024-05-28 14:24:19] [INFO ] Deduced a trap composed of 280 places in 217 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/532 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 966 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 532/1490 variables, and 66 constraints, problems are : Problem set: 0 solved, 966 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 32/33 constraints, State Equation: 0/534 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 966/966 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 966 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/532 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 966 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/532 variables, 32/46 constraints. Problems are: Problem set: 0 solved, 966 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/532 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 966 unsolved
[2024-05-28 14:24:31] [INFO ] Deduced a trap composed of 275 places in 160 ms of which 3 ms to minimize.
[2024-05-28 14:24:31] [INFO ] Deduced a trap composed of 275 places in 181 ms of which 2 ms to minimize.
[2024-05-28 14:24:31] [INFO ] Deduced a trap composed of 302 places in 187 ms of which 2 ms to minimize.
[2024-05-28 14:24:31] [INFO ] Deduced a trap composed of 284 places in 182 ms of which 3 ms to minimize.
[2024-05-28 14:24:31] [INFO ] Deduced a trap composed of 247 places in 175 ms of which 3 ms to minimize.
[2024-05-28 14:24:32] [INFO ] Deduced a trap composed of 42 places in 183 ms of which 3 ms to minimize.
[2024-05-28 14:24:32] [INFO ] Deduced a trap composed of 282 places in 199 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/532 variables, 7/73 constraints. Problems are: Problem set: 0 solved, 966 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 532/1490 variables, and 73 constraints, problems are : Problem set: 0 solved, 966 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 32/33 constraints, State Equation: 0/534 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/966 constraints, Known Traps: 27/27 constraints]
After SMT, in 40919ms problems are : Problem set: 0 solved, 966 unsolved
Search for dead transitions found 0 dead transitions in 40933ms
[2024-05-28 14:24:42] [INFO ] Flow matrix only has 956 transitions (discarded 12 similar events)
[2024-05-28 14:24:42] [INFO ] Invariant cache hit.
[2024-05-28 14:24:43] [INFO ] Implicit Places using invariants in 254 ms returned []
[2024-05-28 14:24:43] [INFO ] Flow matrix only has 956 transitions (discarded 12 similar events)
[2024-05-28 14:24:43] [INFO ] Invariant cache hit.
[2024-05-28 14:24:43] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 14:24:47] [INFO ] Implicit Places using invariants and state equation in 4318 ms returned []
Implicit Place search using SMT with State Equation took 4609 ms to find 0 implicit places.
Running 966 sub problems to find dead transitions.
[2024-05-28 14:24:47] [INFO ] Flow matrix only has 956 transitions (discarded 12 similar events)
[2024-05-28 14:24:47] [INFO ] Invariant cache hit.
[2024-05-28 14:24:47] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/532 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 966 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/532 variables, 32/46 constraints. Problems are: Problem set: 0 solved, 966 unsolved
[2024-05-28 14:24:55] [INFO ] Deduced a trap composed of 74 places in 43 ms of which 1 ms to minimize.
[2024-05-28 14:24:55] [INFO ] Deduced a trap composed of 74 places in 50 ms of which 0 ms to minimize.
[2024-05-28 14:24:55] [INFO ] Deduced a trap composed of 73 places in 51 ms of which 0 ms to minimize.
[2024-05-28 14:24:55] [INFO ] Deduced a trap composed of 74 places in 62 ms of which 1 ms to minimize.
[2024-05-28 14:24:55] [INFO ] Deduced a trap composed of 74 places in 47 ms of which 0 ms to minimize.
[2024-05-28 14:24:55] [INFO ] Deduced a trap composed of 284 places in 169 ms of which 3 ms to minimize.
[2024-05-28 14:24:55] [INFO ] Deduced a trap composed of 138 places in 183 ms of which 3 ms to minimize.
[2024-05-28 14:24:56] [INFO ] Deduced a trap composed of 136 places in 162 ms of which 2 ms to minimize.
[2024-05-28 14:24:56] [INFO ] Deduced a trap composed of 292 places in 190 ms of which 3 ms to minimize.
[2024-05-28 14:24:56] [INFO ] Deduced a trap composed of 306 places in 180 ms of which 3 ms to minimize.
[2024-05-28 14:24:57] [INFO ] Deduced a trap composed of 289 places in 193 ms of which 3 ms to minimize.
[2024-05-28 14:24:58] [INFO ] Deduced a trap composed of 73 places in 45 ms of which 1 ms to minimize.
[2024-05-28 14:25:02] [INFO ] Deduced a trap composed of 274 places in 192 ms of which 3 ms to minimize.
[2024-05-28 14:25:03] [INFO ] Deduced a trap composed of 248 places in 180 ms of which 3 ms to minimize.
[2024-05-28 14:25:03] [INFO ] Deduced a trap composed of 37 places in 101 ms of which 2 ms to minimize.
[2024-05-28 14:25:03] [INFO ] Deduced a trap composed of 42 places in 190 ms of which 3 ms to minimize.
[2024-05-28 14:25:04] [INFO ] Deduced a trap composed of 284 places in 165 ms of which 2 ms to minimize.
[2024-05-28 14:25:04] [INFO ] Deduced a trap composed of 296 places in 194 ms of which 3 ms to minimize.
[2024-05-28 14:25:04] [INFO ] Deduced a trap composed of 270 places in 211 ms of which 3 ms to minimize.
[2024-05-28 14:25:05] [INFO ] Deduced a trap composed of 3 places in 203 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/532 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 966 unsolved
[2024-05-28 14:25:06] [INFO ] Deduced a trap composed of 226 places in 211 ms of which 3 ms to minimize.
[2024-05-28 14:25:12] [INFO ] Deduced a trap composed of 242 places in 163 ms of which 3 ms to minimize.
[2024-05-28 14:25:14] [INFO ] Deduced a trap composed of 91 places in 104 ms of which 2 ms to minimize.
[2024-05-28 14:25:14] [INFO ] Deduced a trap composed of 42 places in 100 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/532 variables, 4/70 constraints. Problems are: Problem set: 0 solved, 966 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 532/1490 variables, and 70 constraints, problems are : Problem set: 0 solved, 966 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 32/33 constraints, State Equation: 0/534 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 966/966 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 966 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/532 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 966 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/532 variables, 32/46 constraints. Problems are: Problem set: 0 solved, 966 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/532 variables, 24/70 constraints. Problems are: Problem set: 0 solved, 966 unsolved
[2024-05-28 14:25:19] [INFO ] Deduced a trap composed of 290 places in 197 ms of which 3 ms to minimize.
[2024-05-28 14:25:20] [INFO ] Deduced a trap composed of 289 places in 199 ms of which 3 ms to minimize.
[2024-05-28 14:25:24] [INFO ] Deduced a trap composed of 269 places in 163 ms of which 3 ms to minimize.
[2024-05-28 14:25:24] [INFO ] Deduced a trap composed of 296 places in 173 ms of which 3 ms to minimize.
[2024-05-28 14:25:24] [INFO ] Deduced a trap composed of 370 places in 172 ms of which 3 ms to minimize.
[2024-05-28 14:25:24] [INFO ] Deduced a trap composed of 362 places in 172 ms of which 3 ms to minimize.
[2024-05-28 14:25:27] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/532 variables, 7/77 constraints. Problems are: Problem set: 0 solved, 966 unsolved
[2024-05-28 14:25:45] [INFO ] Deduced a trap composed of 281 places in 155 ms of which 3 ms to minimize.
[2024-05-28 14:25:46] [INFO ] Deduced a trap composed of 247 places in 179 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 532/1490 variables, and 79 constraints, problems are : Problem set: 0 solved, 966 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 32/33 constraints, State Equation: 0/534 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/966 constraints, Known Traps: 33/33 constraints]
After SMT, in 60940ms problems are : Problem set: 0 solved, 966 unsolved
Search for dead transitions found 0 dead transitions in 60949ms
Starting structural reductions in LTL mode, iteration 1 : 534/536 places, 968/968 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 106504 ms. Remains : 534/536 places, 968/968 transitions.
[2024-05-28 14:25:48] [INFO ] Flatten gal took : 23 ms
[2024-05-28 14:25:48] [INFO ] Flatten gal took : 32 ms
[2024-05-28 14:25:48] [INFO ] Input system was already deterministic with 968 transitions.
[2024-05-28 14:25:48] [INFO ] Flatten gal took : 26 ms
[2024-05-28 14:25:48] [INFO ] Flatten gal took : 26 ms
[2024-05-28 14:25:48] [INFO ] Time to serialize gal into /tmp/CTLFireability3732822470140607496.gal : 4 ms
[2024-05-28 14:25:48] [INFO ] Time to serialize properties into /tmp/CTLFireability10021536990019449249.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3732822470140607496.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10021536990019449249.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-28 14:26:18] [INFO ] Flatten gal took : 55 ms
[2024-05-28 14:26:18] [INFO ] Applying decomposition
[2024-05-28 14:26:18] [INFO ] Flatten gal took : 43 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph6933104234798505603.txt' '-o' '/tmp/graph6933104234798505603.bin' '-w' '/tmp/graph6933104234798505603.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6933104234798505603.bin' '-l' '-1' '-v' '-w' '/tmp/graph6933104234798505603.weights' '-q' '0' '-e' '0.001'
[2024-05-28 14:26:18] [INFO ] Decomposing Gal with order
[2024-05-28 14:26:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 14:26:18] [INFO ] Removed a total of 698 redundant transitions.
[2024-05-28 14:26:19] [INFO ] Flatten gal took : 74 ms
[2024-05-28 14:26:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 174 labels/synchronizations in 13 ms.
[2024-05-28 14:26:19] [INFO ] Time to serialize gal into /tmp/CTLFireability6502177592013969709.gal : 8 ms
[2024-05-28 14:26:19] [INFO ] Time to serialize properties into /tmp/CTLFireability14628186570235903668.ctl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6502177592013969709.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14628186570235903668.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 536/536 places, 968/968 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 48 place count 536 transition count 920
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 96 place count 488 transition count 920
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 60 Pre rules applied. Total rules applied 96 place count 488 transition count 860
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 216 place count 428 transition count 860
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 276 place count 398 transition count 830
Applied a total of 276 rules in 23 ms. Remains 398 /536 variables (removed 138) and now considering 830/968 (removed 138) transitions.
Running 828 sub problems to find dead transitions.
[2024-05-28 14:26:49] [INFO ] Flow matrix only has 818 transitions (discarded 12 similar events)
// Phase 1: matrix 818 rows 398 cols
[2024-05-28 14:26:49] [INFO ] Computed 50 invariants in 10 ms
[2024-05-28 14:26:49] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/394 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 828 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/394 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 828 unsolved
[2024-05-28 14:26:53] [INFO ] Deduced a trap composed of 50 places in 109 ms of which 1 ms to minimize.
[2024-05-28 14:26:54] [INFO ] Deduced a trap composed of 50 places in 68 ms of which 1 ms to minimize.
[2024-05-28 14:26:54] [INFO ] Deduced a trap composed of 50 places in 47 ms of which 0 ms to minimize.
[2024-05-28 14:26:54] [INFO ] Deduced a trap composed of 50 places in 51 ms of which 0 ms to minimize.
[2024-05-28 14:26:54] [INFO ] Deduced a trap composed of 50 places in 40 ms of which 0 ms to minimize.
[2024-05-28 14:26:54] [INFO ] Deduced a trap composed of 113 places in 174 ms of which 2 ms to minimize.
[2024-05-28 14:26:54] [INFO ] Deduced a trap composed of 160 places in 199 ms of which 3 ms to minimize.
[2024-05-28 14:26:55] [INFO ] Deduced a trap composed of 50 places in 67 ms of which 1 ms to minimize.
[2024-05-28 14:26:56] [INFO ] Deduced a trap composed of 240 places in 199 ms of which 3 ms to minimize.
[2024-05-28 14:26:58] [INFO ] Deduced a trap composed of 183 places in 143 ms of which 3 ms to minimize.
[2024-05-28 14:26:59] [INFO ] Deduced a trap composed of 83 places in 118 ms of which 2 ms to minimize.
[2024-05-28 14:27:01] [INFO ] Deduced a trap composed of 144 places in 229 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/394 variables, 12/58 constraints. Problems are: Problem set: 0 solved, 828 unsolved
[2024-05-28 14:27:05] [INFO ] Deduced a trap composed of 146 places in 167 ms of which 2 ms to minimize.
[2024-05-28 14:27:07] [INFO ] Deduced a trap composed of 155 places in 128 ms of which 2 ms to minimize.
[2024-05-28 14:27:07] [INFO ] Deduced a trap composed of 140 places in 150 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/394 variables, 3/61 constraints. Problems are: Problem set: 0 solved, 828 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 394/1216 variables, and 61 constraints, problems are : Problem set: 0 solved, 828 unsolved in 20049 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 33/35 constraints, State Equation: 0/398 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 828/828 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 828 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/394 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 828 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/394 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 828 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/394 variables, 15/61 constraints. Problems are: Problem set: 0 solved, 828 unsolved
[2024-05-28 14:27:11] [INFO ] Deduced a trap composed of 15 places in 89 ms of which 2 ms to minimize.
[2024-05-28 14:27:14] [INFO ] Deduced a trap composed of 57 places in 83 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/394 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 828 unsolved
[2024-05-28 14:27:22] [INFO ] Deduced a trap composed of 154 places in 152 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/394 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 828 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 394/1216 variables, and 64 constraints, problems are : Problem set: 0 solved, 828 unsolved in 20013 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 33/35 constraints, State Equation: 0/398 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/828 constraints, Known Traps: 18/18 constraints]
After SMT, in 40851ms problems are : Problem set: 0 solved, 828 unsolved
Search for dead transitions found 0 dead transitions in 40858ms
[2024-05-28 14:27:30] [INFO ] Flow matrix only has 818 transitions (discarded 12 similar events)
[2024-05-28 14:27:30] [INFO ] Invariant cache hit.
[2024-05-28 14:27:30] [INFO ] Implicit Places using invariants in 251 ms returned [362, 363, 364, 365, 366, 367]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 266 ms to find 6 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 392/536 places, 830/968 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 386 transition count 824
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 386 transition count 824
Applied a total of 12 rules in 13 ms. Remains 386 /392 variables (removed 6) and now considering 824/830 (removed 6) transitions.
[2024-05-28 14:27:30] [INFO ] Flow matrix only has 812 transitions (discarded 12 similar events)
// Phase 1: matrix 812 rows 386 cols
[2024-05-28 14:27:30] [INFO ] Computed 44 invariants in 9 ms
[2024-05-28 14:27:30] [INFO ] Implicit Places using invariants in 256 ms returned []
[2024-05-28 14:27:30] [INFO ] Flow matrix only has 812 transitions (discarded 12 similar events)
[2024-05-28 14:27:30] [INFO ] Invariant cache hit.
[2024-05-28 14:27:30] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 14:27:32] [INFO ] Implicit Places using invariants and state equation in 2060 ms returned []
Implicit Place search using SMT with State Equation took 2327 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 386/536 places, 824/968 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 43503 ms. Remains : 386/536 places, 824/968 transitions.
[2024-05-28 14:27:32] [INFO ] Flatten gal took : 31 ms
[2024-05-28 14:27:32] [INFO ] Flatten gal took : 30 ms
[2024-05-28 14:27:32] [INFO ] Input system was already deterministic with 824 transitions.
[2024-05-28 14:27:32] [INFO ] Flatten gal took : 24 ms
[2024-05-28 14:27:32] [INFO ] Flatten gal took : 22 ms
[2024-05-28 14:27:32] [INFO ] Time to serialize gal into /tmp/CTLFireability13846979045359539718.gal : 4 ms
[2024-05-28 14:27:32] [INFO ] Time to serialize properties into /tmp/CTLFireability6019585806215702883.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13846979045359539718.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6019585806215702883.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-28 14:28:02] [INFO ] Flatten gal took : 31 ms
[2024-05-28 14:28:02] [INFO ] Applying decomposition
[2024-05-28 14:28:02] [INFO ] Flatten gal took : 22 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph11224435311368739430.txt' '-o' '/tmp/graph11224435311368739430.bin' '-w' '/tmp/graph11224435311368739430.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11224435311368739430.bin' '-l' '-1' '-v' '-w' '/tmp/graph11224435311368739430.weights' '-q' '0' '-e' '0.001'
[2024-05-28 14:28:03] [INFO ] Decomposing Gal with order
[2024-05-28 14:28:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 14:28:03] [INFO ] Removed a total of 534 redundant transitions.
[2024-05-28 14:28:03] [INFO ] Flatten gal took : 53 ms
[2024-05-28 14:28:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 533 labels/synchronizations in 8 ms.
[2024-05-28 14:28:03] [INFO ] Time to serialize gal into /tmp/CTLFireability17852626270944399524.gal : 17 ms
[2024-05-28 14:28:03] [INFO ] Time to serialize properties into /tmp/CTLFireability13517514796078036838.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17852626270944399524.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13517514796078036838.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 536/536 places, 968/968 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 534 transition count 968
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 8 place count 528 transition count 962
Iterating global reduction 1 with 6 rules applied. Total rules applied 14 place count 528 transition count 962
Applied a total of 14 rules in 20 ms. Remains 528 /536 variables (removed 8) and now considering 962/968 (removed 6) transitions.
Running 960 sub problems to find dead transitions.
[2024-05-28 14:28:33] [INFO ] Flow matrix only has 950 transitions (discarded 12 similar events)
// Phase 1: matrix 950 rows 528 cols
[2024-05-28 14:28:33] [INFO ] Computed 48 invariants in 21 ms
[2024-05-28 14:28:33] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/526 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/526 variables, 30/46 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-05-28 14:28:40] [INFO ] Deduced a trap composed of 72 places in 47 ms of which 1 ms to minimize.
[2024-05-28 14:28:40] [INFO ] Deduced a trap composed of 72 places in 74 ms of which 1 ms to minimize.
[2024-05-28 14:28:40] [INFO ] Deduced a trap composed of 72 places in 48 ms of which 1 ms to minimize.
[2024-05-28 14:28:40] [INFO ] Deduced a trap composed of 72 places in 49 ms of which 0 ms to minimize.
[2024-05-28 14:28:40] [INFO ] Deduced a trap composed of 72 places in 54 ms of which 1 ms to minimize.
[2024-05-28 14:28:40] [INFO ] Deduced a trap composed of 261 places in 203 ms of which 3 ms to minimize.
[2024-05-28 14:28:41] [INFO ] Deduced a trap composed of 149 places in 159 ms of which 3 ms to minimize.
[2024-05-28 14:28:41] [INFO ] Deduced a trap composed of 131 places in 159 ms of which 3 ms to minimize.
[2024-05-28 14:28:41] [INFO ] Deduced a trap composed of 72 places in 53 ms of which 0 ms to minimize.
[2024-05-28 14:28:41] [INFO ] Deduced a trap composed of 303 places in 199 ms of which 3 ms to minimize.
[2024-05-28 14:28:42] [INFO ] Deduced a trap composed of 278 places in 209 ms of which 3 ms to minimize.
[2024-05-28 14:28:42] [INFO ] Deduced a trap composed of 282 places in 183 ms of which 3 ms to minimize.
[2024-05-28 14:28:48] [INFO ] Deduced a trap composed of 274 places in 221 ms of which 3 ms to minimize.
[2024-05-28 14:28:48] [INFO ] Deduced a trap composed of 275 places in 211 ms of which 3 ms to minimize.
[2024-05-28 14:28:48] [INFO ] Deduced a trap composed of 247 places in 192 ms of which 3 ms to minimize.
[2024-05-28 14:28:49] [INFO ] Deduced a trap composed of 284 places in 180 ms of which 2 ms to minimize.
[2024-05-28 14:28:49] [INFO ] Deduced a trap composed of 269 places in 200 ms of which 3 ms to minimize.
[2024-05-28 14:28:49] [INFO ] Deduced a trap composed of 290 places in 203 ms of which 3 ms to minimize.
[2024-05-28 14:28:50] [INFO ] Deduced a trap composed of 286 places in 194 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/526 variables, 19/65 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-05-28 14:28:53] [INFO ] Deduced a trap composed of 59 places in 104 ms of which 1 ms to minimize.
[2024-05-28 14:28:53] [INFO ] Deduced a trap composed of 15 places in 101 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 526/1478 variables, and 67 constraints, problems are : Problem set: 0 solved, 960 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 16/17 constraints, Generalized P Invariants (flows): 30/31 constraints, State Equation: 0/528 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 960/960 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 960 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/526 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/526 variables, 30/46 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/526 variables, 21/67 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-05-28 14:29:04] [INFO ] Deduced a trap composed of 287 places in 155 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/526 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-05-28 14:29:12] [INFO ] Deduced a trap composed of 61 places in 117 ms of which 2 ms to minimize.
[2024-05-28 14:29:13] [INFO ] Deduced a trap composed of 63 places in 197 ms of which 3 ms to minimize.
[2024-05-28 14:29:13] [INFO ] Deduced a trap composed of 42 places in 199 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 526/1478 variables, and 71 constraints, problems are : Problem set: 0 solved, 960 unsolved in 20013 ms.
Refiners :[Positive P Invariants (semi-flows): 16/17 constraints, Generalized P Invariants (flows): 30/31 constraints, State Equation: 0/528 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/960 constraints, Known Traps: 25/25 constraints]
After SMT, in 41049ms problems are : Problem set: 0 solved, 960 unsolved
Search for dead transitions found 0 dead transitions in 41057ms
[2024-05-28 14:29:14] [INFO ] Flow matrix only has 950 transitions (discarded 12 similar events)
[2024-05-28 14:29:14] [INFO ] Invariant cache hit.
[2024-05-28 14:29:14] [INFO ] Implicit Places using invariants in 279 ms returned [414, 415, 416, 417, 418, 419]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 302 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 522/536 places, 962/968 transitions.
Applied a total of 0 rules in 5 ms. Remains 522 /522 variables (removed 0) and now considering 962/962 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 41387 ms. Remains : 522/536 places, 962/968 transitions.
[2024-05-28 14:29:14] [INFO ] Flatten gal took : 24 ms
[2024-05-28 14:29:14] [INFO ] Flatten gal took : 25 ms
[2024-05-28 14:29:14] [INFO ] Input system was already deterministic with 962 transitions.
[2024-05-28 14:29:14] [INFO ] Flatten gal took : 25 ms
[2024-05-28 14:29:14] [INFO ] Flatten gal took : 25 ms
[2024-05-28 14:29:14] [INFO ] Time to serialize gal into /tmp/CTLFireability16360569051750696655.gal : 4 ms
[2024-05-28 14:29:14] [INFO ] Time to serialize properties into /tmp/CTLFireability4668490226193705154.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16360569051750696655.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4668490226193705154.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-28 14:29:44] [INFO ] Flatten gal took : 44 ms
[2024-05-28 14:29:44] [INFO ] Applying decomposition
[2024-05-28 14:29:44] [INFO ] Flatten gal took : 37 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph7013269954060620112.txt' '-o' '/tmp/graph7013269954060620112.bin' '-w' '/tmp/graph7013269954060620112.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7013269954060620112.bin' '-l' '-1' '-v' '-w' '/tmp/graph7013269954060620112.weights' '-q' '0' '-e' '0.001'
[2024-05-28 14:29:45] [INFO ] Decomposing Gal with order
[2024-05-28 14:29:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 14:29:45] [INFO ] Removed a total of 738 redundant transitions.
[2024-05-28 14:29:45] [INFO ] Flatten gal took : 78 ms
[2024-05-28 14:29:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 212 labels/synchronizations in 12 ms.
[2024-05-28 14:29:45] [INFO ] Time to serialize gal into /tmp/CTLFireability4066232855925292069.gal : 9 ms
[2024-05-28 14:29:45] [INFO ] Time to serialize properties into /tmp/CTLFireability5335537479120085030.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability4066232855925292069.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5335537479120085030.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 536/536 places, 968/968 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 534 transition count 968
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 8 place count 528 transition count 962
Iterating global reduction 1 with 6 rules applied. Total rules applied 14 place count 528 transition count 962
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 20 place count 522 transition count 956
Iterating global reduction 1 with 6 rules applied. Total rules applied 26 place count 522 transition count 956
Applied a total of 26 rules in 17 ms. Remains 522 /536 variables (removed 14) and now considering 956/968 (removed 12) transitions.
Running 954 sub problems to find dead transitions.
[2024-05-28 14:30:15] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
// Phase 1: matrix 944 rows 522 cols
[2024-05-28 14:30:15] [INFO ] Computed 48 invariants in 14 ms
[2024-05-28 14:30:15] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/520 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/520 variables, 31/46 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-05-28 14:30:22] [INFO ] Deduced a trap composed of 71 places in 67 ms of which 2 ms to minimize.
[2024-05-28 14:30:22] [INFO ] Deduced a trap composed of 71 places in 50 ms of which 0 ms to minimize.
[2024-05-28 14:30:23] [INFO ] Deduced a trap composed of 71 places in 57 ms of which 1 ms to minimize.
[2024-05-28 14:30:23] [INFO ] Deduced a trap composed of 71 places in 54 ms of which 1 ms to minimize.
[2024-05-28 14:30:23] [INFO ] Deduced a trap composed of 71 places in 54 ms of which 0 ms to minimize.
[2024-05-28 14:30:23] [INFO ] Deduced a trap composed of 292 places in 172 ms of which 3 ms to minimize.
[2024-05-28 14:30:23] [INFO ] Deduced a trap composed of 304 places in 181 ms of which 2 ms to minimize.
[2024-05-28 14:30:23] [INFO ] Deduced a trap composed of 281 places in 176 ms of which 3 ms to minimize.
[2024-05-28 14:30:24] [INFO ] Deduced a trap composed of 240 places in 178 ms of which 2 ms to minimize.
[2024-05-28 14:30:24] [INFO ] Deduced a trap composed of 124 places in 151 ms of which 2 ms to minimize.
[2024-05-28 14:30:24] [INFO ] Deduced a trap composed of 71 places in 51 ms of which 0 ms to minimize.
[2024-05-28 14:30:25] [INFO ] Deduced a trap composed of 281 places in 192 ms of which 2 ms to minimize.
[2024-05-28 14:30:25] [INFO ] Deduced a trap composed of 243 places in 197 ms of which 3 ms to minimize.
[2024-05-28 14:30:32] [INFO ] Deduced a trap composed of 221 places in 178 ms of which 2 ms to minimize.
[2024-05-28 14:30:34] [INFO ] Deduced a trap composed of 214 places in 188 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/520 variables, 15/61 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 520/1466 variables, and 61 constraints, problems are : Problem set: 0 solved, 954 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 31/32 constraints, State Equation: 0/522 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 954/954 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 954 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/520 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/520 variables, 31/46 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/520 variables, 15/61 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-05-28 14:30:37] [INFO ] Deduced a trap composed of 290 places in 181 ms of which 3 ms to minimize.
[2024-05-28 14:30:41] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 2 ms to minimize.
[2024-05-28 14:30:44] [INFO ] Deduced a trap composed of 270 places in 183 ms of which 3 ms to minimize.
[2024-05-28 14:30:45] [INFO ] Deduced a trap composed of 274 places in 186 ms of which 2 ms to minimize.
[2024-05-28 14:30:45] [INFO ] Deduced a trap composed of 62 places in 185 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/520 variables, 5/66 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-05-28 14:30:53] [INFO ] Deduced a trap composed of 259 places in 179 ms of which 2 ms to minimize.
[2024-05-28 14:30:53] [INFO ] Deduced a trap composed of 358 places in 182 ms of which 3 ms to minimize.
[2024-05-28 14:30:53] [INFO ] Deduced a trap composed of 323 places in 173 ms of which 2 ms to minimize.
[2024-05-28 14:30:53] [INFO ] Deduced a trap composed of 274 places in 182 ms of which 3 ms to minimize.
[2024-05-28 14:30:53] [INFO ] Deduced a trap composed of 37 places in 142 ms of which 2 ms to minimize.
[2024-05-28 14:30:54] [INFO ] Deduced a trap composed of 313 places in 189 ms of which 3 ms to minimize.
[2024-05-28 14:30:54] [INFO ] Deduced a trap composed of 278 places in 187 ms of which 3 ms to minimize.
[2024-05-28 14:30:54] [INFO ] Deduced a trap composed of 359 places in 229 ms of which 2 ms to minimize.
(s60 0timeout
^^^^^^^^
(error "Invalid token: 0timeout")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 520/1466 variables, and 74 constraints, problems are : Problem set: 0 solved, 954 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 31/32 constraints, State Equation: 0/522 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/954 constraints, Known Traps: 28/28 constraints]
After SMT, in 41239ms problems are : Problem set: 0 solved, 954 unsolved
Search for dead transitions found 0 dead transitions in 41251ms
[2024-05-28 14:30:56] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
[2024-05-28 14:30:56] [INFO ] Invariant cache hit.
[2024-05-28 14:30:56] [INFO ] Implicit Places using invariants in 235 ms returned [414, 415, 416, 417, 418, 419]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 259 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 516/536 places, 956/968 transitions.
Applied a total of 0 rules in 4 ms. Remains 516 /516 variables (removed 0) and now considering 956/956 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 41534 ms. Remains : 516/536 places, 956/968 transitions.
[2024-05-28 14:30:56] [INFO ] Flatten gal took : 21 ms
[2024-05-28 14:30:56] [INFO ] Flatten gal took : 24 ms
[2024-05-28 14:30:56] [INFO ] Input system was already deterministic with 956 transitions.
[2024-05-28 14:30:56] [INFO ] Flatten gal took : 24 ms
[2024-05-28 14:30:56] [INFO ] Flatten gal took : 23 ms
[2024-05-28 14:30:56] [INFO ] Time to serialize gal into /tmp/CTLFireability13642328586184874090.gal : 4 ms
[2024-05-28 14:30:56] [INFO ] Time to serialize properties into /tmp/CTLFireability13792451044831690477.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13642328586184874090.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13792451044831690477.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-28 14:31:27] [INFO ] Flatten gal took : 40 ms
[2024-05-28 14:31:27] [INFO ] Applying decomposition
[2024-05-28 14:31:27] [INFO ] Flatten gal took : 35 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph15161804798521272951.txt' '-o' '/tmp/graph15161804798521272951.bin' '-w' '/tmp/graph15161804798521272951.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15161804798521272951.bin' '-l' '-1' '-v' '-w' '/tmp/graph15161804798521272951.weights' '-q' '0' '-e' '0.001'
[2024-05-28 14:31:27] [INFO ] Decomposing Gal with order
[2024-05-28 14:31:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 14:31:27] [INFO ] Removed a total of 810 redundant transitions.
[2024-05-28 14:31:27] [INFO ] Flatten gal took : 82 ms
[2024-05-28 14:31:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 148 labels/synchronizations in 12 ms.
[2024-05-28 14:31:27] [INFO ] Time to serialize gal into /tmp/CTLFireability6004288176086799556.gal : 7 ms
[2024-05-28 14:31:27] [INFO ] Time to serialize properties into /tmp/CTLFireability9782645671326456738.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6004288176086799556.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9782645671326456738.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 536/536 places, 968/968 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 530 transition count 962
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 530 transition count 962
Applied a total of 12 rules in 20 ms. Remains 530 /536 variables (removed 6) and now considering 962/968 (removed 6) transitions.
Running 960 sub problems to find dead transitions.
[2024-05-28 14:31:57] [INFO ] Flow matrix only has 950 transitions (discarded 12 similar events)
// Phase 1: matrix 950 rows 530 cols
[2024-05-28 14:31:57] [INFO ] Computed 50 invariants in 9 ms
[2024-05-28 14:31:57] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/526 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/526 variables, 31/46 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-05-28 14:32:04] [INFO ] Deduced a trap composed of 72 places in 47 ms of which 0 ms to minimize.
[2024-05-28 14:32:04] [INFO ] Deduced a trap composed of 72 places in 54 ms of which 1 ms to minimize.
[2024-05-28 14:32:04] [INFO ] Deduced a trap composed of 72 places in 53 ms of which 1 ms to minimize.
[2024-05-28 14:32:04] [INFO ] Deduced a trap composed of 72 places in 53 ms of which 0 ms to minimize.
[2024-05-28 14:32:04] [INFO ] Deduced a trap composed of 72 places in 44 ms of which 0 ms to minimize.
[2024-05-28 14:32:05] [INFO ] Deduced a trap composed of 268 places in 176 ms of which 2 ms to minimize.
[2024-05-28 14:32:05] [INFO ] Deduced a trap composed of 293 places in 171 ms of which 3 ms to minimize.
[2024-05-28 14:32:05] [INFO ] Deduced a trap composed of 118 places in 168 ms of which 3 ms to minimize.
[2024-05-28 14:32:05] [INFO ] Deduced a trap composed of 151 places in 169 ms of which 2 ms to minimize.
[2024-05-28 14:32:06] [INFO ] Deduced a trap composed of 133 places in 154 ms of which 2 ms to minimize.
[2024-05-28 14:32:06] [INFO ] Deduced a trap composed of 303 places in 208 ms of which 3 ms to minimize.
[2024-05-28 14:32:06] [INFO ] Deduced a trap composed of 287 places in 196 ms of which 2 ms to minimize.
[2024-05-28 14:32:07] [INFO ] Deduced a trap composed of 305 places in 186 ms of which 2 ms to minimize.
[2024-05-28 14:32:07] [INFO ] Deduced a trap composed of 268 places in 180 ms of which 3 ms to minimize.
[2024-05-28 14:32:07] [INFO ] Deduced a trap composed of 72 places in 192 ms of which 2 ms to minimize.
[2024-05-28 14:32:07] [INFO ] Deduced a trap composed of 293 places in 196 ms of which 2 ms to minimize.
[2024-05-28 14:32:07] [INFO ] Deduced a trap composed of 293 places in 217 ms of which 2 ms to minimize.
[2024-05-28 14:32:08] [INFO ] Deduced a trap composed of 292 places in 196 ms of which 3 ms to minimize.
[2024-05-28 14:32:08] [INFO ] Deduced a trap composed of 273 places in 217 ms of which 3 ms to minimize.
[2024-05-28 14:32:14] [INFO ] Deduced a trap composed of 58 places in 173 ms of which 8 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/526 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-05-28 14:32:15] [INFO ] Deduced a trap composed of 303 places in 191 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 526/1480 variables, and 67 constraints, problems are : Problem set: 0 solved, 960 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 15/17 constraints, Generalized P Invariants (flows): 31/33 constraints, State Equation: 0/530 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 960/960 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 960 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/526 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/526 variables, 31/46 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/526 variables, 21/67 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-05-28 14:32:24] [INFO ] Deduced a trap composed of 361 places in 199 ms of which 2 ms to minimize.
[2024-05-28 14:32:24] [INFO ] Deduced a trap composed of 355 places in 177 ms of which 3 ms to minimize.
[2024-05-28 14:32:24] [INFO ] Deduced a trap composed of 356 places in 178 ms of which 2 ms to minimize.
[2024-05-28 14:32:24] [INFO ] Deduced a trap composed of 365 places in 187 ms of which 2 ms to minimize.
[2024-05-28 14:32:25] [INFO ] Deduced a trap composed of 365 places in 186 ms of which 3 ms to minimize.
[2024-05-28 14:32:25] [INFO ] Deduced a trap composed of 356 places in 180 ms of which 3 ms to minimize.
[2024-05-28 14:32:28] [INFO ] Deduced a trap composed of 274 places in 165 ms of which 3 ms to minimize.
[2024-05-28 14:32:28] [INFO ] Deduced a trap composed of 271 places in 190 ms of which 3 ms to minimize.
[2024-05-28 14:32:28] [INFO ] Deduced a trap composed of 271 places in 185 ms of which 3 ms to minimize.
[2024-05-28 14:32:29] [INFO ] Deduced a trap composed of 285 places in 183 ms of which 3 ms to minimize.
[2024-05-28 14:32:29] [INFO ] Deduced a trap composed of 292 places in 187 ms of which 2 ms to minimize.
[2024-05-28 14:32:29] [INFO ] Deduced a trap composed of 264 places in 172 ms of which 3 ms to minimize.
[2024-05-28 14:32:31] [INFO ] Deduced a trap composed of 304 places in 178 ms of which 2 ms to minimize.
[2024-05-28 14:32:31] [INFO ] Deduced a trap composed of 315 places in 197 ms of which 2 ms to minimize.
[2024-05-28 14:32:31] [INFO ] Deduced a trap composed of 300 places in 167 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/526 variables, 15/82 constraints. Problems are: Problem set: 0 solved, 960 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 526/1480 variables, and 82 constraints, problems are : Problem set: 0 solved, 960 unsolved in 20013 ms.
Refiners :[Positive P Invariants (semi-flows): 15/17 constraints, Generalized P Invariants (flows): 31/33 constraints, State Equation: 0/530 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/960 constraints, Known Traps: 36/36 constraints]
After SMT, in 41016ms problems are : Problem set: 0 solved, 960 unsolved
Search for dead transitions found 0 dead transitions in 41030ms
[2024-05-28 14:32:38] [INFO ] Flow matrix only has 950 transitions (discarded 12 similar events)
[2024-05-28 14:32:38] [INFO ] Invariant cache hit.
[2024-05-28 14:32:38] [INFO ] Implicit Places using invariants in 270 ms returned [416, 417, 418, 419, 420, 421]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 294 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 524/536 places, 962/968 transitions.
Applied a total of 0 rules in 5 ms. Remains 524 /524 variables (removed 0) and now considering 962/962 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 41352 ms. Remains : 524/536 places, 962/968 transitions.
[2024-05-28 14:32:38] [INFO ] Flatten gal took : 23 ms
[2024-05-28 14:32:38] [INFO ] Flatten gal took : 27 ms
[2024-05-28 14:32:38] [INFO ] Input system was already deterministic with 962 transitions.
[2024-05-28 14:32:38] [INFO ] Flatten gal took : 30 ms
[2024-05-28 14:32:38] [INFO ] Flatten gal took : 27 ms
[2024-05-28 14:32:38] [INFO ] Time to serialize gal into /tmp/CTLFireability17738185041386963041.gal : 4 ms
[2024-05-28 14:32:38] [INFO ] Time to serialize properties into /tmp/CTLFireability10595491681174507831.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17738185041386963041.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10595491681174507831.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-28 14:33:08] [INFO ] Flatten gal took : 25 ms
[2024-05-28 14:33:08] [INFO ] Applying decomposition
[2024-05-28 14:33:08] [INFO ] Flatten gal took : 24 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph2174879270701959343.txt' '-o' '/tmp/graph2174879270701959343.bin' '-w' '/tmp/graph2174879270701959343.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2174879270701959343.bin' '-l' '-1' '-v' '-w' '/tmp/graph2174879270701959343.weights' '-q' '0' '-e' '0.001'
[2024-05-28 14:33:09] [INFO ] Decomposing Gal with order
[2024-05-28 14:33:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 14:33:09] [INFO ] Removed a total of 825 redundant transitions.
[2024-05-28 14:33:09] [INFO ] Flatten gal took : 82 ms
[2024-05-28 14:33:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 175 labels/synchronizations in 9 ms.
[2024-05-28 14:33:09] [INFO ] Time to serialize gal into /tmp/CTLFireability1251698185226311160.gal : 7 ms
[2024-05-28 14:33:09] [INFO ] Time to serialize properties into /tmp/CTLFireability15263944969805192192.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1251698185226311160.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15263944969805192192.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 536/536 places, 968/968 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 48 place count 534 transition count 920
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 96 place count 486 transition count 920
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 60 Pre rules applied. Total rules applied 96 place count 486 transition count 860
Deduced a syphon composed of 60 places in 0 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 216 place count 426 transition count 860
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 300 place count 384 transition count 818
Applied a total of 300 rules in 34 ms. Remains 384 /536 variables (removed 152) and now considering 818/968 (removed 150) transitions.
Running 816 sub problems to find dead transitions.
[2024-05-28 14:33:39] [INFO ] Flow matrix only has 806 transitions (discarded 12 similar events)
// Phase 1: matrix 806 rows 384 cols
[2024-05-28 14:33:39] [INFO ] Computed 48 invariants in 9 ms
[2024-05-28 14:33:39] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/382 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 816 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/382 variables, 32/46 constraints. Problems are: Problem set: 0 solved, 816 unsolved
[2024-05-28 14:33:44] [INFO ] Deduced a trap composed of 48 places in 59 ms of which 1 ms to minimize.
[2024-05-28 14:33:44] [INFO ] Deduced a trap composed of 48 places in 40 ms of which 0 ms to minimize.
[2024-05-28 14:33:44] [INFO ] Deduced a trap composed of 48 places in 55 ms of which 0 ms to minimize.
[2024-05-28 14:33:44] [INFO ] Deduced a trap composed of 48 places in 36 ms of which 0 ms to minimize.
[2024-05-28 14:33:44] [INFO ] Deduced a trap composed of 48 places in 48 ms of which 0 ms to minimize.
[2024-05-28 14:33:44] [INFO ] Deduced a trap composed of 146 places in 156 ms of which 2 ms to minimize.
[2024-05-28 14:33:45] [INFO ] Deduced a trap composed of 49 places in 134 ms of which 2 ms to minimize.
[2024-05-28 14:33:45] [INFO ] Deduced a trap composed of 130 places in 187 ms of which 2 ms to minimize.
[2024-05-28 14:33:45] [INFO ] Deduced a trap composed of 145 places in 174 ms of which 2 ms to minimize.
[2024-05-28 14:33:47] [INFO ] Deduced a trap composed of 228 places in 136 ms of which 2 ms to minimize.
[2024-05-28 14:33:48] [INFO ] Deduced a trap composed of 125 places in 181 ms of which 3 ms to minimize.
[2024-05-28 14:33:51] [INFO ] Deduced a trap composed of 119 places in 146 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/382 variables, 12/58 constraints. Problems are: Problem set: 0 solved, 816 unsolved
[2024-05-28 14:33:52] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
[2024-05-28 14:33:55] [INFO ] Deduced a trap composed of 167 places in 135 ms of which 2 ms to minimize.
[2024-05-28 14:33:55] [INFO ] Deduced a trap composed of 168 places in 146 ms of which 2 ms to minimize.
[2024-05-28 14:33:57] [INFO ] Deduced a trap composed of 173 places in 136 ms of which 2 ms to minimize.
[2024-05-28 14:33:58] [INFO ] Deduced a trap composed of 3 places in 222 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/382 variables, 5/63 constraints. Problems are: Problem set: 0 solved, 816 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 382/1190 variables, and 63 constraints, problems are : Problem set: 0 solved, 816 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 32/34 constraints, State Equation: 0/384 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 816/816 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 816 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/382 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 816 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/382 variables, 32/46 constraints. Problems are: Problem set: 0 solved, 816 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/382 variables, 17/63 constraints. Problems are: Problem set: 0 solved, 816 unsolved
[2024-05-28 14:34:09] [INFO ] Deduced a trap composed of 130 places in 132 ms of which 2 ms to minimize.
[2024-05-28 14:34:14] [INFO ] Deduced a trap composed of 25 places in 134 ms of which 2 ms to minimize.
[2024-05-28 14:34:14] [INFO ] Deduced a trap composed of 121 places in 144 ms of which 2 ms to minimize.
[2024-05-28 14:34:15] [INFO ] Deduced a trap composed of 50 places in 167 ms of which 2 ms to minimize.
[2024-05-28 14:34:15] [INFO ] Deduced a trap composed of 67 places in 115 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/382 variables, 5/68 constraints. Problems are: Problem set: 0 solved, 816 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 382/1190 variables, and 68 constraints, problems are : Problem set: 0 solved, 816 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 32/34 constraints, State Equation: 0/384 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/816 constraints, Known Traps: 22/22 constraints]
After SMT, in 40842ms problems are : Problem set: 0 solved, 816 unsolved
Search for dead transitions found 0 dead transitions in 40852ms
[2024-05-28 14:34:20] [INFO ] Flow matrix only has 806 transitions (discarded 12 similar events)
[2024-05-28 14:34:20] [INFO ] Invariant cache hit.
[2024-05-28 14:34:20] [INFO ] Implicit Places using invariants in 334 ms returned [342, 343, 344, 345, 346, 347]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 349 ms to find 6 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 378/536 places, 818/968 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 372 transition count 812
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 372 transition count 812
Applied a total of 12 rules in 14 ms. Remains 372 /378 variables (removed 6) and now considering 812/818 (removed 6) transitions.
[2024-05-28 14:34:20] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
// Phase 1: matrix 800 rows 372 cols
[2024-05-28 14:34:20] [INFO ] Computed 42 invariants in 20 ms
[2024-05-28 14:34:20] [INFO ] Implicit Places using invariants in 295 ms returned []
[2024-05-28 14:34:20] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2024-05-28 14:34:20] [INFO ] Invariant cache hit.
[2024-05-28 14:34:21] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 14:34:24] [INFO ] Implicit Places using invariants and state equation in 3856 ms returned []
Implicit Place search using SMT with State Equation took 4177 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 372/536 places, 812/968 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 45428 ms. Remains : 372/536 places, 812/968 transitions.
[2024-05-28 14:34:24] [INFO ] Flatten gal took : 21 ms
[2024-05-28 14:34:24] [INFO ] Flatten gal took : 22 ms
[2024-05-28 14:34:24] [INFO ] Input system was already deterministic with 812 transitions.
RANDOM walk for 69 steps (0 resets) in 5 ms. (11 steps per ms) remains 0/1 properties
FORMULA PolyORBLF-COL-S02J06T06-CTLFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-28 14:34:24] [INFO ] Flatten gal took : 23 ms
[2024-05-28 14:34:24] [INFO ] Flatten gal took : 21 ms
[2024-05-28 14:34:24] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12558520769524343156.gal : 8 ms
[2024-05-28 14:34:24] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8509996948625157161.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12558520769524343156.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8509996948625157161.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
java.io.IOException: Stream closed
at java.base/java.io.BufferedInputStream.getBufIfOpen(BufferedInputStream.java:168)
at java.base/java.io.BufferedInputStream.read1(BufferedInputStream.java:281)
at java.base/java.io.BufferedInputStream.read(BufferedInputStream.java:343)
at java.base/sun.nio.cs.StreamDecoder.readBytes(StreamDecoder.java:270)
at java.base/sun.nio.cs.StreamDecoder.implRead(StreamDecoder.java:313)
at java.base/sun.nio.cs.StreamDecoder.read(StreamDecoder.java:188)
at java.base/java.io.InputStreamReader.read(InputStreamReader.java:177)
at java.base/java.io.BufferedReader.fill(BufferedReader.java:162)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:329)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:396)
at fr.lip6.move.gal.application.runner.its.ITSRunner$ITSInterpreter.run(ITSRunner.java:211)
at java.base/java.lang.Thread.run(Thread.java:840)
Starting structural reductions in LTL mode, iteration 0 : 536/536 places, 968/968 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 534 transition count 968
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 8 place count 528 transition count 962
Iterating global reduction 1 with 6 rules applied. Total rules applied 14 place count 528 transition count 962
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 20 place count 522 transition count 956
Iterating global reduction 1 with 6 rules applied. Total rules applied 26 place count 522 transition count 956
Applied a total of 26 rules in 16 ms. Remains 522 /536 variables (removed 14) and now considering 956/968 (removed 12) transitions.
Running 954 sub problems to find dead transitions.
[2024-05-28 14:34:24] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
// Phase 1: matrix 944 rows 522 cols
[2024-05-28 14:34:24] [INFO ] Computed 48 invariants in 9 ms
[2024-05-28 14:34:24] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/520 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/520 variables, 31/46 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-05-28 14:34:32] [INFO ] Deduced a trap composed of 71 places in 58 ms of which 1 ms to minimize.
[2024-05-28 14:34:32] [INFO ] Deduced a trap composed of 71 places in 41 ms of which 1 ms to minimize.
[2024-05-28 14:34:32] [INFO ] Deduced a trap composed of 71 places in 56 ms of which 1 ms to minimize.
[2024-05-28 14:34:32] [INFO ] Deduced a trap composed of 71 places in 63 ms of which 13 ms to minimize.
[2024-05-28 14:34:32] [INFO ] Deduced a trap composed of 71 places in 48 ms of which 0 ms to minimize.
[2024-05-28 14:34:33] [INFO ] Deduced a trap composed of 292 places in 212 ms of which 3 ms to minimize.
[2024-05-28 14:34:33] [INFO ] Deduced a trap composed of 304 places in 205 ms of which 3 ms to minimize.
[2024-05-28 14:34:33] [INFO ] Deduced a trap composed of 281 places in 185 ms of which 3 ms to minimize.
[2024-05-28 14:34:33] [INFO ] Deduced a trap composed of 240 places in 170 ms of which 3 ms to minimize.
[2024-05-28 14:34:33] [INFO ] Deduced a trap composed of 124 places in 172 ms of which 3 ms to minimize.
[2024-05-28 14:34:33] [INFO ] Deduced a trap composed of 71 places in 58 ms of which 1 ms to minimize.
[2024-05-28 14:34:34] [INFO ] Deduced a trap composed of 281 places in 196 ms of which 3 ms to minimize.
[2024-05-28 14:34:34] [INFO ] Deduced a trap composed of 243 places in 199 ms of which 3 ms to minimize.
[2024-05-28 14:34:42] [INFO ] Deduced a trap composed of 221 places in 210 ms of which 3 ms to minimize.
[2024-05-28 14:34:44] [INFO ] Deduced a trap composed of 214 places in 229 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/520 variables, 15/61 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 520/1466 variables, and 61 constraints, problems are : Problem set: 0 solved, 954 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 31/32 constraints, State Equation: 0/522 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 954/954 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 954 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/520 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/520 variables, 31/46 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/520 variables, 15/61 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-05-28 14:34:47] [INFO ] Deduced a trap composed of 290 places in 233 ms of which 3 ms to minimize.
[2024-05-28 14:34:51] [INFO ] Deduced a trap composed of 15 places in 95 ms of which 2 ms to minimize.
[2024-05-28 14:34:54] [INFO ] Deduced a trap composed of 270 places in 163 ms of which 2 ms to minimize.
[2024-05-28 14:34:54] [INFO ] Deduced a trap composed of 274 places in 230 ms of which 3 ms to minimize.
[2024-05-28 14:34:55] [INFO ] Deduced a trap composed of 62 places in 199 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/520 variables, 5/66 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-05-28 14:35:03] [INFO ] Deduced a trap composed of 259 places in 230 ms of which 4 ms to minimize.
[2024-05-28 14:35:03] [INFO ] Deduced a trap composed of 358 places in 194 ms of which 3 ms to minimize.
[2024-05-28 14:35:03] [INFO ] Deduced a trap composed of 323 places in 189 ms of which 3 ms to minimize.
[2024-05-28 14:35:03] [INFO ] Deduced a trap composed of 274 places in 243 ms of which 4 ms to minimize.
[2024-05-28 14:35:04] [INFO ] Deduced a trap composed of 37 places in 158 ms of which 3 ms to minimize.
[2024-05-28 14:35:04] [INFO ] Deduced a trap composed of 313 places in 235 ms of which 2 ms to minimize.
[2024-05-28 14:35:04] [INFO ] Deduced a trap composed of 278 places in 189 ms of which 3 ms to minimize.
[2024-05-28 14:35:04] [INFO ] Deduced a trap composed of 359 places in 196 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 3)
(s1 7)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 9)
(s147 1)
(s148 0)
(s149 1)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 1)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 1)
(s181 1)
(s182 0)
(s183 0)
(s184 0)
(s185 1)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 1)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 1)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 1)
(s243 0)
(s244 1)
(s245 0)
(s246 0)
(s247 1)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 520/1466 variables, and 74 constraints, problems are : Problem set: 0 solved, 954 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 31/32 constraints, State Equation: 0/522 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/954 constraints, Known Traps: 28/28 constraints]
After SMT, in 40833ms problems are : Problem set: 0 solved, 954 unsolved
Search for dead transitions found 0 dead transitions in 40842ms
[2024-05-28 14:35:05] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
[2024-05-28 14:35:05] [INFO ] Invariant cache hit.
[2024-05-28 14:35:06] [INFO ] Implicit Places using invariants in 278 ms returned [414, 415, 416, 417, 418, 419]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 293 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 516/536 places, 956/968 transitions.
Applied a total of 0 rules in 4 ms. Remains 516 /516 variables (removed 0) and now considering 956/956 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 41157 ms. Remains : 516/536 places, 956/968 transitions.
[2024-05-28 14:35:06] [INFO ] Flatten gal took : 25 ms
[2024-05-28 14:35:06] [INFO ] Flatten gal took : 27 ms
[2024-05-28 14:35:06] [INFO ] Input system was already deterministic with 956 transitions.
[2024-05-28 14:35:06] [INFO ] Flatten gal took : 26 ms
[2024-05-28 14:35:06] [INFO ] Flatten gal took : 27 ms
[2024-05-28 14:35:06] [INFO ] Time to serialize gal into /tmp/CTLFireability10370797022454999123.gal : 4 ms
[2024-05-28 14:35:06] [INFO ] Time to serialize properties into /tmp/CTLFireability14000435577581943081.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability10370797022454999123.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14000435577581943081.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-28 14:35:36] [INFO ] Flatten gal took : 27 ms
[2024-05-28 14:35:36] [INFO ] Applying decomposition
[2024-05-28 14:35:36] [INFO ] Flatten gal took : 28 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph11648444309471100639.txt' '-o' '/tmp/graph11648444309471100639.bin' '-w' '/tmp/graph11648444309471100639.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11648444309471100639.bin' '-l' '-1' '-v' '-w' '/tmp/graph11648444309471100639.weights' '-q' '0' '-e' '0.001'
[2024-05-28 14:35:36] [INFO ] Decomposing Gal with order
[2024-05-28 14:35:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 14:35:36] [INFO ] Removed a total of 807 redundant transitions.
[2024-05-28 14:35:36] [INFO ] Flatten gal took : 66 ms
[2024-05-28 14:35:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 154 labels/synchronizations in 5 ms.
[2024-05-28 14:35:36] [INFO ] Time to serialize gal into /tmp/CTLFireability3463267603117970664.gal : 5 ms
[2024-05-28 14:35:36] [INFO ] Time to serialize properties into /tmp/CTLFireability2558691005511304111.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3463267603117970664.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2558691005511304111.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-28 14:36:06] [INFO ] Flatten gal took : 31 ms
[2024-05-28 14:36:06] [INFO ] Flatten gal took : 32 ms
[2024-05-28 14:36:06] [INFO ] Applying decomposition
[2024-05-28 14:36:06] [INFO ] Flatten gal took : 33 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph6650550813271987276.txt' '-o' '/tmp/graph6650550813271987276.bin' '-w' '/tmp/graph6650550813271987276.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6650550813271987276.bin' '-l' '-1' '-v' '-w' '/tmp/graph6650550813271987276.weights' '-q' '0' '-e' '0.001'
[2024-05-28 14:36:06] [INFO ] Decomposing Gal with order
[2024-05-28 14:36:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 14:36:06] [INFO ] Removed a total of 705 redundant transitions.
[2024-05-28 14:36:06] [INFO ] Flatten gal took : 61 ms
[2024-05-28 14:36:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 178 labels/synchronizations in 6 ms.
[2024-05-28 14:36:07] [INFO ] Time to serialize gal into /tmp/CTLFireability6094492905277643520.gal : 6 ms
[2024-05-28 14:36:07] [INFO ] Time to serialize properties into /tmp/CTLFireability18029922770038203024.ctl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6094492905277643520.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18029922770038203024.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 13 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.54963e+08,235.426,2618120,23241,102935,2.07532e+06,746399,2091,9.23899e+06,1032,1.32936e+07,0
Converting to forward existential form...Done !
original formula: !(A(((((AF(E(((((((((i0.u0.cJobCnt>=1)&&(i10.u54.NotifyEventJobQueuedB_1>=1))||((i0.u0.cJobCnt>=1)&&(i10.u54.NotifyEventJobQueuedB_0>=1))...12496
=> equivalent forward existential formula: ([FwdG(((((FwdU(Init,!((((!(EG(!(((((i5.i0.u67.RunB_4>=1)||(i7.i0.u70.RunB_5>=1))||((i16.i0.u66.RunB_2>=1)||(i15...20178
Reverse transition relation is NOT exact ! Due to transitions t6, t7, t8, t9, t10, t11, t18, t28, t29, t49, t50, t419, t674, t675, t676, t677, t678, t679, ...1408
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
ITS-tools command line returned an error code 139
[2024-05-28 14:41:52] [INFO ] Applying decomposition
[2024-05-28 14:41:52] [INFO ] Flatten gal took : 59 ms
[2024-05-28 14:41:52] [INFO ] Decomposing Gal with order
[2024-05-28 14:41:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 14:41:52] [WARNING] Could not apply decomposition. Using flat GAL structure.
java.lang.RuntimeException: Could not find partition element corresponding to cJobCnt in partition [CreatedJobs_0],[CreatedJobs_1],[CreatedJobs_2],[CreatedJobs_3],[CreatedJobs_4],[CreatedJobs_5],[CreatedJobs_6],[CreatedJobs_7],[CreatedJobs_8],[CreatedJobs_9],[CreatedJobs_10],[CreatedJobs_11],[CreatedJobs_12],[CreatedJobs_13],[AwakeTasks_0, IdleTasks_0, NotifyEventJobQueuedE_0, QueueJobE_0, P_2321_0, TryAllocateOneTaskE_0, TryAllocateOneTaskB_0, P_2318_0, EnablePollingE_0, EnablePollingB_0, FetchJobB_0, ScheduleTaskE_Check_0, ScheduleTaskB_0, Abort_Check_Sources_E_0, Abort_Check_Sources_B_0, NotifyEventSourceAddedB_0, Insert_Source_E_0, NotifyEventSourceAddedE_0, P_1113_0, ProcessingEvt_0, P_1155_0, nyo_0, P_1158_0, P_1159_0, P_1160_0, NotifyEventEndOfCheckSourcesB_0, NotifyEventEndOfCheckSourcesE_0, Check_Sources_B_0, Check_Sources_E_0, Idle_0, NotifyEventJobCompletedE_0, NotifyEventJobCompletedB_0, RunE_0, RunB_0, Perform_Work_E_0, Try_Check_Sources_B_0, Try_Check_Sources_E_0, P_1617_0, ScheduleTaskE_Idle_0],[AwakeTasks_1, IdleTasks_1, NotifyEventJobQueuedE_1, QueueJobE_1, P_2321_1, TryAllocateOneTaskE_1, TryAllocateOneTaskB_1, P_2318_1, EnablePollingE_1, EnablePollingB_1, FetchJobB_1, ScheduleTaskE_Check_1, ScheduleTaskB_1, Abort_Check_Sources_E_1, Abort_Check_Sources_B_1, NotifyEventSourceAddedB_1, Insert_Source_E_1, NotifyEventSourceAddedE_1, P_1113_1, ProcessingEvt_1, P_1155_1, nyo_1, P_1158_1, P_1159_1, P_1160_1, NotifyEventEndOfCheckSourcesB_1, NotifyEventEndOfCheckSourcesE_1, Check_Sources_B_1, Check_Sources_E_1, Idle_1, NotifyEventJobCompletedE_1, NotifyEventJobCompletedB_1, RunE_1, RunB_1, Perform_Work_E_1, Try_Check_Sources_B_1, Try_Check_Sources_E_1, P_1617_1, ScheduleTaskE_Idle_1],[AwakeTasks_2, IdleTasks_2, NotifyEventJobQueuedE_2, QueueJobE_2, P_2321_2, TryAllocateOneTaskE_2, TryAllocateOneTaskB_2, P_2318_2, EnablePollingE_2, EnablePollingB_2, FetchJobB_2, ScheduleTaskE_Check_2, ScheduleTaskB_2, Abort_Check_Sources_E_2, Abort_Check_Sources_B_2, NotifyEventSourceAddedB_2, Insert_Source_E_2, NotifyEventSourceAddedE_2, P_1113_2, ProcessingEvt_2, P_1155_2, nyo_2, P_1158_2, P_1159_2, P_1160_2, NotifyEventEndOfCheckSourcesB_2, NotifyEventEndOfCheckSourcesE_2, Check_Sources_B_2, Check_Sources_E_2, Idle_2, NotifyEventJobCompletedE_2, NotifyEventJobCompletedB_2, RunE_2, RunB_2, Perform_Work_E_2, Try_Check_Sources_B_2, Try_Check_Sources_E_2, P_1617_2, ScheduleTaskE_Idle_2],[AwakeTasks_3, IdleTasks_3, NotifyEventJobQueuedE_3, QueueJobE_3, P_2321_3, TryAllocateOneTaskE_3, TryAllocateOneTaskB_3, P_2318_3, EnablePollingE_3, EnablePollingB_3, FetchJobB_3, ScheduleTaskE_Check_3, ScheduleTaskB_3, Abort_Check_Sources_E_3, Abort_Check_Sources_B_3, NotifyEventSourceAddedB_3, Insert_Source_E_3, NotifyEventSourceAddedE_3, P_1113_3, ProcessingEvt_3, P_1155_3, nyo_3, P_1158_3, P_1159_3, P_1160_3, NotifyEventEndOfCheckSourcesB_3, NotifyEventEndOfCheckSourcesE_3, Check_Sources_B_3, Check_Sources_E_3, Idle_3, NotifyEventJobCompletedE_3, NotifyEventJobCompletedB_3, RunE_3, RunB_3, Perform_Work_E_3, Try_Check_Sources_B_3, Try_Check_Sources_E_3, P_1617_3, ScheduleTaskE_Idle_3],[AwakeTasks_4, IdleTasks_4, NotifyEventJobQueuedE_4, QueueJobE_4, P_2321_4, TryAllocateOneTaskE_4, TryAllocateOneTaskB_4, P_2318_4, EnablePollingE_4, EnablePollingB_4, FetchJobB_4, ScheduleTaskE_Check_4, ScheduleTaskB_4, Abort_Check_Sources_E_4, Abort_Check_Sources_B_4, NotifyEventSourceAddedB_4, Insert_Source_E_4, NotifyEventSourceAddedE_4, P_1113_4, ProcessingEvt_4, P_1155_4, nyo_4, P_1158_4, P_1159_4, P_1160_4, NotifyEventEndOfCheckSourcesB_4, NotifyEventEndOfCheckSourcesE_4, Check_Sources_B_4, Check_Sources_E_4, Idle_4, NotifyEventJobCompletedE_4, NotifyEventJobCompletedB_4, RunE_4, RunB_4, Perform_Work_E_4, Try_Check_Sources_B_4, Try_Check_Sources_E_4, P_1617_4, ScheduleTaskE_Idle_4],[AwakeTasks_5, IdleTasks_5, NotifyEventJobQueuedE_5, QueueJobE_5, P_2321_5, TryAllocateOneTaskE_5, TryAllocateOneTaskB_5, P_2318_5, EnablePollingE_5, EnablePollingB_5, FetchJobB_5, ScheduleTaskE_Check_5, ScheduleTaskB_5, Abort_Check_Sources_E_5, Abort_Check_Sources_B_5, NotifyEventSourceAddedB_5, Insert_Source_E_5, NotifyEventSourceAddedE_5, P_1113_5, ProcessingEvt_5, P_1155_5, nyo_5, P_1158_5, P_1159_5, P_1160_5, NotifyEventEndOfCheckSourcesB_5, NotifyEventEndOfCheckSourcesE_5, Check_Sources_B_5, Check_Sources_E_5, Idle_5, NotifyEventJobCompletedE_5, NotifyEventJobCompletedB_5, RunE_5, RunB_5, Perform_Work_E_5, Try_Check_Sources_B_5, Try_Check_Sources_E_5, P_1617_5, ScheduleTaskE_Idle_5],[P_1725_0, P_1724_0, P_1712_0, AvailableJobId_0],[P_1725_1, P_1724_1, P_1712_1, AvailableJobId_1],[P_1725_2, P_1724_2, P_1712_2, AvailableJobId_2],[P_1725_3, P_1724_3, P_1712_3, AvailableJobId_3],[P_1725_4, P_1724_4, P_1712_4, AvailableJobId_4],[P_1725_5, P_1724_5, P_1712_5, AvailableJobId_5],[P_1725_6, P_1724_6, P_1712_6, AvailableJobId_6],[NotifyEventJobQueuedB_0, QueueJobB_0, FetchJobE_0, ScheduleTaskE_Work_0],[NotifyEventJobQueuedB_1, QueueJobB_1, FetchJobE_1, ScheduleTaskE_Work_1],[NotifyEventJobQueuedB_2, QueueJobB_2, FetchJobE_2, ScheduleTaskE_Work_2],[NotifyEventJobQueuedB_3, QueueJobB_3, FetchJobE_3, ScheduleTaskE_Work_3],[NotifyEventJobQueuedB_4, QueueJobB_4, FetchJobE_4, ScheduleTaskE_Work_4],[NotifyEventJobQueuedB_5, QueueJobB_5, FetchJobE_5, ScheduleTaskE_Work_5],[NotifyEventJobQueuedB_6, QueueJobB_6, FetchJobE_6, ScheduleTaskE_Work_6],[NotifyEventJobQueuedB_7, QueueJobB_7, FetchJobE_7, ScheduleTaskE_Work_7],[NotifyEventJobQueuedB_8, QueueJobB_8, FetchJobE_8, ScheduleTaskE_Work_8],[NotifyEventJobQueuedB_9, QueueJobB_9, FetchJobE_9, ScheduleTaskE_Work_9],[NotifyEventJobQueuedB_10, QueueJobB_10, FetchJobE_10, ScheduleTaskE_Work_10],[NotifyEventJobQueuedB_11, QueueJobB_11, FetchJobE_11, ScheduleTaskE_Work_11],[NotifyEventJobQueuedB_12, QueueJobB_12, FetchJobE_12, ScheduleTaskE_Work_12],[NotifyEventJobQueuedB_13, QueueJobB_13, FetchJobE_13, ScheduleTaskE_Work_13],[NotifyEventJobQueuedB_14, QueueJobB_14, FetchJobE_14, ScheduleTaskE_Work_14],[NotifyEventJobQueuedB_15, QueueJobB_15, FetchJobE_15, ScheduleTaskE_Work_15],[NotifyEventJobQueuedB_16, QueueJobB_16, FetchJobE_16, ScheduleTaskE_Work_16],[NotifyEventJobQueuedB_17, QueueJobB_17, FetchJobE_17, ScheduleTaskE_Work_17],[NotifyEventJobQueuedB_18, QueueJobB_18, FetchJobE_18, ScheduleTaskE_Work_18],[NotifyEventJobQueuedB_19, QueueJobB_19, FetchJobE_19, ScheduleTaskE_Work_19],[NotifyEventJobQueuedB_20, QueueJobB_20, FetchJobE_20, ScheduleTaskE_Work_20],[NotifyEventJobQueuedB_21, QueueJobB_21, FetchJobE_21, ScheduleTaskE_Work_21],[NotifyEventJobQueuedB_22, QueueJobB_22, FetchJobE_22, ScheduleTaskE_Work_22],[NotifyEventJobQueuedB_23, QueueJobB_23, FetchJobE_23, ScheduleTaskE_Work_23],[NotifyEventJobQueuedB_24, QueueJobB_24, FetchJobE_24, ScheduleTaskE_Work_24],[NotifyEventJobQueuedB_25, QueueJobB_25, FetchJobE_25, ScheduleTaskE_Work_25],[NotifyEventJobQueuedB_26, QueueJobB_26, FetchJobE_26, ScheduleTaskE_Work_26],[NotifyEventJobQueuedB_27, QueueJobB_27, FetchJobE_27, ScheduleTaskE_Work_27],[NotifyEventJobQueuedB_28, QueueJobB_28, FetchJobE_28, ScheduleTaskE_Work_28],[NotifyEventJobQueuedB_29, QueueJobB_29, FetchJobE_29, ScheduleTaskE_Work_29],[NotifyEventJobQueuedB_30, QueueJobB_30, FetchJobE_30, ScheduleTaskE_Work_30],[NotifyEventJobQueuedB_31, QueueJobB_31, FetchJobE_31, ScheduleTaskE_Work_31],[NotifyEventJobQueuedB_32, QueueJobB_32, FetchJobE_32, ScheduleTaskE_Work_32],[NotifyEventJobQueuedB_33, QueueJobB_33, FetchJobE_33, ScheduleTaskE_Work_33],[NotifyEventJobQueuedB_34, QueueJobB_34, FetchJobE_34, ScheduleTaskE_Work_34],[NotifyEventJobQueuedB_35, QueueJobB_35, FetchJobE_35, ScheduleTaskE_Work_35],[NotifyEventJobQueuedB_36, QueueJobB_36, FetchJobE_36, ScheduleTaskE_Work_36],[NotifyEventJobQueuedB_37, QueueJobB_37, FetchJobE_37, ScheduleTaskE_Work_37],[NotifyEventJobQueuedB_38, QueueJobB_38, FetchJobE_38, ScheduleTaskE_Work_38],[NotifyEventJobQueuedB_39, QueueJobB_39, FetchJobE_39, ScheduleTaskE_Work_39],[NotifyEventJobQueuedB_40, QueueJobB_40, FetchJobE_40, ScheduleTaskE_Work_40],[NotifyEventJobQueuedB_41, QueueJobB_41, FetchJobE_41, ScheduleTaskE_Work_41],[DataOnSrc_0, PlaceSources_0, ModifiedSrc_0, AbourtToModifySrc_0],[DataOnSrc_1, PlaceSources_1, ModifiedSrc_1, AbourtToModifySrc_1],[DisablePollingE_0, DisablePollingB_0, Insert_Source_B_0, P_1119_0, P_2579_0],[DisablePollingE_1, DisablePollingB_1, Insert_Source_B_1, P_1119_1, P_2579_1],[DisablePollingE_2, DisablePollingB_2, Insert_Source_B_2, P_1119_2, P_2579_2],[DisablePollingE_3, DisablePollingB_3, Insert_Source_B_3, P_1119_3, P_2579_3],[DisablePollingE_4, DisablePollingB_4, Insert_Source_B_4, P_1119_4, P_2579_4],[DisablePollingE_5, DisablePollingB_5, Insert_Source_B_5, P_1119_5, P_2579_5],[DisablePollingE_6, DisablePollingB_6, Insert_Source_B_6, P_1119_6, P_2579_6],[DisablePollingE_7, DisablePollingB_7, Insert_Source_B_7, P_1119_7, P_2579_7],[DisablePollingE_8, DisablePollingB_8, Insert_Source_B_8, P_1119_8, P_2579_8],[DisablePollingE_9, DisablePollingB_9, Insert_Source_B_9, P_1119_9, P_2579_9],[DisablePollingE_10, DisablePollingB_10, Insert_Source_B_10, P_1119_10, P_2579_10],[DisablePollingE_11, DisablePollingB_11, Insert_Source_B_11, P_1119_11, P_2579_11],
at fr.lip6.move.gal.instantiate.CompositeBuilder$Partition.getIndex(CompositeBuilder.java:1421)
at fr.lip6.move.gal.instantiate.CompositeBuilder.galToCompositeWithPartition(CompositeBuilder.java:556)
at fr.lip6.move.gal.instantiate.CompositeBuilder.decomposeWithOrder(CompositeBuilder.java:147)
at fr.lip6.move.gal.application.mcc.MccTranslator.applyOrder(MccTranslator.java:133)
at fr.lip6.move.gal.application.mcc.MccTranslator.flattenSpec(MccTranslator.java:230)
at fr.lip6.move.gal.application.runner.its.MultiOrderRunner.runMultiITS(MultiOrderRunner.java:124)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:943)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-28 14:41:52] [INFO ] Flatten gal took : 45 ms
[2024-05-28 14:41:52] [INFO ] Time to serialize gal into /tmp/CTLFireability11090793293971403199.gal : 6 ms
[2024-05-28 14:41:52] [INFO ] Time to serialize properties into /tmp/CTLFireability10355952575355861300.ctl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability11090793293971403199.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10355952575355861300.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 13 CTL formulae.
ITS-tools command line returned an error code 137
[2024-05-28 14:52:44] [INFO ] Flatten gal took : 50 ms
[2024-05-28 14:52:44] [INFO ] Input system was already deterministic with 968 transitions.
[2024-05-28 14:52:44] [INFO ] Transformed 536 places.
[2024-05-28 14:52:44] [INFO ] Transformed 968 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-28 14:53:14] [INFO ] Time to serialize gal into /tmp/CTLFireability9578653969193489205.gal : 6 ms
[2024-05-28 14:53:14] [INFO ] Time to serialize properties into /tmp/CTLFireability3884398844016218928.ctl : 6 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9578653969193489205.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3884398844016218928.ctl' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...328
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 13 CTL formulae.
ITS-tools command line returned an error code 137
Total runtime 3240319 ms.
BK_STOP 1716908485589
--------------------
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
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -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 CTLFireability -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="PolyORBLF-COL-S02J06T06"
export BK_EXAMINATION="CTLFireability"
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 PolyORBLF-COL-S02J06T06, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r290-tajo-171654446400098"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-COL-S02J06T06.tgz
mv PolyORBLF-COL-S02J06T06 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;