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-171654446400113.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-S02J06T10, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r290-tajo-171654446400113
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 620K
-rw-r--r-- 1 mcc users 11K Apr 11 17:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 105K Apr 11 17:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Apr 11 17:06 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Apr 11 17:06 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 4.2K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K 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 18K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 11 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 114K Apr 11 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Apr 11 17:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 11 17:13 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-S02J06T10-CTLCardinality-2024-00
FORMULA_NAME PolyORBLF-COL-S02J06T10-CTLCardinality-2024-01
FORMULA_NAME PolyORBLF-COL-S02J06T10-CTLCardinality-2024-02
FORMULA_NAME PolyORBLF-COL-S02J06T10-CTLCardinality-2024-03
FORMULA_NAME PolyORBLF-COL-S02J06T10-CTLCardinality-2024-04
FORMULA_NAME PolyORBLF-COL-S02J06T10-CTLCardinality-2024-05
FORMULA_NAME PolyORBLF-COL-S02J06T10-CTLCardinality-2024-06
FORMULA_NAME PolyORBLF-COL-S02J06T10-CTLCardinality-2024-07
FORMULA_NAME PolyORBLF-COL-S02J06T10-CTLCardinality-2024-08
FORMULA_NAME PolyORBLF-COL-S02J06T10-CTLCardinality-2024-09
FORMULA_NAME PolyORBLF-COL-S02J06T10-CTLCardinality-2024-10
FORMULA_NAME PolyORBLF-COL-S02J06T10-CTLCardinality-2024-11
FORMULA_NAME PolyORBLF-COL-S02J06T10-CTLCardinality-2024-12
FORMULA_NAME PolyORBLF-COL-S02J06T10-CTLCardinality-2024-13
FORMULA_NAME PolyORBLF-COL-S02J06T10-CTLCardinality-2024-14
FORMULA_NAME PolyORBLF-COL-S02J06T10-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716906873698

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-COL-S02J06T10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
CTLCardinality COL
Running Version 202405141337
[2024-05-28 14:34:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-28 14:34:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 14:34:35] [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:34:35] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-28 14:34:35] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 620 ms
[2024-05-28 14:34:35] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 844 PT places and 1904.0 transition bindings in 26 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 20 ms.
[2024-05-28 14:34:35] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 5 ms.
[2024-05-28 14:34:35] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 16 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
RANDOM walk for 40001 steps (19 resets) in 2668 ms. (14 steps per ms) remains 90/117 properties
BEST_FIRST walk for 4001 steps (8 resets) in 122 ms. (32 steps per ms) remains 89/90 properties
BEST_FIRST walk for 4001 steps (8 resets) in 261 ms. (15 steps per ms) remains 89/89 properties
BEST_FIRST walk for 4002 steps (8 resets) in 161 ms. (24 steps per ms) remains 89/89 properties
BEST_FIRST walk for 4003 steps (8 resets) in 162 ms. (24 steps per ms) remains 89/89 properties
BEST_FIRST walk for 4001 steps (8 resets) in 40 ms. (97 steps per ms) remains 89/89 properties
BEST_FIRST walk for 4002 steps (8 resets) in 35 ms. (111 steps per ms) remains 89/89 properties
BEST_FIRST walk for 4001 steps (8 resets) in 64 ms. (61 steps per ms) remains 89/89 properties
BEST_FIRST walk for 4001 steps (8 resets) in 32 ms. (121 steps per ms) remains 89/89 properties
BEST_FIRST walk for 4001 steps (8 resets) in 33 ms. (117 steps per ms) remains 89/89 properties
BEST_FIRST walk for 4000 steps (9 resets) in 57 ms. (68 steps per ms) remains 89/89 properties
BEST_FIRST walk for 4000 steps (9 resets) in 31 ms. (125 steps per ms) remains 89/89 properties
BEST_FIRST walk for 4001 steps (8 resets) in 33 ms. (117 steps per ms) remains 89/89 properties
BEST_FIRST walk for 4001 steps (8 resets) in 32 ms. (121 steps per ms) remains 89/89 properties
BEST_FIRST walk for 4000 steps (8 resets) in 33 ms. (117 steps per ms) remains 89/89 properties
BEST_FIRST walk for 4001 steps (8 resets) in 52 ms. (75 steps per ms) remains 89/89 properties
BEST_FIRST walk for 4000 steps (8 resets) in 33 ms. (117 steps per ms) remains 89/89 properties
BEST_FIRST walk for 4003 steps (8 resets) in 61 ms. (64 steps per ms) remains 89/89 properties
BEST_FIRST walk for 4002 steps (8 resets) in 44 ms. (88 steps per ms) remains 89/89 properties
BEST_FIRST walk for 4001 steps (8 resets) in 48 ms. (81 steps per ms) remains 89/89 properties
BEST_FIRST walk for 4000 steps (8 resets) in 51 ms. (76 steps per ms) remains 89/89 properties
BEST_FIRST walk for 4000 steps (8 resets) in 38 ms. (102 steps per ms) remains 89/89 properties
BEST_FIRST walk for 4000 steps (9 resets) in 42 ms. (93 steps per ms) remains 89/89 properties
BEST_FIRST walk for 4002 steps (8 resets) in 38 ms. (102 steps per ms) remains 89/89 properties
BEST_FIRST walk for 4003 steps (8 resets) in 51 ms. (76 steps per ms) remains 89/89 properties
BEST_FIRST walk for 4000 steps (8 resets) in 37 ms. (105 steps per ms) remains 89/89 properties
BEST_FIRST walk for 4001 steps (9 resets) in 54 ms. (72 steps per ms) remains 89/89 properties
BEST_FIRST walk for 4001 steps (8 resets) in 35 ms. (111 steps per ms) remains 89/89 properties
BEST_FIRST walk for 4001 steps (8 resets) in 42 ms. (93 steps per ms) remains 89/89 properties
BEST_FIRST walk for 4001 steps (8 resets) in 34 ms. (114 steps per ms) remains 89/89 properties
BEST_FIRST walk for 4000 steps (8 resets) in 40 ms. (97 steps per ms) remains 89/89 properties
BEST_FIRST walk for 4003 steps (8 resets) in 39 ms. (100 steps per ms) remains 89/89 properties
BEST_FIRST walk for 4000 steps (8 resets) in 41 ms. (95 steps per ms) remains 89/89 properties
BEST_FIRST walk for 4001 steps (8 resets) in 64 ms. (61 steps per ms) remains 89/89 properties
BEST_FIRST walk for 4001 steps (8 resets) in 46 ms. (85 steps per ms) remains 89/89 properties
BEST_FIRST walk for 4001 steps (10 resets) in 44 ms. (88 steps per ms) remains 89/89 properties
BEST_FIRST walk for 4001 steps (8 resets) in 33 ms. (117 steps per ms) remains 89/89 properties
BEST_FIRST walk for 4001 steps (8 resets) in 46 ms. (85 steps per ms) remains 89/89 properties
BEST_FIRST walk for 4000 steps (9 resets) in 41 ms. (95 steps per ms) remains 89/89 properties
BEST_FIRST walk for 4000 steps (8 resets) in 38 ms. (102 steps per ms) remains 89/89 properties
BEST_FIRST walk for 4002 steps (8 resets) in 39 ms. (100 steps per ms) remains 89/89 properties
BEST_FIRST walk for 4003 steps (8 resets) in 39 ms. (100 steps per ms) remains 89/89 properties
BEST_FIRST walk for 4000 steps (9 resets) in 47 ms. (83 steps per ms) remains 89/89 properties
BEST_FIRST walk for 4002 steps (8 resets) in 34 ms. (114 steps per ms) remains 89/89 properties
BEST_FIRST walk for 4001 steps (8 resets) in 37 ms. (105 steps per ms) remains 89/89 properties
BEST_FIRST walk for 4001 steps (9 resets) in 36 ms. (108 steps per ms) remains 89/89 properties
BEST_FIRST walk for 4002 steps (8 resets) in 28 ms. (138 steps per ms) remains 89/89 properties
BEST_FIRST walk for 4002 steps (8 resets) in 33 ms. (117 steps per ms) remains 89/89 properties
BEST_FIRST walk for 4002 steps (8 resets) in 33 ms. (117 steps per ms) remains 89/89 properties
BEST_FIRST walk for 4000 steps (8 resets) in 30 ms. (129 steps per ms) remains 89/89 properties
BEST_FIRST walk for 4001 steps (8 resets) in 32 ms. (121 steps per ms) remains 89/89 properties
[2024-05-28 14:34:37] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2024-05-28 14:34:37] [INFO ] Computed 26 invariants in 11 ms
[2024-05-28 14:34:37] [INFO ] State equation strengthened by 8 read => feed constraints.
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp36 is UNSAT
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp57 is UNSAT
Problem AtomicPropp63 is UNSAT
Problem AtomicPropp71 is UNSAT
Problem AtomicPropp84 is UNSAT
Problem AtomicPropp104 is UNSAT
Problem AtomicPropp106 is UNSAT
Problem AtomicPropp107 is UNSAT
Problem AtomicPropp114 is UNSAT
Problem AtomicPropp116 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 6/6 constraints. Problems are: Problem set: 17 solved, 72 unsolved
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp56 is UNSAT
Problem AtomicPropp93 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/70 variables, 4/10 constraints. Problems are: Problem set: 21 solved, 68 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 0/10 constraints. Problems are: Problem set: 21 solved, 68 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp53 is UNSAT
Problem AtomicPropp54 is UNSAT
Problem AtomicPropp58 is UNSAT
Problem AtomicPropp59 is UNSAT
Problem AtomicPropp66 is UNSAT
Problem AtomicPropp69 is UNSAT
Problem AtomicPropp70 is UNSAT
Problem AtomicPropp78 is UNSAT
Problem AtomicPropp80 is UNSAT
Problem AtomicPropp81 is UNSAT
Problem AtomicPropp86 is UNSAT
Problem AtomicPropp89 is UNSAT
Problem AtomicPropp91 is UNSAT
Problem AtomicPropp96 is UNSAT
Problem AtomicPropp100 is UNSAT
Problem AtomicPropp101 is UNSAT
Problem AtomicPropp102 is UNSAT
Problem AtomicPropp105 is UNSAT
Problem AtomicPropp108 is UNSAT
Problem AtomicPropp111 is UNSAT
At refinement iteration 3 (OVERLAPS) 6/76 variables, 5/15 constraints. Problems are: Problem set: 57 solved, 32 unsolved
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp48 is UNSAT
Problem AtomicPropp50 is UNSAT
Problem AtomicPropp55 is UNSAT
Problem AtomicPropp64 is UNSAT
Problem AtomicPropp72 is UNSAT
Problem AtomicPropp88 is UNSAT
Problem AtomicPropp90 is UNSAT
Problem AtomicPropp103 is UNSAT
Problem AtomicPropp110 is UNSAT
Problem AtomicPropp113 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 4/19 constraints. Problems are: Problem set: 73 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/76 variables, 0/19 constraints. Problems are: Problem set: 73 solved, 16 unsolved
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp51 is UNSAT
Problem AtomicPropp52 is UNSAT
Problem AtomicPropp74 is UNSAT
Problem AtomicPropp79 is UNSAT
Problem AtomicPropp92 is UNSAT
Problem AtomicPropp109 is UNSAT
Problem AtomicPropp112 is UNSAT
At refinement iteration 6 (OVERLAPS) 5/81 variables, 7/26 constraints. Problems are: Problem set: 82 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/81 variables, 0/26 constraints. Problems are: Problem set: 82 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 64/145 variables, 81/107 constraints. Problems are: Problem set: 82 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/145 variables, 8/115 constraints. Problems are: Problem set: 82 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/145 variables, 0/115 constraints. Problems are: Problem set: 82 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 0/145 variables, 0/115 constraints. Problems are: Problem set: 82 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 145/145 variables, and 115 constraints, problems are : Problem set: 82 solved, 7 unsolved in 653 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: 89/89 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 82 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 1/1 constraints. Problems are: Problem set: 82 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/1 constraints. Problems are: Problem set: 82 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 25/55 variables, 7/8 constraints. Problems are: Problem set: 82 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 0/8 constraints. Problems are: Problem set: 82 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 2/57 variables, 2/10 constraints. Problems are: Problem set: 82 solved, 7 unsolved
[2024-05-28 14:34:38] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 10 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/57 variables, 1/11 constraints. Problems are: Problem set: 82 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/57 variables, 0/11 constraints. Problems are: Problem set: 82 solved, 7 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp82 is UNSAT
Problem AtomicPropp95 is UNSAT
At refinement iteration 7 (OVERLAPS) 20/77 variables, 13/24 constraints. Problems are: Problem set: 85 solved, 4 unsolved
[2024-05-28 14:34:38] [INFO ] Deduced a trap composed of 29 places in 34 ms of which 2 ms to minimize.
[2024-05-28 14:34:38] [INFO ] Deduced a trap composed of 26 places in 27 ms of which 1 ms to minimize.
Problem AtomicPropp37 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/77 variables, 2/26 constraints. Problems are: Problem set: 86 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/77 variables, 0/26 constraints. Problems are: Problem set: 86 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 2/79 variables, 1/27 constraints. Problems are: Problem set: 86 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/79 variables, 0/27 constraints. Problems are: Problem set: 86 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 2/81 variables, 2/29 constraints. Problems are: Problem set: 86 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/81 variables, 0/29 constraints. Problems are: Problem set: 86 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 64/145 variables, 81/110 constraints. Problems are: Problem set: 86 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/145 variables, 8/118 constraints. Problems are: Problem set: 86 solved, 3 unsolved
Problem AtomicPropp85 is UNSAT
At refinement iteration 16 (INCLUDED_ONLY) 0/145 variables, 3/121 constraints. Problems are: Problem set: 87 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/145 variables, 0/121 constraints. Problems are: Problem set: 87 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/145 variables, 0/121 constraints. Problems are: Problem set: 87 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 145/145 variables, and 121 constraints, problems are : Problem set: 87 solved, 2 unsolved in 376 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: 3/89 constraints, Known Traps: 3/3 constraints]
After SMT, in 1100ms problems are : Problem set: 87 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 297 ms.
Support contains 4 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 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 80 transition count 59
Reduce places removed 6 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 8 rules applied. Total rules applied 15 place count 74 transition count 57
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 17 place count 72 transition count 57
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 17 place count 72 transition count 55
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 21 place count 70 transition count 55
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 3 with 14 rules applied. Total rules applied 35 place count 63 transition count 48
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 37 place count 63 transition count 46
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 39 place count 61 transition count 46
Applied a total of 39 rules in 36 ms. Remains 61 /81 variables (removed 20) and now considering 46/65 (removed 19) transitions.
Running 45 sub problems to find dead transitions.
[2024-05-28 14:34:39] [INFO ] Flow matrix only has 45 transitions (discarded 1 similar events)
// Phase 1: matrix 45 rows 61 cols
[2024-05-28 14:34:39] [INFO ] Computed 25 invariants in 3 ms
[2024-05-28 14:34:39] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 15/24 constraints. Problems are: Problem set: 0 solved, 45 unsolved
[2024-05-28 14:34:39] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 0 ms to minimize.
[2024-05-28 14:34:39] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2024-05-28 14:34:39] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
[2024-05-28 14:34:39] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 1 ms to minimize.
[2024-05-28 14:34:39] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 5/29 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 45 unsolved
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
At refinement iteration 4 (OVERLAPS) 1/61 variables, 1/30 constraints. Problems are: Problem set: 2 solved, 43 unsolved
[2024-05-28 14:34:39] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2024-05-28 14:34:39] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-05-28 14:34:39] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 3/33 constraints. Problems are: Problem set: 2 solved, 43 unsolved
[2024-05-28 14:34:39] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/61 variables, 1/34 constraints. Problems are: Problem set: 2 solved, 43 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/61 variables, 0/34 constraints. Problems are: Problem set: 2 solved, 43 unsolved
At refinement iteration 8 (OVERLAPS) 45/106 variables, 61/95 constraints. Problems are: Problem set: 2 solved, 43 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/106 variables, 8/103 constraints. Problems are: Problem set: 2 solved, 43 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/106 variables, 0/103 constraints. Problems are: Problem set: 2 solved, 43 unsolved
At refinement iteration 11 (OVERLAPS) 0/106 variables, 0/103 constraints. Problems are: Problem set: 2 solved, 43 unsolved
No progress, stopping.
After SMT solving in domain Real declared 106/106 variables, and 103 constraints, problems are : Problem set: 2 solved, 43 unsolved in 1306 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 61/61 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 45/45 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 2 solved, 43 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 9/9 constraints. Problems are: Problem set: 2 solved, 43 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 15/24 constraints. Problems are: Problem set: 2 solved, 43 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 6/30 constraints. Problems are: Problem set: 2 solved, 43 unsolved
[2024-05-28 14:34:40] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 1/31 constraints. Problems are: Problem set: 2 solved, 43 unsolved
[2024-05-28 14:34:40] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 1/32 constraints. Problems are: Problem set: 2 solved, 43 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 0/32 constraints. Problems are: Problem set: 2 solved, 43 unsolved
At refinement iteration 6 (OVERLAPS) 1/61 variables, 1/33 constraints. Problems are: Problem set: 2 solved, 43 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/61 variables, 3/36 constraints. Problems are: Problem set: 2 solved, 43 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/61 variables, 0/36 constraints. Problems are: Problem set: 2 solved, 43 unsolved
At refinement iteration 9 (OVERLAPS) 45/106 variables, 61/97 constraints. Problems are: Problem set: 2 solved, 43 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/106 variables, 8/105 constraints. Problems are: Problem set: 2 solved, 43 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/106 variables, 43/148 constraints. Problems are: Problem set: 2 solved, 43 unsolved
[2024-05-28 14:34:41] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/106 variables, 1/149 constraints. Problems are: Problem set: 2 solved, 43 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/106 variables, 0/149 constraints. Problems are: Problem set: 2 solved, 43 unsolved
At refinement iteration 14 (OVERLAPS) 0/106 variables, 0/149 constraints. Problems are: Problem set: 2 solved, 43 unsolved
No progress, stopping.
After SMT solving in domain Int declared 106/106 variables, and 149 constraints, problems are : Problem set: 2 solved, 43 unsolved in 1507 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 61/61 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 43/45 constraints, Known Traps: 12/12 constraints]
After SMT, in 2844ms problems are : Problem set: 2 solved, 43 unsolved
Search for dead transitions found 2 dead transitions in 2845ms
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 : 61/81 places, 44/65 transitions.
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 60 transition count 42
Reduce places removed 2 places and 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 58 transition count 40
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 3 rules in 7 ms. Remains 58 /61 variables (removed 3) and now considering 40/44 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2902 ms. Remains : 58/81 places, 40/65 transitions.
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
RANDOM walk for 40001 steps (29 resets) in 365 ms. (109 steps per ms) remains 1/1 properties
BEST_FIRST walk for 2401 steps (0 resets) in 15 ms. (150 steps per ms) remains 0/1 properties
Successfully simplified 88 atomic propositions for a total of 16 simplifications.
FORMULA PolyORBLF-COL-S02J06T10-CTLCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J06T10-CTLCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J06T10-CTLCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 14:34:42] [INFO ] Initial state reduction rules for CTL removed 6 formulas.
[2024-05-28 14:34:42] [INFO ] Flatten gal took : 35 ms
[2024-05-28 14:34:42] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA PolyORBLF-COL-S02J06T10-CTLCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J06T10-CTLCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J06T10-CTLCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J06T10-CTLCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J06T10-CTLCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J06T10-CTLCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J06T10-CTLCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 14:34:42] [INFO ] Flatten gal took : 15 ms
Transition T_2315 forces synchronizations/join behavior on parameter t of sort Threads
Transition GoPerformWork forces synchronizations/join behavior on parameter j of sort Jobs
Transition T_0376 forces synchronizations/join behavior on parameter s of sort Sources
[2024-05-28 14:34:42] [INFO ] Unfolded HLPN to a Petri net with 844 places and 1812 transitions 8302 arcs in 44 ms.
[2024-05-28 14:34:42] [INFO ] Unfolded 6 HLPN properties in 1 ms.
Ensure Unique test removed 160 transitions
Reduce redundant transitions removed 160 transitions.
Support contains 286 out of 844 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 844/844 places, 1652/1652 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 834 transition count 1642
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 834 transition count 1642
Applied a total of 20 rules in 69 ms. Remains 834 /844 variables (removed 10) and now considering 1642/1652 (removed 10) transitions.
Running 1640 sub problems to find dead transitions.
[2024-05-28 14:34:42] [INFO ] Flow matrix only has 1622 transitions (discarded 20 similar events)
// Phase 1: matrix 1622 rows 834 cols
[2024-05-28 14:34:42] [INFO ] Computed 58 invariants in 129 ms
[2024-05-28 14:34:42] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/830 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1640 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/830 variables, 40/54 constraints. Problems are: Problem set: 0 solved, 1640 unsolved
[2024-05-28 14:35:03] [INFO ] Deduced a trap composed of 72 places in 186 ms of which 2 ms to minimize.
[2024-05-28 14:35:04] [INFO ] Deduced a trap composed of 73 places in 1233 ms of which 1 ms to minimize.
[2024-05-28 14:35:04] [INFO ] Deduced a trap composed of 72 places in 51 ms of which 2 ms to minimize.
[2024-05-28 14:35:05] [INFO ] Deduced a trap composed of 72 places in 62 ms of which 1 ms to minimize.
[2024-05-28 14:35:05] [INFO ] Deduced a trap composed of 72 places in 62 ms of which 1 ms to minimize.
[2024-05-28 14:35:05] [INFO ] Deduced a trap composed of 72 places in 57 ms of which 1 ms to minimize.
[2024-05-28 14:35:05] [INFO ] Deduced a trap composed of 72 places in 54 ms of which 4 ms to minimize.
[2024-05-28 14:35:05] [INFO ] Deduced a trap composed of 72 places in 57 ms of which 2 ms to minimize.
SMT process timed out in 23096ms, After SMT, problems are : Problem set: 0 solved, 1640 unsolved
Search for dead transitions found 0 dead transitions in 23123ms
[2024-05-28 14:35:05] [INFO ] Flow matrix only has 1622 transitions (discarded 20 similar events)
[2024-05-28 14:35:05] [INFO ] Invariant cache hit.
[2024-05-28 14:35:06] [INFO ] Implicit Places using invariants in 621 ms returned [648, 649, 650, 651, 652, 653, 654, 655, 656, 657]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 648 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 824/844 places, 1642/1652 transitions.
Applied a total of 0 rules in 17 ms. Remains 824 /824 variables (removed 0) and now considering 1642/1642 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 23868 ms. Remains : 824/844 places, 1642/1652 transitions.
Support contains 286 out of 824 places after structural reductions.
[2024-05-28 14:35:06] [INFO ] Flatten gal took : 259 ms
[2024-05-28 14:35:06] [INFO ] Flatten gal took : 146 ms
[2024-05-28 14:35:06] [INFO ] Input system was already deterministic with 1642 transitions.
Support contains 252 out of 824 places (down from 286) after GAL structural reductions.
RANDOM walk for 40000 steps (12 resets) in 1942 ms. (20 steps per ms) remains 22/29 properties
BEST_FIRST walk for 4002 steps (8 resets) in 61 ms. (64 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 50 ms. (78 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (8 resets) in 47 ms. (83 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (8 resets) in 22 ms. (174 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 32 ms. (121 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (9 resets) in 24 ms. (160 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (8 resets) in 24 ms. (160 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (8 resets) in 40 ms. (97 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (9 resets) in 24 ms. (160 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (8 resets) in 23 ms. (166 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4000 steps (8 resets) in 51 ms. (76 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 36 ms. (108 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (8 resets) in 31 ms. (125 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (8 resets) in 23 ms. (166 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 38 ms. (102 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (8 resets) in 23 ms. (166 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (8 resets) in 51 ms. (76 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (8 resets) in 48 ms. (81 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (8 resets) in 21 ms. (181 steps per ms) remains 22/22 properties
[2024-05-28 14:35:07] [INFO ] Flow matrix only has 1622 transitions (discarded 20 similar events)
// Phase 1: matrix 1622 rows 824 cols
[2024-05-28 14:35:07] [INFO ] Computed 48 invariants in 70 ms
[2024-05-28 14:35:07] [INFO ] State equation strengthened by 120 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/190 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp28 is UNSAT
At refinement iteration 1 (OVERLAPS) 557/747 variables, 18/18 constraints. Problems are: Problem set: 17 solved, 5 unsolved
Problem AtomicPropp16 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/747 variables, 3/21 constraints. Problems are: Problem set: 18 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/747 variables, 0/21 constraints. Problems are: Problem set: 18 solved, 4 unsolved
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp24 is UNSAT
At refinement iteration 4 (OVERLAPS) 77/824 variables, 27/48 constraints. Problems are: Problem set: 21 solved, 1 unsolved
[2024-05-28 14:35:08] [INFO ] Deduced a trap composed of 73 places in 379 ms of which 5 ms to minimize.
[2024-05-28 14:35:09] [INFO ] Deduced a trap composed of 210 places in 347 ms of which 6 ms to minimize.
[2024-05-28 14:35:09] [INFO ] Deduced a trap composed of 73 places in 359 ms of which 4 ms to minimize.
[2024-05-28 14:35:10] [INFO ] Deduced a trap composed of 73 places in 355 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/824 variables, 4/52 constraints. Problems are: Problem set: 21 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/824 variables, 0/52 constraints. Problems are: Problem set: 21 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2446/2446 variables, and 876 constraints, problems are : Problem set: 21 solved, 1 unsolved in 3184 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 824/824 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 21 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 21 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 411/421 variables, 1/1 constraints. Problems are: Problem set: 21 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/421 variables, 0/1 constraints. Problems are: Problem set: 21 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 48/469 variables, 6/7 constraints. Problems are: Problem set: 21 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/469 variables, 0/7 constraints. Problems are: Problem set: 21 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 259/728 variables, 9/16 constraints. Problems are: Problem set: 21 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/728 variables, 0/16 constraints. Problems are: Problem set: 21 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 93/821 variables, 30/46 constraints. Problems are: Problem set: 21 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/821 variables, 4/50 constraints. Problems are: Problem set: 21 solved, 1 unsolved
[2024-05-28 14:35:11] [INFO ] Deduced a trap composed of 73 places in 272 ms of which 4 ms to minimize.
[2024-05-28 14:35:12] [INFO ] Deduced a trap composed of 73 places in 221 ms of which 4 ms to minimize.
[2024-05-28 14:35:12] [INFO ] Deduced a trap composed of 73 places in 165 ms of which 3 ms to minimize.
[2024-05-28 14:35:12] [INFO ] Deduced a trap composed of 73 places in 142 ms of which 2 ms to minimize.
[2024-05-28 14:35:12] [INFO ] Deduced a trap composed of 74 places in 112 ms of which 2 ms to minimize.
[2024-05-28 14:35:12] [INFO ] Deduced a trap composed of 73 places in 139 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/821 variables, 6/56 constraints. Problems are: Problem set: 21 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/821 variables, 0/56 constraints. Problems are: Problem set: 21 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/822 variables, 1/57 constraints. Problems are: Problem set: 21 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/822 variables, 0/57 constraints. Problems are: Problem set: 21 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2444/2446 variables, and 879 constraints, problems are : Problem set: 21 solved, 1 unsolved in 3069 ms.
Refiners :[Positive P Invariants (semi-flows): 17/18 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 822/824 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/22 constraints, Known Traps: 10/10 constraints]
After SMT, in 6459ms problems are : Problem set: 21 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 10 out of 824 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 824/824 places, 1642/1642 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 0 with 62 rules applied. Total rules applied 62 place count 822 transition count 1582
Reduce places removed 60 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 1 with 70 rules applied. Total rules applied 132 place count 762 transition count 1572
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 142 place count 752 transition count 1572
Performed 90 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 90 Pre rules applied. Total rules applied 142 place count 752 transition count 1482
Deduced a syphon composed of 90 places in 20 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 3 with 180 rules applied. Total rules applied 322 place count 662 transition count 1482
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Deduced a syphon composed of 90 places in 1 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 3 with 180 rules applied. Total rules applied 502 place count 572 transition count 1392
Free-agglomeration rule (complex) applied 20 times.
Iterating global reduction 3 with 20 rules applied. Total rules applied 522 place count 572 transition count 1372
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 3 with 20 rules applied. Total rules applied 542 place count 552 transition count 1372
Applied a total of 542 rules in 270 ms. Remains 552 /824 variables (removed 272) and now considering 1372/1642 (removed 270) transitions.
Running 1370 sub problems to find dead transitions.
[2024-05-28 14:35:14] [INFO ] Flow matrix only has 1352 transitions (discarded 20 similar events)
// Phase 1: matrix 1352 rows 552 cols
[2024-05-28 14:35:14] [INFO ] Computed 46 invariants in 37 ms
[2024-05-28 14:35:14] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/550 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1370 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/550 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1370 unsolved
[2024-05-28 14:35:30] [INFO ] Deduced a trap composed of 46 places in 291 ms of which 7 ms to minimize.
[2024-05-28 14:35:30] [INFO ] Deduced a trap composed of 46 places in 246 ms of which 21 ms to minimize.
[2024-05-28 14:35:30] [INFO ] Deduced a trap composed of 46 places in 192 ms of which 6 ms to minimize.
[2024-05-28 14:35:31] [INFO ] Deduced a trap composed of 46 places in 559 ms of which 2 ms to minimize.
[2024-05-28 14:35:31] [INFO ] Deduced a trap composed of 46 places in 90 ms of which 15 ms to minimize.
[2024-05-28 14:35:31] [INFO ] Deduced a trap composed of 46 places in 72 ms of which 1 ms to minimize.
[2024-05-28 14:35:31] [INFO ] Deduced a trap composed of 46 places in 54 ms of which 1 ms to minimize.
[2024-05-28 14:35:31] [INFO ] Deduced a trap composed of 46 places in 42 ms of which 1 ms to minimize.
[2024-05-28 14:35:31] [INFO ] Deduced a trap composed of 46 places in 43 ms of which 0 ms to minimize.
[2024-05-28 14:35:32] [INFO ] Deduced a trap composed of 197 places in 338 ms of which 4 ms to minimize.
[2024-05-28 14:35:32] [INFO ] Deduced a trap composed of 204 places in 305 ms of which 4 ms to minimize.
[2024-05-28 14:35:32] [INFO ] Deduced a trap composed of 203 places in 297 ms of which 3 ms to minimize.
[2024-05-28 14:35:33] [INFO ] Deduced a trap composed of 213 places in 227 ms of which 2 ms to minimize.
[2024-05-28 14:35:34] [INFO ] Deduced a trap composed of 46 places in 61 ms of which 1 ms to minimize.
[2024-05-28 14:35:37] [INFO ] Deduced a trap composed of 348 places in 227 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 10.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 1.0)
(s16 0.0)
(s17 4.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 9.0)
(s213 1.0)
(s214 0.0)
(s215 1.0)
(s216 1.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 550/1904 variables, and 59 constraints, problems are : Problem set: 0 solved, 1370 unsolved in 20055 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/552 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1370/1370 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1370 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/550 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1370 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/550 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1370 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/550 variables, 15/59 constraints. Problems are: Problem set: 0 solved, 1370 unsolved
[2024-05-28 14:35:45] [INFO ] Deduced a trap composed of 46 places in 163 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 550/1904 variables, and 60 constraints, problems are : Problem set: 0 solved, 1370 unsolved in 20040 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/552 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1370 constraints, Known Traps: 16/16 constraints]
After SMT, in 44052ms problems are : Problem set: 0 solved, 1370 unsolved
Search for dead transitions found 0 dead transitions in 44068ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44342 ms. Remains : 552/824 places, 1372/1642 transitions.
RANDOM walk for 40000 steps (16 resets) in 485 ms. (82 steps per ms) remains 1/1 properties
BEST_FIRST walk for 3068 steps (0 resets) in 12 ms. (236 steps per ms) remains 0/1 properties
Successfully simplified 21 atomic propositions for a total of 6 simplifications.
[2024-05-28 14:35:59] [INFO ] Flatten gal took : 113 ms
[2024-05-28 14:35:59] [INFO ] Flatten gal took : 80 ms
[2024-05-28 14:35:59] [INFO ] Input system was already deterministic with 1642 transitions.
FORMULA PolyORBLF-COL-S02J06T10-CTLCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 824/824 places, 1642/1642 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 822 transition count 1642
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 12 place count 812 transition count 1632
Iterating global reduction 1 with 10 rules applied. Total rules applied 22 place count 812 transition count 1632
Applied a total of 22 rules in 103 ms. Remains 812 /824 variables (removed 12) and now considering 1632/1642 (removed 10) transitions.
Running 1630 sub problems to find dead transitions.
[2024-05-28 14:35:59] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
// Phase 1: matrix 1612 rows 812 cols
[2024-05-28 14:35:59] [INFO ] Computed 46 invariants in 32 ms
[2024-05-28 14:35:59] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/810 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/810 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
[2024-05-28 14:36:17] [INFO ] Deduced a trap composed of 72 places in 73 ms of which 1 ms to minimize.
[2024-05-28 14:36:18] [INFO ] Deduced a trap composed of 72 places in 68 ms of which 2 ms to minimize.
[2024-05-28 14:36:18] [INFO ] Deduced a trap composed of 72 places in 74 ms of which 1 ms to minimize.
[2024-05-28 14:36:18] [INFO ] Deduced a trap composed of 72 places in 74 ms of which 1 ms to minimize.
[2024-05-28 14:36:18] [INFO ] Deduced a trap composed of 72 places in 52 ms of which 1 ms to minimize.
[2024-05-28 14:36:18] [INFO ] Deduced a trap composed of 72 places in 58 ms of which 1 ms to minimize.
[2024-05-28 14:36:18] [INFO ] Deduced a trap composed of 72 places in 55 ms of which 1 ms to minimize.
[2024-05-28 14:36:18] [INFO ] Deduced a trap composed of 72 places in 67 ms of which 7 ms to minimize.
[2024-05-28 14:36:18] [INFO ] Deduced a trap composed of 72 places in 57 ms of which 1 ms to minimize.
[2024-05-28 14:36:19] [INFO ] Deduced a trap composed of 463 places in 301 ms of which 4 ms to minimize.
[2024-05-28 14:36:19] [INFO ] Deduced a trap composed of 397 places in 283 ms of which 3 ms to minimize.
[2024-05-28 14:36:19] [INFO ] Deduced a trap composed of 208 places in 255 ms of which 4 ms to minimize.
[2024-05-28 14:36:20] [INFO ] Deduced a trap composed of 72 places in 56 ms of which 0 ms to minimize.
[2024-05-28 14:36:21] [INFO ] Deduced a trap composed of 474 places in 319 ms of which 4 ms to minimize.
[2024-05-28 14:36:21] [INFO ] Deduced a trap composed of 479 places in 314 ms of which 5 ms to minimize.
[2024-05-28 14:36:22] [INFO ] Deduced a trap composed of 423 places in 312 ms of which 5 ms to minimize.
[2024-05-28 14:36:22] [INFO ] Deduced a trap composed of 424 places in 315 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 810/2424 variables, and 61 constraints, problems are : Problem set: 0 solved, 1630 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/812 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1630/1630 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1630 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/810 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/810 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/810 variables, 17/61 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
[2024-05-28 14:36:25] [INFO ] Deduced a trap composed of 393 places in 282 ms of which 4 ms to minimize.
[2024-05-28 14:36:34] [INFO ] Deduced a trap composed of 23 places in 182 ms of which 3 ms to minimize.
[2024-05-28 14:36:36] [INFO ] Deduced a trap composed of 422 places in 297 ms of which 4 ms to minimize.
[2024-05-28 14:36:38] [INFO ] Deduced a trap composed of 488 places in 306 ms of which 4 ms to minimize.
[2024-05-28 14:36:38] [INFO ] Deduced a trap composed of 488 places in 313 ms of which 4 ms to minimize.
[2024-05-28 14:36:38] [INFO ] Deduced a trap composed of 412 places in 302 ms of which 4 ms to minimize.
[2024-05-28 14:36:39] [INFO ] Deduced a trap composed of 430 places in 307 ms of which 3 ms to minimize.
[2024-05-28 14:36:39] [INFO ] Deduced a trap composed of 415 places in 306 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 810/2424 variables, and 69 constraints, problems are : Problem set: 0 solved, 1630 unsolved in 20037 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/812 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1630 constraints, Known Traps: 25/25 constraints]
After SMT, in 43235ms problems are : Problem set: 0 solved, 1630 unsolved
Search for dead transitions found 0 dead transitions in 43272ms
[2024-05-28 14:36:42] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2024-05-28 14:36:42] [INFO ] Invariant cache hit.
[2024-05-28 14:36:43] [INFO ] Implicit Places using invariants in 607 ms returned []
[2024-05-28 14:36:43] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2024-05-28 14:36:43] [INFO ] Invariant cache hit.
[2024-05-28 14:36:44] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 14:36:58] [INFO ] Implicit Places using invariants and state equation in 15210 ms returned []
Implicit Place search using SMT with State Equation took 15821 ms to find 0 implicit places.
Running 1630 sub problems to find dead transitions.
[2024-05-28 14:36:58] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2024-05-28 14:36:58] [INFO ] Invariant cache hit.
[2024-05-28 14:36:58] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/810 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/810 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
[2024-05-28 14:37:23] [INFO ] Deduced a trap composed of 72 places in 58 ms of which 1 ms to minimize.
[2024-05-28 14:37:23] [INFO ] Deduced a trap composed of 72 places in 62 ms of which 1 ms to minimize.
[2024-05-28 14:37:23] [INFO ] Deduced a trap composed of 72 places in 48 ms of which 1 ms to minimize.
[2024-05-28 14:37:23] [INFO ] Deduced a trap composed of 72 places in 55 ms of which 1 ms to minimize.
[2024-05-28 14:37:23] [INFO ] Deduced a trap composed of 72 places in 48 ms of which 1 ms to minimize.
[2024-05-28 14:37:24] [INFO ] Deduced a trap composed of 72 places in 55 ms of which 1 ms to minimize.
[2024-05-28 14:37:24] [INFO ] Deduced a trap composed of 72 places in 55 ms of which 1 ms to minimize.
[2024-05-28 14:37:24] [INFO ] Deduced a trap composed of 72 places in 47 ms of which 1 ms to minimize.
[2024-05-28 14:37:24] [INFO ] Deduced a trap composed of 72 places in 55 ms of which 1 ms to minimize.
[2024-05-28 14:37:24] [INFO ] Deduced a trap composed of 72 places in 45 ms of which 1 ms to minimize.
[2024-05-28 14:37:26] [INFO ] Deduced a trap composed of 457 places in 303 ms of which 4 ms to minimize.
[2024-05-28 14:37:26] [INFO ] Deduced a trap composed of 412 places in 364 ms of which 4 ms to minimize.
[2024-05-28 14:37:27] [INFO ] Deduced a trap composed of 471 places in 374 ms of which 4 ms to minimize.
[2024-05-28 14:37:27] [INFO ] Deduced a trap composed of 426 places in 332 ms of which 4 ms to minimize.
[2024-05-28 14:37:28] [INFO ] Deduced a trap composed of 465 places in 296 ms of which 4 ms to minimize.
[2024-05-28 14:37:28] [INFO ] Deduced a trap composed of 434 places in 344 ms of which 4 ms to minimize.
[2024-05-28 14:37:28] [INFO ] Deduced a trap composed of 444 places in 305 ms of which 12 ms to minimize.
[2024-05-28 14:37:29] [INFO ] Deduced a trap composed of 445 places in 311 ms of which 4 ms to minimize.
[2024-05-28 14:37:29] [INFO ] Deduced a trap composed of 450 places in 294 ms of which 4 ms to minimize.
[2024-05-28 14:37:29] [INFO ] Deduced a trap composed of 459 places in 314 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/810 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
[2024-05-28 14:37:31] [INFO ] Deduced a trap composed of 425 places in 322 ms of which 4 ms to minimize.
SMT process timed out in 32633ms, After SMT, problems are : Problem set: 0 solved, 1630 unsolved
Search for dead transitions found 0 dead transitions in 32648ms
Starting structural reductions in LTL mode, iteration 1 : 812/824 places, 1632/1642 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 91866 ms. Remains : 812/824 places, 1632/1642 transitions.
[2024-05-28 14:37:31] [INFO ] Flatten gal took : 47 ms
[2024-05-28 14:37:31] [INFO ] Flatten gal took : 54 ms
[2024-05-28 14:37:31] [INFO ] Input system was already deterministic with 1632 transitions.
[2024-05-28 14:37:31] [INFO ] Flatten gal took : 97 ms
[2024-05-28 14:37:31] [INFO ] Flatten gal took : 129 ms
[2024-05-28 14:37:31] [INFO ] Time to serialize gal into /tmp/CTLCardinality5562835523405280719.gal : 71 ms
[2024-05-28 14:37:31] [INFO ] Time to serialize properties into /tmp/CTLCardinality13044222311866557310.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/CTLCardinality5562835523405280719.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13044222311866557310.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:38:01] [INFO ] Flatten gal took : 80 ms
[2024-05-28 14:38:01] [INFO ] Applying decomposition
[2024-05-28 14:38:02] [INFO ] Flatten gal took : 65 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/graph16395553453690510408.txt' '-o' '/tmp/graph16395553453690510408.bin' '-w' '/tmp/graph16395553453690510408.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16395553453690510408.bin' '-l' '-1' '-v' '-w' '/tmp/graph16395553453690510408.weights' '-q' '0' '-e' '0.001'
[2024-05-28 14:38:02] [INFO ] Decomposing Gal with order
[2024-05-28 14:38:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 14:38:02] [INFO ] Removed a total of 1513 redundant transitions.
[2024-05-28 14:38:02] [INFO ] Flatten gal took : 416 ms
[2024-05-28 14:38:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 314 labels/synchronizations in 91 ms.
[2024-05-28 14:38:03] [INFO ] Time to serialize gal into /tmp/CTLCardinality9712021949629409012.gal : 51 ms
[2024-05-28 14:38:03] [INFO ] Time to serialize properties into /tmp/CTLCardinality2969201987617517114.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/CTLCardinality9712021949629409012.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2969201987617517114.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 : 824/824 places, 1642/1642 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 822 transition count 1642
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 12 place count 812 transition count 1632
Iterating global reduction 1 with 10 rules applied. Total rules applied 22 place count 812 transition count 1632
Applied a total of 22 rules in 25 ms. Remains 812 /824 variables (removed 12) and now considering 1632/1642 (removed 10) transitions.
Running 1630 sub problems to find dead transitions.
[2024-05-28 14:38:33] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2024-05-28 14:38:33] [INFO ] Invariant cache hit.
[2024-05-28 14:38:33] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/810 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/810 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 810/2424 variables, and 44 constraints, problems are : Problem set: 0 solved, 1630 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/812 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1630/1630 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1630 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/810 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/810 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
[2024-05-28 14:38:57] [INFO ] Deduced a trap composed of 72 places in 118 ms of which 3 ms to minimize.
[2024-05-28 14:38:57] [INFO ] Deduced a trap composed of 72 places in 79 ms of which 5 ms to minimize.
[2024-05-28 14:38:57] [INFO ] Deduced a trap composed of 72 places in 75 ms of which 2 ms to minimize.
[2024-05-28 14:38:57] [INFO ] Deduced a trap composed of 72 places in 83 ms of which 1 ms to minimize.
[2024-05-28 14:38:57] [INFO ] Deduced a trap composed of 72 places in 97 ms of which 1 ms to minimize.
[2024-05-28 14:38:58] [INFO ] Deduced a trap composed of 73 places in 430 ms of which 5 ms to minimize.
[2024-05-28 14:38:58] [INFO ] Deduced a trap composed of 207 places in 384 ms of which 6 ms to minimize.
[2024-05-28 14:39:01] [INFO ] Deduced a trap composed of 72 places in 68 ms of which 1 ms to minimize.
[2024-05-28 14:39:06] [INFO ] Deduced a trap composed of 117 places in 310 ms of which 4 ms to minimize.
[2024-05-28 14:39:06] [INFO ] Deduced a trap composed of 72 places in 54 ms of which 1 ms to minimize.
[2024-05-28 14:39:10] [INFO ] Deduced a trap composed of 72 places in 79 ms of which 1 ms to minimize.
[2024-05-28 14:39:11] [INFO ] Deduced a trap composed of 72 places in 60 ms of which 0 ms to minimize.
[2024-05-28 14:39:13] [INFO ] Deduced a trap composed of 424 places in 349 ms of which 4 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 810/2424 variables, and 57 constraints, problems are : Problem set: 0 solved, 1630 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/812 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1630 constraints, Known Traps: 13/13 constraints]
After SMT, in 42730ms problems are : Problem set: 0 solved, 1630 unsolved
Search for dead transitions found 0 dead transitions in 42746ms
[2024-05-28 14:39:15] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2024-05-28 14:39:15] [INFO ] Invariant cache hit.
[2024-05-28 14:39:16] [INFO ] Implicit Places using invariants in 507 ms returned []
[2024-05-28 14:39:16] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2024-05-28 14:39:16] [INFO ] Invariant cache hit.
[2024-05-28 14:39:17] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 14:39:34] [INFO ] Implicit Places using invariants and state equation in 17854 ms returned []
Implicit Place search using SMT with State Equation took 18374 ms to find 0 implicit places.
Running 1630 sub problems to find dead transitions.
[2024-05-28 14:39:34] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2024-05-28 14:39:34] [INFO ] Invariant cache hit.
[2024-05-28 14:39:34] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/810 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/810 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
[2024-05-28 14:39:59] [INFO ] Deduced a trap composed of 72 places in 46 ms of which 1 ms to minimize.
[2024-05-28 14:39:59] [INFO ] Deduced a trap composed of 72 places in 55 ms of which 0 ms to minimize.
[2024-05-28 14:39:59] [INFO ] Deduced a trap composed of 72 places in 54 ms of which 0 ms to minimize.
[2024-05-28 14:39:59] [INFO ] Deduced a trap composed of 72 places in 54 ms of which 1 ms to minimize.
[2024-05-28 14:39:59] [INFO ] Deduced a trap composed of 72 places in 57 ms of which 1 ms to minimize.
[2024-05-28 14:40:00] [INFO ] Deduced a trap composed of 72 places in 53 ms of which 1 ms to minimize.
[2024-05-28 14:40:00] [INFO ] Deduced a trap composed of 72 places in 46 ms of which 1 ms to minimize.
[2024-05-28 14:40:00] [INFO ] Deduced a trap composed of 72 places in 51 ms of which 0 ms to minimize.
[2024-05-28 14:40:00] [INFO ] Deduced a trap composed of 72 places in 47 ms of which 1 ms to minimize.
[2024-05-28 14:40:00] [INFO ] Deduced a trap composed of 72 places in 60 ms of which 1 ms to minimize.
[2024-05-28 14:40:02] [INFO ] Deduced a trap composed of 457 places in 296 ms of which 4 ms to minimize.
[2024-05-28 14:40:02] [INFO ] Deduced a trap composed of 412 places in 317 ms of which 4 ms to minimize.
[2024-05-28 14:40:03] [INFO ] Deduced a trap composed of 471 places in 343 ms of which 17 ms to minimize.
[2024-05-28 14:40:03] [INFO ] Deduced a trap composed of 426 places in 284 ms of which 4 ms to minimize.
[2024-05-28 14:40:03] [INFO ] Deduced a trap composed of 465 places in 318 ms of which 4 ms to minimize.
[2024-05-28 14:40:04] [INFO ] Deduced a trap composed of 434 places in 297 ms of which 3 ms to minimize.
[2024-05-28 14:40:04] [INFO ] Deduced a trap composed of 444 places in 309 ms of which 4 ms to minimize.
[2024-05-28 14:40:04] [INFO ] Deduced a trap composed of 445 places in 344 ms of which 4 ms to minimize.
[2024-05-28 14:40:05] [INFO ] Deduced a trap composed of 450 places in 310 ms of which 4 ms to minimize.
[2024-05-28 14:40:05] [INFO ] Deduced a trap composed of 459 places in 300 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/810 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
[2024-05-28 14:40:06] [INFO ] Deduced a trap composed of 425 places in 329 ms of which 4 ms to minimize.
SMT process timed out in 32516ms, After SMT, problems are : Problem set: 0 solved, 1630 unsolved
Search for dead transitions found 0 dead transitions in 32549ms
Starting structural reductions in LTL mode, iteration 1 : 812/824 places, 1632/1642 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 93701 ms. Remains : 812/824 places, 1632/1642 transitions.
[2024-05-28 14:40:06] [INFO ] Flatten gal took : 48 ms
[2024-05-28 14:40:07] [INFO ] Flatten gal took : 58 ms
[2024-05-28 14:40:07] [INFO ] Input system was already deterministic with 1632 transitions.
[2024-05-28 14:40:07] [INFO ] Flatten gal took : 42 ms
[2024-05-28 14:40:07] [INFO ] Flatten gal took : 41 ms
[2024-05-28 14:40:07] [INFO ] Time to serialize gal into /tmp/CTLCardinality17130829787006292074.gal : 22 ms
[2024-05-28 14:40:07] [INFO ] Time to serialize properties into /tmp/CTLCardinality15920329414061655642.ctl : 23 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/CTLCardinality17130829787006292074.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15920329414061655642.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:40:37] [INFO ] Flatten gal took : 85 ms
[2024-05-28 14:40:37] [INFO ] Applying decomposition
[2024-05-28 14:40:37] [INFO ] Flatten gal took : 65 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/graph8229768851316237649.txt' '-o' '/tmp/graph8229768851316237649.bin' '-w' '/tmp/graph8229768851316237649.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8229768851316237649.bin' '-l' '-1' '-v' '-w' '/tmp/graph8229768851316237649.weights' '-q' '0' '-e' '0.001'
[2024-05-28 14:40:37] [INFO ] Decomposing Gal with order
[2024-05-28 14:40:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 14:40:38] [INFO ] Removed a total of 2003 redundant transitions.
[2024-05-28 14:40:38] [INFO ] Flatten gal took : 198 ms
[2024-05-28 14:40:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 1254 labels/synchronizations in 218 ms.
[2024-05-28 14:40:38] [INFO ] Time to serialize gal into /tmp/CTLCardinality12313811911340967301.gal : 17 ms
[2024-05-28 14:40:38] [INFO ] Time to serialize properties into /tmp/CTLCardinality14040436885510307732.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/CTLCardinality12313811911340967301.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14040436885510307732.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.
Starting structural reductions in LTL mode, iteration 0 : 824/824 places, 1642/1642 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 822 transition count 1642
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 12 place count 812 transition count 1632
Iterating global reduction 1 with 10 rules applied. Total rules applied 22 place count 812 transition count 1632
Applied a total of 22 rules in 20 ms. Remains 812 /824 variables (removed 12) and now considering 1632/1642 (removed 10) transitions.
Running 1630 sub problems to find dead transitions.
[2024-05-28 14:41:08] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2024-05-28 14:41:08] [INFO ] Invariant cache hit.
[2024-05-28 14:41:08] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/810 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/810 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 810/2424 variables, and 44 constraints, problems are : Problem set: 0 solved, 1630 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/812 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1630/1630 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1630 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/810 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/810 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
[2024-05-28 14:41:32] [INFO ] Deduced a trap composed of 72 places in 114 ms of which 2 ms to minimize.
[2024-05-28 14:41:32] [INFO ] Deduced a trap composed of 72 places in 75 ms of which 1 ms to minimize.
[2024-05-28 14:41:32] [INFO ] Deduced a trap composed of 72 places in 76 ms of which 11 ms to minimize.
[2024-05-28 14:41:32] [INFO ] Deduced a trap composed of 72 places in 77 ms of which 1 ms to minimize.
[2024-05-28 14:41:32] [INFO ] Deduced a trap composed of 72 places in 97 ms of which 1 ms to minimize.
[2024-05-28 14:41:33] [INFO ] Deduced a trap composed of 73 places in 278 ms of which 5 ms to minimize.
[2024-05-28 14:41:34] [INFO ] Deduced a trap composed of 207 places in 312 ms of which 4 ms to minimize.
[2024-05-28 14:41:36] [INFO ] Deduced a trap composed of 72 places in 50 ms of which 0 ms to minimize.
[2024-05-28 14:41:41] [INFO ] Deduced a trap composed of 117 places in 220 ms of which 3 ms to minimize.
[2024-05-28 14:41:41] [INFO ] Deduced a trap composed of 72 places in 72 ms of which 1 ms to minimize.
[2024-05-28 14:41:44] [INFO ] Deduced a trap composed of 72 places in 64 ms of which 1 ms to minimize.
[2024-05-28 14:41:45] [INFO ] Deduced a trap composed of 72 places in 46 ms of which 0 ms to minimize.
[2024-05-28 14:41:47] [INFO ] Deduced a trap composed of 424 places in 306 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")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 810/2424 variables, and 57 constraints, problems are : Problem set: 0 solved, 1630 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/812 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1630 constraints, Known Traps: 13/13 constraints]
After SMT, in 42664ms problems are : Problem set: 0 solved, 1630 unsolved
Search for dead transitions found 0 dead transitions in 42678ms
[2024-05-28 14:41:51] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2024-05-28 14:41:51] [INFO ] Invariant cache hit.
[2024-05-28 14:41:51] [INFO ] Implicit Places using invariants in 537 ms returned []
[2024-05-28 14:41:51] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2024-05-28 14:41:51] [INFO ] Invariant cache hit.
[2024-05-28 14:41:52] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 14:42:06] [INFO ] Implicit Places using invariants and state equation in 14979 ms returned []
Implicit Place search using SMT with State Equation took 15525 ms to find 0 implicit places.
Running 1630 sub problems to find dead transitions.
[2024-05-28 14:42:06] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2024-05-28 14:42:06] [INFO ] Invariant cache hit.
[2024-05-28 14:42:06] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/810 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/810 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
[2024-05-28 14:42:32] [INFO ] Deduced a trap composed of 72 places in 50 ms of which 0 ms to minimize.
[2024-05-28 14:42:32] [INFO ] Deduced a trap composed of 72 places in 54 ms of which 1 ms to minimize.
[2024-05-28 14:42:32] [INFO ] Deduced a trap composed of 72 places in 56 ms of which 1 ms to minimize.
[2024-05-28 14:42:32] [INFO ] Deduced a trap composed of 72 places in 47 ms of which 0 ms to minimize.
[2024-05-28 14:42:32] [INFO ] Deduced a trap composed of 72 places in 34 ms of which 1 ms to minimize.
[2024-05-28 14:42:32] [INFO ] Deduced a trap composed of 72 places in 54 ms of which 1 ms to minimize.
[2024-05-28 14:42:32] [INFO ] Deduced a trap composed of 72 places in 55 ms of which 0 ms to minimize.
[2024-05-28 14:42:32] [INFO ] Deduced a trap composed of 72 places in 55 ms of which 1 ms to minimize.
[2024-05-28 14:42:32] [INFO ] Deduced a trap composed of 72 places in 50 ms of which 1 ms to minimize.
[2024-05-28 14:42:33] [INFO ] Deduced a trap composed of 72 places in 53 ms of which 1 ms to minimize.
[2024-05-28 14:42:34] [INFO ] Deduced a trap composed of 457 places in 337 ms of which 4 ms to minimize.
[2024-05-28 14:42:35] [INFO ] Deduced a trap composed of 412 places in 331 ms of which 4 ms to minimize.
[2024-05-28 14:42:35] [INFO ] Deduced a trap composed of 471 places in 300 ms of which 4 ms to minimize.
[2024-05-28 14:42:36] [INFO ] Deduced a trap composed of 426 places in 292 ms of which 3 ms to minimize.
[2024-05-28 14:42:36] [INFO ] Deduced a trap composed of 465 places in 342 ms of which 4 ms to minimize.
[2024-05-28 14:42:36] [INFO ] Deduced a trap composed of 434 places in 297 ms of which 4 ms to minimize.
[2024-05-28 14:42:37] [INFO ] Deduced a trap composed of 444 places in 304 ms of which 4 ms to minimize.
[2024-05-28 14:42:37] [INFO ] Deduced a trap composed of 445 places in 302 ms of which 4 ms to minimize.
[2024-05-28 14:42:37] [INFO ] Deduced a trap composed of 450 places in 302 ms of which 4 ms to minimize.
[2024-05-28 14:42:38] [INFO ] Deduced a trap composed of 459 places in 295 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/810 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
[2024-05-28 14:42:39] [INFO ] Deduced a trap composed of 425 places in 302 ms of which 4 ms to minimize.
[2024-05-28 14:42:39] [INFO ] Deduced a trap composed of 460 places in 303 ms of which 4 ms to minimize.
SMT process timed out in 32830ms, After SMT, problems are : Problem set: 0 solved, 1630 unsolved
Search for dead transitions found 0 dead transitions in 32844ms
Starting structural reductions in LTL mode, iteration 1 : 812/824 places, 1632/1642 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 91075 ms. Remains : 812/824 places, 1632/1642 transitions.
[2024-05-28 14:42:39] [INFO ] Flatten gal took : 104 ms
[2024-05-28 14:42:39] [INFO ] Flatten gal took : 121 ms
[2024-05-28 14:42:40] [INFO ] Input system was already deterministic with 1632 transitions.
[2024-05-28 14:42:40] [INFO ] Flatten gal took : 98 ms
[2024-05-28 14:42:40] [INFO ] Flatten gal took : 73 ms
[2024-05-28 14:42:40] [INFO ] Time to serialize gal into /tmp/CTLCardinality11364144341248131033.gal : 22 ms
[2024-05-28 14:42:40] [INFO ] Time to serialize properties into /tmp/CTLCardinality16079116220497654437.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/CTLCardinality11364144341248131033.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16079116220497654437.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:43:10] [INFO ] Flatten gal took : 91 ms
[2024-05-28 14:43:10] [INFO ] Applying decomposition
[2024-05-28 14:43:10] [INFO ] Flatten gal took : 61 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/graph13008930339185141369.txt' '-o' '/tmp/graph13008930339185141369.bin' '-w' '/tmp/graph13008930339185141369.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13008930339185141369.bin' '-l' '-1' '-v' '-w' '/tmp/graph13008930339185141369.weights' '-q' '0' '-e' '0.001'
[2024-05-28 14:43:10] [INFO ] Decomposing Gal with order
[2024-05-28 14:43:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 14:43:10] [INFO ] Removed a total of 1411 redundant transitions.
[2024-05-28 14:43:11] [INFO ] Flatten gal took : 209 ms
[2024-05-28 14:43:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 241 labels/synchronizations in 34 ms.
[2024-05-28 14:43:11] [INFO ] Time to serialize gal into /tmp/CTLCardinality17487976139389618084.gal : 24 ms
[2024-05-28 14:43:11] [INFO ] Time to serialize properties into /tmp/CTLCardinality7923055168000505283.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/CTLCardinality17487976139389618084.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7923055168000505283.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.
Starting structural reductions in LTL mode, iteration 0 : 824/824 places, 1642/1642 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 822 transition count 1642
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 12 place count 812 transition count 1632
Iterating global reduction 1 with 10 rules applied. Total rules applied 22 place count 812 transition count 1632
Applied a total of 22 rules in 36 ms. Remains 812 /824 variables (removed 12) and now considering 1632/1642 (removed 10) transitions.
Running 1630 sub problems to find dead transitions.
[2024-05-28 14:43:41] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2024-05-28 14:43:41] [INFO ] Invariant cache hit.
[2024-05-28 14:43:41] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/810 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/810 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 810/2424 variables, and 44 constraints, problems are : Problem set: 0 solved, 1630 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/812 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1630/1630 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1630 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/810 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/810 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
[2024-05-28 14:44:05] [INFO ] Deduced a trap composed of 72 places in 100 ms of which 2 ms to minimize.
[2024-05-28 14:44:05] [INFO ] Deduced a trap composed of 72 places in 85 ms of which 1 ms to minimize.
[2024-05-28 14:44:06] [INFO ] Deduced a trap composed of 72 places in 79 ms of which 1 ms to minimize.
[2024-05-28 14:44:06] [INFO ] Deduced a trap composed of 72 places in 138 ms of which 1 ms to minimize.
[2024-05-28 14:44:06] [INFO ] Deduced a trap composed of 72 places in 95 ms of which 2 ms to minimize.
[2024-05-28 14:44:07] [INFO ] Deduced a trap composed of 73 places in 346 ms of which 4 ms to minimize.
[2024-05-28 14:44:08] [INFO ] Deduced a trap composed of 207 places in 269 ms of which 4 ms to minimize.
[2024-05-28 14:44:09] [INFO ] Deduced a trap composed of 72 places in 56 ms of which 1 ms to minimize.
[2024-05-28 14:44:15] [INFO ] Deduced a trap composed of 117 places in 225 ms of which 3 ms to minimize.
[2024-05-28 14:44:15] [INFO ] Deduced a trap composed of 72 places in 73 ms of which 1 ms to minimize.
[2024-05-28 14:44:18] [INFO ] Deduced a trap composed of 72 places in 64 ms of which 1 ms to minimize.
[2024-05-28 14:44:19] [INFO ] Deduced a trap composed of 72 places in 48 ms of which 1 ms to minimize.
[2024-05-28 14:44:22] [INFO ] Deduced a trap composed of 424 places in 317 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 10)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 1)
(s14 1)
(s15 1)
(s16 3)
(s17 0)
(s18 1)
(s19 1)
(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 0)
(s147 0)
(s148 0)
(s149 0)
(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 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(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 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 9)
(s243 1)
(s244 0)
(s245 1)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 1)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 0)
(s340 0)
(s341 0)
(s342 0)
(s343 0)
(s344 0)
(s345 0)
(s346 0)
(s347 0)
(s348 0)
(s349 0)
(s350 0)
(s351 0)
(s352 0)
(s353 0)
(s354 0)
(s355 0)
(s356 0)
(s357 0)
(s358 0)
(s359 0)
(s360 0)
(s361 0)
(s362 0)
(s363 0)
(s364 0)
(s365 0)
(s366 0)
(s367 0)
(s368 0)
(s369 0)
(s370 0)
(s371 0)
(s372 0)
(s373 0)
(s374 0)
(s375 1)
(s376 0)
(s377 0)
(s378 0)
(s379 0)
(s380 0)
(s381 0)
(s382 0)
(s383 0)
(s384 0)
(s385 0)
(s386 0)
(s387 0)
(s388 0)
(s389 0)
(s390 0)
(s391 0)
(s392 0)
(s393 0)
(s394 0)
(s395 0)
(s396 0)
(s397 0)
(s398 0)
(s399 0)
(s400 0)
(s401 0)
(s402 0)
(s403 0)
(s404 0)
(s405 0)
(s406 0)
(s407 0)
(s408 0)
(s409 0)
(s410 0)
(s411 0)
(s412 0)
(s413 0)
(s414 0)
(s415 0)
(s416 0)
(s417 0)
(s418 0)
(s419 0)
(s420 0)
(s421 0)
(s422 1)
(s423 0)
(s424 0)
(s425 0)
(s426 0)
(s427 0)
(s428 0)
(s429 0)
(s430 0)
(s431 0)
(s432 0)
(s433 0)
(s434 1)
(s437 0)
(s438 0)
(s439 0)
(s440 0)
(s441 0)
(s442 0)
(s443 0)
(s444 0)
(s445 0)
(s446 0)
(s447 0)
(s448 0)
(s449 0)
(s450 0)
(s451 0)
(s452 0)
(s453 0)
(s454 0)
(s455 0)
(s456 0)
(s457 0)
(s458 0)
(s459 0)
(s460 0)
(s461 0)
(s462 0)
(s463 0)
(s464 0)
(s465 0)
(s466 0)
(s467 0)
(s468 0)
(s469 0)
(s470 0)
(s471 0)
(s472 0)
(s473 0)
(s474 0)
(s475 0)
(s476 0)
(s477 0)
(s478 0)
(s479 0)
(s480 0)
(s481 0)
(s482 0)
(s483 0)
(s484 0)
(s485 0)
(s486 0)
(s487 0)timeout

