Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r058-smll-174854064700705.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5832
Executing tool itstools
Input is DiscoveryGPU-PT-12a, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r058-smll-174854064700705
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 452K
-rw-r--r-- 1 mcc users 6.7K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 38K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 43K May 29 14:32 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME DiscoveryGPU-PT-12a-CTLCardinality-2023-12
FORMULA_NAME DiscoveryGPU-PT-12a-CTLCardinality-2023-13
FORMULA_NAME DiscoveryGPU-PT-12a-CTLCardinality-2023-14
FORMULA_NAME DiscoveryGPU-PT-12a-CTLCardinality-2023-15
FORMULA_NAME DiscoveryGPU-PT-12a-CTLCardinality-2025-00
FORMULA_NAME DiscoveryGPU-PT-12a-CTLCardinality-2025-01
FORMULA_NAME DiscoveryGPU-PT-12a-CTLCardinality-2025-02
FORMULA_NAME DiscoveryGPU-PT-12a-CTLCardinality-2025-03
FORMULA_NAME DiscoveryGPU-PT-12a-CTLCardinality-2025-04
FORMULA_NAME DiscoveryGPU-PT-12a-CTLCardinality-2025-05
FORMULA_NAME DiscoveryGPU-PT-12a-CTLCardinality-2025-06
FORMULA_NAME DiscoveryGPU-PT-12a-CTLCardinality-2025-07
FORMULA_NAME DiscoveryGPU-PT-12a-CTLCardinality-2025-08
FORMULA_NAME DiscoveryGPU-PT-12a-CTLCardinality-2025-09
FORMULA_NAME DiscoveryGPU-PT-12a-CTLCardinality-2025-10
FORMULA_NAME DiscoveryGPU-PT-12a-CTLCardinality-2025-11

=== Now, execution of the tool begins

