Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r114-tall-174876422500345.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 IBM703-PT-none, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r114-tall-174876422500345
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 744K
-rw-r--r-- 1 mcc users 9.8K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K 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.2K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 5.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.1K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 19K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 117K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 22K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 109K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K 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 5 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 203K 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 IBM703-PT-none-CTLCardinality-2023-12
FORMULA_NAME IBM703-PT-none-CTLCardinality-2023-13
FORMULA_NAME IBM703-PT-none-CTLCardinality-2023-14
FORMULA_NAME IBM703-PT-none-CTLCardinality-2023-15
FORMULA_NAME IBM703-PT-none-CTLCardinality-2025-00
FORMULA_NAME IBM703-PT-none-CTLCardinality-2025-01
FORMULA_NAME IBM703-PT-none-CTLCardinality-2025-02
FORMULA_NAME IBM703-PT-none-CTLCardinality-2025-03
FORMULA_NAME IBM703-PT-none-CTLCardinality-2025-04
FORMULA_NAME IBM703-PT-none-CTLCardinality-2025-05
FORMULA_NAME IBM703-PT-none-CTLCardinality-2025-06
FORMULA_NAME IBM703-PT-none-CTLCardinality-2025-07
FORMULA_NAME IBM703-PT-none-CTLCardinality-2025-08
FORMULA_NAME IBM703-PT-none-CTLCardinality-2025-09
FORMULA_NAME IBM703-PT-none-CTLCardinality-2025-10
FORMULA_NAME IBM703-PT-none-CTLCardinality-2025-11

=== Now, execution of the tool begins

