Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r142-tall-174876812600457.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 PermAdmissibility-COL-02, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r142-tall-174876812600457
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 512K
-rw-r--r-- 1 mcc users 6.9K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K 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.3K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K 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 12K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 120K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_pt
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 5 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 54K 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 PermAdmissibility-COL-02-CTLCardinality-2025-00
FORMULA_NAME PermAdmissibility-COL-02-CTLCardinality-2025-01
FORMULA_NAME PermAdmissibility-COL-02-CTLCardinality-2025-02
FORMULA_NAME PermAdmissibility-COL-02-CTLCardinality-2025-03
FORMULA_NAME PermAdmissibility-COL-02-CTLCardinality-2025-04
FORMULA_NAME PermAdmissibility-COL-02-CTLCardinality-2025-05
FORMULA_NAME PermAdmissibility-COL-02-CTLCardinality-2025-06
FORMULA_NAME PermAdmissibility-COL-02-CTLCardinality-2025-07
FORMULA_NAME PermAdmissibility-COL-02-CTLCardinality-2025-08
FORMULA_NAME PermAdmissibility-COL-02-CTLCardinality-2025-09
FORMULA_NAME PermAdmissibility-COL-02-CTLCardinality-2025-10
FORMULA_NAME PermAdmissibility-COL-02-CTLCardinality-2025-11
FORMULA_NAME PermAdmissibility-COL-02-CTLCardinality-2025-12
FORMULA_NAME PermAdmissibility-COL-02-CTLCardinality-2025-13
FORMULA_NAME PermAdmissibility-COL-02-CTLCardinality-2025-14
FORMULA_NAME PermAdmissibility-COL-02-CTLCardinality-2025-15

=== Now, execution of the tool begins