org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 810/2424 variables, and 57 constraints, problems are : Problem set: 0 solved, 1630 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/812 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1630 constraints, Known Traps: 13/13 constraints]
After SMT, in 42814ms problems are : Problem set: 0 solved, 1630 unsolved
Search for dead transitions found 0 dead transitions in 42829ms
[2024-05-28 14:44:24] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2024-05-28 14:44:24] [INFO ] Invariant cache hit.
[2024-05-28 14:44:24] [INFO ] Implicit Places using invariants in 458 ms returned []
[2024-05-28 14:44:24] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2024-05-28 14:44:24] [INFO ] Invariant cache hit.
[2024-05-28 14:44:25] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 14:44:40] [INFO ] Implicit Places using invariants and state equation in 16054 ms returned []
Implicit Place search using SMT with State Equation took 16513 ms to find 0 implicit places.
Running 1630 sub problems to find dead transitions.
[2024-05-28 14:44:40] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2024-05-28 14:44:40] [INFO ] Invariant cache hit.
[2024-05-28 14:44:40] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/810 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/810 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
[2024-05-28 14:45:07] [INFO ] Deduced a trap composed of 72 places in 55 ms of which 0 ms to minimize.
[2024-05-28 14:45:07] [INFO ] Deduced a trap composed of 72 places in 79 ms of which 1 ms to minimize.
[2024-05-28 14:45:07] [INFO ] Deduced a trap composed of 72 places in 54 ms of which 1 ms to minimize.
[2024-05-28 14:45:07] [INFO ] Deduced a trap composed of 72 places in 54 ms of which 1 ms to minimize.
[2024-05-28 14:45:07] [INFO ] Deduced a trap composed of 72 places in 46 ms of which 1 ms to minimize.
[2024-05-28 14:45:07] [INFO ] Deduced a trap composed of 72 places in 44 ms of which 0 ms to minimize.
[2024-05-28 14:45:07] [INFO ] Deduced a trap composed of 72 places in 54 ms of which 1 ms to minimize.
[2024-05-28 14:45:07] [INFO ] Deduced a trap composed of 72 places in 49 ms of which 1 ms to minimize.
[2024-05-28 14:45:07] [INFO ] Deduced a trap composed of 72 places in 54 ms of which 1 ms to minimize.
[2024-05-28 14:45:08] [INFO ] Deduced a trap composed of 72 places in 49 ms of which 1 ms to minimize.
[2024-05-28 14:45:10] [INFO ] Deduced a trap composed of 457 places in 306 ms of which 4 ms to minimize.
[2024-05-28 14:45:10] [INFO ] Deduced a trap composed of 412 places in 316 ms of which 4 ms to minimize.
[2024-05-28 14:45:11] [INFO ] Deduced a trap composed of 471 places in 318 ms of which 4 ms to minimize.
[2024-05-28 14:45:11] [INFO ] Deduced a trap composed of 426 places in 305 ms of which 3 ms to minimize.
[2024-05-28 14:45:11] [INFO ] Deduced a trap composed of 465 places in 319 ms of which 4 ms to minimize.
[2024-05-28 14:45:12] [INFO ] Deduced a trap composed of 434 places in 328 ms of which 4 ms to minimize.
[2024-05-28 14:45:12] [INFO ] Deduced a trap composed of 444 places in 305 ms of which 4 ms to minimize.
[2024-05-28 14:45:12] [INFO ] Deduced a trap composed of 445 places in 307 ms of which 4 ms to minimize.
[2024-05-28 14:45:13] [INFO ] Deduced a trap composed of 450 places in 327 ms of which 4 ms to minimize.
[2024-05-28 14:45:13] [INFO ] Deduced a trap composed of 459 places in 349 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/810 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 810/2424 variables, and 64 constraints, problems are : Problem set: 0 solved, 1630 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/812 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1630/1630 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1630 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/810 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/810 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/810 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
[2024-05-28 14:45:16] [INFO ] Deduced a trap composed of 200 places in 274 ms of which 4 ms to minimize.
[2024-05-28 14:45:16] [INFO ] Deduced a trap composed of 200 places in 259 ms of which 4 ms to minimize.
[2024-05-28 14:45:17] [INFO ] Deduced a trap composed of 393 places in 308 ms of which 4 ms to minimize.
[2024-05-28 14:45:17] [INFO ] Deduced a trap composed of 465 places in 299 ms of which 4 ms to minimize.
[2024-05-28 14:45:20] [INFO ] Deduced a trap composed of 462 places in 309 ms of which 4 ms to minimize.
[2024-05-28 14:45:20] [INFO ] Deduced a trap composed of 447 places in 301 ms of which 4 ms to minimize.
[2024-05-28 14:45:21] [INFO ] Deduced a trap composed of 78 places in 137 ms of which 2 ms to minimize.
[2024-05-28 14:45:38] [INFO ] Deduced a trap composed of 430 places in 289 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 810/2424 variables, and 72 constraints, problems are : Problem set: 0 solved, 1630 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/812 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1630 constraints, Known Traps: 28/28 constraints]
After SMT, in 63176ms problems are : Problem set: 0 solved, 1630 unsolved
Search for dead transitions found 0 dead transitions in 63191ms
Starting structural reductions in LTL mode, iteration 1 : 812/824 places, 1632/1642 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 122576 ms. Remains : 812/824 places, 1632/1642 transitions.
[2024-05-28 14:45:44] [INFO ] Flatten gal took : 40 ms
[2024-05-28 14:45:44] [INFO ] Flatten gal took : 60 ms
[2024-05-28 14:45:44] [INFO ] Input system was already deterministic with 1632 transitions.
[2024-05-28 14:45:44] [INFO ] Flatten gal took : 53 ms
[2024-05-28 14:45:44] [INFO ] Flatten gal took : 47 ms
[2024-05-28 14:45:44] [INFO ] Time to serialize gal into /tmp/CTLCardinality4362514527605923470.gal : 9 ms
[2024-05-28 14:45:44] [INFO ] Time to serialize properties into /tmp/CTLCardinality3728127170051472999.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/CTLCardinality4362514527605923470.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3728127170051472999.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:46:14] [INFO ] Flatten gal took : 42 ms
[2024-05-28 14:46:14] [INFO ] Applying decomposition
[2024-05-28 14:46:14] [INFO ] Flatten gal took : 42 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/graph1163379275719313495.txt' '-o' '/tmp/graph1163379275719313495.bin' '-w' '/tmp/graph1163379275719313495.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1163379275719313495.bin' '-l' '-1' '-v' '-w' '/tmp/graph1163379275719313495.weights' '-q' '0' '-e' '0.001'
[2024-05-28 14:46:14] [INFO ] Decomposing Gal with order
[2024-05-28 14:46:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 14:46:14] [INFO ] Removed a total of 1217 redundant transitions.
[2024-05-28 14:46:15] [INFO ] Flatten gal took : 176 ms
[2024-05-28 14:46:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 284 labels/synchronizations in 31 ms.
[2024-05-28 14:46:15] [INFO ] Time to serialize gal into /tmp/CTLCardinality18214755481115140256.gal : 59 ms
[2024-05-28 14:46:15] [INFO ] Time to serialize properties into /tmp/CTLCardinality11896730997455743783.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/CTLCardinality18214755481115140256.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11896730997455743783.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 : 824/824 places, 1642/1642 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 822 transition count 1642
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 12 place count 812 transition count 1632
Iterating global reduction 1 with 10 rules applied. Total rules applied 22 place count 812 transition count 1632
Applied a total of 22 rules in 29 ms. Remains 812 /824 variables (removed 12) and now considering 1632/1642 (removed 10) transitions.
Running 1630 sub problems to find dead transitions.
[2024-05-28 14:46:45] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2024-05-28 14:46:45] [INFO ] Invariant cache hit.
[2024-05-28 14:46:45] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/810 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/810 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 810/2424 variables, and 44 constraints, problems are : Problem set: 0 solved, 1630 unsolved in 20035 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/812 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1630/1630 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1630 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/810 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/810 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
[2024-05-28 14:47:09] [INFO ] Deduced a trap composed of 72 places in 87 ms of which 2 ms to minimize.
[2024-05-28 14:47:09] [INFO ] Deduced a trap composed of 72 places in 77 ms of which 1 ms to minimize.
[2024-05-28 14:47:09] [INFO ] Deduced a trap composed of 72 places in 80 ms of which 1 ms to minimize.
[2024-05-28 14:47:09] [INFO ] Deduced a trap composed of 72 places in 72 ms of which 1 ms to minimize.
[2024-05-28 14:47:09] [INFO ] Deduced a trap composed of 72 places in 67 ms of which 1 ms to minimize.
[2024-05-28 14:47:10] [INFO ] Deduced a trap composed of 73 places in 284 ms of which 4 ms to minimize.
[2024-05-28 14:47:10] [INFO ] Deduced a trap composed of 207 places in 279 ms of which 4 ms to minimize.
[2024-05-28 14:47:12] [INFO ] Deduced a trap composed of 72 places in 47 ms of which 1 ms to minimize.
[2024-05-28 14:47:18] [INFO ] Deduced a trap composed of 117 places in 239 ms of which 3 ms to minimize.
[2024-05-28 14:47:18] [INFO ] Deduced a trap composed of 72 places in 70 ms of which 1 ms to minimize.
[2024-05-28 14:47:22] [INFO ] Deduced a trap composed of 72 places in 72 ms of which 1 ms to minimize.
[2024-05-28 14:47:23] [INFO ] Deduced a trap composed of 72 places in 47 ms of which 1 ms to minimize.
[2024-05-28 14:47:25] [INFO ] Deduced a trap composed of 424 places in 306 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 10)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 1)
(s14 1)
(s15 1)
(s16 3)
(s17 1)
(s18 0)
(s19 1)
(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 0)
(s147 0)
(s148 0)
(s149 0)
(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 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(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 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 810/2424 variables, and 57 constraints, problems are : Problem set: 0 solved, 1630 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/812 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1630 constraints, Known Traps: 13/13 constraints]
After SMT, in 42752ms problems are : Problem set: 0 solved, 1630 unsolved
Search for dead transitions found 0 dead transitions in 42766ms
[2024-05-28 14:47:28] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2024-05-28 14:47:28] [INFO ] Invariant cache hit.
[2024-05-28 14:47:28] [INFO ] Implicit Places using invariants in 510 ms returned []
[2024-05-28 14:47:28] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2024-05-28 14:47:28] [INFO ] Invariant cache hit.
[2024-05-28 14:47:29] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 14:47:43] [INFO ] Implicit Places using invariants and state equation in 15258 ms returned []
Implicit Place search using SMT with State Equation took 15770 ms to find 0 implicit places.
Running 1630 sub problems to find dead transitions.
[2024-05-28 14:47:43] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2024-05-28 14:47:43] [INFO ] Invariant cache hit.
[2024-05-28 14:47:43] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/810 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/810 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
[2024-05-28 14:48:12] [INFO ] Deduced a trap composed of 72 places in 57 ms of which 1 ms to minimize.
[2024-05-28 14:48:12] [INFO ] Deduced a trap composed of 72 places in 38 ms of which 1 ms to minimize.
[2024-05-28 14:48:12] [INFO ] Deduced a trap composed of 72 places in 47 ms of which 1 ms to minimize.
[2024-05-28 14:48:12] [INFO ] Deduced a trap composed of 72 places in 60 ms of which 1 ms to minimize.
[2024-05-28 14:48:12] [INFO ] Deduced a trap composed of 72 places in 60 ms of which 1 ms to minimize.
[2024-05-28 14:48:12] [INFO ] Deduced a trap composed of 72 places in 61 ms of which 0 ms to minimize.
[2024-05-28 14:48:12] [INFO ] Deduced a trap composed of 72 places in 50 ms of which 1 ms to minimize.
[2024-05-28 14:48:12] [INFO ] Deduced a trap composed of 72 places in 55 ms of which 1 ms to minimize.
[2024-05-28 14:48:12] [INFO ] Deduced a trap composed of 72 places in 47 ms of which 1 ms to minimize.
[2024-05-28 14:48:13] [INFO ] Deduced a trap composed of 72 places in 37 ms of which 0 ms to minimize.
[2024-05-28 14:48:15] [INFO ] Deduced a trap composed of 457 places in 521 ms of which 19 ms to minimize.
[2024-05-28 14:48:15] [INFO ] Deduced a trap composed of 412 places in 458 ms of which 5 ms to minimize.
[2024-05-28 14:48:15] [INFO ] Deduced a trap composed of 471 places in 336 ms of which 4 ms to minimize.
[2024-05-28 14:48:16] [INFO ] Deduced a trap composed of 426 places in 312 ms of which 4 ms to minimize.
[2024-05-28 14:48:16] [INFO ] Deduced a trap composed of 465 places in 306 ms of which 4 ms to minimize.
[2024-05-28 14:48:17] [INFO ] Deduced a trap composed of 434 places in 316 ms of which 4 ms to minimize.
SMT process timed out in 33227ms, After SMT, problems are : Problem set: 0 solved, 1630 unsolved
Search for dead transitions found 0 dead transitions in 33241ms
Starting structural reductions in LTL mode, iteration 1 : 812/824 places, 1632/1642 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 91813 ms. Remains : 812/824 places, 1632/1642 transitions.
[2024-05-28 14:48:17] [INFO ] Flatten gal took : 40 ms
[2024-05-28 14:48:17] [INFO ] Flatten gal took : 42 ms
[2024-05-28 14:48:17] [INFO ] Input system was already deterministic with 1632 transitions.
[2024-05-28 14:48:17] [INFO ] Flatten gal took : 42 ms
[2024-05-28 14:48:17] [INFO ] Flatten gal took : 41 ms
[2024-05-28 14:48:17] [INFO ] Time to serialize gal into /tmp/CTLCardinality4268702613711837375.gal : 19 ms
[2024-05-28 14:48:17] [INFO ] Time to serialize properties into /tmp/CTLCardinality18247402579464823622.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/CTLCardinality4268702613711837375.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18247402579464823622.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:48:47] [INFO ] Flatten gal took : 88 ms
[2024-05-28 14:48:47] [INFO ] Applying decomposition
[2024-05-28 14:48:47] [INFO ] Flatten gal took : 64 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/graph9244839920311365992.txt' '-o' '/tmp/graph9244839920311365992.bin' '-w' '/tmp/graph9244839920311365992.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9244839920311365992.bin' '-l' '-1' '-v' '-w' '/tmp/graph9244839920311365992.weights' '-q' '0' '-e' '0.001'
[2024-05-28 14:48:47] [INFO ] Decomposing Gal with order
[2024-05-28 14:48:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 14:48:47] [INFO ] Removed a total of 1564 redundant transitions.
[2024-05-28 14:48:47] [INFO ] Flatten gal took : 162 ms
[2024-05-28 14:48:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 283 labels/synchronizations in 36 ms.
[2024-05-28 14:48:48] [INFO ] Time to serialize gal into /tmp/CTLCardinality17524990479522104435.gal : 28 ms
[2024-05-28 14:48:48] [INFO ] Time to serialize properties into /tmp/CTLCardinality10475950701296525917.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/CTLCardinality17524990479522104435.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10475950701296525917.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:49:18] [INFO ] Flatten gal took : 42 ms
[2024-05-28 14:49:18] [INFO ] Flatten gal took : 43 ms
[2024-05-28 14:49:18] [INFO ] Applying decomposition
[2024-05-28 14:49:18] [INFO ] Flatten gal took : 45 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/graph13968720029456587161.txt' '-o' '/tmp/graph13968720029456587161.bin' '-w' '/tmp/graph13968720029456587161.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13968720029456587161.bin' '-l' '-1' '-v' '-w' '/tmp/graph13968720029456587161.weights' '-q' '0' '-e' '0.001'
[2024-05-28 14:49:18] [INFO ] Decomposing Gal with order
[2024-05-28 14:49:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 14:49:18] [INFO ] Removed a total of 1730 redundant transitions.
[2024-05-28 14:49:18] [INFO ] Flatten gal took : 140 ms
[2024-05-28 14:49:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 1051 labels/synchronizations in 47 ms.
[2024-05-28 14:49:18] [INFO ] Time to serialize gal into /tmp/CTLCardinality6419821499338826026.gal : 28 ms
[2024-05-28 14:49:18] [INFO ] Time to serialize properties into /tmp/CTLCardinality4017315714854017606.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/CTLCardinality6419821499338826026.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4017315714854017606.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 5 CTL formulae.
ITS-tools command line returned an error code 137
[2024-05-28 14:58:45] [INFO ] Applying decomposition
[2024-05-28 14:58:45] [INFO ] Flatten gal took : 81 ms
[2024-05-28 14:58:45] [INFO ] Decomposing Gal with order
[2024-05-28 14:58:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 14:58:45] [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, NotifyEventJobCompletedE_0, NotifyEventJobCompletedB_0, RunE_0, RunB_0, Perform_Work_E_0, Try_Check_Sources_B_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, NotifyEventJobCompletedE_1, NotifyEventJobCompletedB_1, RunE_1, RunB_1, Perform_Work_E_1, Try_Check_Sources_B_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, NotifyEventJobCompletedE_2, NotifyEventJobCompletedB_2, RunE_2, RunB_2, Perform_Work_E_2, Try_Check_Sources_B_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, NotifyEventJobCompletedE_3, NotifyEventJobCompletedB_3, RunE_3, RunB_3, Perform_Work_E_3, Try_Check_Sources_B_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, NotifyEventJobCompletedE_4, NotifyEventJobCompletedB_4, RunE_4, RunB_4, Perform_Work_E_4, Try_Check_Sources_B_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, NotifyEventJobCompletedE_5, NotifyEventJobCompletedB_5, RunE_5, RunB_5, Perform_Work_E_5, Try_Check_Sources_B_5, P_1617_5, ScheduleTaskE_Idle_5],[AwakeTasks_6, IdleTasks_6, NotifyEventJobQueuedE_6, QueueJobE_6, P_2321_6, TryAllocateOneTaskE_6, TryAllocateOneTaskB_6, P_2318_6, EnablePollingE_6, EnablePollingB_6, FetchJobB_6, ScheduleTaskE_Check_6, ScheduleTaskB_6, Abort_Check_Sources_E_6, Abort_Check_Sources_B_6, NotifyEventSourceAddedB_6, Insert_Source_E_6, NotifyEventSourceAddedE_6, P_1113_6, ProcessingEvt_6, P_1155_6, nyo_6, P_1158_6, P_1159_6, P_1160_6, NotifyEventEndOfCheckSourcesB_6, NotifyEventEndOfCheckSourcesE_6, Check_Sources_B_6, Check_Sources_E_6, NotifyEventJobCompletedE_6, NotifyEventJobCompletedB_6, RunE_6, RunB_6, Perform_Work_E_6, Try_Check_Sources_B_6, P_1617_6, ScheduleTaskE_Idle_6],[AwakeTasks_7, IdleTasks_7, NotifyEventJobQueuedE_7, QueueJobE_7, P_2321_7, TryAllocateOneTaskE_7, TryAllocateOneTaskB_7, P_2318_7, EnablePollingE_7, EnablePollingB_7, FetchJobB_7, ScheduleTaskE_Check_7, ScheduleTaskB_7, Abort_Check_Sources_E_7, Abort_Check_Sources_B_7, NotifyEventSourceAddedB_7, Insert_Source_E_7, NotifyEventSourceAddedE_7, P_1113_7, ProcessingEvt_7, P_1155_7, nyo_7, P_1158_7, P_1159_7, P_1160_7, NotifyEventEndOfCheckSourcesB_7, NotifyEventEndOfCheckSourcesE_7, Check_Sources_B_7, Check_Sources_E_7, NotifyEventJobCompletedE_7, NotifyEventJobCompletedB_7, RunE_7, RunB_7, Perform_Work_E_7, Try_Check_Sources_B_7, P_1617_7, ScheduleTaskE_Idle_7],[AwakeTasks_8, IdleTasks_8, NotifyEventJobQueuedE_8, QueueJobE_8, P_2321_8, TryAllocateOneTaskE_8, TryAllocateOneTaskB_8, P_2318_8, EnablePollingE_8, EnablePollingB_8, FetchJobB_8, ScheduleTaskE_Check_8, ScheduleTaskB_8, Abort_Check_Sources_E_8, Abort_Check_Sources_B_8, NotifyEventSourceAddedB_8, Insert_Source_E_8, NotifyEventSourceAddedE_8, P_1113_8, ProcessingEvt_8, P_1155_8, nyo_8, P_1158_8, P_1159_8, P_1160_8, NotifyEventEndOfCheckSourcesB_8, NotifyEventEndOfCheckSourcesE_8, Check_Sources_B_8, Check_Sources_E_8, NotifyEventJobCompletedE_8, NotifyEventJobCompletedB_8, RunE_8, RunB_8, Perform_Work_E_8, Try_Check_Sources_B_8, P_1617_8, ScheduleTaskE_Idle_8],[AwakeTasks_9, IdleTasks_9, NotifyEventJobQueuedE_9, QueueJobE_9, P_2321_9, TryAllocateOneTaskE_9, TryAllocateOneTaskB_9, P_2318_9, EnablePollingE_9, EnablePollingB_9, FetchJobB_9, ScheduleTaskE_Check_9, ScheduleTaskB_9, Abort_Check_Sources_E_9, Abort_Check_Sources_B_9, NotifyEventSourceAddedB_9, Insert_Source_E_9, NotifyEventSourceAddedE_9, P_1113_9, ProcessingEvt_9, P_1155_9, nyo_9, P_1158_9, P_1159_9, P_1160_9, NotifyEventEndOfCheckSourcesB_9, NotifyEventEndOfCheckSourcesE_9, Check_Sources_B_9, Check_Sources_E_9, NotifyEventJobCompletedE_9, NotifyEventJobCompletedB_9, RunE_9, RunB_9, Perform_Work_E_9, Try_Check_Sources_B_9, P_1617_9, ScheduleTaskE_Idle_9],[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],[NotifyEventJobQueuedB_42, QueueJobB_42, FetchJobE_42, ScheduleTaskE_Work_42],[NotifyEventJobQueuedB_43, QueueJobB_43, FetchJobE_43, ScheduleTaskE_Work_43],[NotifyEventJobQueuedB_44, QueueJobB_44, FetchJobE_44, ScheduleTaskE_Work_44],[NotifyEventJobQueuedB_45, QueueJobB_45, FetchJobE_45, ScheduleTaskE_Work_45],[NotifyEventJobQueuedB_46, QueueJobB_46, FetchJobE_46, ScheduleTaskE_Work_46],[NotifyEventJobQueuedB_47, QueueJobB_47, FetchJobE_47, ScheduleTaskE_Work_47],[NotifyEventJobQueuedB_48, QueueJobB_48, FetchJobE_48, ScheduleTaskE_Work_48],[NotifyEventJobQueuedB_49, QueueJobB_49, FetchJobE_49, ScheduleTaskE_Work_49],[NotifyEventJobQueuedB_50, QueueJobB_50, FetchJobE_50, ScheduleTaskE_Work_50],[NotifyEventJobQueuedB_51, QueueJobB_51, FetchJobE_51, ScheduleTaskE_Work_51],[NotifyEventJobQueuedB_52, QueueJobB_52, FetchJobE_52, ScheduleTaskE_Work_52],[NotifyEventJobQueuedB_53, QueueJobB_53, FetchJobE_53, ScheduleTaskE_Work_53],[NotifyEventJobQueuedB_54, QueueJobB_54, FetchJobE_54, ScheduleTaskE_Work_54],[NotifyEventJobQueuedB_55, QueueJobB_55, FetchJobE_55, ScheduleTaskE_Work_55],[NotifyEventJobQueuedB_56, QueueJobB_56, FetchJobE_56, ScheduleTaskE_Work_56],[NotifyEventJobQueuedB_57, QueueJobB_57, FetchJobE_57, ScheduleTaskE_Work_57],[NotifyEventJobQueuedB_58, QueueJobB_58, FetchJobE_58, ScheduleTaskE_Work_58],[NotifyEventJobQueuedB_59, QueueJobB_59, FetchJobE_59, ScheduleTaskE_Work_59],[NotifyEventJobQueuedB_60, QueueJobB_60, FetchJobE_60, ScheduleTaskE_Work_60],[NotifyEventJobQueuedB_61, QueueJobB_61, FetchJobE_61, ScheduleTaskE_Work_61],[NotifyEventJobQueuedB_62, QueueJobB_62, FetchJobE_62, ScheduleTaskE_Work_62],[NotifyEventJobQueuedB_63, QueueJobB_63, FetchJobE_63, ScheduleTaskE_Work_63],[NotifyEventJobQueuedB_64, QueueJobB_64, FetchJobE_64, ScheduleTaskE_Work_64],[NotifyEventJobQueuedB_65, QueueJobB_65, FetchJobE_65, ScheduleTaskE_Work_65],[NotifyEventJobQueuedB_66, QueueJobB_66, FetchJobE_66, ScheduleTaskE_Work_66],[NotifyEventJobQueuedB_67, QueueJobB_67, FetchJobE_67, ScheduleTaskE_Work_67],[NotifyEventJobQueuedB_68, QueueJobB_68, FetchJobE_68, ScheduleTaskE_Work_68],[NotifyEventJobQueuedB_69, QueueJobB_69, FetchJobE_69, ScheduleTaskE_Work_69],[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],[DisablePollingE_12, DisablePollingB_12, Insert_Source_B_12, P_1119_12, P_2579_12],[DisablePollingE_13, DisablePollingB_13, Insert_Source_B_13, P_1119_13, P_2579_13],[DisablePollingE_14, DisablePollingB_14, Insert_Source_B_14, P_1119_14, P_2579_14],[DisablePollingE_15, DisablePollingB_15, Insert_Source_B_15, P_1119_15, P_2579_15],[DisablePollingE_16, DisablePollingB_16, Insert_Source_B_16, P_1119_16, P_2579_16],[DisablePollingE_17, DisablePollingB_17, Insert_Source_B_17, P_1119_17, P_2579_17],[DisablePollingE_18, DisablePollingB_18, Insert_Source_B_18, P_1119_18, P_2579_18],[DisablePollingE_19, DisablePollingB_19, Insert_Source_B_19, P_1119_19, P_2579_19],

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:58:45] [INFO ] Flatten gal took : 69 ms
[2024-05-28 14:58:45] [INFO ] Time to serialize gal into /tmp/CTLCardinality5622386734569397896.gal : 10 ms
[2024-05-28 14:58:45] [INFO ] Time to serialize properties into /tmp/CTLCardinality8222350282203999160.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/CTLCardinality5622386734569397896.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8222350282203999160.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 5 CTL formulae.
ITS-tools command line returned an error code 137
[2024-05-28 15:09:55] [INFO ] Flatten gal took : 51 ms
[2024-05-28 15:09:55] [INFO ] Input system was already deterministic with 1642 transitions.
[2024-05-28 15:09:55] [INFO ] Transformed 824 places.
[2024-05-28 15:09:56] [INFO ] Transformed 1642 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 15:10:26] [INFO ] Time to serialize gal into /tmp/CTLCardinality14048270099677878154.gal : 9 ms
[2024-05-28 15:10:26] [INFO ] Time to serialize properties into /tmp/CTLCardinality15709949389431481412.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/CTLCardinality14048270099677878154.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15709949389431481412.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 -...330
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 5 CTL formulae.
ITS-tools command line returned an error code 137
Total runtime 2958089 ms.

BK_STOP 1716909833123

--------------------
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
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLCardinality -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 CTLCardinality -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-S02J06T10"
export BK_EXAMINATION="CTLCardinality"
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-S02J06T10, examination is CTLCardinality"
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-171654446400113"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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