BK_START 1748936343457

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DiscoveryGPU-PT-12a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202505121319
[2025-06-03 07:39:05] [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]
[2025-06-03 07:39:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-03 07:39:05] [INFO ] Load time of PNML (sax parser for PT used): 104 ms
[2025-06-03 07:39:05] [INFO ] Transformed 123 places.
[2025-06-03 07:39:05] [INFO ] Transformed 169 transitions.
[2025-06-03 07:39:05] [INFO ] Found NUPN structural information;
[2025-06-03 07:39:05] [INFO ] Parsed PT model containing 123 places and 169 transitions and 543 arcs in 256 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 29 ms.
FORMULA DiscoveryGPU-PT-12a-CTLCardinality-2025-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-12a-CTLCardinality-2025-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 72 out of 123 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 169/169 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 117 transition count 163
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 117 transition count 163
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 16 place count 113 transition count 159
Iterating global reduction 0 with 4 rules applied. Total rules applied 20 place count 113 transition count 159
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 111 transition count 155
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 111 transition count 155
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 0 with 10 rules applied. Total rules applied 34 place count 111 transition count 145
Applied a total of 34 rules in 49 ms. Remains 111 /123 variables (removed 12) and now considering 145/169 (removed 24) transitions.
// Phase 1: matrix 145 rows 111 cols
[2025-06-03 07:39:05] [INFO ] Computed 2 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 07:39:06] [INFO ] Implicit Places using invariants in 363 ms returned []
[2025-06-03 07:39:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 07:39:06] [INFO ] State equation strengthened by 92 read => feed constraints.
[2025-06-03 07:39:06] [INFO ] Implicit Places using invariants and state equation in 292 ms returned []
Implicit Place search using SMT with State Equation took 719 ms to find 0 implicit places.
Running 144 sub problems to find dead transitions.
[2025-06-03 07:39:06] [INFO ] Invariant cache hit.
[2025-06-03 07:39:06] [INFO ] State equation strengthened by 92 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 1 (OVERLAPS) 1/111 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 3 (OVERLAPS) 145/256 variables, 111/113 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/256 variables, 92/205 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/256 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 6 (OVERLAPS) 0/256 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 144 unsolved
No progress, stopping.
After SMT solving in domain Real declared 256/256 variables, and 205 constraints, problems are : Problem set: 0 solved, 144 unsolved in 7041 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 111/111 constraints, ReadFeed: 92/92 constraints, PredecessorRefiner: 144/144 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 144 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 1 (OVERLAPS) 1/111 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 3 (OVERLAPS) 145/256 variables, 111/113 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/256 variables, 92/205 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/256 variables, 144/349 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/256 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 7 (OVERLAPS) 0/256 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 144 unsolved
No progress, stopping.
After SMT solving in domain Int declared 256/256 variables, and 349 constraints, problems are : Problem set: 0 solved, 144 unsolved in 7308 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 111/111 constraints, ReadFeed: 92/92 constraints, PredecessorRefiner: 144/144 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 14459ms problems are : Problem set: 0 solved, 144 unsolved
Search for dead transitions found 0 dead transitions in 14478ms
Starting structural reductions in LTL mode, iteration 1 : 111/123 places, 145/169 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15276 ms. Remains : 111/123 places, 145/169 transitions.
Support contains 72 out of 111 places after structural reductions.
[2025-06-03 07:39:21] [INFO ] Flatten gal took : 84 ms
[2025-06-03 07:39:21] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA DiscoveryGPU-PT-12a-CTLCardinality-2025-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-03 07:39:21] [INFO ] Flatten gal took : 46 ms
[2025-06-03 07:39:21] [INFO ] Input system was already deterministic with 145 transitions.
Support contains 69 out of 111 places (down from 72) after GAL structural reductions.
RANDOM walk for 40000 steps (308 resets) in 1879 ms. (21 steps per ms) remains 2/54 properties
BEST_FIRST walk for 40000 steps (8 resets) in 382 ms. (104 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (25 resets) in 136 ms. (292 steps per ms) remains 2/2 properties
[2025-06-03 07:39:22] [INFO ] Invariant cache hit.
[2025-06-03 07:39:22] [INFO ] State equation strengthened by 92 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem AtomicPropp15 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/8 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1/9 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 14/23 variables, 9/11 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/23 variables, 10/21 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/23 variables, 0/21 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 40/63 variables, 19/40 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/63 variables, 16/56 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/63 variables, 0/56 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 42/105 variables, 16/72 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/105 variables, 15/87 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/105 variables, 0/87 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 28/133 variables, 14/101 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/133 variables, 11/112 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/133 variables, 0/112 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 27/160 variables, 11/123 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/160 variables, 12/135 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/160 variables, 0/135 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 34/194 variables, 12/147 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/194 variables, 12/159 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/194 variables, 0/159 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 26/220 variables, 11/170 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/220 variables, 7/177 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/220 variables, 0/177 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 14/234 variables, 8/185 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/234 variables, 5/190 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/234 variables, 0/190 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 8/242 variables, 4/194 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/242 variables, 1/195 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/242 variables, 0/195 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 8/250 variables, 4/199 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/250 variables, 3/202 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/250 variables, 0/202 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 35 (OVERLAPS) 6/256 variables, 3/205 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/256 variables, 0/205 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 37 (OVERLAPS) 0/256 variables, 0/205 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 256/256 variables, and 205 constraints, problems are : Problem set: 1 solved, 1 unsolved in 577 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 111/111 constraints, ReadFeed: 92/92 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/4 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1/5 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Problem AtomicPropp4 is UNSAT
After SMT solving in domain Int declared 9/256 variables, and 7 constraints, problems are : Problem set: 2 solved, 0 unsolved in 39 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 5/111 constraints, ReadFeed: 0/92 constraints, PredecessorRefiner: 0/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 641ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 2 atomic propositions for a total of 13 simplifications.
[2025-06-03 07:39:23] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2025-06-03 07:39:23] [INFO ] Flatten gal took : 19 ms
FORMULA DiscoveryGPU-PT-12a-CTLCardinality-2025-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-12a-CTLCardinality-2025-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-03 07:39:23] [INFO ] Flatten gal took : 13 ms
[2025-06-03 07:39:23] [INFO ] Input system was already deterministic with 145 transitions.
Support contains 63 out of 111 places (down from 64) after GAL structural reductions.
Computed a total of 15 stabilizing places and 13 stable transitions
Graph (complete) has 322 edges and 111 vertex of which 105 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.3 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 111/111 places, 145/145 transitions.
Graph (complete) has 322 edges and 111 vertex of which 105 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 118 edges and 102 vertex of which 84 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.0 ms
Discarding 18 places :
Also discarding 18 output transitions
Drop transitions (Output transitions of discarded places.) removed 18 transitions
Graph (trivial) has 91 edges and 84 vertex of which 46 / 84 are part of one of the 23 SCC in 2 ms
Free SCC test removed 23 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 61 transition count 110
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 34 rules applied. Total rules applied 49 place count 51 transition count 86
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 50 place count 50 transition count 86
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 61 place count 39 transition count 64
Iterating global reduction 3 with 11 rules applied. Total rules applied 72 place count 39 transition count 64
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 82 place count 29 transition count 44
Iterating global reduction 3 with 10 rules applied. Total rules applied 92 place count 29 transition count 44
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 101 place count 20 transition count 26
Iterating global reduction 3 with 9 rules applied. Total rules applied 110 place count 20 transition count 26
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 119 place count 11 transition count 17
Iterating global reduction 3 with 9 rules applied. Total rules applied 128 place count 11 transition count 17
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 130 place count 11 transition count 15
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 132 place count 10 transition count 14
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 135 place count 7 transition count 11
Applied a total of 135 rules in 44 ms. Remains 7 /111 variables (removed 104) and now considering 11/145 (removed 134) transitions.
[2025-06-03 07:39:23] [INFO ] Flow matrix only has 9 transitions (discarded 2 similar events)
// Phase 1: matrix 9 rows 7 cols
[2025-06-03 07:39:23] [INFO ] Computed 0 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 07:39:23] [INFO ] Implicit Places using invariants in 19 ms returned []
[2025-06-03 07:39:23] [INFO ] Flow matrix only has 9 transitions (discarded 2 similar events)
[2025-06-03 07:39:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 07:39:23] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 07:39:23] [INFO ] Redundant transitions in 1 ms returned []
Running 6 sub problems to find dead transitions.
[2025-06-03 07:39:23] [INFO ] Flow matrix only has 9 transitions (discarded 2 similar events)
[2025-06-03 07:39:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 8/12 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 3/15 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 0/15 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 15/16 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 163 ms.
Refiners :[State Equation: 7/7 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 8/12 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 3/15 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/15 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/15 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 15/16 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 231 ms.
Refiners :[State Equation: 7/7 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 400ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 401ms
Starting structural reductions in SI_CTL mode, iteration 1 : 7/111 places, 11/145 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 507 ms. Remains : 7/111 places, 11/145 transitions.
[2025-06-03 07:39:23] [INFO ] Flatten gal took : 4 ms
[2025-06-03 07:39:23] [INFO ] Flatten gal took : 1 ms
[2025-06-03 07:39:23] [INFO ] Input system was already deterministic with 11 transitions.
[2025-06-03 07:39:23] [INFO ] Flatten gal took : 1 ms
[2025-06-03 07:39:23] [INFO ] Flatten gal took : 1 ms
[2025-06-03 07:39:23] [INFO ] Time to serialize gal into /tmp/CTLCardinality2088104905427600879.gal : 3 ms
[2025-06-03 07:39:23] [INFO ] Time to serialize properties into /tmp/CTLCardinality17360880036649546932.ctl : 9 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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality2088104905427600879.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17360880036649546932.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,869,0.036996,3744,2,28,5,357,6,0,36,434,0


Converting to forward existential form...Done !
original formula: AG(EF(((p88==0)||(p76==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((p88==0)||(p76==1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t10, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/...171
(forward)formula 0,1,0.04088,4000,1,0,28,554,40,12,199,564,29
FORMULA DiscoveryGPU-PT-12a-CTLCardinality-2025-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 145/145 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 103 transition count 137
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 103 transition count 137
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 22 place count 97 transition count 131
Iterating global reduction 0 with 6 rules applied. Total rules applied 28 place count 97 transition count 131
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 32 place count 93 transition count 127
Iterating global reduction 0 with 4 rules applied. Total rules applied 36 place count 93 transition count 127
Applied a total of 36 rules in 17 ms. Remains 93 /111 variables (removed 18) and now considering 127/145 (removed 18) transitions.
// Phase 1: matrix 127 rows 93 cols
[2025-06-03 07:39:24] [INFO ] Computed 2 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 07:39:24] [INFO ] Implicit Places using invariants in 109 ms returned []
[2025-06-03 07:39:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 07:39:24] [INFO ] State equation strengthened by 86 read => feed constraints.
[2025-06-03 07:39:24] [INFO ] Implicit Places using invariants and state equation in 287 ms returned [92]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 402 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 92/111 places, 127/145 transitions.
Applied a total of 0 rules in 6 ms. Remains 92 /92 variables (removed 0) and now considering 127/127 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 425 ms. Remains : 92/111 places, 127/145 transitions.
[2025-06-03 07:39:24] [INFO ] Flatten gal took : 8 ms
[2025-06-03 07:39:24] [INFO ] Flatten gal took : 9 ms
[2025-06-03 07:39:24] [INFO ] Input system was already deterministic with 127 transitions.
[2025-06-03 07:39:24] [INFO ] Flatten gal took : 8 ms
[2025-06-03 07:39:24] [INFO ] Flatten gal took : 8 ms
[2025-06-03 07:39:24] [INFO ] Time to serialize gal into /tmp/CTLCardinality9805059037731368012.gal : 3 ms
[2025-06-03 07:39:24] [INFO ] Time to serialize properties into /tmp/CTLCardinality14496186553964302372.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality9805059037731368012.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14496186553964302372.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.58313e+11,14.5667,308856,2,72460,5,2.09102e+06,6,0,481,1.07724e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-06-03 07:39:54] [INFO ] Flatten gal took : 10 ms
[2025-06-03 07:39:54] [INFO ] Applying decomposition
[2025-06-03 07:39:54] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph10192000409781896524.txt' '-o' '/tmp/graph10192000409781896524.bin' '-w' '/tmp/graph10192000409781896524.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph10192000409781896524.bin' '-l' '-1' '-v' '-w' '/tmp/graph10192000409781896524.weights' '-q' '0' '-e' '0.001'
[2025-06-03 07:39:54] [INFO ] Decomposing Gal with order
[2025-06-03 07:39:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 07:39:55] [INFO ] Removed a total of 68 redundant transitions.
[2025-06-03 07:39:55] [INFO ] Flatten gal took : 96 ms
[2025-06-03 07:39:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 86 labels/synchronizations in 19 ms.
[2025-06-03 07:39:55] [INFO ] Time to serialize gal into /tmp/CTLCardinality6830534598486688811.gal : 7 ms
[2025-06-03 07:39:55] [INFO ] Time to serialize properties into /tmp/CTLCardinality4202142509575575219.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality6830534598486688811.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4202142509575575219.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.58313e+11,0.230189,11044,409,79,14928,1913,203,34061,45,10709,0


Converting to forward existential form...Done !
original formula: EX(AG(EX(((AF((i13.u25.p120==0)) + EG(((i6.u9.p41==0)||(i7.u13.p59==1)))) + (i5.u8.p37==1)))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U !(EX(((!(EG(!((i13.u25.p120==0)))) + EG(((i6.u9.p41==0)||(i7.u13.p59==1)))) + (i5.u8.p37...175
Reverse transition relation is NOT exact ! Due to transitions t28, t30, t34, t36, t40, t41, t45, t47, i0.t49, i0.t32, i0.u0.t120, i0.u16.t115, i0.u22.t126,...395
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
(forward)formula 0,0,3.42063,114852,1,0,225224,13432,1228,536743,257,106085,199582
FORMULA DiscoveryGPU-PT-12a-CTLCardinality-2025-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 145/145 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 102 transition count 136
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 102 transition count 136
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 24 place count 96 transition count 130
Iterating global reduction 0 with 6 rules applied. Total rules applied 30 place count 96 transition count 130
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 35 place count 91 transition count 125
Iterating global reduction 0 with 5 rules applied. Total rules applied 40 place count 91 transition count 125
Applied a total of 40 rules in 17 ms. Remains 91 /111 variables (removed 20) and now considering 125/145 (removed 20) transitions.
// Phase 1: matrix 125 rows 91 cols
[2025-06-03 07:39:58] [INFO ] Computed 2 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 07:39:58] [INFO ] Implicit Places using invariants in 145 ms returned []
[2025-06-03 07:39:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 07:39:58] [INFO ] State equation strengthened by 85 read => feed constraints.
[2025-06-03 07:39:59] [INFO ] Implicit Places using invariants and state equation in 269 ms returned [90]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 428 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 90/111 places, 125/145 transitions.
Applied a total of 0 rules in 3 ms. Remains 90 /90 variables (removed 0) and now considering 125/125 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 448 ms. Remains : 90/111 places, 125/145 transitions.
[2025-06-03 07:39:59] [INFO ] Flatten gal took : 8 ms
[2025-06-03 07:39:59] [INFO ] Flatten gal took : 8 ms
[2025-06-03 07:39:59] [INFO ] Input system was already deterministic with 125 transitions.
[2025-06-03 07:39:59] [INFO ] Flatten gal took : 12 ms
[2025-06-03 07:39:59] [INFO ] Flatten gal took : 7 ms
[2025-06-03 07:39:59] [INFO ] Time to serialize gal into /tmp/CTLCardinality755086312270962629.gal : 1 ms
[2025-06-03 07:39:59] [INFO ] Time to serialize properties into /tmp/CTLCardinality18198090655351060003.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality755086312270962629.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18198090655351060003.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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.
[2025-06-03 07:40:29] [INFO ] Flatten gal took : 8 ms
[2025-06-03 07:40:29] [INFO ] Applying decomposition
[2025-06-03 07:40:29] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph5272844985178247926.txt' '-o' '/tmp/graph5272844985178247926.bin' '-w' '/tmp/graph5272844985178247926.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph5272844985178247926.bin' '-l' '-1' '-v' '-w' '/tmp/graph5272844985178247926.weights' '-q' '0' '-e' '0.001'
[2025-06-03 07:40:29] [INFO ] Decomposing Gal with order
[2025-06-03 07:40:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 07:40:29] [INFO ] Removed a total of 66 redundant transitions.
[2025-06-03 07:40:29] [INFO ] Flatten gal took : 33 ms
[2025-06-03 07:40:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 83 labels/synchronizations in 6 ms.
[2025-06-03 07:40:29] [INFO ] Time to serialize gal into /tmp/CTLCardinality10548781276153003165.gal : 4 ms
[2025-06-03 07:40:29] [INFO ] Time to serialize properties into /tmp/CTLCardinality15496814441323052755.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality10548781276153003165.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15496814441323052755.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.80434e+11,0.252501,11652,367,118,16659,1334,203,29436,48,7561,0


Converting to forward existential form...Done !
original formula: AX(EX(EF(((i10.u16.p79==0) * EF((i0.u0.p113==1))))))
=> equivalent forward existential formula: [(EY(Init) * !(EX(E(TRUE U ((i10.u16.p79==0) * E(TRUE U (i0.u0.p113==1)))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t24, t30, t32, t34, t36, t41, t43, t47, t49, u2.t118, i0.u0.t1, i0.u0.t119, i0.u23.t112, i1.t...398
(forward)formula 0,1,0.498708,17284,1,0,33212,3022,1048,44557,236,13055,32669
FORMULA DiscoveryGPU-PT-12a-CTLCardinality-2025-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 111/111 places, 145/145 transitions.
Graph (complete) has 322 edges and 111 vertex of which 105 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 7 Pre rules applied. Total rules applied 1 place count 105 transition count 132
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 15 place count 98 transition count 132
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 24 place count 89 transition count 123
Iterating global reduction 0 with 9 rules applied. Total rules applied 33 place count 89 transition count 123
Applied a total of 33 rules in 21 ms. Remains 89 /111 variables (removed 22) and now considering 123/145 (removed 22) transitions.
// Phase 1: matrix 123 rows 89 cols
[2025-06-03 07:40:29] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 07:40:30] [INFO ] Implicit Places using invariants in 124 ms returned []
[2025-06-03 07:40:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 07:40:30] [INFO ] State equation strengthened by 85 read => feed constraints.
[2025-06-03 07:40:30] [INFO ] Implicit Places using invariants and state equation in 257 ms returned [88]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 407 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 88/111 places, 123/145 transitions.
Partial Post-agglomeration rule applied 4 times.
Drop transitions (Partial Post agglomeration) removed 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 88 transition count 123
Applied a total of 4 rules in 33 ms. Remains 88 /88 variables (removed 0) and now considering 123/123 (removed 0) transitions.
[2025-06-03 07:40:30] [INFO ] Flow matrix only has 122 transitions (discarded 1 similar events)
// Phase 1: matrix 122 rows 88 cols
[2025-06-03 07:40:30] [INFO ] Computed 1 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 07:40:30] [INFO ] Implicit Places using invariants in 107 ms returned []
[2025-06-03 07:40:30] [INFO ] Flow matrix only has 122 transitions (discarded 1 similar events)
[2025-06-03 07:40:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 07:40:30] [INFO ] State equation strengthened by 64 read => feed constraints.
[2025-06-03 07:40:30] [INFO ] Implicit Places using invariants and state equation in 175 ms returned []
Implicit Place search using SMT with State Equation took 291 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 88/111 places, 123/145 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 755 ms. Remains : 88/111 places, 123/145 transitions.
[2025-06-03 07:40:30] [INFO ] Flatten gal took : 5 ms
[2025-06-03 07:40:30] [INFO ] Flatten gal took : 6 ms
[2025-06-03 07:40:30] [INFO ] Input system was already deterministic with 123 transitions.
[2025-06-03 07:40:30] [INFO ] Flatten gal took : 6 ms
[2025-06-03 07:40:30] [INFO ] Flatten gal took : 25 ms
[2025-06-03 07:40:30] [INFO ] Time to serialize gal into /tmp/CTLCardinality9948879635790979214.gal : 1 ms
[2025-06-03 07:40:30] [INFO ] Time to serialize properties into /tmp/CTLCardinality3885893172652468665.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality9948879635790979214.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3885893172652468665.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.922e+11,2.65373,64200,2,20831,5,424590,6,0,463,187222,0


Converting to forward existential form...Done !
original formula: (AF(EG(((AG(((p100!=0)&&(p50!=1))) + AF(((p103==0)&&(p54==1)))) * (p15==1)))) + AG((EF(((p107==0)||(p40==1))) * ((p94==0)||(p49==1)))))
=> equivalent forward existential formula: ([(FwdU((Init * !(!(EG(!(EG(((!(E(TRUE U !(((p100!=0)&&(p50!=1))))) + !(EG(!(((p103==0)&&(p54==1)))))) * (p15==1...381
Reverse transition relation is NOT exact ! Due to transitions t3, t25, t27, t29, t31, t33, t36, t37, t39, t40, t42, t106, t107, t108, t109, t110, t111, t11...299
Detected timeout of ITS tools.
[2025-06-03 07:41:00] [INFO ] Flatten gal took : 10 ms
[2025-06-03 07:41:00] [INFO ] Applying decomposition
[2025-06-03 07:41:00] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph11619517971923268189.txt' '-o' '/tmp/graph11619517971923268189.bin' '-w' '/tmp/graph11619517971923268189.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph11619517971923268189.bin' '-l' '-1' '-v' '-w' '/tmp/graph11619517971923268189.weights' '-q' '0' '-e' '0.001'
[2025-06-03 07:41:00] [INFO ] Decomposing Gal with order
[2025-06-03 07:41:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 07:41:00] [INFO ] Removed a total of 70 redundant transitions.
[2025-06-03 07:41:00] [INFO ] Flatten gal took : 22 ms
[2025-06-03 07:41:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 83 labels/synchronizations in 9 ms.
[2025-06-03 07:41:00] [INFO ] Time to serialize gal into /tmp/CTLCardinality2620564653708581142.gal : 3 ms
[2025-06-03 07:41:00] [INFO ] Time to serialize properties into /tmp/CTLCardinality328920491453471683.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality2620564653708581142.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality328920491453471683.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.922e+11,0.164203,9184,292,92,9759,858,219,29760,39,6023,0


Converting to forward existential form...Done !
original formula: (AF(EG(((AG(((u20.p100!=0)&&(i3.i0.u10.p50!=1))) + AF(((i9.u21.p103==0)&&(i4.u11.p54==1)))) * (i1.u2.p15==1)))) + AG((EF(((i3.i1.u23.p107...221
=> equivalent forward existential formula: ([(FwdU((Init * !(!(EG(!(EG(((!(E(TRUE U !(((u20.p100!=0)&&(i3.i0.u10.p50!=1))))) + !(EG(!(((i9.u21.p103==0)&&(i...483
Reverse transition relation is NOT exact ! Due to transitions t25, t31, t33, t36, t37, t39, t40, t42, t73, t120, i0.u0.t112, i1.u2.t111, i2.u4.t113, i3.i0....397
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found a local SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
(forward)formula 0,0,12.8687,202828,1,0,259031,10334,1458,1.30063e+06,193,61915,125129
FORMULA DiscoveryGPU-PT-12a-CTLCardinality-2025-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 145/145 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 102 transition count 136
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 102 transition count 136
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 25 place count 95 transition count 129
Iterating global reduction 0 with 7 rules applied. Total rules applied 32 place count 95 transition count 129
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 36 place count 91 transition count 125
Iterating global reduction 0 with 4 rules applied. Total rules applied 40 place count 91 transition count 125
Applied a total of 40 rules in 20 ms. Remains 91 /111 variables (removed 20) and now considering 125/145 (removed 20) transitions.
// Phase 1: matrix 125 rows 91 cols
[2025-06-03 07:41:13] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 07:41:14] [INFO ] Implicit Places using invariants in 214 ms returned []
[2025-06-03 07:41:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 07:41:14] [INFO ] State equation strengthened by 85 read => feed constraints.
[2025-06-03 07:41:14] [INFO ] Implicit Places using invariants and state equation in 574 ms returned [90]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 807 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 90/111 places, 125/145 transitions.
Applied a total of 0 rules in 6 ms. Remains 90 /90 variables (removed 0) and now considering 125/125 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 834 ms. Remains : 90/111 places, 125/145 transitions.
[2025-06-03 07:41:14] [INFO ] Flatten gal took : 5 ms
[2025-06-03 07:41:14] [INFO ] Flatten gal took : 5 ms
[2025-06-03 07:41:14] [INFO ] Input system was already deterministic with 125 transitions.
[2025-06-03 07:41:14] [INFO ] Flatten gal took : 20 ms
[2025-06-03 07:41:14] [INFO ] Flatten gal took : 28 ms
[2025-06-03 07:41:14] [INFO ] Time to serialize gal into /tmp/CTLCardinality14474748331532149669.gal : 1 ms
[2025-06-03 07:41:14] [INFO ] Time to serialize properties into /tmp/CTLCardinality3364894175161941527.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality14474748331532149669.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3364894175161941527.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.80434e+11,3.38556,86492,2,18938,5,613878,6,0,472,257757,0


Converting to forward existential form...Done !
original formula: AX(((E(((p99==0) * EX(((p56==0)||(p33==1)))) U E((p30!=0) U !(((p115==0)||(p44==1))))) * EF(((p90==0)||(p116==1)))) * (((E(EX(((p35==0)||...241
=> equivalent forward existential formula: (([(EY(Init) * !(E(((p99==0) * EX(((p56==0)||(p33==1)))) U E((p30!=0) U !(((p115==0)||(p44==1)))))))] = FALSE * ...400
Reverse transition relation is NOT exact ! Due to transitions t17, t24, t28, t30, t32, t34, t38, t40, t41, t43, t45, t47, t49, t112, t113, t114, t115, t116...304
(forward)formula 0,1,26.9116,576736,1,0,461,3.23566e+06,298,260,2911,3.3278e+06,605
FORMULA DiscoveryGPU-PT-12a-CTLCardinality-2025-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 145/145 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 104 transition count 138
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 104 transition count 138
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 20 place count 98 transition count 132
Iterating global reduction 0 with 6 rules applied. Total rules applied 26 place count 98 transition count 132
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 30 place count 94 transition count 128
Iterating global reduction 0 with 4 rules applied. Total rules applied 34 place count 94 transition count 128
Applied a total of 34 rules in 8 ms. Remains 94 /111 variables (removed 17) and now considering 128/145 (removed 17) transitions.
// Phase 1: matrix 128 rows 94 cols
[2025-06-03 07:41:41] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 07:41:42] [INFO ] Implicit Places using invariants in 244 ms returned []
[2025-06-03 07:41:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 07:41:42] [INFO ] State equation strengthened by 86 read => feed constraints.
[2025-06-03 07:41:42] [INFO ] Implicit Places using invariants and state equation in 407 ms returned [93]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 661 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 93/111 places, 128/145 transitions.
Applied a total of 0 rules in 2 ms. Remains 93 /93 variables (removed 0) and now considering 128/128 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 672 ms. Remains : 93/111 places, 128/145 transitions.
[2025-06-03 07:41:42] [INFO ] Flatten gal took : 4 ms
[2025-06-03 07:41:42] [INFO ] Flatten gal took : 4 ms
[2025-06-03 07:41:42] [INFO ] Input system was already deterministic with 128 transitions.
[2025-06-03 07:41:42] [INFO ] Flatten gal took : 5 ms
[2025-06-03 07:41:42] [INFO ] Flatten gal took : 4 ms
[2025-06-03 07:41:42] [INFO ] Time to serialize gal into /tmp/CTLCardinality10459814432712626814.gal : 2 ms
[2025-06-03 07:41:42] [INFO ] Time to serialize properties into /tmp/CTLCardinality16986940324146313029.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality10459814432712626814.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16986940324146313029.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,8.30288e+11,5.59841,126932,2,23840,5,890858,6,0,486,399424,0


Converting to forward existential form...Done !
original formula: AG(((p93==0) * A(((p97==0)||(p88==1)) U EX(((p101==0)||(p104==1))))))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !((p93==0)))] = FALSE * ([((FwdU(FwdU(Init,TRUE),!(EX(((p101==0)||(p104==1))))) * !(((p97==...278
Reverse transition relation is NOT exact ! Due to transitions t6, t25, t29, t33, t35, t37, t39, t41, t42, t44, t46, t48, t114, t115, t116, t117, t118, t119...305
(forward)formula 0,0,20.1943,400380,1,0,185,1.82387e+06,278,122,2862,2.82581e+06,271
FORMULA DiscoveryGPU-PT-12a-CTLCardinality-2025-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 111/111 places, 145/145 transitions.
Graph (complete) has 322 edges and 111 vertex of which 105 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 118 edges and 102 vertex of which 84 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.1 ms
Discarding 18 places :
Also discarding 18 output transitions
Drop transitions (Output transitions of discarded places.) removed 18 transitions
Graph (trivial) has 93 edges and 84 vertex of which 46 / 84 are part of one of the 23 SCC in 0 ms
Free SCC test removed 23 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 61 transition count 108
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 52 place count 49 transition count 85
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 63 place count 38 transition count 63
Iterating global reduction 2 with 11 rules applied. Total rules applied 74 place count 38 transition count 63
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 84 place count 28 transition count 43
Iterating global reduction 2 with 10 rules applied. Total rules applied 94 place count 28 transition count 43
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 104 place count 18 transition count 23
Iterating global reduction 2 with 10 rules applied. Total rules applied 114 place count 18 transition count 23
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 124 place count 8 transition count 13
Iterating global reduction 2 with 10 rules applied. Total rules applied 134 place count 8 transition count 13
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 135 place count 8 transition count 12
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 136 place count 8 transition count 11
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 137 place count 7 transition count 11
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 139 place count 5 transition count 9
Applied a total of 139 rules in 11 ms. Remains 5 /111 variables (removed 106) and now considering 9/145 (removed 136) transitions.
[2025-06-03 07:42:02] [INFO ] Flow matrix only has 7 transitions (discarded 2 similar events)
// Phase 1: matrix 7 rows 5 cols
[2025-06-03 07:42:02] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 07:42:02] [INFO ] Implicit Places using invariants in 26 ms returned []
[2025-06-03 07:42:02] [INFO ] Flow matrix only has 7 transitions (discarded 2 similar events)
[2025-06-03 07:42:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 07:42:03] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 07:42:03] [INFO ] Redundant transitions in 0 ms returned []
Running 5 sub problems to find dead transitions.
[2025-06-03 07:42:03] [INFO ] Flow matrix only has 7 transitions (discarded 2 similar events)
[2025-06-03 07:42:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 6/9 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 2/11 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 0/11 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 11/12 variables, and 5 constraints, problems are : Problem set: 0 solved, 5 unsolved in 107 ms.
Refiners :[State Equation: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 6/9 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 2/11 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/11 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 0/11 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 11/12 variables, and 10 constraints, problems are : Problem set: 0 solved, 5 unsolved in 136 ms.
Refiners :[State Equation: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 255ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 255ms
Starting structural reductions in SI_CTL mode, iteration 1 : 5/111 places, 9/145 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 362 ms. Remains : 5/111 places, 9/145 transitions.
[2025-06-03 07:42:03] [INFO ] Flatten gal took : 1 ms
[2025-06-03 07:42:03] [INFO ] Flatten gal took : 1 ms
[2025-06-03 07:42:03] [INFO ] Input system was already deterministic with 9 transitions.
[2025-06-03 07:42:03] [INFO ] Flatten gal took : 1 ms
[2025-06-03 07:42:03] [INFO ] Flatten gal took : 0 ms
[2025-06-03 07:42:03] [INFO ] Time to serialize gal into /tmp/CTLCardinality7452235788516822817.gal : 0 ms
[2025-06-03 07:42:03] [INFO ] Time to serialize properties into /tmp/CTLCardinality17598610287365619993.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality7452235788516822817.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17598610287365619993.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,312,0.002877,3660,2,19,5,135,6,0,25,135,0


Converting to forward existential form...Done !
original formula: AF(EG(EF((p45==1))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(E(TRUE U (p45==1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t2, t3, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total...165
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,0.005567,3916,1,0,24,256,48,15,155,366,31
FORMULA DiscoveryGPU-PT-12a-CTLCardinality-2025-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 145/145 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 102 transition count 136
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 102 transition count 136
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 25 place count 95 transition count 129
Iterating global reduction 0 with 7 rules applied. Total rules applied 32 place count 95 transition count 129
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 37 place count 90 transition count 124
Iterating global reduction 0 with 5 rules applied. Total rules applied 42 place count 90 transition count 124
Applied a total of 42 rules in 7 ms. Remains 90 /111 variables (removed 21) and now considering 124/145 (removed 21) transitions.
// Phase 1: matrix 124 rows 90 cols
[2025-06-03 07:42:03] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 07:42:03] [INFO ] Implicit Places using invariants in 115 ms returned []
[2025-06-03 07:42:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 07:42:03] [INFO ] State equation strengthened by 85 read => feed constraints.
[2025-06-03 07:42:03] [INFO ] Implicit Places using invariants and state equation in 228 ms returned [89]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 360 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 89/111 places, 124/145 transitions.
Applied a total of 0 rules in 1 ms. Remains 89 /89 variables (removed 0) and now considering 124/124 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 370 ms. Remains : 89/111 places, 124/145 transitions.
[2025-06-03 07:42:03] [INFO ] Flatten gal took : 7 ms
[2025-06-03 07:42:03] [INFO ] Flatten gal took : 4 ms
[2025-06-03 07:42:03] [INFO ] Input system was already deterministic with 124 transitions.
[2025-06-03 07:42:03] [INFO ] Flatten gal took : 6 ms
[2025-06-03 07:42:03] [INFO ] Flatten gal took : 4 ms
[2025-06-03 07:42:03] [INFO ] Time to serialize gal into /tmp/CTLCardinality4009616114189743639.gal : 1 ms
[2025-06-03 07:42:03] [INFO ] Time to serialize properties into /tmp/CTLCardinality14288906903298409893.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality4009616114189743639.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14288906903298409893.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.20086e+11,3.52578,88692,2,18824,5,626894,6,0,467,253456,0


Converting to forward existential form...Done !
original formula: EG(((EX((p85==1)) + (p50==0)) + ((p95==1)&&(p17==0))))
=> equivalent forward existential formula: [FwdG(Init,((EX((p85==1)) + (p50==0)) + ((p95==1)&&(p17==0))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t27, t29, t31, t33, t35, t37, t39, t40, t42, t44, t46, t48, t111, t112, t113, t114, t115, t11...299
(forward)formula 0,0,14.7428,298328,1,0,181,1.38464e+06,272,121,2758,1.94809e+06,265
FORMULA DiscoveryGPU-PT-12a-CTLCardinality-2023-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 145/145 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 103 transition count 137
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 103 transition count 137
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 21 place count 98 transition count 132
Iterating global reduction 0 with 5 rules applied. Total rules applied 26 place count 98 transition count 132
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 29 place count 95 transition count 129
Iterating global reduction 0 with 3 rules applied. Total rules applied 32 place count 95 transition count 129
Applied a total of 32 rules in 8 ms. Remains 95 /111 variables (removed 16) and now considering 129/145 (removed 16) transitions.
// Phase 1: matrix 129 rows 95 cols
[2025-06-03 07:42:18] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 07:42:18] [INFO ] Implicit Places using invariants in 163 ms returned []
[2025-06-03 07:42:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 07:42:18] [INFO ] State equation strengthened by 87 read => feed constraints.
[2025-06-03 07:42:19] [INFO ] Implicit Places using invariants and state equation in 428 ms returned [94]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 621 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 94/111 places, 129/145 transitions.
Applied a total of 0 rules in 2 ms. Remains 94 /94 variables (removed 0) and now considering 129/129 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 631 ms. Remains : 94/111 places, 129/145 transitions.
[2025-06-03 07:42:19] [INFO ] Flatten gal took : 4 ms
[2025-06-03 07:42:19] [INFO ] Flatten gal took : 4 ms
[2025-06-03 07:42:19] [INFO ] Input system was already deterministic with 129 transitions.
[2025-06-03 07:42:19] [INFO ] Flatten gal took : 4 ms
[2025-06-03 07:42:19] [INFO ] Flatten gal took : 4 ms
[2025-06-03 07:42:19] [INFO ] Time to serialize gal into /tmp/CTLCardinality9924054856413883788.gal : 1 ms
[2025-06-03 07:42:19] [INFO ] Time to serialize properties into /tmp/CTLCardinality17903650532091593338.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality9924054856413883788.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17903650532091593338.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,8.87498e+11,5.59103,131948,2,30039,5,946923,6,0,491,391232,0


Converting to forward existential form...Done !
original formula: (A(((p81==1) + AF(EG(EF((p8==0))))) U ((p32!=1) + EX(!(((p29!=1)&&(p109==1)))))) * AG(EX(EG(((p109==0)&&(p26==0))))))
=> equivalent forward existential formula: (([(((FwdU(Init,!(((p32!=1) + EX(!(((p29!=1)&&(p109==1))))))) * !(((p81==1) + !(EG(!(EG(E(TRUE U (p8==0)))))))))...349
Reverse transition relation is NOT exact ! Due to transitions t29, t31, t33, t35, t39, t41, t42, t44, t46, t50, t105, t108, t115, t116, t117, t118, t119, t...308
Detected timeout of ITS tools.
[2025-06-03 07:42:49] [INFO ] Flatten gal took : 3 ms
[2025-06-03 07:42:49] [INFO ] Applying decomposition
[2025-06-03 07:42:49] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph11417202191541955622.txt' '-o' '/tmp/graph11417202191541955622.bin' '-w' '/tmp/graph11417202191541955622.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph11417202191541955622.bin' '-l' '-1' '-v' '-w' '/tmp/graph11417202191541955622.weights' '-q' '0' '-e' '0.001'
[2025-06-03 07:42:49] [INFO ] Decomposing Gal with order
[2025-06-03 07:42:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 07:42:49] [INFO ] Removed a total of 70 redundant transitions.
[2025-06-03 07:42:49] [INFO ] Flatten gal took : 12 ms
[2025-06-03 07:42:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 89 labels/synchronizations in 9 ms.
[2025-06-03 07:42:49] [INFO ] Time to serialize gal into /tmp/CTLCardinality5458510040899112044.gal : 14 ms
[2025-06-03 07:42:49] [INFO ] Time to serialize properties into /tmp/CTLCardinality9186104946929432492.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality5458510040899112044.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9186104946929432492.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,8.87498e+11,0.285464,11512,406,66,16362,1330,209,31251,43,8295,0


Converting to forward existential form...Done !
original formula: (A(((i8.u18.p81==1) + AF(EG(EF((i12.u2.p8==0))))) U ((i3.u7.p32!=1) + EX(!(((i2.u6.p29!=1)&&(u24.p109==1)))))) * AG(EX(EG(((u24.p109==0)&...175
=> equivalent forward existential formula: (([(((FwdU(Init,!(((i3.u7.p32!=1) + EX(!(((i2.u6.p29!=1)&&(u24.p109==1))))))) * !(((i8.u18.p81==1) + !(EG(!(EG(E...421
Reverse transition relation is NOT exact ! Due to transitions t29, t31, t35, t39, t41, t42, t44, t46, t105, t108, i0.t50, i0.t33, i0.u16.t117, i0.u23.t128,...408
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
(forward)formula 0,0,3.47173,96248,1,0,166825,4205,1186,490659,214,35686,122496
FORMULA DiscoveryGPU-PT-12a-CTLCardinality-2023-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 145/145 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 104 transition count 138
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 104 transition count 138
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 20 place count 98 transition count 132
Iterating global reduction 0 with 6 rules applied. Total rules applied 26 place count 98 transition count 132
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 31 place count 93 transition count 127
Iterating global reduction 0 with 5 rules applied. Total rules applied 36 place count 93 transition count 127
Applied a total of 36 rules in 5 ms. Remains 93 /111 variables (removed 18) and now considering 127/145 (removed 18) transitions.
// Phase 1: matrix 127 rows 93 cols
[2025-06-03 07:42:52] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 07:42:53] [INFO ] Implicit Places using invariants in 73 ms returned []
[2025-06-03 07:42:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 07:42:53] [INFO ] State equation strengthened by 86 read => feed constraints.
[2025-06-03 07:42:53] [INFO ] Implicit Places using invariants and state equation in 257 ms returned [92]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 334 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 92/111 places, 127/145 transitions.
Applied a total of 0 rules in 1 ms. Remains 92 /92 variables (removed 0) and now considering 127/127 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 340 ms. Remains : 92/111 places, 127/145 transitions.
[2025-06-03 07:42:53] [INFO ] Flatten gal took : 5 ms
[2025-06-03 07:42:53] [INFO ] Flatten gal took : 4 ms
[2025-06-03 07:42:53] [INFO ] Input system was already deterministic with 127 transitions.
[2025-06-03 07:42:53] [INFO ] Flatten gal took : 4 ms
[2025-06-03 07:42:53] [INFO ] Flatten gal took : 4 ms
[2025-06-03 07:42:53] [INFO ] Time to serialize gal into /tmp/CTLCardinality13904869589110317196.gal : 7 ms
[2025-06-03 07:42:53] [INFO ] Time to serialize properties into /tmp/CTLCardinality17426851585125798324.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality13904869589110317196.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17426851585125798324.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.97841e+11,19.7659,400848,2,96273,5,2.51496e+06,6,0,482,1.56202e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-06-03 07:43:23] [INFO ] Flatten gal took : 4 ms
[2025-06-03 07:43:23] [INFO ] Applying decomposition
[2025-06-03 07:43:23] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph3952791342331171493.txt' '-o' '/tmp/graph3952791342331171493.bin' '-w' '/tmp/graph3952791342331171493.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph3952791342331171493.bin' '-l' '-1' '-v' '-w' '/tmp/graph3952791342331171493.weights' '-q' '0' '-e' '0.001'
[2025-06-03 07:43:23] [INFO ] Decomposing Gal with order
[2025-06-03 07:43:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 07:43:23] [INFO ] Removed a total of 68 redundant transitions.
[2025-06-03 07:43:23] [INFO ] Flatten gal took : 22 ms
[2025-06-03 07:43:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 81 labels/synchronizations in 4 ms.
[2025-06-03 07:43:23] [INFO ] Time to serialize gal into /tmp/CTLCardinality11246532254753071448.gal : 2 ms
[2025-06-03 07:43:23] [INFO ] Time to serialize properties into /tmp/CTLCardinality8146066116254719702.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality11246532254753071448.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8146066116254719702.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.97841e+11,0.528685,18728,1033,149,30613,2189,225,68896,46,14755,0


Converting to forward existential form...Done !
original formula: EG((EX((!(E((i0.u1.p4==1) U (u12.p58==1))) + AX((i0.u21.p105!=0)))) + (AF((((i13.u23.p112!=0)&&(i13.u24.p114!=1))&&((i11.u20.p100==0)||(i...200
=> equivalent forward existential formula: [FwdG(Init,(EX((!(E((i0.u1.p4==1) U (u12.p58==1))) + !(EX(!((i0.u21.p105!=0)))))) + (!(EG(!((((i13.u23.p112!=0)&...273
Reverse transition relation is NOT exact ! Due to transitions t25, t31, t33, t42, t44, t46, t48, t101, t108, u2.t120, i0.t50, i0.t37, i0.u1.t41, i0.u7.t118...408
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 2
Fast SCC detection found a local SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
(forward)formula 0,1,29.6718,437184,1,0,803940,8595,1306,1.21988e+06,228,86216,547111
FORMULA DiscoveryGPU-PT-12a-CTLCardinality-2023-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 145/145 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 105 transition count 139
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 105 transition count 139
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 102 transition count 136
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 102 transition count 136
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 100 transition count 134
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 100 transition count 134
Applied a total of 22 rules in 7 ms. Remains 100 /111 variables (removed 11) and now considering 134/145 (removed 11) transitions.
// Phase 1: matrix 134 rows 100 cols
[2025-06-03 07:43:53] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 07:43:53] [INFO ] Implicit Places using invariants in 127 ms returned []
[2025-06-03 07:43:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 07:43:53] [INFO ] State equation strengthened by 89 read => feed constraints.
[2025-06-03 07:43:53] [INFO ] Implicit Places using invariants and state equation in 497 ms returned [99]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 628 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 99/111 places, 134/145 transitions.
Applied a total of 0 rules in 1 ms. Remains 99 /99 variables (removed 0) and now considering 134/134 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 636 ms. Remains : 99/111 places, 134/145 transitions.
[2025-06-03 07:43:53] [INFO ] Flatten gal took : 3 ms
[2025-06-03 07:43:53] [INFO ] Flatten gal took : 4 ms
[2025-06-03 07:43:53] [INFO ] Input system was already deterministic with 134 transitions.
[2025-06-03 07:43:53] [INFO ] Flatten gal took : 4 ms
[2025-06-03 07:43:53] [INFO ] Flatten gal took : 4 ms
[2025-06-03 07:43:53] [INFO ] Time to serialize gal into /tmp/CTLCardinality13771518102942519264.gal : 1 ms
[2025-06-03 07:43:53] [INFO ] Time to serialize properties into /tmp/CTLCardinality6391641935788574939.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality13771518102942519264.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6391641935788574939.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.24023e+12,11.3989,228928,2,59051,5,1.39502e+06,6,0,515,887629,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-06-03 07:44:24] [INFO ] Flatten gal took : 4 ms
[2025-06-03 07:44:24] [INFO ] Applying decomposition
[2025-06-03 07:44:24] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph14121122517499800499.txt' '-o' '/tmp/graph14121122517499800499.bin' '-w' '/tmp/graph14121122517499800499.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph14121122517499800499.bin' '-l' '-1' '-v' '-w' '/tmp/graph14121122517499800499.weights' '-q' '0' '-e' '0.001'
[2025-06-03 07:44:24] [INFO ] Decomposing Gal with order
[2025-06-03 07:44:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 07:44:24] [INFO ] Removed a total of 70 redundant transitions.
[2025-06-03 07:44:24] [INFO ] Flatten gal took : 9 ms
[2025-06-03 07:44:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 88 labels/synchronizations in 4 ms.
[2025-06-03 07:44:24] [INFO ] Time to serialize gal into /tmp/CTLCardinality736915714486328721.gal : 2 ms
[2025-06-03 07:44:24] [INFO ] Time to serialize properties into /tmp/CTLCardinality6789505114578137925.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality736915714486328721.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6789505114578137925.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.24023e+12,0.271953,12308,499,61,20314,691,217,27643,43,3745,0


Converting to forward existential form...Done !
original formula: ((AF(((i5.u13.p52==1)||(i4.u11.p46==1))) + AG(((AX(((i0.u0.p3==1)||(i6.u17.p67==0))) * ((EF((i5.u13.p51==0)) + (i5.u13.p53==0)) + (i2.u6....462
=> equivalent forward existential formula: (([(EY(FwdU(((Init * !(E((i2.u6.p24==1) U ((i10.u26.p107==1) * ((!(EX(!(((i5.u14.p54==0)||(i6.u16.p64==1))))) + ...1321
Reverse transition relation is NOT exact ! Due to transitions t33, t41, t44, t46, t48, t110, t112, t117, i0.u1.t127, i1.t50, i1.t35, i1.t31, i1.u18.t121, i...420
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
(forward)formula 0,0,3.87987,119956,1,0,256393,3761,1564,404987,227,32381,221462
FORMULA DiscoveryGPU-PT-12a-CTLCardinality-2023-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

[2025-06-03 07:44:27] [INFO ] Flatten gal took : 5 ms
[2025-06-03 07:44:27] [INFO ] Flatten gal took : 4 ms
Total runtime 322620 ms.

BK_STOP 1748936668064

--------------------
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
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /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="DiscoveryGPU-PT-12a"
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-5832"
echo " Executing tool itstools"
echo " Input is DiscoveryGPU-PT-12a, 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 r058-smll-174854064700705"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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