BK_START 1748835634433

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=IBM703-PT-none
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202505121319
[2025-06-02 03:40:35] [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-02 03:40:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 03:40:36] [INFO ] Load time of PNML (sax parser for PT used): 87 ms
[2025-06-02 03:40:36] [INFO ] Transformed 262 places.
[2025-06-02 03:40:36] [INFO ] Transformed 284 transitions.
[2025-06-02 03:40:36] [INFO ] Found NUPN structural information;
[2025-06-02 03:40:36] [INFO ] Parsed PT model containing 262 places and 284 transitions and 572 arcs in 191 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 14 ms.
Support contains 62 out of 262 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 262/262 places, 284/284 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 258 transition count 284
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 24 place count 238 transition count 264
Iterating global reduction 1 with 20 rules applied. Total rules applied 44 place count 238 transition count 264
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 51 place count 231 transition count 257
Iterating global reduction 1 with 7 rules applied. Total rules applied 58 place count 231 transition count 257
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 61 place count 228 transition count 254
Iterating global reduction 1 with 3 rules applied. Total rules applied 64 place count 228 transition count 254
Applied a total of 64 rules in 69 ms. Remains 228 /262 variables (removed 34) and now considering 254/284 (removed 30) transitions.
// Phase 1: matrix 254 rows 228 cols
[2025-06-02 03:40:36] [INFO ] Computed 0 invariants in 16 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:40:36] [INFO ] Implicit Places using invariants in 191 ms returned []
[2025-06-02 03:40:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:40:36] [INFO ] Implicit Places using invariants and state equation in 212 ms returned []
Implicit Place search using SMT with State Equation took 439 ms to find 0 implicit places.
Running 253 sub problems to find dead transitions.
[2025-06-02 03:40:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/225 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 1 (OVERLAPS) 254/479 variables, 225/225 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/479 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 3 (OVERLAPS) 3/482 variables, 3/228 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/482 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 5 (OVERLAPS) 0/482 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 253 unsolved
No progress, stopping.
After SMT solving in domain Real declared 482/482 variables, and 228 constraints, problems are : Problem set: 0 solved, 253 unsolved in 29123 ms.
Refiners :[State Equation: 228/228 constraints, PredecessorRefiner: 253/253 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 253 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/225 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 1 (OVERLAPS) 254/479 variables, 225/225 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/479 variables, 251/476 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/479 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 4 (OVERLAPS) 3/482 variables, 3/479 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/482 variables, 2/481 constraints. Problems are: Problem set: 0 solved, 253 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 482/482 variables, and 481 constraints, problems are : Problem set: 0 solved, 253 unsolved in 30028 ms.
Refiners :[State Equation: 228/228 constraints, PredecessorRefiner: 253/253 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 59216ms problems are : Problem set: 0 solved, 253 unsolved
Search for dead transitions found 0 dead transitions in 59228ms
Starting structural reductions in LTL mode, iteration 1 : 228/262 places, 254/284 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 59755 ms. Remains : 228/262 places, 254/284 transitions.
Support contains 62 out of 228 places after structural reductions.
[2025-06-02 03:41:36] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2025-06-02 03:41:36] [INFO ] Flatten gal took : 37 ms
[2025-06-02 03:41:36] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA IBM703-PT-none-CTLCardinality-2023-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM703-PT-none-CTLCardinality-2025-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-02 03:41:36] [INFO ] Flatten gal took : 14 ms
[2025-06-02 03:41:36] [INFO ] Input system was already deterministic with 254 transitions.
Support contains 53 out of 228 places (down from 62) after GAL structural reductions.
RANDOM walk for 40000 steps (699 resets) in 1097 ms. (36 steps per ms) remains 2/34 properties
BEST_FIRST walk for 40001 steps (444 resets) in 364 ms. (109 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (455 resets) in 177 ms. (224 steps per ms) remains 2/2 properties
[2025-06-02 03:41:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 14/20 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 34/54 variables, 14/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 46/100 variables, 20/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 56/156 variables, 25/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/156 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 58/214 variables, 28/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/214 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 59/273 variables, 27/120 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/273 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 47/320 variables, 24/144 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/320 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 36/356 variables, 18/162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/356 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 36/392 variables, 17/179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/392 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 33/425 variables, 17/196 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/425 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 23/448 variables, 12/208 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/448 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 16/464 variables, 9/217 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/464 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 10/474 variables, 6/223 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/474 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 4/478 variables, 2/225 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/478 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (OVERLAPS) 3/481 variables, 2/227 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/481 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (OVERLAPS) 1/482 variables, 1/228 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/482 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 33 (OVERLAPS) 0/482 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 482/482 variables, and 228 constraints, problems are : Problem set: 0 solved, 2 unsolved in 277 ms.
Refiners :[State Equation: 228/228 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 14/20 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 34/54 variables, 14/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 46/100 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/100 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 56/156 variables, 25/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/156 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 58/214 variables, 28/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/214 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 59/273 variables, 27/122 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/273 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 47/320 variables, 24/146 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/320 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 36/356 variables, 18/164 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/356 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 36/392 variables, 17/181 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/392 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp28 is UNSAT
At refinement iteration 20 (OVERLAPS) 33/425 variables, 17/198 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/425 variables, 0/198 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 23/448 variables, 12/210 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/448 variables, 0/210 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 16/464 variables, 9/219 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/464 variables, 0/219 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Problem AtomicPropp3 is UNSAT
After SMT solving in domain Int declared 474/482 variables, and 225 constraints, problems are : Problem set: 2 solved, 0 unsolved in 583 ms.
Refiners :[State Equation: 223/228 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 864ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 2 atomic propositions for a total of 12 simplifications.
[2025-06-02 03:41:37] [INFO ] Flatten gal took : 10 ms
[2025-06-02 03:41:37] [INFO ] Flatten gal took : 11 ms
[2025-06-02 03:41:37] [INFO ] Input system was already deterministic with 254 transitions.
Computed a total of 228 stabilizing places and 254 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 228 transition count 254
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
AF dead knowledge conclusive for 2 formulas.
FORMULA IBM703-PT-none-CTLCardinality-2025-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM703-PT-none-CTLCardinality-2023-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Starting structural reductions in SI_CTL mode, iteration 0 : 228/228 places, 254/254 transitions.
Graph (complete) has 256 edges and 228 vertex of which 65 are kept as prefixes of interest. Removing 163 places using SCC suffix rule.1 ms
Discarding 163 places :
Also discarding 178 output transitions
Drop transitions (Output transitions of discarded places.) removed 178 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 47 rules applied. Total rules applied 48 place count 64 transition count 28
Reduce places removed 46 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 51 rules applied. Total rules applied 99 place count 18 transition count 23
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 103 place count 15 transition count 22
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 104 place count 14 transition count 22
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 104 place count 14 transition count 19
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 110 place count 11 transition count 19
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 111 place count 10 transition count 17
Iterating global reduction 4 with 1 rules applied. Total rules applied 112 place count 10 transition count 17
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 4 with 2 rules applied. Total rules applied 114 place count 9 transition count 16
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
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 4 with 2 rules applied. Total rules applied 116 place count 9 transition count 14
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 118 place count 8 transition count 13
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 120 place count 8 transition count 11
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 6 with 1 rules applied. Total rules applied 121 place count 8 transition count 10
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 122 place count 7 transition count 10
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 123 place count 7 transition count 9
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 123 place count 7 transition count 8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 125 place count 6 transition count 8
Applied a total of 125 rules in 25 ms. Remains 6 /228 variables (removed 222) and now considering 8/254 (removed 246) transitions.
// Phase 1: matrix 8 rows 6 cols
[2025-06-02 03:41:37] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:41:37] [INFO ] Implicit Places using invariants in 13 ms returned []
[2025-06-02 03:41:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:41:37] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 31 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 03:41:37] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2025-06-02 03:41:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 8/13 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 1/14 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 0/14 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 14/14 variables, and 6 constraints, problems are : Problem set: 0 solved, 6 unsolved in 55 ms.
Refiners :[State Equation: 6/6 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/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 8/13 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/13 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 1/14 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/14 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/14 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 14/14 variables, and 12 constraints, problems are : Problem set: 0 solved, 6 unsolved in 69 ms.
Refiners :[State Equation: 6/6 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 129ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 129ms
Starting structural reductions in SI_CTL mode, iteration 1 : 6/228 places, 8/254 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 194 ms. Remains : 6/228 places, 8/254 transitions.
[2025-06-02 03:41:37] [INFO ] Flatten gal took : 0 ms
[2025-06-02 03:41:37] [INFO ] Flatten gal took : 0 ms
[2025-06-02 03:41:37] [INFO ] Input system was already deterministic with 8 transitions.
[2025-06-02 03:41:37] [INFO ] Flatten gal took : 1 ms
[2025-06-02 03:41:37] [INFO ] Flatten gal took : 1 ms
[2025-06-02 03:41:37] [INFO ] Time to serialize gal into /tmp/CTLCardinality2283167295153471889.gal : 1 ms
[2025-06-02 03:41:37] [INFO ] Time to serialize properties into /tmp/CTLCardinality1877646851334047262.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality2283167295153471889.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1877646851334047262.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,7,0.010379,3616,2,12,5,50,6,0,32,39,0


Converting to forward existential form...Done !
original formula: AG(AF(((callToProcess_s00000808_output_s00000264==0)&&(task_s00000712_inputCriterion_s00000257_used==1))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(((callToProcess_s00000808_output_s00000264==0)&&(task_s00000712_inputCriterion_s00000257...176
Hit Full ! (commute/partial/dont) 4/0/4
(forward)formula 0,0,0.01158,3872,1,0,13,137,19,2,146,137,13
FORMULA IBM703-PT-none-CTLCardinality-2025-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 228/228 places, 254/254 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 226 transition count 254
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 20 place count 208 transition count 236
Iterating global reduction 1 with 18 rules applied. Total rules applied 38 place count 208 transition count 236
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 39 place count 208 transition count 235
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 51 place count 196 transition count 223
Iterating global reduction 2 with 12 rules applied. Total rules applied 63 place count 196 transition count 223
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 73 place count 186 transition count 213
Iterating global reduction 2 with 10 rules applied. Total rules applied 83 place count 186 transition count 213
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 85 place count 186 transition count 211
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 90 place count 181 transition count 206
Iterating global reduction 3 with 5 rules applied. Total rules applied 95 place count 181 transition count 206
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 99 place count 177 transition count 202
Iterating global reduction 3 with 4 rules applied. Total rules applied 103 place count 177 transition count 202
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 107 place count 173 transition count 198
Iterating global reduction 3 with 4 rules applied. Total rules applied 111 place count 173 transition count 198
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 113 place count 171 transition count 196
Iterating global reduction 3 with 2 rules applied. Total rules applied 115 place count 171 transition count 196
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 116 place count 170 transition count 195
Iterating global reduction 3 with 1 rules applied. Total rules applied 117 place count 170 transition count 195
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 118 place count 169 transition count 194
Iterating global reduction 3 with 1 rules applied. Total rules applied 119 place count 169 transition count 194
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 120 place count 168 transition count 193
Iterating global reduction 3 with 1 rules applied. Total rules applied 121 place count 168 transition count 193
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 122 place count 167 transition count 192
Iterating global reduction 3 with 1 rules applied. Total rules applied 123 place count 167 transition count 192
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 124 place count 166 transition count 191
Iterating global reduction 3 with 1 rules applied. Total rules applied 125 place count 166 transition count 191
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 126 place count 166 transition count 190
Applied a total of 126 rules in 140 ms. Remains 166 /228 variables (removed 62) and now considering 190/254 (removed 64) transitions.
// Phase 1: matrix 190 rows 166 cols
[2025-06-02 03:41:38] [INFO ] Computed 0 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:41:38] [INFO ] Implicit Places using invariants in 47 ms returned []
[2025-06-02 03:41:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:41:38] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 148 ms to find 0 implicit places.
Running 189 sub problems to find dead transitions.
[2025-06-02 03:41:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 1 (OVERLAPS) 190/355 variables, 165/165 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/355 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 3 (OVERLAPS) 1/356 variables, 1/166 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/356 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 5 (OVERLAPS) 0/356 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 189 unsolved
No progress, stopping.
After SMT solving in domain Real declared 356/356 variables, and 166 constraints, problems are : Problem set: 0 solved, 189 unsolved in 25088 ms.
Refiners :[State Equation: 166/166 constraints, PredecessorRefiner: 189/189 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 189 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 1 (OVERLAPS) 190/355 variables, 165/165 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/355 variables, 189/354 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/355 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 4 (OVERLAPS) 1/356 variables, 1/355 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/356 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 189 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 356/356 variables, and 355 constraints, problems are : Problem set: 0 solved, 189 unsolved in 30016 ms.
Refiners :[State Equation: 166/166 constraints, PredecessorRefiner: 189/189 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 55115ms problems are : Problem set: 0 solved, 189 unsolved
Search for dead transitions found 0 dead transitions in 55116ms
Starting structural reductions in LTL mode, iteration 1 : 166/228 places, 190/254 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55405 ms. Remains : 166/228 places, 190/254 transitions.
[2025-06-02 03:42:33] [INFO ] Flatten gal took : 7 ms
[2025-06-02 03:42:33] [INFO ] Flatten gal took : 7 ms
[2025-06-02 03:42:33] [INFO ] Input system was already deterministic with 190 transitions.
[2025-06-02 03:42:33] [INFO ] Flatten gal took : 6 ms
[2025-06-02 03:42:33] [INFO ] Flatten gal took : 6 ms
[2025-06-02 03:42:33] [INFO ] Time to serialize gal into /tmp/CTLCardinality8806143019363946918.gal : 4 ms
[2025-06-02 03:42:33] [INFO ] Time to serialize properties into /tmp/CTLCardinality373666987401213284.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/CTLCardinality8806143019363946918.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality373666987401213284.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 -...282
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,2326,0.056844,5876,2,638,5,5493,6,0,854,7855,0


Converting to forward existential form...Done !
original formula: EF(EX(TRUE))
=> equivalent forward existential formula: [(EY(FwdU(Init,TRUE)) * TRUE)] != FALSE
(forward)formula 0,1,0.069282,5876,1,0,6,5493,7,1,1355,7855,1
FORMULA IBM703-PT-none-CTLCardinality-2025-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 228/228 places, 254/254 transitions.
Graph (complete) has 256 edges and 228 vertex of which 127 are kept as prefixes of interest. Removing 101 places using SCC suffix rule.1 ms
Discarding 101 places :
Also discarding 106 output transitions
Drop transitions (Output transitions of discarded places.) removed 106 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 74 transitions
Trivial Post-agglo rules discarded 74 transitions
Performed 74 trivial Post agglomeration. Transition count delta: 74
Iterating post reduction 0 with 74 rules applied. Total rules applied 75 place count 126 transition count 73
Reduce places removed 74 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 82 rules applied. Total rules applied 157 place count 52 transition count 65
Reduce places removed 5 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 9 rules applied. Total rules applied 166 place count 47 transition count 61
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 170 place count 43 transition count 61
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 11 Pre rules applied. Total rules applied 170 place count 43 transition count 50
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 192 place count 32 transition count 50
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 193 place count 31 transition count 49
Iterating global reduction 4 with 1 rules applied. Total rules applied 194 place count 31 transition count 49
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 198 place count 29 transition count 47
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 199 place count 29 transition count 46
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 5 with 2 rules applied. Total rules applied 201 place count 28 transition count 45
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 202 place count 28 transition count 44
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 206 place count 28 transition count 40
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 6 with 2 rules applied. Total rules applied 208 place count 28 transition count 38
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 7 with 4 rules applied. Total rules applied 212 place count 26 transition count 36
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 214 place count 24 transition count 36
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 215 place count 24 transition count 35
Applied a total of 215 rules in 22 ms. Remains 24 /228 variables (removed 204) and now considering 35/254 (removed 219) transitions.
// Phase 1: matrix 35 rows 24 cols
[2025-06-02 03:42:33] [INFO ] Computed 0 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:42:33] [INFO ] Implicit Places using invariants in 19 ms returned []
[2025-06-02 03:42:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:42:33] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 03:42:33] [INFO ] Redundant transitions in 0 ms returned []
Running 31 sub problems to find dead transitions.
[2025-06-02 03:42:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 1 (OVERLAPS) 34/57 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 3 (OVERLAPS) 2/59 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 5 (OVERLAPS) 0/59 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 31 unsolved
No progress, stopping.
After SMT solving in domain Real declared 59/59 variables, and 24 constraints, problems are : Problem set: 0 solved, 31 unsolved in 378 ms.
Refiners :[State Equation: 24/24 constraints, PredecessorRefiner: 31/31 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 31 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 1 (OVERLAPS) 34/57 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 31/54 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 4 (OVERLAPS) 2/59 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 6 (OVERLAPS) 0/59 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 31 unsolved
No progress, stopping.
After SMT solving in domain Int declared 59/59 variables, and 55 constraints, problems are : Problem set: 0 solved, 31 unsolved in 409 ms.
Refiners :[State Equation: 24/24 constraints, PredecessorRefiner: 31/31 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 790ms problems are : Problem set: 0 solved, 31 unsolved
Search for dead transitions found 0 dead transitions in 791ms
Starting structural reductions in SI_CTL mode, iteration 1 : 24/228 places, 35/254 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 868 ms. Remains : 24/228 places, 35/254 transitions.
[2025-06-02 03:42:34] [INFO ] Flatten gal took : 2 ms
[2025-06-02 03:42:34] [INFO ] Flatten gal took : 1 ms
[2025-06-02 03:42:34] [INFO ] Input system was already deterministic with 35 transitions.
[2025-06-02 03:42:34] [INFO ] Flatten gal took : 1 ms
[2025-06-02 03:42:34] [INFO ] Flatten gal took : 1 ms
[2025-06-02 03:42:34] [INFO ] Time to serialize gal into /tmp/CTLCardinality11716991749214939988.gal : 1 ms
[2025-06-02 03:42:34] [INFO ] Time to serialize properties into /tmp/CTLCardinality265564406383281618.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/CTLCardinality11716991749214939988.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality265564406383281618.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,45,0.008587,3964,2,56,5,257,6,0,127,201,0


Converting to forward existential form...Done !
original formula: (AF(E(E((merge_s00000453_input_s00000263==0) U ((A(((merge_s00000453_activated==0)||(task_s00000705_inputCriterion_s00000257_used==1)) U ...424
=> equivalent forward existential formula: ([FwdG(Init,!(E(E((merge_s00000453_input_s00000263==0) U ((!((E(!((task_s00000714_input_s00000263==0)) U (!(((me...596
Reverse transition relation is NOT exact ! Due to transitions t0, t3, t9, t11, t13, t20, t22, t25, t33, Intersection with reachable at each step enabled. ...201
(forward)formula 0,0,0.022806,4604,1,0,112,4129,95,60,674,5224,144
FORMULA IBM703-PT-none-CTLCardinality-2025-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 228/228 places, 254/254 transitions.
Graph (complete) has 256 edges and 228 vertex of which 179 are kept as prefixes of interest. Removing 49 places using SCC suffix rule.0 ms
Discarding 49 places :
Also discarding 48 output transitions
Drop transitions (Output transitions of discarded places.) removed 48 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 130 transitions
Trivial Post-agglo rules discarded 130 transitions
Performed 130 trivial Post agglomeration. Transition count delta: 130
Iterating post reduction 0 with 130 rules applied. Total rules applied 131 place count 178 transition count 75
Reduce places removed 130 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 1 with 153 rules applied. Total rules applied 284 place count 48 transition count 52
Reduce places removed 15 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
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 17 rules applied. Total rules applied 301 place count 33 transition count 50
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 302 place count 32 transition count 50
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 302 place count 32 transition count 43
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 316 place count 25 transition count 43
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 318 place count 23 transition count 40
Iterating global reduction 4 with 2 rules applied. Total rules applied 320 place count 23 transition count 40
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 321 place count 22 transition count 38
Iterating global reduction 4 with 1 rules applied. Total rules applied 322 place count 22 transition count 38
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 3 rules applied. Total rules applied 325 place count 22 transition count 35
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
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 5 with 4 rules applied. Total rules applied 329 place count 20 transition count 33
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 330 place count 19 transition count 33
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 7 with 10 rules applied. Total rules applied 340 place count 14 transition count 28
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 7 with 6 rules applied. Total rules applied 346 place count 14 transition count 22
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
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 8 with 5 rules applied. Total rules applied 351 place count 12 transition count 19
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 352 place count 11 transition count 19
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 10 with 2 rules applied. Total rules applied 354 place count 10 transition count 18
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 10 with 4 rules applied. Total rules applied 358 place count 10 transition count 14
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 10 with 3 rules applied. Total rules applied 361 place count 10 transition count 11
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 11 with 3 rules applied. Total rules applied 364 place count 7 transition count 11
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 365 place count 7 transition count 10
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 12 with 1 rules applied. Total rules applied 366 place count 7 transition count 9
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 367 place count 6 transition count 9
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 14 with 1 rules applied. Total rules applied 368 place count 6 transition count 9
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 14 with 1 rules applied. Total rules applied 369 place count 6 transition count 8
Applied a total of 369 rules in 12 ms. Remains 6 /228 variables (removed 222) and now considering 8/254 (removed 246) transitions.
// Phase 1: matrix 8 rows 6 cols
[2025-06-02 03:42:34] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:42:34] [INFO ] Implicit Places using invariants in 13 ms returned []
[2025-06-02 03:42:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:42:34] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 35 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 03:42:34] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2025-06-02 03:42:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 8/13 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 1/14 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 0/14 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 14/14 variables, and 6 constraints, problems are : Problem set: 0 solved, 6 unsolved in 47 ms.
Refiners :[State Equation: 6/6 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/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 8/13 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/13 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 1/14 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/14 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/14 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 14/14 variables, and 12 constraints, problems are : Problem set: 0 solved, 6 unsolved in 49 ms.
Refiners :[State Equation: 6/6 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 98ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 98ms
Starting structural reductions in SI_CTL mode, iteration 1 : 6/228 places, 8/254 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 149 ms. Remains : 6/228 places, 8/254 transitions.
[2025-06-02 03:42:34] [INFO ] Flatten gal took : 1 ms
[2025-06-02 03:42:34] [INFO ] Flatten gal took : 1 ms
[2025-06-02 03:42:34] [INFO ] Input system was already deterministic with 8 transitions.
[2025-06-02 03:42:34] [INFO ] Flatten gal took : 1 ms
[2025-06-02 03:42:34] [INFO ] Flatten gal took : 0 ms
[2025-06-02 03:42:34] [INFO ] Time to serialize gal into /tmp/CTLCardinality10474788015933649727.gal : 0 ms
[2025-06-02 03:42:34] [INFO ] Time to serialize properties into /tmp/CTLCardinality8397834586206787843.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/CTLCardinality10474788015933649727.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8397834586206787843.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,0.001868,3660,2,12,5,52,6,0,32,38,0


Converting to forward existential form...Done !
original formula: !(A((task_s00000725_inputCriterion_s00000257_used==0) U !(AF(!(EF((merge_s00000446_input_s00000263==0)))))))
=> equivalent forward existential formula: ([((FwdU(Init,!(!(!(EG(!(!(E(TRUE U (merge_s00000446_input_s00000263==0))))))))) * !((task_s00000725_inputCriter...343
Reverse transition relation is NOT exact ! Due to transitions t2, t3, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total...165
dead was empty
(forward)formula 0,0,0.003933,4172,1,0,26,212,39,14,155,231,39
FORMULA IBM703-PT-none-CTLCardinality-2025-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 228/228 places, 254/254 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 227 transition count 254
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 16 place count 212 transition count 239
Iterating global reduction 1 with 15 rules applied. Total rules applied 31 place count 212 transition count 239
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 32 place count 212 transition count 238
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 41 place count 203 transition count 229
Iterating global reduction 2 with 9 rules applied. Total rules applied 50 place count 203 transition count 229
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 57 place count 196 transition count 222
Iterating global reduction 2 with 7 rules applied. Total rules applied 64 place count 196 transition count 222
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 65 place count 196 transition count 221
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 68 place count 193 transition count 218
Iterating global reduction 3 with 3 rules applied. Total rules applied 71 place count 193 transition count 218
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 72 place count 192 transition count 217
Iterating global reduction 3 with 1 rules applied. Total rules applied 73 place count 192 transition count 217
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 74 place count 191 transition count 216
Iterating global reduction 3 with 1 rules applied. Total rules applied 75 place count 191 transition count 216
Applied a total of 75 rules in 23 ms. Remains 191 /228 variables (removed 37) and now considering 216/254 (removed 38) transitions.
// Phase 1: matrix 216 rows 191 cols
[2025-06-02 03:42:34] [INFO ] Computed 0 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:42:34] [INFO ] Implicit Places using invariants in 30 ms returned []
[2025-06-02 03:42:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:42:34] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
Running 215 sub problems to find dead transitions.
[2025-06-02 03:42:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (OVERLAPS) 216/405 variables, 189/189 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/405 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (OVERLAPS) 2/407 variables, 2/191 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/407 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (OVERLAPS) 0/407 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 215 unsolved
No progress, stopping.
After SMT solving in domain Real declared 407/407 variables, and 191 constraints, problems are : Problem set: 0 solved, 215 unsolved in 28355 ms.
Refiners :[State Equation: 191/191 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 215 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (OVERLAPS) 216/405 variables, 189/189 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/405 variables, 214/403 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/405 variables, 0/403 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (OVERLAPS) 2/407 variables, 2/405 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/407 variables, 1/406 constraints. Problems are: Problem set: 0 solved, 215 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 407/407 variables, and 406 constraints, problems are : Problem set: 0 solved, 215 unsolved in 30018 ms.
Refiners :[State Equation: 191/191 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 58388ms problems are : Problem set: 0 solved, 215 unsolved
Search for dead transitions found 0 dead transitions in 58389ms
Starting structural reductions in LTL mode, iteration 1 : 191/228 places, 216/254 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 58528 ms. Remains : 191/228 places, 216/254 transitions.
[2025-06-02 03:43:33] [INFO ] Flatten gal took : 7 ms
[2025-06-02 03:43:33] [INFO ] Flatten gal took : 6 ms
[2025-06-02 03:43:33] [INFO ] Input system was already deterministic with 216 transitions.
[2025-06-02 03:43:33] [INFO ] Flatten gal took : 7 ms
[2025-06-02 03:43:33] [INFO ] Flatten gal took : 6 ms
[2025-06-02 03:43:33] [INFO ] Time to serialize gal into /tmp/CTLCardinality12716147480243231881.gal : 2 ms
[2025-06-02 03:43:33] [INFO ] Time to serialize properties into /tmp/CTLCardinality8745236081784847412.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/CTLCardinality12716147480243231881.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8745236081784847412.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,4670,0.073759,6408,2,755,5,7003,6,0,977,10484,0


Converting to forward existential form...Done !
original formula: AF(!(A(AX((((task_s00000762_input_s00000263==0)||(callToProcess_s00000348_output_s00000264==1))&&(task_s00000760_inputCriterion_s00000257...255
=> equivalent forward existential formula: [FwdG(Init,!(!(!((E(!(!(EG(((task_s00000762_output_s00000264==0)||(task_s00000736_output_s00000264==1))))) U (!(...501
Reverse transition relation is NOT exact ! Due to transitions t24, t27, t29, t30, t34, t35, t36, t41, t42, t46, t48, t53, t56, t57, t71, t80, t127, t153, t...278
dead was empty
(forward)formula 0,1,1.49476,67948,1,0,671,386421,458,425,5027,365851,932
FORMULA IBM703-PT-none-CTLCardinality-2025-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 228/228 places, 254/254 transitions.
Graph (complete) has 256 edges and 228 vertex of which 40 are kept as prefixes of interest. Removing 188 places using SCC suffix rule.2 ms
Discarding 188 places :
Also discarding 208 output transitions
Drop transitions (Output transitions of discarded places.) removed 208 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 30 rules applied. Total rules applied 31 place count 39 transition count 15
Reduce places removed 29 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 34 rules applied. Total rules applied 65 place count 10 transition count 10
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 68 place count 7 transition count 10
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 68 place count 7 transition count 8
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 72 place count 5 transition count 8
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 74 place count 4 transition count 7
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
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 3 with 2 rules applied. Total rules applied 76 place count 4 transition count 5
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 78 place count 3 transition count 4
Applied a total of 78 rules in 9 ms. Remains 3 /228 variables (removed 225) and now considering 4/254 (removed 250) transitions.
// Phase 1: matrix 4 rows 3 cols
[2025-06-02 03:43:34] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:43:34] [INFO ] Implicit Places using invariants in 17 ms returned []
[2025-06-02 03:43:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:43:34] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 33 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 03:43:34] [INFO ] Redundant transitions in 0 ms returned []
Running 2 sub problems to find dead transitions.
[2025-06-02 03:43:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 3/5 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/7 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/7 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 0/7 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7/7 variables, and 3 constraints, problems are : Problem set: 0 solved, 2 unsolved in 24 ms.
Refiners :[State Equation: 3/3 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 3/5 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 2/7 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/7 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 7/7 variables, and 5 constraints, problems are : Problem set: 0 solved, 2 unsolved in 27 ms.
Refiners :[State Equation: 3/3 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 53ms problems are : Problem set: 0 solved, 2 unsolved
Search for dead transitions found 0 dead transitions in 53ms
Starting structural reductions in SI_CTL mode, iteration 1 : 3/228 places, 4/254 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 100 ms. Remains : 3/228 places, 4/254 transitions.
[2025-06-02 03:43:34] [INFO ] Flatten gal took : 0 ms
[2025-06-02 03:43:34] [INFO ] Flatten gal took : 0 ms
[2025-06-02 03:43:34] [INFO ] Input system was already deterministic with 4 transitions.
[2025-06-02 03:43:34] [INFO ] Flatten gal took : 1 ms
[2025-06-02 03:43:34] [INFO ] Flatten gal took : 0 ms
[2025-06-02 03:43:34] [INFO ] Time to serialize gal into /tmp/CTLCardinality9783237437149650004.gal : 0 ms
[2025-06-02 03:43:34] [INFO ] Time to serialize properties into /tmp/CTLCardinality18080417726798551042.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/CTLCardinality9783237437149650004.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18080417726798551042.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,4,0.00261,3660,2,6,5,22,6,0,16,17,0


Converting to forward existential form...Done !
original formula: EG(EF((task_s00000706_inputCriterion_s00000257_used==0)))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U (task_s00000706_inputCriterion_s00000257_used==0)))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t2, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total...165
(forward)formula 0,1,0.004384,3916,1,0,20,66,32,11,78,91,28
FORMULA IBM703-PT-none-CTLCardinality-2025-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 228/228 places, 254/254 transitions.
Graph (complete) has 256 edges and 228 vertex of which 85 are kept as prefixes of interest. Removing 143 places using SCC suffix rule.1 ms
Discarding 143 places :
Also discarding 154 output transitions
Drop transitions (Output transitions of discarded places.) removed 154 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 57 transitions
Trivial Post-agglo rules discarded 57 transitions
Performed 57 trivial Post agglomeration. Transition count delta: 57
Iterating post reduction 0 with 58 rules applied. Total rules applied 59 place count 84 transition count 41
Reduce places removed 57 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 65 rules applied. Total rules applied 124 place count 27 transition count 33
Reduce places removed 5 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 7 rules applied. Total rules applied 131 place count 22 transition count 31
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 133 place count 20 transition count 31
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 133 place count 20 transition count 27
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 141 place count 16 transition count 27
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 144 place count 16 transition count 24
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 145 place count 16 transition count 23
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 146 place count 15 transition count 23
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 146 place count 15 transition count 22
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 148 place count 14 transition count 22
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 149 place count 14 transition count 21
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 150 place count 14 transition count 21
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 151 place count 14 transition count 20
Applied a total of 151 rules in 8 ms. Remains 14 /228 variables (removed 214) and now considering 20/254 (removed 234) transitions.
// Phase 1: matrix 20 rows 14 cols
[2025-06-02 03:43:34] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:43:34] [INFO ] Implicit Places using invariants in 17 ms returned []
[2025-06-02 03:43:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:43:34] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 03:43:34] [INFO ] Redundant transitions in 0 ms returned []
Running 17 sub problems to find dead transitions.
[2025-06-02 03:43:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 20/33 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 1/34 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/34 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 0/34 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 34/34 variables, and 14 constraints, problems are : Problem set: 0 solved, 17 unsolved in 166 ms.
Refiners :[State Equation: 14/14 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 20/33 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 17/30 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 1/34 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/34 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 0/34 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 34/34 variables, and 31 constraints, problems are : Problem set: 0 solved, 17 unsolved in 168 ms.
Refiners :[State Equation: 14/14 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 338ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 338ms
Starting structural reductions in SI_CTL mode, iteration 1 : 14/228 places, 20/254 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 390 ms. Remains : 14/228 places, 20/254 transitions.
[2025-06-02 03:43:35] [INFO ] Flatten gal took : 1 ms
[2025-06-02 03:43:35] [INFO ] Flatten gal took : 1 ms
[2025-06-02 03:43:35] [INFO ] Input system was already deterministic with 20 transitions.
[2025-06-02 03:43:35] [INFO ] Flatten gal took : 1 ms
[2025-06-02 03:43:35] [INFO ] Flatten gal took : 1 ms
[2025-06-02 03:43:35] [INFO ] Time to serialize gal into /tmp/CTLCardinality11734413102096376869.gal : 1 ms
[2025-06-02 03:43:35] [INFO ] Time to serialize properties into /tmp/CTLCardinality3386294626157018827.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/CTLCardinality11734413102096376869.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3386294626157018827.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,15,0.003049,3768,2,28,5,142,6,0,73,112,0


Converting to forward existential form...Done !
original formula: EG(((!(E((merge_s00000341_input_s00000285==1) U EG((fork_s00000466_activated_s00000272==1)))) * EF((task_s00000705_input_s00000263==1))) ...232
=> equivalent forward existential formula: [FwdG(Init,((!(E((merge_s00000341_input_s00000285==1) U EG((fork_s00000466_activated_s00000272==1)))) * E(TRUE U...281
Reverse transition relation is NOT exact ! Due to transitions t0, t4, t7, t14, t17, Intersection with reachable at each step enabled. (destroyed/reverse/i...181
dead was empty
(forward)formula 0,0,0.007264,4280,1,0,45,761,72,24,386,846,66
FORMULA IBM703-PT-none-CTLCardinality-2025-08 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 : 228/228 places, 254/254 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 226 transition count 254
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 20 place count 208 transition count 236
Iterating global reduction 1 with 18 rules applied. Total rules applied 38 place count 208 transition count 236
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 39 place count 208 transition count 235
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 51 place count 196 transition count 223
Iterating global reduction 2 with 12 rules applied. Total rules applied 63 place count 196 transition count 223
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 73 place count 186 transition count 213
Iterating global reduction 2 with 10 rules applied. Total rules applied 83 place count 186 transition count 213
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 85 place count 186 transition count 211
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 90 place count 181 transition count 206
Iterating global reduction 3 with 5 rules applied. Total rules applied 95 place count 181 transition count 206
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 99 place count 177 transition count 202
Iterating global reduction 3 with 4 rules applied. Total rules applied 103 place count 177 transition count 202
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 107 place count 173 transition count 198
Iterating global reduction 3 with 4 rules applied. Total rules applied 111 place count 173 transition count 198
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 113 place count 171 transition count 196
Iterating global reduction 3 with 2 rules applied. Total rules applied 115 place count 171 transition count 196
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 116 place count 170 transition count 195
Iterating global reduction 3 with 1 rules applied. Total rules applied 117 place count 170 transition count 195
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 118 place count 169 transition count 194
Iterating global reduction 3 with 1 rules applied. Total rules applied 119 place count 169 transition count 194
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 120 place count 168 transition count 193
Iterating global reduction 3 with 1 rules applied. Total rules applied 121 place count 168 transition count 193
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 122 place count 167 transition count 192
Iterating global reduction 3 with 1 rules applied. Total rules applied 123 place count 167 transition count 192
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 124 place count 166 transition count 191
Iterating global reduction 3 with 1 rules applied. Total rules applied 125 place count 166 transition count 191
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 126 place count 166 transition count 190
Applied a total of 126 rules in 20 ms. Remains 166 /228 variables (removed 62) and now considering 190/254 (removed 64) transitions.
// Phase 1: matrix 190 rows 166 cols
[2025-06-02 03:43:35] [INFO ] Computed 0 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:43:35] [INFO ] Implicit Places using invariants in 32 ms returned []
[2025-06-02 03:43:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:43:35] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 111 ms to find 0 implicit places.
Running 189 sub problems to find dead transitions.
[2025-06-02 03:43:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 1 (OVERLAPS) 190/355 variables, 165/165 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/355 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 3 (OVERLAPS) 1/356 variables, 1/166 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/356 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 5 (OVERLAPS) 0/356 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 189 unsolved
No progress, stopping.
After SMT solving in domain Real declared 356/356 variables, and 166 constraints, problems are : Problem set: 0 solved, 189 unsolved in 24760 ms.
Refiners :[State Equation: 166/166 constraints, PredecessorRefiner: 189/189 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 189 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 1 (OVERLAPS) 190/355 variables, 165/165 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/355 variables, 189/354 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/355 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 4 (OVERLAPS) 1/356 variables, 1/355 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/356 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 189 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 356/356 variables, and 355 constraints, problems are : Problem set: 0 solved, 189 unsolved in 30015 ms.
Refiners :[State Equation: 166/166 constraints, PredecessorRefiner: 189/189 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 54785ms problems are : Problem set: 0 solved, 189 unsolved
Search for dead transitions found 0 dead transitions in 54785ms
Starting structural reductions in LTL mode, iteration 1 : 166/228 places, 190/254 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54917 ms. Remains : 166/228 places, 190/254 transitions.
[2025-06-02 03:44:30] [INFO ] Flatten gal took : 6 ms
[2025-06-02 03:44:30] [INFO ] Flatten gal took : 5 ms
[2025-06-02 03:44:30] [INFO ] Input system was already deterministic with 190 transitions.
[2025-06-02 03:44:30] [INFO ] Flatten gal took : 6 ms
[2025-06-02 03:44:30] [INFO ] Flatten gal took : 5 ms
[2025-06-02 03:44:30] [INFO ] Time to serialize gal into /tmp/CTLCardinality9588447496001659473.gal : 1 ms
[2025-06-02 03:44:30] [INFO ] Time to serialize properties into /tmp/CTLCardinality18380226470424345248.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/CTLCardinality9588447496001659473.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18380226470424345248.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,2326,0.061883,5880,2,638,5,5493,6,0,854,7855,0


Converting to forward existential form...Done !
original formula: AX(AX(AX((decision_s00000799_activated==1))))
=> equivalent forward existential formula: [(EY(EY(EY(Init))) * !((decision_s00000799_activated==1)))] = FALSE
(forward)formula 0,0,0.07027,6136,1,0,11,5493,9,2,1025,7855,4
FORMULA IBM703-PT-none-CTLCardinality-2025-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 228/228 places, 254/254 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 226 transition count 254
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 20 place count 208 transition count 236
Iterating global reduction 1 with 18 rules applied. Total rules applied 38 place count 208 transition count 236
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 39 place count 208 transition count 235
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 51 place count 196 transition count 223
Iterating global reduction 2 with 12 rules applied. Total rules applied 63 place count 196 transition count 223
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 73 place count 186 transition count 213
Iterating global reduction 2 with 10 rules applied. Total rules applied 83 place count 186 transition count 213
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 85 place count 186 transition count 211
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 90 place count 181 transition count 206
Iterating global reduction 3 with 5 rules applied. Total rules applied 95 place count 181 transition count 206
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 98 place count 178 transition count 203
Iterating global reduction 3 with 3 rules applied. Total rules applied 101 place count 178 transition count 203
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 104 place count 175 transition count 200
Iterating global reduction 3 with 3 rules applied. Total rules applied 107 place count 175 transition count 200
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 109 place count 173 transition count 198
Iterating global reduction 3 with 2 rules applied. Total rules applied 111 place count 173 transition count 198
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 112 place count 172 transition count 197
Iterating global reduction 3 with 1 rules applied. Total rules applied 113 place count 172 transition count 197
Applied a total of 113 rules in 13 ms. Remains 172 /228 variables (removed 56) and now considering 197/254 (removed 57) transitions.
// Phase 1: matrix 197 rows 172 cols
[2025-06-02 03:44:30] [INFO ] Computed 0 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:44:30] [INFO ] Implicit Places using invariants in 33 ms returned []
[2025-06-02 03:44:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:44:30] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
Running 196 sub problems to find dead transitions.
[2025-06-02 03:44:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (OVERLAPS) 197/368 variables, 171/171 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/368 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (OVERLAPS) 1/369 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/369 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (OVERLAPS) 0/369 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 196 unsolved
No progress, stopping.
After SMT solving in domain Real declared 369/369 variables, and 172 constraints, problems are : Problem set: 0 solved, 196 unsolved in 25276 ms.
Refiners :[State Equation: 172/172 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 196 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (OVERLAPS) 197/368 variables, 171/171 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/368 variables, 196/367 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/368 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (OVERLAPS) 1/369 variables, 1/368 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/369 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 196 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 369/369 variables, and 368 constraints, problems are : Problem set: 0 solved, 196 unsolved in 30019 ms.
Refiners :[State Equation: 172/172 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 55313ms problems are : Problem set: 0 solved, 196 unsolved
Search for dead transitions found 0 dead transitions in 55314ms
Starting structural reductions in LTL mode, iteration 1 : 172/228 places, 197/254 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55445 ms. Remains : 172/228 places, 197/254 transitions.
[2025-06-02 03:45:25] [INFO ] Flatten gal took : 7 ms
[2025-06-02 03:45:25] [INFO ] Flatten gal took : 11 ms
[2025-06-02 03:45:25] [INFO ] Input system was already deterministic with 197 transitions.
[2025-06-02 03:45:25] [INFO ] Flatten gal took : 5 ms
[2025-06-02 03:45:25] [INFO ] Flatten gal took : 5 ms
[2025-06-02 03:45:25] [INFO ] Time to serialize gal into /tmp/CTLCardinality9594243527812134533.gal : 1 ms
[2025-06-02 03:45:25] [INFO ] Time to serialize properties into /tmp/CTLCardinality3607490542141965955.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/CTLCardinality9594243527812134533.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3607490542141965955.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,3260,0.066987,5940,2,673,5,5882,6,0,885,8304,0


Converting to forward existential form...Done !
original formula: EG(AF(EX((((merge_s00000452_activated==0)&&(task_s00000725_input_s00000263==1))&&((task_s00000744_input_s00000263==0)&&(task_s00000748_in...191
=> equivalent forward existential formula: [FwdG(Init,!(EG(!(EX((((merge_s00000452_activated==0)&&(task_s00000725_input_s00000263==1))&&((task_s00000744_in...240
Reverse transition relation is NOT exact ! Due to transitions t24, t26, t27, t28, t29, t32, t33, t34, t39, t40, t44, t46, t51, t54, t55, t61, t69, t78, t12...288
dead was empty
(forward)formula 0,0,1.35909,58852,1,0,672,330245,415,412,4553,312816,796
FORMULA IBM703-PT-none-CTLCardinality-2025-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 228/228 places, 254/254 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 226 transition count 254
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 19 place count 209 transition count 237
Iterating global reduction 1 with 17 rules applied. Total rules applied 36 place count 209 transition count 237
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 37 place count 209 transition count 236
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 48 place count 198 transition count 225
Iterating global reduction 2 with 11 rules applied. Total rules applied 59 place count 198 transition count 225
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 68 place count 189 transition count 216
Iterating global reduction 2 with 9 rules applied. Total rules applied 77 place count 189 transition count 216
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 79 place count 189 transition count 214
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 83 place count 185 transition count 210
Iterating global reduction 3 with 4 rules applied. Total rules applied 87 place count 185 transition count 210
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 91 place count 181 transition count 206
Iterating global reduction 3 with 4 rules applied. Total rules applied 95 place count 181 transition count 206
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 99 place count 177 transition count 202
Iterating global reduction 3 with 4 rules applied. Total rules applied 103 place count 177 transition count 202
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 105 place count 175 transition count 200
Iterating global reduction 3 with 2 rules applied. Total rules applied 107 place count 175 transition count 200
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 108 place count 174 transition count 199
Iterating global reduction 3 with 1 rules applied. Total rules applied 109 place count 174 transition count 199
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 110 place count 173 transition count 198
Iterating global reduction 3 with 1 rules applied. Total rules applied 111 place count 173 transition count 198
Applied a total of 111 rules in 17 ms. Remains 173 /228 variables (removed 55) and now considering 198/254 (removed 56) transitions.
// Phase 1: matrix 198 rows 173 cols
[2025-06-02 03:45:27] [INFO ] Computed 0 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:45:27] [INFO ] Implicit Places using invariants in 35 ms returned []
[2025-06-02 03:45:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:45:27] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
Running 197 sub problems to find dead transitions.
[2025-06-02 03:45:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 1 (OVERLAPS) 198/370 variables, 172/172 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/370 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 3 (OVERLAPS) 1/371 variables, 1/173 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/371 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 5 (OVERLAPS) 0/371 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 197 unsolved
No progress, stopping.
After SMT solving in domain Real declared 371/371 variables, and 173 constraints, problems are : Problem set: 0 solved, 197 unsolved in 24662 ms.
Refiners :[State Equation: 173/173 constraints, PredecessorRefiner: 197/197 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 197 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 1 (OVERLAPS) 198/370 variables, 172/172 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/370 variables, 197/369 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/370 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 4 (OVERLAPS) 1/371 variables, 1/370 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/371 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 197 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 371/371 variables, and 370 constraints, problems are : Problem set: 0 solved, 197 unsolved in 30016 ms.
Refiners :[State Equation: 173/173 constraints, PredecessorRefiner: 197/197 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 54690ms problems are : Problem set: 0 solved, 197 unsolved
Search for dead transitions found 0 dead transitions in 54690ms
Starting structural reductions in LTL mode, iteration 1 : 173/228 places, 198/254 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54829 ms. Remains : 173/228 places, 198/254 transitions.
[2025-06-02 03:46:21] [INFO ] Flatten gal took : 6 ms
[2025-06-02 03:46:21] [INFO ] Flatten gal took : 9 ms
[2025-06-02 03:46:21] [INFO ] Input system was already deterministic with 198 transitions.
[2025-06-02 03:46:21] [INFO ] Flatten gal took : 5 ms
[2025-06-02 03:46:21] [INFO ] Flatten gal took : 5 ms
[2025-06-02 03:46:21] [INFO ] Time to serialize gal into /tmp/CTLCardinality1751541038759029130.gal : 1 ms
[2025-06-02 03:46:21] [INFO ] Time to serialize properties into /tmp/CTLCardinality16338287362682593156.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/CTLCardinality1751541038759029130.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16338287362682593156.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,2856,0.062768,6084,2,673,5,6197,6,0,890,9118,0


Converting to forward existential form...Done !
original formula: (EX(((AF((task_s00000730_input_s00000263==0)) + ((task_s00000760_inputCriterion_s00000257_used==0)&&(merge_s00000445_activated==1))) + !(...537
=> equivalent forward existential formula: ([(Init * !(EX(((!(EG(!((task_s00000730_input_s00000263==0)))) + ((task_s00000760_inputCriterion_s00000257_used=...818
Reverse transition relation is NOT exact ! Due to transitions t24, t26, t27, t28, t29, t32, t33, t34, t39, t40, t44, t46, t51, t54, t55, t69, t79, t119, t1...283
(forward)formula 0,0,0.640241,29380,1,0,348,92872,425,188,4748,124830,512
FORMULA IBM703-PT-none-CTLCardinality-2025-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 228/228 places, 254/254 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 226 transition count 254
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 19 place count 209 transition count 237
Iterating global reduction 1 with 17 rules applied. Total rules applied 36 place count 209 transition count 237
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 37 place count 209 transition count 236
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 48 place count 198 transition count 225
Iterating global reduction 2 with 11 rules applied. Total rules applied 59 place count 198 transition count 225
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 68 place count 189 transition count 216
Iterating global reduction 2 with 9 rules applied. Total rules applied 77 place count 189 transition count 216
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 79 place count 189 transition count 214
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 84 place count 184 transition count 209
Iterating global reduction 3 with 5 rules applied. Total rules applied 89 place count 184 transition count 209
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 92 place count 181 transition count 206
Iterating global reduction 3 with 3 rules applied. Total rules applied 95 place count 181 transition count 206
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 98 place count 178 transition count 203
Iterating global reduction 3 with 3 rules applied. Total rules applied 101 place count 178 transition count 203
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 103 place count 176 transition count 201
Iterating global reduction 3 with 2 rules applied. Total rules applied 105 place count 176 transition count 201
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 106 place count 175 transition count 200
Iterating global reduction 3 with 1 rules applied. Total rules applied 107 place count 175 transition count 200
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 108 place count 174 transition count 199
Iterating global reduction 3 with 1 rules applied. Total rules applied 109 place count 174 transition count 199
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 110 place count 173 transition count 198
Iterating global reduction 3 with 1 rules applied. Total rules applied 111 place count 173 transition count 198
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 112 place count 172 transition count 197
Iterating global reduction 3 with 1 rules applied. Total rules applied 113 place count 172 transition count 197
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 114 place count 171 transition count 196
Iterating global reduction 3 with 1 rules applied. Total rules applied 115 place count 171 transition count 196
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 116 place count 171 transition count 195
Applied a total of 116 rules in 29 ms. Remains 171 /228 variables (removed 57) and now considering 195/254 (removed 59) transitions.
// Phase 1: matrix 195 rows 171 cols
[2025-06-02 03:46:22] [INFO ] Computed 0 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:46:22] [INFO ] Implicit Places using invariants in 37 ms returned []
[2025-06-02 03:46:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:46:22] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
Running 194 sub problems to find dead transitions.
[2025-06-02 03:46:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 1 (OVERLAPS) 195/365 variables, 170/170 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/365 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 3 (OVERLAPS) 1/366 variables, 1/171 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/366 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 5 (OVERLAPS) 0/366 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 194 unsolved
No progress, stopping.
After SMT solving in domain Real declared 366/366 variables, and 171 constraints, problems are : Problem set: 0 solved, 194 unsolved in 24360 ms.
Refiners :[State Equation: 171/171 constraints, PredecessorRefiner: 194/194 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 194 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 1 (OVERLAPS) 195/365 variables, 170/170 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/365 variables, 194/364 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/365 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 4 (OVERLAPS) 1/366 variables, 1/365 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/366 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 194 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 366/366 variables, and 365 constraints, problems are : Problem set: 0 solved, 194 unsolved in 30017 ms.
Refiners :[State Equation: 171/171 constraints, PredecessorRefiner: 194/194 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 54385ms problems are : Problem set: 0 solved, 194 unsolved
Search for dead transitions found 0 dead transitions in 54386ms
Starting structural reductions in LTL mode, iteration 1 : 171/228 places, 195/254 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54536 ms. Remains : 171/228 places, 195/254 transitions.
[2025-06-02 03:47:17] [INFO ] Flatten gal took : 5 ms
[2025-06-02 03:47:17] [INFO ] Flatten gal took : 5 ms
[2025-06-02 03:47:17] [INFO ] Input system was already deterministic with 195 transitions.
[2025-06-02 03:47:17] [INFO ] Flatten gal took : 5 ms
[2025-06-02 03:47:17] [INFO ] Flatten gal took : 4 ms
[2025-06-02 03:47:17] [INFO ] Time to serialize gal into /tmp/CTLCardinality2252739711408082653.gal : 1 ms
[2025-06-02 03:47:17] [INFO ] Time to serialize properties into /tmp/CTLCardinality8856450476416728379.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/CTLCardinality2252739711408082653.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8856450476416728379.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,2346,0.059609,6032,2,662,5,6138,6,0,879,8942,0


Converting to forward existential form...Done !
original formula: EX(AF((AG(((task_s00000728_inputCriterion_s00000257_used==0)||(merge_s00000806_activated==1))) * ((task_s00000741_output_s00000264==1)||(...203
=> equivalent forward existential formula: [(EY(Init) * !(EG(!((!(E(TRUE U !(((task_s00000728_inputCriterion_s00000257_used==0)||(merge_s00000806_activated...266
Reverse transition relation is NOT exact ! Due to transitions t23, t25, t26, t27, t28, t31, t33, t38, t39, t43, t45, t50, t53, t54, t59, t67, t75, t84, t12...282
(forward)formula 0,0,1.30352,64112,1,0,705,362124,418,434,4826,338358,825
FORMULA IBM703-PT-none-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 : 228/228 places, 254/254 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 226 transition count 254
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 19 place count 209 transition count 237
Iterating global reduction 1 with 17 rules applied. Total rules applied 36 place count 209 transition count 237
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 37 place count 209 transition count 236
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 47 place count 199 transition count 226
Iterating global reduction 2 with 10 rules applied. Total rules applied 57 place count 199 transition count 226
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 65 place count 191 transition count 218
Iterating global reduction 2 with 8 rules applied. Total rules applied 73 place count 191 transition count 218
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 74 place count 191 transition count 217
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 78 place count 187 transition count 213
Iterating global reduction 3 with 4 rules applied. Total rules applied 82 place count 187 transition count 213
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 85 place count 184 transition count 210
Iterating global reduction 3 with 3 rules applied. Total rules applied 88 place count 184 transition count 210
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 91 place count 181 transition count 207
Iterating global reduction 3 with 3 rules applied. Total rules applied 94 place count 181 transition count 207
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 96 place count 179 transition count 205
Iterating global reduction 3 with 2 rules applied. Total rules applied 98 place count 179 transition count 205
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 99 place count 178 transition count 204
Iterating global reduction 3 with 1 rules applied. Total rules applied 100 place count 178 transition count 204
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 101 place count 177 transition count 203
Iterating global reduction 3 with 1 rules applied. Total rules applied 102 place count 177 transition count 203
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 103 place count 176 transition count 202
Iterating global reduction 3 with 1 rules applied. Total rules applied 104 place count 176 transition count 202
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 105 place count 175 transition count 201
Iterating global reduction 3 with 1 rules applied. Total rules applied 106 place count 175 transition count 201
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 107 place count 174 transition count 200
Iterating global reduction 3 with 1 rules applied. Total rules applied 108 place count 174 transition count 200
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 109 place count 174 transition count 199
Applied a total of 109 rules in 16 ms. Remains 174 /228 variables (removed 54) and now considering 199/254 (removed 55) transitions.
// Phase 1: matrix 199 rows 174 cols
[2025-06-02 03:47:18] [INFO ] Computed 0 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:47:18] [INFO ] Implicit Places using invariants in 31 ms returned []
[2025-06-02 03:47:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:47:18] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
Running 198 sub problems to find dead transitions.
[2025-06-02 03:47:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (OVERLAPS) 199/372 variables, 173/173 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/372 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (OVERLAPS) 1/373 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/373 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (OVERLAPS) 0/373 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Real declared 373/373 variables, and 174 constraints, problems are : Problem set: 0 solved, 198 unsolved in 26616 ms.
Refiners :[State Equation: 174/174 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 198 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (OVERLAPS) 199/372 variables, 173/173 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/372 variables, 198/371 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/372 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (OVERLAPS) 1/373 variables, 1/372 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/373 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 198 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 373/373 variables, and 372 constraints, problems are : Problem set: 0 solved, 198 unsolved in 30013 ms.
Refiners :[State Equation: 174/174 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 56639ms problems are : Problem set: 0 solved, 198 unsolved
Search for dead transitions found 0 dead transitions in 56640ms
Starting structural reductions in LTL mode, iteration 1 : 174/228 places, 199/254 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56773 ms. Remains : 174/228 places, 199/254 transitions.
[2025-06-02 03:48:15] [INFO ] Flatten gal took : 7 ms
[2025-06-02 03:48:15] [INFO ] Flatten gal took : 5 ms
[2025-06-02 03:48:15] [INFO ] Input system was already deterministic with 199 transitions.
[2025-06-02 03:48:15] [INFO ] Flatten gal took : 4 ms
[2025-06-02 03:48:15] [INFO ] Flatten gal took : 4 ms
[2025-06-02 03:48:15] [INFO ] Time to serialize gal into /tmp/CTLCardinality7728553747986770081.gal : 1 ms
[2025-06-02 03:48:15] [INFO ] Time to serialize properties into /tmp/CTLCardinality5867241165556472565.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/CTLCardinality7728553747986770081.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5867241165556472565.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,2382,0.06455,6104,2,720,5,6183,6,0,895,9171,0


Converting to forward existential form...Done !
original formula: (EX(AF((AF((merge_s00000462_activated==1)) + EG(((task_s00000727_input_s00000263==0)&&(decision_s00000793_activated==1)))))) * AF(((task_...239
=> equivalent forward existential formula: ([(Init * !(EX(!(EG(!((!(EG(!((merge_s00000462_activated==1)))) + EG(((task_s00000727_input_s00000263==0)&&(deci...318
Hit Full ! (commute/partial/dont) 195/0/4
(forward)formula 0,0,0.453334,23136,1,0,114,84560,19,3,3969,88250,114
FORMULA IBM703-PT-none-CTLCardinality-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
[2025-06-02 03:48:15] [INFO ] Flatten gal took : 5 ms
[2025-06-02 03:48:15] [INFO ] Flatten gal took : 5 ms
Total runtime 459881 ms.

BK_STOP 1748836095749

--------------------
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
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.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="IBM703-PT-none"
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 IBM703-PT-none, 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 r114-tall-174876422500345"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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