BK_START 1748890521877

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PermAdmissibility-COL-02
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
CTLCardinality COL
Running Version 202505121319
[2025-06-02 18:55:23] [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 18:55:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 18:55:23] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2025-06-02 18:55:23] [WARNING] Using fallBack plugin, rng conformance not checked
[2025-06-02 18:55:23] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 550 ms
[2025-06-02 18:55:24] [INFO ] Imported 40 HL places and 16 HL transitions for a total of 208 PT places and 1024.0 transition bindings in 21 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 18 ms.
[2025-06-02 18:55:24] [INFO ] Built PT skeleton of HLPN with 40 places and 16 transitions 83 arcs in 4 ms.
[2025-06-02 18:55:24] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Computed a total of 40 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 40 transition count 16
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 4 formulas.
FORMULA PermAdmissibility-COL-02-CTLCardinality-2025-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-COL-02-CTLCardinality-2025-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Remains 14 properties that can be checked using skeleton over-approximation.
Computed a total of 40 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 40 transition count 16
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
RANDOM walk for 40001 steps (833 resets) in 1268 ms. (31 steps per ms) remains 45/70 properties
BEST_FIRST walk for 4001 steps (51 resets) in 44 ms. (88 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4001 steps (54 resets) in 42 ms. (93 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4001 steps (52 resets) in 61 ms. (64 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4000 steps (60 resets) in 23 ms. (166 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (60 resets) in 23 ms. (166 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (52 resets) in 26 ms. (148 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (60 resets) in 22 ms. (174 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (51 resets) in 35 ms. (111 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (48 resets) in 27 ms. (142 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (49 resets) in 25 ms. (153 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (56 resets) in 25 ms. (153 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (60 resets) in 41 ms. (95 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (45 resets) in 24 ms. (160 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (60 resets) in 27 ms. (143 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4000 steps (60 resets) in 18 ms. (210 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (45 resets) in 15 ms. (250 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (52 resets) in 18 ms. (210 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4001 steps (56 resets) in 19 ms. (200 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (44 resets) in 18 ms. (210 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (51 resets) in 23 ms. (166 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4001 steps (54 resets) in 17 ms. (222 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (52 resets) in 42 ms. (93 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4001 steps (52 resets) in 22 ms. (173 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (52 resets) in 19 ms. (200 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (60 resets) in 23 ms. (166 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (48 resets) in 18 ms. (210 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (56 resets) in 21 ms. (181 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (57 resets) in 22 ms. (174 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (48 resets) in 22 ms. (174 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4001 steps (44 resets) in 26 ms. (148 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4001 steps (60 resets) in 42 ms. (93 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (56 resets) in 29 ms. (133 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (52 resets) in 32 ms. (121 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (48 resets) in 28 ms. (138 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (52 resets) in 31 ms. (125 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (50 resets) in 26 ms. (148 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (54 resets) in 23 ms. (166 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4000 steps (60 resets) in 27 ms. (142 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4001 steps (46 resets) in 15 ms. (250 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4001 steps (52 resets) in 20 ms. (190 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (48 resets) in 50 ms. (78 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4000 steps (60 resets) in 22 ms. (173 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4000 steps (60 resets) in 19 ms. (200 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4000 steps (56 resets) in 18 ms. (210 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4001 steps (52 resets) in 17 ms. (222 steps per ms) remains 45/45 properties
// Phase 1: matrix 16 rows 40 cols
[2025-06-02 18:55:25] [INFO ] Computed 24 invariants in 6 ms
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/36 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 45 unsolved
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp40 is UNSAT
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp50 is UNSAT
Problem AtomicPropp51 is UNSAT
Problem AtomicPropp52 is UNSAT
Problem AtomicPropp53 is UNSAT
Problem AtomicPropp54 is UNSAT
Problem AtomicPropp55 is UNSAT
Problem AtomicPropp57 is UNSAT
Problem AtomicPropp59 is UNSAT
Problem AtomicPropp60 is UNSAT
Problem AtomicPropp62 is UNSAT
Problem AtomicPropp63 is UNSAT
Problem AtomicPropp65 is UNSAT
Problem AtomicPropp66 is UNSAT
Problem AtomicPropp68 is UNSAT
After SMT solving in domain Real declared 40/56 variables, and 24 constraints, problems are : Problem set: 45 solved, 0 unsolved in 392 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/40 constraints, PredecessorRefiner: 45/45 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 446ms problems are : Problem set: 45 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 45 atomic propositions for a total of 14 simplifications.
FORMULA PermAdmissibility-COL-02-CTLCardinality-2025-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-02 18:55:25] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2025-06-02 18:55:25] [INFO ] Flatten gal took : 16 ms
FORMULA PermAdmissibility-COL-02-CTLCardinality-2025-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-COL-02-CTLCardinality-2025-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-COL-02-CTLCardinality-2025-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-COL-02-CTLCardinality-2025-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-COL-02-CTLCardinality-2025-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-02 18:55:25] [INFO ] Flatten gal took : 4 ms
Symmetric sort wr.t. initial and guards and successors and join/free detected :input
Symmetric sort wr.t. initial detected :input
Symmetric sort wr.t. initial and guards detected :input
Applying symmetric unfolding of full symmetric sort :input domain size was 8
[2025-06-02 18:55:25] [INFO ] Unfolded HLPN to a Petri net with 40 places and 16 transitions 83 arcs in 9 ms.
[2025-06-02 18:55:25] [INFO ] Unfolded 8 HLPN properties in 0 ms.
Support contains 36 out of 40 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 16/16 transitions.
Applied a total of 0 rules in 4 ms. Remains 40 /40 variables (removed 0) and now considering 16/16 (removed 0) transitions.
[2025-06-02 18:55:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:55:25] [INFO ] Implicit Places using invariants in 47 ms returned []
[2025-06-02 18:55:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:55:25] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
Running 15 sub problems to find dead transitions.
[2025-06-02 18:55:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 9/40 variables, 16/24 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 16/56 variables, 40/64 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (OVERLAPS) 0/56 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 56/56 variables, and 64 constraints, problems are : Problem set: 0 solved, 15 unsolved in 349 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 40/40 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 9/40 variables, 16/24 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 16/56 variables, 40/64 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 15/79 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/56 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 0/56 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 56/56 variables, and 79 constraints, problems are : Problem set: 0 solved, 15 unsolved in 477 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 40/40 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 836ms problems are : Problem set: 0 solved, 15 unsolved
Search for dead transitions found 0 dead transitions in 836ms
Finished structural reductions in LTL mode , in 1 iterations and 953 ms. Remains : 40/40 places, 16/16 transitions.
Support contains 36 out of 40 places after structural reductions.
[2025-06-02 18:55:26] [INFO ] Flatten gal took : 5 ms
[2025-06-02 18:55:26] [INFO ] Flatten gal took : 4 ms
[2025-06-02 18:55:26] [INFO ] Input system was already deterministic with 16 transitions.
RANDOM walk for 40001 steps (829 resets) in 742 ms. (53 steps per ms) remains 28/47 properties
BEST_FIRST walk for 4000 steps (51 resets) in 14 ms. (266 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (54 resets) in 25 ms. (153 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (52 resets) in 21 ms. (181 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4000 steps (60 resets) in 20 ms. (190 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (52 resets) in 14 ms. (266 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (60 resets) in 34 ms. (114 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (51 resets) in 14 ms. (266 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4001 steps (48 resets) in 20 ms. (190 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4001 steps (48 resets) in 15 ms. (250 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (56 resets) in 25 ms. (153 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (60 resets) in 25 ms. (153 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (47 resets) in 19 ms. (200 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (60 resets) in 21 ms. (181 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4000 steps (60 resets) in 18 ms. (210 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4001 steps (52 resets) in 22 ms. (173 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (60 resets) in 57 ms. (69 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (48 resets) in 26 ms. (148 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4001 steps (56 resets) in 21 ms. (181 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (56 resets) in 37 ms. (105 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (49 resets) in 19 ms. (200 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (47 resets) in 18 ms. (210 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (60 resets) in 24 ms. (160 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (52 resets) in 28 ms. (138 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (50 resets) in 20 ms. (190 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4000 steps (60 resets) in 27 ms. (142 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4000 steps (60 resets) in 25 ms. (153 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (58 resets) in 20 ms. (190 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (52 resets) in 26 ms. (148 steps per ms) remains 28/28 properties
[2025-06-02 18:55:27] [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/30 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 28 unsolved
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp40 is UNSAT
Problem AtomicPropp42 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp45 is UNSAT
After SMT solving in domain Real declared 40/56 variables, and 24 constraints, problems are : Problem set: 28 solved, 0 unsolved in 108 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/40 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 113ms problems are : Problem set: 28 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 28 atomic propositions for a total of 8 simplifications.
[2025-06-02 18:55:27] [INFO ] Flatten gal took : 4 ms
[2025-06-02 18:55:27] [INFO ] Flatten gal took : 3 ms
[2025-06-02 18:55:27] [INFO ] Input system was already deterministic with 16 transitions.
Support contains 12 out of 40 places (down from 16) after GAL structural reductions.
Computed a total of 40 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 40 transition count 16
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 16/16 transitions.
Ensure Unique test removed 2 places
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 31 transition count 16
Applied a total of 9 rules in 6 ms. Remains 31 /40 variables (removed 9) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 31 cols
[2025-06-02 18:55:27] [INFO ] Computed 15 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:55:27] [INFO ] Implicit Places using invariants in 38 ms returned [4, 8, 12, 15, 16, 20, 21, 25]
[2025-06-02 18:55:27] [INFO ] Actually due to overlaps returned [4, 8, 12, 15, 20, 21, 25]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 41 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 24/40 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 48 ms. Remains : 24/40 places, 16/16 transitions.
[2025-06-02 18:55:27] [INFO ] Flatten gal took : 2 ms
[2025-06-02 18:55:27] [INFO ] Flatten gal took : 1 ms
[2025-06-02 18:55:27] [INFO ] Input system was already deterministic with 16 transitions.
[2025-06-02 18:55:27] [INFO ] Flatten gal took : 2 ms
[2025-06-02 18:55:27] [INFO ] Flatten gal took : 2 ms
[2025-06-02 18:55:27] [INFO ] Time to serialize gal into /tmp/CTLCardinality1431212624412326769.gal : 1 ms
[2025-06-02 18:55:27] [INFO ] Time to serialize properties into /tmp/CTLCardinality1359604009494003286.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/CTLCardinality1431212624412326769.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1359604009494003286.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,153,0.014648,3768,2,178,5,635,6,0,110,438,0


Converting to forward existential form...Done !
original formula: EG((A(EX(((in3<=59)&&(aux10>aux15))) U !((AX((out7<=aux11)) + AX((aux8<=aux11))))) + (aux11<=aux14)))
=> equivalent forward existential formula: [FwdG(Init,(!((E(!(!((!(EX(!((out7<=aux11)))) + !(EX(!((aux8<=aux11))))))) U (!(EX(((in3<=59)&&(aux10>aux15)))) ...311
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.055601,5944,1,0,180,11407,23,124,606,13540,158
FORMULA PermAdmissibility-COL-02-CTLCardinality-2025-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 16/16 transitions.
Ensure Unique test removed 2 places
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 30 transition count 16
Applied a total of 10 rules in 2 ms. Remains 30 /40 variables (removed 10) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 30 cols
[2025-06-02 18:55:27] [INFO ] Computed 14 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:55:27] [INFO ] Implicit Places using invariants in 44 ms returned [3, 5, 6, 7, 11, 13, 14, 15, 18, 19, 20, 24, 25, 26]
[2025-06-02 18:55:27] [INFO ] Actually due to overlaps returned [3, 6, 11, 13, 18, 19, 20, 24]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 45 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 22/40 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 48 ms. Remains : 22/40 places, 16/16 transitions.
[2025-06-02 18:55:27] [INFO ] Flatten gal took : 2 ms
[2025-06-02 18:55:27] [INFO ] Flatten gal took : 1 ms
[2025-06-02 18:55:27] [INFO ] Input system was already deterministic with 16 transitions.
[2025-06-02 18:55:27] [INFO ] Flatten gal took : 1 ms
[2025-06-02 18:55:27] [INFO ] Flatten gal took : 1 ms
[2025-06-02 18:55:27] [INFO ] Time to serialize gal into /tmp/CTLCardinality13115514891150241279.gal : 1 ms
[2025-06-02 18:55:27] [INFO ] Time to serialize properties into /tmp/CTLCardinality15925467934062395138.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/CTLCardinality13115514891150241279.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15925467934062395138.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,153,0.005449,3924,2,186,5,791,6,0,106,738,0


Converting to forward existential form...Done !
original formula: AX(EG((AG((c110>1)) + AX(FALSE))))
=> equivalent forward existential formula: [(EY(Init) * !(EG((!(E(TRUE U !((c110>1)))) + !(EX(!(FALSE)))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0...163
(forward)formula 0,0,0.021928,4820,1,0,62,4371,57,26,676,5047,84
FORMULA PermAdmissibility-COL-02-CTLCardinality-2025-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 16/16 transitions.
Ensure Unique test removed 2 places
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 30 transition count 16
Applied a total of 10 rules in 1 ms. Remains 30 /40 variables (removed 10) and now considering 16/16 (removed 0) transitions.
[2025-06-02 18:55:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:55:27] [INFO ] Implicit Places using invariants in 41 ms returned [3, 5, 6, 7, 11, 13, 14, 15, 18, 19, 20, 24, 25, 26]
[2025-06-02 18:55:27] [INFO ] Actually due to overlaps returned [3, 6, 11, 13, 18, 19, 20, 24]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 43 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 22/40 places, 16/16 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 44 ms. Remains : 22/40 places, 16/16 transitions.
[2025-06-02 18:55:27] [INFO ] Flatten gal took : 1 ms
[2025-06-02 18:55:27] [INFO ] Flatten gal took : 2 ms
[2025-06-02 18:55:27] [INFO ] Input system was already deterministic with 16 transitions.
[2025-06-02 18:55:27] [INFO ] Flatten gal took : 1 ms
[2025-06-02 18:55:27] [INFO ] Flatten gal took : 1 ms
[2025-06-02 18:55:27] [INFO ] Time to serialize gal into /tmp/CTLCardinality11224929787310199281.gal : 1 ms
[2025-06-02 18:55:27] [INFO ] Time to serialize properties into /tmp/CTLCardinality11523387884864231469.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/CTLCardinality11224929787310199281.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11523387884864231469.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,153,0.005632,3884,2,186,5,791,6,0,106,738,0


Converting to forward existential form...Done !
original formula: AX(FALSE)
=> equivalent forward existential formula: [(EY(Init) * !(FALSE))] = FALSE
(forward)formula 0,0,0.005859,3884,1,0,6,791,7,1,140,738,1
FORMULA PermAdmissibility-COL-02-CTLCardinality-2025-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 16/16 transitions.
Ensure Unique test removed 2 places
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 31 transition count 16
Applied a total of 9 rules in 1 ms. Remains 31 /40 variables (removed 9) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 31 cols
[2025-06-02 18:55:27] [INFO ] Computed 15 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:55:27] [INFO ] Implicit Places using invariants in 46 ms returned [4, 6, 7, 8, 12, 14, 15, 16, 20, 21, 25, 26, 27]
[2025-06-02 18:55:27] [INFO ] Actually due to overlaps returned [4, 7, 12, 14, 20, 21, 25]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 47 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 24/40 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 49 ms. Remains : 24/40 places, 16/16 transitions.
[2025-06-02 18:55:27] [INFO ] Flatten gal took : 3 ms
[2025-06-02 18:55:27] [INFO ] Flatten gal took : 1 ms
[2025-06-02 18:55:27] [INFO ] Input system was already deterministic with 16 transitions.
[2025-06-02 18:55:27] [INFO ] Flatten gal took : 1 ms
[2025-06-02 18:55:27] [INFO ] Flatten gal took : 1 ms
[2025-06-02 18:55:27] [INFO ] Time to serialize gal into /tmp/CTLCardinality16605231554626470498.gal : 0 ms
[2025-06-02 18:55:27] [INFO ] Time to serialize properties into /tmp/CTLCardinality1552358547867671349.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/CTLCardinality16605231554626470498.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1552358547867671349.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,153,0.00516,3944,2,202,5,687,6,0,110,488,0


Converting to forward existential form...Done !
original formula: EX(AG(EF((out2<=in3))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U !(E(TRUE U (out2<=in3))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0...163
(forward)formula 0,0,0.016026,4456,1,0,31,2671,51,22,711,2505,47
FORMULA PermAdmissibility-COL-02-CTLCardinality-2025-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 16/16 transitions.
Ensure Unique test removed 2 places
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 30 transition count 16
Applied a total of 10 rules in 1 ms. Remains 30 /40 variables (removed 10) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 30 cols
[2025-06-02 18:55:27] [INFO ] Computed 14 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:55:27] [INFO ] Implicit Places using invariants in 43 ms returned [3, 5, 6, 7, 11, 13, 14, 15, 18, 19, 20, 24, 25, 26]
[2025-06-02 18:55:27] [INFO ] Actually due to overlaps returned [3, 6, 11, 13, 18, 19, 20, 24]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 44 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 22/40 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 46 ms. Remains : 22/40 places, 16/16 transitions.
[2025-06-02 18:55:27] [INFO ] Flatten gal took : 1 ms
[2025-06-02 18:55:27] [INFO ] Flatten gal took : 1 ms
[2025-06-02 18:55:27] [INFO ] Input system was already deterministic with 16 transitions.
[2025-06-02 18:55:27] [INFO ] Flatten gal took : 2 ms
[2025-06-02 18:55:27] [INFO ] Flatten gal took : 1 ms
[2025-06-02 18:55:27] [INFO ] Time to serialize gal into /tmp/CTLCardinality6772036383711657885.gal : 1 ms
[2025-06-02 18:55:27] [INFO ] Time to serialize properties into /tmp/CTLCardinality2656001574101148044.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/CTLCardinality6772036383711657885.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2656001574101148044.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,153,0.005483,3928,2,186,5,791,6,0,106,738,0


Converting to forward existential form...Done !
original formula: AX(FALSE)
=> equivalent forward existential formula: [(EY(Init) * !(FALSE))] = FALSE
(forward)formula 0,0,0.00572,3928,1,0,6,791,7,1,140,738,1
FORMULA PermAdmissibility-COL-02-CTLCardinality-2025-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 16/16 transitions.
Ensure Unique test removed 2 places
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 30 transition count 16
Applied a total of 10 rules in 1 ms. Remains 30 /40 variables (removed 10) and now considering 16/16 (removed 0) transitions.
[2025-06-02 18:55:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:55:27] [INFO ] Implicit Places using invariants in 39 ms returned [3, 5, 6, 7, 11, 13, 14, 15, 18, 19, 20, 24, 25, 26]
[2025-06-02 18:55:27] [INFO ] Actually due to overlaps returned [3, 6, 11, 13, 18, 19, 20, 24]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 40 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 22/40 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 42 ms. Remains : 22/40 places, 16/16 transitions.
[2025-06-02 18:55:27] [INFO ] Flatten gal took : 3 ms
[2025-06-02 18:55:27] [INFO ] Flatten gal took : 1 ms
[2025-06-02 18:55:27] [INFO ] Input system was already deterministic with 16 transitions.
[2025-06-02 18:55:27] [INFO ] Flatten gal took : 1 ms
[2025-06-02 18:55:27] [INFO ] Flatten gal took : 1 ms
[2025-06-02 18:55:27] [INFO ] Time to serialize gal into /tmp/CTLCardinality8849910848194490538.gal : 1 ms
[2025-06-02 18:55:27] [INFO ] Time to serialize properties into /tmp/CTLCardinality646265940144598642.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/CTLCardinality8849910848194490538.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality646265940144598642.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,153,0.005817,3968,2,186,5,791,6,0,106,738,0


Converting to forward existential form...Done !
original formula: AX(FALSE)
=> equivalent forward existential formula: [(EY(Init) * !(FALSE))] = FALSE
(forward)formula 0,0,0.006032,3968,1,0,6,791,7,1,140,738,1
FORMULA PermAdmissibility-COL-02-CTLCardinality-2025-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 40/40 places, 16/16 transitions.
Graph (complete) has 105 edges and 40 vertex of which 29 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.0 ms
Discarding 11 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Ensure Unique test removed 2 places
Applied a total of 1 rules in 8 ms. Remains 27 /40 variables (removed 13) and now considering 14/16 (removed 2) transitions.
// Phase 1: matrix 14 rows 27 cols
[2025-06-02 18:55:27] [INFO ] Computed 13 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:55:27] [INFO ] Implicit Places using invariants in 37 ms returned [2, 8, 11, 12, 15, 17, 21, 22, 23]
[2025-06-02 18:55:27] [INFO ] Actually due to overlaps returned [2, 8, 11, 15, 17, 21]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 38 ms to find 6 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 21/40 places, 14/16 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 21 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 20 transition count 13
Applied a total of 2 rules in 4 ms. Remains 20 /21 variables (removed 1) and now considering 13/14 (removed 1) transitions.
// Phase 1: matrix 13 rows 20 cols
[2025-06-02 18:55:27] [INFO ] Computed 7 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:55:27] [INFO ] Implicit Places using invariants in 23 ms returned [9, 15, 16]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 24 ms to find 3 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 17/40 places, 13/16 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 0 with 2 rules applied. Total rules applied 2 place count 17 transition count 11
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 5 place count 15 transition count 10
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 14 transition count 10
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 6 place count 14 transition count 9
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 8 place count 13 transition count 9
Applied a total of 8 rules in 4 ms. Remains 13 /17 variables (removed 4) and now considering 9/13 (removed 4) transitions.
// Phase 1: matrix 9 rows 13 cols
[2025-06-02 18:55:27] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:55:27] [INFO ] Implicit Places using invariants in 17 ms returned []
[2025-06-02 18:55:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:55:27] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 3 : 13/40 places, 9/16 transitions.
Finished structural reductions in SI_CTL mode , in 3 iterations and 121 ms. Remains : 13/40 places, 9/16 transitions.
[2025-06-02 18:55:27] [INFO ] Flatten gal took : 1 ms
[2025-06-02 18:55:27] [INFO ] Flatten gal took : 1 ms
[2025-06-02 18:55:27] [INFO ] Input system was already deterministic with 9 transitions.
[2025-06-02 18:55:27] [INFO ] Flatten gal took : 1 ms
[2025-06-02 18:55:27] [INFO ] Flatten gal took : 1 ms
[2025-06-02 18:55:27] [INFO ] Time to serialize gal into /tmp/CTLCardinality3260213266275828653.gal : 1 ms
[2025-06-02 18:55:27] [INFO ] Time to serialize properties into /tmp/CTLCardinality9979790867677245046.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/CTLCardinality3260213266275828653.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9979790867677245046.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,55,0.00394,3788,2,53,5,255,6,0,59,174,0


Converting to forward existential form...Done !
original formula: EF(((aux15>c17) * EG(((aux8<=c6)&&((out2<=in1)||(aux8<=41))))))
=> equivalent forward existential formula: [FwdG((FwdU(Init,TRUE) * (aux15>c17)),((aux8<=c6)&&((out2<=in1)||(aux8<=41))))] != FALSE
Hit Full ! (commute/partial/dont) 3/0/6
(forward)formula 0,1,0.00762,4044,1,0,28,1130,19,5,338,973,26
FORMULA PermAdmissibility-COL-02-CTLCardinality-2025-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 16/16 transitions.
Ensure Unique test removed 2 places
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 30 transition count 16
Applied a total of 10 rules in 0 ms. Remains 30 /40 variables (removed 10) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 30 cols
[2025-06-02 18:55:27] [INFO ] Computed 14 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:55:27] [INFO ] Implicit Places using invariants in 45 ms returned [3, 5, 6, 7, 11, 13, 14, 15, 18, 20, 24, 25, 26]
[2025-06-02 18:55:27] [INFO ] Actually due to overlaps returned [3, 6, 11, 13, 18, 20, 24]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 46 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 23/40 places, 16/16 transitions.
Applied a total of 0 rules in 0 ms. Remains 23 /23 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 46 ms. Remains : 23/40 places, 16/16 transitions.
[2025-06-02 18:55:27] [INFO ] Flatten gal took : 1 ms
[2025-06-02 18:55:27] [INFO ] Flatten gal took : 2 ms
[2025-06-02 18:55:27] [INFO ] Input system was already deterministic with 16 transitions.
[2025-06-02 18:55:27] [INFO ] Flatten gal took : 1 ms
[2025-06-02 18:55:27] [INFO ] Flatten gal took : 1 ms
[2025-06-02 18:55:27] [INFO ] Time to serialize gal into /tmp/CTLCardinality10300241649746579309.gal : 0 ms
[2025-06-02 18:55:27] [INFO ] Time to serialize properties into /tmp/CTLCardinality2708712247262169336.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/CTLCardinality10300241649746579309.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2708712247262169336.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,153,0.005829,3940,2,192,5,801,6,0,109,741,0


Converting to forward existential form...Done !
original formula: AX(EF(AG((in1>c17))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U !(E(TRUE U !((in1>c17)))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0...163
(forward)formula 0,0,0.015528,4452,1,0,28,2455,52,20,710,2359,42
FORMULA PermAdmissibility-COL-02-CTLCardinality-2025-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

[2025-06-02 18:55:27] [INFO ] Flatten gal took : 2 ms
[2025-06-02 18:55:27] [INFO ] Flatten gal took : 2 ms
Total runtime 4630 ms.

BK_STOP 1748890528010

--------------------
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="PermAdmissibility-COL-02"
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 PermAdmissibility-COL-02, 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 r142-tall-174876812600457"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PermAdmissibility-COL-02.tgz
mv PermAdmissibility-COL-02 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 ;