Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 484K
-rw-r--r-- 1 mcc users 6.5K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K 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 8.9K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 28K May 29 14:32 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1748917507965

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DiscoveryGPU-PT-08a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202505121319
[2025-06-03 02:25:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-03 02:25:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-03 02:25:11] [INFO ] Load time of PNML (sax parser for PT used): 123 ms
[2025-06-03 02:25:11] [INFO ] Transformed 83 places.
[2025-06-03 02:25:11] [INFO ] Transformed 113 transitions.
[2025-06-03 02:25:11] [INFO ] Found NUPN structural information;
[2025-06-03 02:25:11] [INFO ] Parsed PT model containing 83 places and 113 transitions and 363 arcs in 360 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 29 ms.
Support contains 61 out of 83 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 83/83 places, 113/113 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 80 transition count 110
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 80 transition count 110
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 14 place count 80 transition count 102
Applied a total of 14 rules in 50 ms. Remains 80 /83 variables (removed 3) and now considering 102/113 (removed 11) transitions.
// Phase 1: matrix 102 rows 80 cols
[2025-06-03 02:25:11] [INFO ] Computed 2 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:25:12] [INFO ] Implicit Places using invariants in 317 ms returned []
[2025-06-03 02:25:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:25:12] [INFO ] State equation strengthened by 64 read => feed constraints.
[2025-06-03 02:25:12] [INFO ] Implicit Places using invariants and state equation in 260 ms returned []
Implicit Place search using SMT with State Equation took 667 ms to find 0 implicit places.
Running 101 sub problems to find dead transitions.
[2025-06-03 02:25:12] [INFO ] Invariant cache hit.
[2025-06-03 02:25:12] [INFO ] State equation strengthened by 64 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (OVERLAPS) 1/80 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (OVERLAPS) 102/182 variables, 80/82 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/182 variables, 64/146 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/182 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (OVERLAPS) 0/182 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Real declared 182/182 variables, and 146 constraints, problems are : Problem set: 0 solved, 101 unsolved in 5820 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 80/80 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 101 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (OVERLAPS) 1/80 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (OVERLAPS) 102/182 variables, 80/82 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/182 variables, 64/146 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/182 variables, 101/247 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/182 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (OVERLAPS) 0/182 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Int declared 182/182 variables, and 247 constraints, problems are : Problem set: 0 solved, 101 unsolved in 4649 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 80/80 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10566ms problems are : Problem set: 0 solved, 101 unsolved
Search for dead transitions found 0 dead transitions in 10591ms
Starting structural reductions in LTL mode, iteration 1 : 80/83 places, 102/113 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11343 ms. Remains : 80/83 places, 102/113 transitions.
Support contains 61 out of 80 places after structural reductions.
[2025-06-03 02:25:23] [INFO ] Flatten gal took : 45 ms
[2025-06-03 02:25:23] [INFO ] Flatten gal took : 19 ms
[2025-06-03 02:25:23] [INFO ] Input system was already deterministic with 102 transitions.
RANDOM walk for 40000 steps (469 resets) in 1425 ms. (28 steps per ms) remains 0/70 properties
[2025-06-03 02:25:23] [INFO ] Flatten gal took : 10 ms
[2025-06-03 02:25:23] [INFO ] Flatten gal took : 12 ms
[2025-06-03 02:25:23] [INFO ] Input system was already deterministic with 102 transitions.
Computed a total of 11 stabilizing places and 9 stable transitions
Graph (complete) has 225 edges and 80 vertex of which 75 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.3 ms
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 102/102 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 74 transition count 96
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 74 transition count 96
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 68 transition count 90
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 68 transition count 90
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 28 place count 64 transition count 86
Iterating global reduction 0 with 4 rules applied. Total rules applied 32 place count 64 transition count 86
Applied a total of 32 rules in 13 ms. Remains 64 /80 variables (removed 16) and now considering 86/102 (removed 16) transitions.
// Phase 1: matrix 86 rows 64 cols
[2025-06-03 02:25:23] [INFO ] Computed 2 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:25:23] [INFO ] Implicit Places using invariants in 57 ms returned []
[2025-06-03 02:25:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:25:24] [INFO ] State equation strengthened by 58 read => feed constraints.
[2025-06-03 02:25:24] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 198 ms to find 0 implicit places.
Running 85 sub problems to find dead transitions.
[2025-06-03 02:25:24] [INFO ] Invariant cache hit.
[2025-06-03 02:25:24] [INFO ] State equation strengthened by 58 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 3 (OVERLAPS) 86/150 variables, 64/66 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/150 variables, 58/124 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/150 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 6 (OVERLAPS) 0/150 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Real declared 150/150 variables, and 124 constraints, problems are : Problem set: 0 solved, 85 unsolved in 3963 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 64/64 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 85 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 3 (OVERLAPS) 86/150 variables, 64/66 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/150 variables, 58/124 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/150 variables, 85/209 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/150 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 7 (OVERLAPS) 0/150 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Int declared 150/150 variables, and 209 constraints, problems are : Problem set: 0 solved, 85 unsolved in 4189 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 64/64 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8204ms problems are : Problem set: 0 solved, 85 unsolved
Search for dead transitions found 0 dead transitions in 8207ms
Starting structural reductions in LTL mode, iteration 1 : 64/80 places, 86/102 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8420 ms. Remains : 64/80 places, 86/102 transitions.
[2025-06-03 02:25:32] [INFO ] Flatten gal took : 12 ms
[2025-06-03 02:25:32] [INFO ] Flatten gal took : 10 ms
[2025-06-03 02:25:32] [INFO ] Input system was already deterministic with 86 transitions.
[2025-06-03 02:25:32] [INFO ] Flatten gal took : 14 ms
[2025-06-03 02:25:32] [INFO ] Flatten gal took : 10 ms
[2025-06-03 02:25:32] [INFO ] Time to serialize gal into /tmp/CTLFireability5444983476746769155.gal : 5 ms
[2025-06-03 02:25:32] [INFO ] Time to serialize properties into /tmp/CTLFireability9987338080197172150.ctl : 6 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability5444983476746769155.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9987338080197172150.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.04554e+08,0.436832,11948,2,2001,5,53839,6,0,331,29073,0


Converting to forward existential form...Done !
original formula: EX((AG(((p78==0) * EG(((p45==0)||(p81==0))))) + (!(E((((p40==1)&&(p81==1))||((p4==1)&&(p82==1))) U ((p52==1)&&(p81==1)))) * (((AG(((p8==0...234
=> equivalent forward existential formula: ([(EY(Init) * !(E(TRUE U !(((p78==0) * EG(((p45==0)||(p81==0))))))))] != FALSE + ((([((EY(Init) * !(E((((p40==1)...636
Reverse transition relation is NOT exact ! Due to transitions t20, t24, t26, t28, t29, t31, t33, t69, t73, t77, t78, t79, t80, t81, t82, t83, t84, t85, In...250
(forward)formula 0,0,7.78274,211312,1,0,655,1.18287e+06,215,343,2062,1.46539e+06,804
FORMULA DiscoveryGPU-PT-08a-CTLFireability-2025-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 102/102 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 76 transition count 98
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 76 transition count 98
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 12 place count 72 transition count 94
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 72 transition count 94
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 70 transition count 92
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 70 transition count 92
Applied a total of 20 rules in 10 ms. Remains 70 /80 variables (removed 10) and now considering 92/102 (removed 10) transitions.
// Phase 1: matrix 92 rows 70 cols
[2025-06-03 02:25:40] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:25:40] [INFO ] Implicit Places using invariants in 71 ms returned []
[2025-06-03 02:25:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:25:40] [INFO ] State equation strengthened by 60 read => feed constraints.
[2025-06-03 02:25:40] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 214 ms to find 0 implicit places.
Running 91 sub problems to find dead transitions.
[2025-06-03 02:25:40] [INFO ] Invariant cache hit.
[2025-06-03 02:25:40] [INFO ] State equation strengthened by 60 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (OVERLAPS) 1/70 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 3 (OVERLAPS) 92/162 variables, 70/72 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 60/132 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/162 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (OVERLAPS) 0/162 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Real declared 162/162 variables, and 132 constraints, problems are : Problem set: 0 solved, 91 unsolved in 4139 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 70/70 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 91 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (OVERLAPS) 1/70 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 3 (OVERLAPS) 92/162 variables, 70/72 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 60/132 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/162 variables, 91/223 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (OVERLAPS) 0/162 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Int declared 162/162 variables, and 223 constraints, problems are : Problem set: 0 solved, 91 unsolved in 4952 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 70/70 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9128ms problems are : Problem set: 0 solved, 91 unsolved
Search for dead transitions found 0 dead transitions in 9130ms
Starting structural reductions in LTL mode, iteration 1 : 70/80 places, 92/102 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9355 ms. Remains : 70/80 places, 92/102 transitions.
[2025-06-03 02:25:49] [INFO ] Flatten gal took : 12 ms
[2025-06-03 02:25:49] [INFO ] Flatten gal took : 15 ms
[2025-06-03 02:25:49] [INFO ] Input system was already deterministic with 92 transitions.
[2025-06-03 02:25:49] [INFO ] Flatten gal took : 26 ms
[2025-06-03 02:25:49] [INFO ] Flatten gal took : 10 ms
[2025-06-03 02:25:49] [INFO ] Time to serialize gal into /tmp/CTLFireability2764821094176871813.gal : 3 ms
[2025-06-03 02:25:49] [INFO ] Time to serialize properties into /tmp/CTLFireability8143098484342063807.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/CTLFireability2764821094176871813.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8143098484342063807.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.47622e+08,0.158155,8800,2,1051,5,34160,6,0,360,16907,0


Converting to forward existential form...Done !
original formula: (EF((AG((p21==1)) * ((((((p37==1)&&(p81==1)) * E(((p2==1)&&(p81==1)) U ((p38==1)&&(p82==1)))) + AX((p64==1))) * A((((p4==1)&&(p82==1))||(...535
=> equivalent forward existential formula: (([((((FwdU(Init,TRUE) * !(E(TRUE U !((p21==1))))) * ((((p37==1)&&(p81==1)) * E(((p2==1)&&(p81==1)) U ((p38==1)&...801
Reverse transition relation is NOT exact ! Due to transitions t1, t10, t25, t27, t34, t36, t73, t75, t77, t82, t83, t84, t85, t86, t87, t88, t89, t90, t91,...254
(forward)formula 0,0,1.7706,48096,1,0,338,250139,246,192,2242,282345,457
FORMULA DiscoveryGPU-PT-08a-CTLFireability-2025-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 102/102 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 73 transition count 95
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 73 transition count 95
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 20 place count 67 transition count 89
Iterating global reduction 0 with 6 rules applied. Total rules applied 26 place count 67 transition count 89
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 29 place count 64 transition count 86
Iterating global reduction 0 with 3 rules applied. Total rules applied 32 place count 64 transition count 86
Applied a total of 32 rules in 8 ms. Remains 64 /80 variables (removed 16) and now considering 86/102 (removed 16) transitions.
// Phase 1: matrix 86 rows 64 cols
[2025-06-03 02:25:51] [INFO ] Computed 2 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:25:51] [INFO ] Implicit Places using invariants in 79 ms returned []
[2025-06-03 02:25:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:25:51] [INFO ] State equation strengthened by 57 read => feed constraints.
[2025-06-03 02:25:51] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 229 ms to find 0 implicit places.
Running 85 sub problems to find dead transitions.
[2025-06-03 02:25:51] [INFO ] Invariant cache hit.
[2025-06-03 02:25:51] [INFO ] State equation strengthened by 57 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 3 (OVERLAPS) 86/150 variables, 64/66 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/150 variables, 57/123 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/150 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 6 (OVERLAPS) 0/150 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Real declared 150/150 variables, and 123 constraints, problems are : Problem set: 0 solved, 85 unsolved in 2683 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 64/64 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 85 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 3 (OVERLAPS) 86/150 variables, 64/66 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/150 variables, 57/123 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/150 variables, 85/208 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/150 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 7 (OVERLAPS) 0/150 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Int declared 150/150 variables, and 208 constraints, problems are : Problem set: 0 solved, 85 unsolved in 3232 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 64/64 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5929ms problems are : Problem set: 0 solved, 85 unsolved
Search for dead transitions found 0 dead transitions in 5932ms
Starting structural reductions in LTL mode, iteration 1 : 64/80 places, 86/102 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6170 ms. Remains : 64/80 places, 86/102 transitions.
[2025-06-03 02:25:57] [INFO ] Flatten gal took : 9 ms
[2025-06-03 02:25:57] [INFO ] Flatten gal took : 9 ms
[2025-06-03 02:25:57] [INFO ] Input system was already deterministic with 86 transitions.
[2025-06-03 02:25:57] [INFO ] Flatten gal took : 8 ms
[2025-06-03 02:25:57] [INFO ] Flatten gal took : 25 ms
[2025-06-03 02:25:57] [INFO ] Time to serialize gal into /tmp/CTLFireability12166527136881331642.gal : 2 ms
[2025-06-03 02:25:57] [INFO ] Time to serialize properties into /tmp/CTLFireability14738460532864163155.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/CTLFireability12166527136881331642.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14738460532864163155.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,1.06387e+08,0.335458,14356,2,1959,5,65550,6,0,331,42686,0


Converting to forward existential form...Done !
original formula: EF((AX(((p58==1)&&(p82==1))) * A((E(((p43==1)&&(p82==1)) U ((p20==1)&&(p81==1))) * (((p80==1)&&(p81==1))||((p3==1)&&(p82==1)))) U AF((p16...163
=> equivalent forward existential formula: [(((FwdU(Init,TRUE) * !(EX(!(((p58==1)&&(p82==1)))))) * !(EG(!(!(EG(!((p16==1)))))))) * !(E(!(!(EG(!((p16==1))))...295
Reverse transition relation is NOT exact ! Due to transitions t7, t14, t17, t21, t23, t25, t27, t30, t34, t77, t78, t79, t80, t81, t82, t83, t84, t85, Int...249
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,6.24114,155820,1,0,613,859794,209,380,2047,1.15342e+06,760
FORMULA DiscoveryGPU-PT-08a-CTLFireability-2025-02 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 : 80/80 places, 102/102 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 73 transition count 95
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 73 transition count 95
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 21 place count 66 transition count 88
Iterating global reduction 0 with 7 rules applied. Total rules applied 28 place count 66 transition count 88
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 32 place count 62 transition count 84
Iterating global reduction 0 with 4 rules applied. Total rules applied 36 place count 62 transition count 84
Applied a total of 36 rules in 9 ms. Remains 62 /80 variables (removed 18) and now considering 84/102 (removed 18) transitions.
// Phase 1: matrix 84 rows 62 cols
[2025-06-03 02:26:04] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:26:04] [INFO ] Implicit Places using invariants in 68 ms returned []
[2025-06-03 02:26:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:26:04] [INFO ] State equation strengthened by 57 read => feed constraints.
[2025-06-03 02:26:04] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 216 ms to find 0 implicit places.
Running 83 sub problems to find dead transitions.
[2025-06-03 02:26:04] [INFO ] Invariant cache hit.
[2025-06-03 02:26:04] [INFO ] State equation strengthened by 57 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 1 (OVERLAPS) 1/62 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 3 (OVERLAPS) 84/146 variables, 62/64 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 57/121 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/146 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 6 (OVERLAPS) 0/146 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 83 unsolved
No progress, stopping.
After SMT solving in domain Real declared 146/146 variables, and 121 constraints, problems are : Problem set: 0 solved, 83 unsolved in 3915 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 62/62 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 83/83 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 83 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 1 (OVERLAPS) 1/62 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 3 (OVERLAPS) 84/146 variables, 62/64 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 57/121 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/146 variables, 83/204 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/146 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 7 (OVERLAPS) 0/146 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 83 unsolved
No progress, stopping.
After SMT solving in domain Int declared 146/146 variables, and 204 constraints, problems are : Problem set: 0 solved, 83 unsolved in 4343 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 62/62 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 83/83 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8277ms problems are : Problem set: 0 solved, 83 unsolved
Search for dead transitions found 0 dead transitions in 8279ms
Starting structural reductions in LTL mode, iteration 1 : 62/80 places, 84/102 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8505 ms. Remains : 62/80 places, 84/102 transitions.
[2025-06-03 02:26:12] [INFO ] Flatten gal took : 8 ms
[2025-06-03 02:26:12] [INFO ] Flatten gal took : 7 ms
[2025-06-03 02:26:12] [INFO ] Input system was already deterministic with 84 transitions.
[2025-06-03 02:26:12] [INFO ] Flatten gal took : 10 ms
[2025-06-03 02:26:12] [INFO ] Flatten gal took : 8 ms
[2025-06-03 02:26:12] [INFO ] Time to serialize gal into /tmp/CTLFireability15375699085669989832.gal : 1 ms
[2025-06-03 02:26:12] [INFO ] Time to serialize properties into /tmp/CTLFireability3448799546183281269.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/CTLFireability15375699085669989832.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3448799546183281269.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,9.0964e+07,0.310411,10332,2,1519,5,41341,6,0,321,25034,0


Converting to forward existential form...Done !
original formula: EG(EF(AX(AF(((p48==1)&&(p82==1))))))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U !(EX(!(!(EG(!(((p48==1)&&(p82==1))))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t19, t21, t23, t25, t27, t28, t30, t32, t75, t76, t77, t78, t79, t80, t81, t82, t83, Interse...245
(forward)formula 0,1,7.26628,187136,1,0,537,1.05184e+06,198,293,2057,1.18894e+06,669
FORMULA DiscoveryGPU-PT-08a-CTLFireability-2025-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 102/102 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 74 transition count 96
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 74 transition count 96
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 17 place count 69 transition count 91
Iterating global reduction 0 with 5 rules applied. Total rules applied 22 place count 69 transition count 91
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 25 place count 66 transition count 88
Iterating global reduction 0 with 3 rules applied. Total rules applied 28 place count 66 transition count 88
Applied a total of 28 rules in 8 ms. Remains 66 /80 variables (removed 14) and now considering 88/102 (removed 14) transitions.
// Phase 1: matrix 88 rows 66 cols
[2025-06-03 02:26:20] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:26:20] [INFO ] Implicit Places using invariants in 80 ms returned []
[2025-06-03 02:26:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:26:20] [INFO ] State equation strengthened by 59 read => feed constraints.
[2025-06-03 02:26:20] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 211 ms to find 0 implicit places.
Running 87 sub problems to find dead transitions.
[2025-06-03 02:26:20] [INFO ] Invariant cache hit.
[2025-06-03 02:26:20] [INFO ] State equation strengthened by 59 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 1 (OVERLAPS) 1/66 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 3 (OVERLAPS) 88/154 variables, 66/68 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 59/127 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/154 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 6 (OVERLAPS) 0/154 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 87 unsolved
No progress, stopping.
After SMT solving in domain Real declared 154/154 variables, and 127 constraints, problems are : Problem set: 0 solved, 87 unsolved in 3952 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 66/66 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 87/87 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 87 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 1 (OVERLAPS) 1/66 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 3 (OVERLAPS) 88/154 variables, 66/68 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 59/127 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/154 variables, 87/214 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/154 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 7 (OVERLAPS) 0/154 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 87 unsolved
No progress, stopping.
After SMT solving in domain Int declared 154/154 variables, and 214 constraints, problems are : Problem set: 0 solved, 87 unsolved in 4345 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 66/66 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 87/87 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8311ms problems are : Problem set: 0 solved, 87 unsolved
Search for dead transitions found 0 dead transitions in 8315ms
Starting structural reductions in LTL mode, iteration 1 : 66/80 places, 88/102 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8535 ms. Remains : 66/80 places, 88/102 transitions.
[2025-06-03 02:26:28] [INFO ] Flatten gal took : 14 ms
[2025-06-03 02:26:28] [INFO ] Flatten gal took : 9 ms
[2025-06-03 02:26:28] [INFO ] Input system was already deterministic with 88 transitions.
[2025-06-03 02:26:28] [INFO ] Flatten gal took : 8 ms
[2025-06-03 02:26:28] [INFO ] Flatten gal took : 10 ms
[2025-06-03 02:26:28] [INFO ] Time to serialize gal into /tmp/CTLFireability10285557065905195868.gal : 2 ms
[2025-06-03 02:26:28] [INFO ] Time to serialize properties into /tmp/CTLFireability3470229474468615661.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/CTLFireability10285557065905195868.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3470229474468615661.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.18989e+08,0.333545,12520,2,2220,5,54949,6,0,341,33477,0


Converting to forward existential form...Done !
original formula: E(!((EF(((p52==1)&&(p81==1))) * AX(EF(((p23==1)||((p22==1)&&(p81==1))))))) U ((p48==1)&&(p82==1)))
=> equivalent forward existential formula: [(FwdU(Init,!((E(TRUE U ((p52==1)&&(p81==1))) * !(EX(!(E(TRUE U ((p23==1)||((p22==1)&&(p81==1)))))))))) * ((p48=...180
Reverse transition relation is NOT exact ! Due to transitions t21, t25, t27, t29, t32, t34, t70, t74, t75, t79, t80, t81, t82, t83, t84, t85, t86, t87, In...250
(forward)formula 0,0,2.24125,59532,1,0,142,312093,203,91,2059,307773,202
FORMULA DiscoveryGPU-PT-08a-CTLFireability-2025-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 102/102 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 76 transition count 98
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 76 transition count 98
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 12 place count 72 transition count 94
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 72 transition count 94
Applied a total of 16 rules in 8 ms. Remains 72 /80 variables (removed 8) and now considering 94/102 (removed 8) transitions.
// Phase 1: matrix 94 rows 72 cols
[2025-06-03 02:26:30] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:26:31] [INFO ] Implicit Places using invariants in 51 ms returned []
[2025-06-03 02:26:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:26:31] [INFO ] State equation strengthened by 60 read => feed constraints.
[2025-06-03 02:26:31] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 170 ms to find 0 implicit places.
Running 93 sub problems to find dead transitions.
[2025-06-03 02:26:31] [INFO ] Invariant cache hit.
[2025-06-03 02:26:31] [INFO ] State equation strengthened by 60 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 1 (OVERLAPS) 1/72 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 3 (OVERLAPS) 94/166 variables, 72/74 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/166 variables, 60/134 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/166 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 6 (OVERLAPS) 0/166 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 93 unsolved
No progress, stopping.
After SMT solving in domain Real declared 166/166 variables, and 134 constraints, problems are : Problem set: 0 solved, 93 unsolved in 4503 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 72/72 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 93/93 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 93 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 1 (OVERLAPS) 1/72 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 3 (OVERLAPS) 94/166 variables, 72/74 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/166 variables, 60/134 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/166 variables, 93/227 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/166 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 7 (OVERLAPS) 0/166 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 93 unsolved
No progress, stopping.
After SMT solving in domain Int declared 166/166 variables, and 227 constraints, problems are : Problem set: 0 solved, 93 unsolved in 5196 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 72/72 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 93/93 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9719ms problems are : Problem set: 0 solved, 93 unsolved
Search for dead transitions found 0 dead transitions in 9720ms
Starting structural reductions in LTL mode, iteration 1 : 72/80 places, 94/102 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9898 ms. Remains : 72/80 places, 94/102 transitions.
[2025-06-03 02:26:40] [INFO ] Flatten gal took : 13 ms
[2025-06-03 02:26:40] [INFO ] Flatten gal took : 5 ms
[2025-06-03 02:26:40] [INFO ] Input system was already deterministic with 94 transitions.
[2025-06-03 02:26:40] [INFO ] Flatten gal took : 5 ms
[2025-06-03 02:26:40] [INFO ] Flatten gal took : 5 ms
[2025-06-03 02:26:40] [INFO ] Time to serialize gal into /tmp/CTLFireability6862183961484305699.gal : 2 ms
[2025-06-03 02:26:40] [INFO ] Time to serialize properties into /tmp/CTLFireability6423458978035709130.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/CTLFireability6862183961484305699.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6423458978035709130.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.5644e+08,0.218055,10820,2,877,5,41434,6,0,368,26617,0


Converting to forward existential form...Done !
original formula: EF(((AG(((((p24==0)||(p82==0))&&((p43==0)||(p82==0)))&&(((p43==0)||(p82==0))||(p41==0)))) * AX(((AG(((p78==1)&&(p82==1))) + ((p23==1)&&(p...371
=> equivalent forward existential formula: ([(((FwdU(Init,TRUE) * (!(E(TRUE U !(((((p24==0)||(p82==0))&&((p43==0)||(p82==0)))&&(((p43==0)||(p82==0))||(p41=...930
Reverse transition relation is NOT exact ! Due to transitions t14, t19, t25, t27, t29, t31, t82, t83, t84, t85, t86, t87, t88, t89, t90, t91, t92, t93, In...250
(forward)formula 0,1,1.77656,45032,1,0,267,229131,222,152,2280,277571,364
FORMULA DiscoveryGPU-PT-08a-CTLFireability-2025-05 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 : 80/80 places, 102/102 transitions.
Graph (complete) has 225 edges and 80 vertex of which 75 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 5 Pre rules applied. Total rules applied 1 place count 75 transition count 92
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 11 place count 70 transition count 92
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 18 place count 63 transition count 85
Iterating global reduction 0 with 7 rules applied. Total rules applied 25 place count 63 transition count 85
Applied a total of 25 rules in 55 ms. Remains 63 /80 variables (removed 17) and now considering 85/102 (removed 17) transitions.
// Phase 1: matrix 85 rows 63 cols
[2025-06-03 02:26:42] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:26:42] [INFO ] Implicit Places using invariants in 136 ms returned []
[2025-06-03 02:26:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:26:43] [INFO ] State equation strengthened by 57 read => feed constraints.
[2025-06-03 02:26:43] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 274 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 02:26:43] [INFO ] Redundant transitions in 4 ms returned []
Running 84 sub problems to find dead transitions.
[2025-06-03 02:26:43] [INFO ] Invariant cache hit.
[2025-06-03 02:26:43] [INFO ] State equation strengthened by 57 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 3 (OVERLAPS) 85/148 variables, 63/65 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/148 variables, 57/122 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/148 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 6 (OVERLAPS) 0/148 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Real declared 148/148 variables, and 122 constraints, problems are : Problem set: 0 solved, 84 unsolved in 3924 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 63/63 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 84 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 3 (OVERLAPS) 85/148 variables, 63/65 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/148 variables, 57/122 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/148 variables, 84/206 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/148 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 7 (OVERLAPS) 0/148 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Int declared 148/148 variables, and 206 constraints, problems are : Problem set: 0 solved, 84 unsolved in 3537 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 63/63 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7478ms problems are : Problem set: 0 solved, 84 unsolved
Search for dead transitions found 0 dead transitions in 7479ms
Starting structural reductions in SI_CTL mode, iteration 1 : 63/80 places, 85/102 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7819 ms. Remains : 63/80 places, 85/102 transitions.
[2025-06-03 02:26:50] [INFO ] Flatten gal took : 5 ms
[2025-06-03 02:26:50] [INFO ] Flatten gal took : 4 ms
[2025-06-03 02:26:50] [INFO ] Input system was already deterministic with 85 transitions.
[2025-06-03 02:26:50] [INFO ] Flatten gal took : 4 ms
[2025-06-03 02:26:50] [INFO ] Flatten gal took : 3 ms
[2025-06-03 02:26:50] [INFO ] Time to serialize gal into /tmp/CTLFireability6141889828401842337.gal : 1 ms
[2025-06-03 02:26:50] [INFO ] Time to serialize properties into /tmp/CTLFireability6320533739907529.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/CTLFireability6141889828401842337.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6320533739907529.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 -...280
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.67804e+07,0.308147,10056,2,1623,5,39654,6,0,327,23244,0


Converting to forward existential form...Done !
original formula: EF((E((p16==1) U !(E(((p3==1)&&(p82==1)) U ((p53==1)&&(p82==1))))) * (p73==1)))
=> equivalent forward existential formula: [(FwdU((FwdU(Init,TRUE) * (p73==1)),(p16==1)) * !(E(((p3==1)&&(p82==1)) U ((p53==1)&&(p82==1)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t6, t17, t25, t27, t30, t32, t34, t73, t77, t78, t79, t80, t81, t82, t83, t84, Intersect...243
Hit Full ! (commute/partial/dont) 82/0/3
(forward)formula 0,1,1.20804,30340,1,0,167,146664,198,102,1994,161186,227
FORMULA DiscoveryGPU-PT-08a-CTLFireability-2025-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 102/102 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 73 transition count 95
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 73 transition count 95
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 21 place count 66 transition count 88
Iterating global reduction 0 with 7 rules applied. Total rules applied 28 place count 66 transition count 88
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 32 place count 62 transition count 84
Iterating global reduction 0 with 4 rules applied. Total rules applied 36 place count 62 transition count 84
Applied a total of 36 rules in 6 ms. Remains 62 /80 variables (removed 18) and now considering 84/102 (removed 18) transitions.
// Phase 1: matrix 84 rows 62 cols
[2025-06-03 02:26:51] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:26:51] [INFO ] Implicit Places using invariants in 51 ms returned []
[2025-06-03 02:26:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:26:51] [INFO ] State equation strengthened by 57 read => feed constraints.
[2025-06-03 02:26:51] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 187 ms to find 0 implicit places.
Running 83 sub problems to find dead transitions.
[2025-06-03 02:26:51] [INFO ] Invariant cache hit.
[2025-06-03 02:26:51] [INFO ] State equation strengthened by 57 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 1 (OVERLAPS) 1/62 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 3 (OVERLAPS) 84/146 variables, 62/64 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 57/121 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/146 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 6 (OVERLAPS) 0/146 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 83 unsolved
No progress, stopping.
After SMT solving in domain Real declared 146/146 variables, and 121 constraints, problems are : Problem set: 0 solved, 83 unsolved in 3403 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 62/62 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 83/83 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 83 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 1 (OVERLAPS) 1/62 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 3 (OVERLAPS) 84/146 variables, 62/64 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 57/121 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/146 variables, 83/204 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/146 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 7 (OVERLAPS) 0/146 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 83 unsolved
No progress, stopping.
After SMT solving in domain Int declared 146/146 variables, and 204 constraints, problems are : Problem set: 0 solved, 83 unsolved in 4336 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 62/62 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 83/83 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7762ms problems are : Problem set: 0 solved, 83 unsolved
Search for dead transitions found 0 dead transitions in 7763ms
Starting structural reductions in LTL mode, iteration 1 : 62/80 places, 84/102 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7958 ms. Remains : 62/80 places, 84/102 transitions.
[2025-06-03 02:26:59] [INFO ] Flatten gal took : 6 ms
[2025-06-03 02:26:59] [INFO ] Flatten gal took : 6 ms
[2025-06-03 02:26:59] [INFO ] Input system was already deterministic with 84 transitions.
[2025-06-03 02:26:59] [INFO ] Flatten gal took : 6 ms
[2025-06-03 02:26:59] [INFO ] Flatten gal took : 4 ms
[2025-06-03 02:26:59] [INFO ] Time to serialize gal into /tmp/CTLFireability5971819800957491559.gal : 1 ms
[2025-06-03 02:26:59] [INFO ] Time to serialize properties into /tmp/CTLFireability817716802078336577.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/CTLFireability5971819800957491559.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability817716802078336577.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,9.0964e+07,0.22292,10440,2,1519,5,41341,6,0,321,25034,0


Converting to forward existential form...Done !
original formula: AX(E(!(((p79==1)&&(p81==1))) U EX(EG(AX(((p68==1)&&(p82==1)))))))
=> equivalent forward existential formula: [(EY(Init) * !(E(!(((p79==1)&&(p81==1))) U EX(EG(!(EX(!(((p68==1)&&(p82==1))))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t19, t21, t23, t25, t27, t28, t30, t32, t75, t76, t77, t78, t79, t80, t81, t82, t83, Interse...245
Using saturation style SCC detection
(forward)formula 0,0,3.99936,112864,1,0,365,622423,198,208,1987,801349,433
FORMULA DiscoveryGPU-PT-08a-CTLFireability-2025-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 102/102 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 74 transition count 96
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 74 transition count 96
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 17 place count 69 transition count 91
Iterating global reduction 0 with 5 rules applied. Total rules applied 22 place count 69 transition count 91
Applied a total of 22 rules in 3 ms. Remains 69 /80 variables (removed 11) and now considering 91/102 (removed 11) transitions.
// Phase 1: matrix 91 rows 69 cols
[2025-06-03 02:27:03] [INFO ] Computed 2 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:27:03] [INFO ] Implicit Places using invariants in 52 ms returned []
[2025-06-03 02:27:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:27:03] [INFO ] State equation strengthened by 59 read => feed constraints.
[2025-06-03 02:27:04] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 184 ms to find 0 implicit places.
Running 90 sub problems to find dead transitions.
[2025-06-03 02:27:04] [INFO ] Invariant cache hit.
[2025-06-03 02:27:04] [INFO ] State equation strengthened by 59 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (OVERLAPS) 1/69 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 3 (OVERLAPS) 91/160 variables, 69/71 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/160 variables, 59/130 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/160 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 6 (OVERLAPS) 0/160 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Real declared 160/160 variables, and 130 constraints, problems are : Problem set: 0 solved, 90 unsolved in 4440 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 69/69 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 90 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (OVERLAPS) 1/69 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 3 (OVERLAPS) 91/160 variables, 69/71 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/160 variables, 59/130 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/160 variables, 90/220 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 7 (OVERLAPS) 0/160 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Int declared 160/160 variables, and 220 constraints, problems are : Problem set: 0 solved, 90 unsolved in 4824 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 69/69 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9276ms problems are : Problem set: 0 solved, 90 unsolved
Search for dead transitions found 0 dead transitions in 9276ms
Starting structural reductions in LTL mode, iteration 1 : 69/80 places, 91/102 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9463 ms. Remains : 69/80 places, 91/102 transitions.
[2025-06-03 02:27:13] [INFO ] Flatten gal took : 7 ms
[2025-06-03 02:27:13] [INFO ] Flatten gal took : 7 ms
[2025-06-03 02:27:13] [INFO ] Input system was already deterministic with 91 transitions.
[2025-06-03 02:27:13] [INFO ] Flatten gal took : 8 ms
[2025-06-03 02:27:13] [INFO ] Flatten gal took : 7 ms
[2025-06-03 02:27:13] [INFO ] Time to serialize gal into /tmp/CTLFireability13631797895082154114.gal : 1 ms
[2025-06-03 02:27:13] [INFO ] Time to serialize properties into /tmp/CTLFireability3525128739979574623.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/CTLFireability13631797895082154114.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3525128739979574623.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.40467e+08,0.647352,18852,2,3658,5,92018,6,0,355,64979,0


Converting to forward existential form...Done !
original formula: AG((((AG(((p59==1)&&(p81==1))) + AF(((p72==0)||(p81==0)))) + (E((p43!=1) U (EG(((p6==1)&&(p81==1))) * EX((p34==1)))) + (((p27==1)&&(p81==...353
=> equivalent forward existential formula: [FwdG((((FwdU(Init,TRUE) * !(((E((p21==1) U ((p63==1)&&(p82==1))) * ((p4==1)||((p70==1)&&(p81==1)))) + (((p34==0...426
Reverse transition relation is NOT exact ! Due to transitions t4, t9, t19, t25, t27, t29, t31, t71, t76, t81, t82, t83, t84, t85, t86, t87, t88, t89, t90, ...253
Hit Full ! (commute/partial/dont) 46/44/45
(forward)formula 0,0,8.59351,189700,1,0,365,1.02468e+06,233,199,2368,1.3027e+06,466
FORMULA DiscoveryGPU-PT-08a-CTLFireability-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 : 80/80 places, 102/102 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 74 transition count 96
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 74 transition count 96
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 68 transition count 90
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 68 transition count 90
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 28 place count 64 transition count 86
Iterating global reduction 0 with 4 rules applied. Total rules applied 32 place count 64 transition count 86
Applied a total of 32 rules in 8 ms. Remains 64 /80 variables (removed 16) and now considering 86/102 (removed 16) transitions.
// Phase 1: matrix 86 rows 64 cols
[2025-06-03 02:27:22] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:27:22] [INFO ] Implicit Places using invariants in 59 ms returned []
[2025-06-03 02:27:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:27:22] [INFO ] State equation strengthened by 58 read => feed constraints.
[2025-06-03 02:27:22] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 175 ms to find 0 implicit places.
Running 85 sub problems to find dead transitions.
[2025-06-03 02:27:22] [INFO ] Invariant cache hit.
[2025-06-03 02:27:22] [INFO ] State equation strengthened by 58 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 3 (OVERLAPS) 86/150 variables, 64/66 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/150 variables, 58/124 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/150 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 6 (OVERLAPS) 0/150 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Real declared 150/150 variables, and 124 constraints, problems are : Problem set: 0 solved, 85 unsolved in 3937 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 64/64 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 85 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 3 (OVERLAPS) 86/150 variables, 64/66 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/150 variables, 58/124 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/150 variables, 85/209 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/150 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 7 (OVERLAPS) 0/150 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Int declared 150/150 variables, and 209 constraints, problems are : Problem set: 0 solved, 85 unsolved in 4441 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 64/64 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8392ms problems are : Problem set: 0 solved, 85 unsolved
Search for dead transitions found 0 dead transitions in 8393ms
Starting structural reductions in LTL mode, iteration 1 : 64/80 places, 86/102 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8576 ms. Remains : 64/80 places, 86/102 transitions.
[2025-06-03 02:27:30] [INFO ] Flatten gal took : 8 ms
[2025-06-03 02:27:30] [INFO ] Flatten gal took : 6 ms
[2025-06-03 02:27:30] [INFO ] Input system was already deterministic with 86 transitions.
[2025-06-03 02:27:30] [INFO ] Flatten gal took : 8 ms
[2025-06-03 02:27:30] [INFO ] Flatten gal took : 6 ms
[2025-06-03 02:27:30] [INFO ] Time to serialize gal into /tmp/CTLFireability17344693050507673594.gal : 1 ms
[2025-06-03 02:27:30] [INFO ] Time to serialize properties into /tmp/CTLFireability13989054051435015758.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/CTLFireability17344693050507673594.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13989054051435015758.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,1.04554e+08,0.415935,11988,2,2001,5,53839,6,0,331,29073,0


Converting to forward existential form...Done !
original formula: EF(EX((A(((p78==1)&&(p82==1)) U (p26==1)) * (AG(((p40==1)&&(p81==1))) + ((p52==1)&&(p81==1))))))
=> equivalent forward existential formula: ([((EY(FwdU(Init,TRUE)) * !((E(!((p26==1)) U (!(((p78==1)&&(p82==1))) * !((p26==1)))) + EG(!((p26==1)))))) * !(E...342
Reverse transition relation is NOT exact ! Due to transitions t20, t24, t26, t28, t29, t31, t33, t69, t73, t77, t78, t79, t80, t81, t82, t83, t84, t85, In...250
(forward)formula 0,1,5.58902,150516,1,0,490,823296,207,265,2054,1.08374e+06,599
FORMULA DiscoveryGPU-PT-08a-CTLFireability-2025-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 102/102 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 73 transition count 95
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 73 transition count 95
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 21 place count 66 transition count 88
Iterating global reduction 0 with 7 rules applied. Total rules applied 28 place count 66 transition count 88
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 32 place count 62 transition count 84
Iterating global reduction 0 with 4 rules applied. Total rules applied 36 place count 62 transition count 84
Applied a total of 36 rules in 8 ms. Remains 62 /80 variables (removed 18) and now considering 84/102 (removed 18) transitions.
// Phase 1: matrix 84 rows 62 cols
[2025-06-03 02:27:36] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:27:36] [INFO ] Implicit Places using invariants in 83 ms returned []
[2025-06-03 02:27:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:27:36] [INFO ] State equation strengthened by 57 read => feed constraints.
[2025-06-03 02:27:36] [INFO ] Implicit Places using invariants and state equation in 215 ms returned [61]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 304 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 61/80 places, 84/102 transitions.
Applied a total of 0 rules in 1 ms. Remains 61 /61 variables (removed 0) and now considering 84/84 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 319 ms. Remains : 61/80 places, 84/102 transitions.
[2025-06-03 02:27:36] [INFO ] Flatten gal took : 7 ms
[2025-06-03 02:27:36] [INFO ] Flatten gal took : 3 ms
[2025-06-03 02:27:36] [INFO ] Input system was already deterministic with 84 transitions.
[2025-06-03 02:27:36] [INFO ] Flatten gal took : 4 ms
[2025-06-03 02:27:36] [INFO ] Flatten gal took : 3 ms
[2025-06-03 02:27:36] [INFO ] Time to serialize gal into /tmp/CTLFireability8424836972044762810.gal : 1 ms
[2025-06-03 02:27:36] [INFO ] Time to serialize properties into /tmp/CTLFireability18438923269462500191.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/CTLFireability8424836972044762810.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18438923269462500191.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,9.0964e+07,0.467433,16180,2,3855,5,82469,6,0,319,45632,0


Converting to forward existential form...Done !
original formula: E(!(EG(!((EF(((p67==1)&&(p81==1))) * E(((p66==1)&&(p81==1)) U ((p50==1)&&(p81==1))))))) U !(AX((!(AF(((p66==1)&&(p81==1)))) + AF((((p56==...184
=> equivalent forward existential formula: [FwdG((EY(FwdU(Init,!(EG(!((E(TRUE U ((p67==1)&&(p81==1))) * E(((p66==1)&&(p81==1)) U ((p50==1)&&(p81==1))))))))...243
Reverse transition relation is NOT exact ! Due to transitions t19, t21, t23, t25, t27, t28, t30, t32, t75, t76, t77, t78, t79, t80, t81, t82, t83, Interse...245
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Hit Full ! (commute/partial/dont) 39/44/45
(forward)formula 0,1,18.3138,398380,1,0,995,2.30031e+06,220,624,2178,2.80234e+06,1112
FORMULA DiscoveryGPU-PT-08a-CTLFireability-2025-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 80/80 places, 102/102 transitions.
Graph (complete) has 225 edges and 80 vertex of which 76 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 1 place count 76 transition count 92
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 13 place count 70 transition count 92
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 19 place count 64 transition count 86
Iterating global reduction 0 with 6 rules applied. Total rules applied 25 place count 64 transition count 86
Applied a total of 25 rules in 10 ms. Remains 64 /80 variables (removed 16) and now considering 86/102 (removed 16) transitions.
// Phase 1: matrix 86 rows 64 cols
[2025-06-03 02:27:55] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:27:55] [INFO ] Implicit Places using invariants in 44 ms returned []
[2025-06-03 02:27:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:27:55] [INFO ] State equation strengthened by 58 read => feed constraints.
[2025-06-03 02:27:55] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 154 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 02:27:55] [INFO ] Redundant transitions in 2 ms returned []
Running 85 sub problems to find dead transitions.
[2025-06-03 02:27:55] [INFO ] Invariant cache hit.
[2025-06-03 02:27:55] [INFO ] State equation strengthened by 58 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 3 (OVERLAPS) 86/150 variables, 64/66 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/150 variables, 58/124 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/150 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 6 (OVERLAPS) 0/150 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Real declared 150/150 variables, and 124 constraints, problems are : Problem set: 0 solved, 85 unsolved in 4190 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 64/64 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 85 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 3 (OVERLAPS) 86/150 variables, 64/66 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/150 variables, 58/124 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/150 variables, 85/209 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/150 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 7 (OVERLAPS) 0/150 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Int declared 150/150 variables, and 209 constraints, problems are : Problem set: 0 solved, 85 unsolved in 3369 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 64/64 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7570ms problems are : Problem set: 0 solved, 85 unsolved
Search for dead transitions found 0 dead transitions in 7573ms
Starting structural reductions in SI_CTL mode, iteration 1 : 64/80 places, 86/102 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7745 ms. Remains : 64/80 places, 86/102 transitions.
[2025-06-03 02:28:02] [INFO ] Flatten gal took : 5 ms
[2025-06-03 02:28:02] [INFO ] Flatten gal took : 4 ms
[2025-06-03 02:28:02] [INFO ] Input system was already deterministic with 86 transitions.
[2025-06-03 02:28:02] [INFO ] Flatten gal took : 4 ms
[2025-06-03 02:28:02] [INFO ] Flatten gal took : 4 ms
[2025-06-03 02:28:02] [INFO ] Time to serialize gal into /tmp/CTLFireability6315008290397894928.gal : 1 ms
[2025-06-03 02:28:02] [INFO ] Time to serialize properties into /tmp/CTLFireability13768840676475184691.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/CTLFireability6315008290397894928.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13768840676475184691.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.90291e+07,0.251332,9300,2,1157,5,33171,6,0,331,19616,0


Converting to forward existential form...Done !
original formula: AG((EF((AF((((p57==1)&&(p81==1))&&((p65==1)&&(p81==1)))) + E(((p64==1)||(p71==1)) U (((p63==1)&&(p50==1))&&(p81==1))))) + A(E(((p38==1)&&...222
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !(!((E(!(EG(((p69==1)&&(p81==1)))) U (!(E(((p38==1)&&(p82==1)) U EG(((p33==1)&&(p82==1)))))...368
Reverse transition relation is NOT exact ! Due to transitions t3, t10, t22, t26, t28, t29, t31, t75, t76, t77, t78, t79, t80, t81, t82, t83, t84, Intersec...244
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,3.67002,92784,1,0,763,494075,225,499,2110,665776,960
FORMULA DiscoveryGPU-PT-08a-CTLFireability-2025-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 102/102 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 74 transition count 96
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 74 transition count 96
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 72 transition count 94
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 72 transition count 94
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 70 transition count 92
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 70 transition count 92
Applied a total of 20 rules in 10 ms. Remains 70 /80 variables (removed 10) and now considering 92/102 (removed 10) transitions.
// Phase 1: matrix 92 rows 70 cols
[2025-06-03 02:28:06] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:28:06] [INFO ] Implicit Places using invariants in 55 ms returned []
[2025-06-03 02:28:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:28:06] [INFO ] State equation strengthened by 59 read => feed constraints.
[2025-06-03 02:28:06] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 157 ms to find 0 implicit places.
Running 91 sub problems to find dead transitions.
[2025-06-03 02:28:06] [INFO ] Invariant cache hit.
[2025-06-03 02:28:06] [INFO ] State equation strengthened by 59 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (OVERLAPS) 1/70 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 3 (OVERLAPS) 92/162 variables, 70/72 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 59/131 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/162 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (OVERLAPS) 0/162 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Real declared 162/162 variables, and 131 constraints, problems are : Problem set: 0 solved, 91 unsolved in 3936 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 70/70 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 91 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (OVERLAPS) 1/70 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 3 (OVERLAPS) 92/162 variables, 70/72 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 59/131 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/162 variables, 91/222 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (OVERLAPS) 0/162 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Int declared 162/162 variables, and 222 constraints, problems are : Problem set: 0 solved, 91 unsolved in 4114 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 70/70 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8061ms problems are : Problem set: 0 solved, 91 unsolved
Search for dead transitions found 0 dead transitions in 8061ms
Starting structural reductions in LTL mode, iteration 1 : 70/80 places, 92/102 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8229 ms. Remains : 70/80 places, 92/102 transitions.
[2025-06-03 02:28:14] [INFO ] Flatten gal took : 5 ms
[2025-06-03 02:28:14] [INFO ] Flatten gal took : 5 ms
[2025-06-03 02:28:14] [INFO ] Input system was already deterministic with 92 transitions.
[2025-06-03 02:28:14] [INFO ] Flatten gal took : 6 ms
[2025-06-03 02:28:14] [INFO ] Flatten gal took : 5 ms
[2025-06-03 02:28:14] [INFO ] Time to serialize gal into /tmp/CTLFireability5477258390013443032.gal : 1 ms
[2025-06-03 02:28:14] [INFO ] Time to serialize properties into /tmp/CTLFireability9453940042727773144.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/CTLFireability5477258390013443032.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9453940042727773144.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.4786e+08,0.594648,16384,2,2413,5,77709,6,0,360,51629,0


Converting to forward existential form...Done !
original formula: EF((EG(A((((p25==1)&&(p81==1)) + EG(((p33==1)&&(p82==1)))) U ((p3==1) * AF(((p4==1)&&(p82==1)))))) * ((E(EF(((p35==1)&&(p81==1))) U (p76=...313
=> equivalent forward existential formula: (([(FwdU((FwdU(Init,TRUE) * EG(!((E(!(((p3==1) * !(EG(!(((p4==1)&&(p82==1))))))) U (!((((p25==1)&&(p81==1)) + EG...1014
Reverse transition relation is NOT exact ! Due to transitions t6, t11, t17, t20, t24, t30, t35, t76, t77, t82, t83, t84, t85, t86, t87, t88, t89, t90, t91,...254
(forward)formula 0,0,24.6639,568064,1,0,1164,3.13307e+06,247,593,2220,4.0017e+06,1392
FORMULA DiscoveryGPU-PT-08a-CTLFireability-2023-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 80/80 places, 102/102 transitions.
Graph (complete) has 225 edges and 80 vertex of which 75 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.0 ms
Discarding 5 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 80 edges and 72 vertex of which 56 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.0 ms
Discarding 16 places :
Also discarding 16 output transitions
Drop transitions (Output transitions of discarded places.) removed 16 transitions
Graph (trivial) has 61 edges and 56 vertex of which 30 / 56 are part of one of the 15 SCC in 3 ms
Free SCC test removed 15 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 41 transition count 73
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 23 rules applied. Total rules applied 35 place count 34 transition count 57
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 36 place count 33 transition count 57
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 43 place count 26 transition count 43
Iterating global reduction 3 with 7 rules applied. Total rules applied 50 place count 26 transition count 43
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 57 place count 19 transition count 29
Iterating global reduction 3 with 7 rules applied. Total rules applied 64 place count 19 transition count 29
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 70 place count 13 transition count 17
Iterating global reduction 3 with 6 rules applied. Total rules applied 76 place count 13 transition count 17
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 82 place count 7 transition count 11
Iterating global reduction 3 with 6 rules applied. Total rules applied 88 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 3 with 1 rules applied. Total rules applied 89 place count 7 transition count 10
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 91 place count 6 transition count 9
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 93 place count 4 transition count 7
Applied a total of 93 rules in 19 ms. Remains 4 /80 variables (removed 76) and now considering 7/102 (removed 95) transitions.
[2025-06-03 02:28:39] [INFO ] Flow matrix only has 6 transitions (discarded 1 similar events)
// Phase 1: matrix 6 rows 4 cols
[2025-06-03 02:28:39] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:28:39] [INFO ] Implicit Places using invariants in 17 ms returned []
[2025-06-03 02:28:39] [INFO ] Flow matrix only has 6 transitions (discarded 1 similar events)
[2025-06-03 02:28:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:28:39] [INFO ] Implicit Places using invariants and state equation in 20 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-03 02:28:39] [INFO ] Redundant transitions in 0 ms returned []
Running 4 sub problems to find dead transitions.
[2025-06-03 02:28:39] [INFO ] Flow matrix only has 6 transitions (discarded 1 similar events)
[2025-06-03 02:28:39] [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, 4 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 2/9 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 0/9 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 9/10 variables, and 4 constraints, problems are : Problem set: 0 solved, 4 unsolved in 58 ms.
Refiners :[State Equation: 4/4 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 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, 4 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 2/9 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/9 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/9 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/9 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 9/10 variables, and 8 constraints, problems are : Problem set: 0 solved, 4 unsolved in 54 ms.
Refiners :[State Equation: 4/4 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 116ms problems are : Problem set: 0 solved, 4 unsolved
Search for dead transitions found 0 dead transitions in 116ms
Starting structural reductions in SI_CTL mode, iteration 1 : 4/80 places, 7/102 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 179 ms. Remains : 4/80 places, 7/102 transitions.
[2025-06-03 02:28:39] [INFO ] Flatten gal took : 1 ms
[2025-06-03 02:28:39] [INFO ] Flatten gal took : 1 ms
[2025-06-03 02:28:39] [INFO ] Input system was already deterministic with 7 transitions.
[2025-06-03 02:28:39] [INFO ] Flatten gal took : 0 ms
[2025-06-03 02:28:39] [INFO ] Flatten gal took : 1 ms
[2025-06-03 02:28:39] [INFO ] Time to serialize gal into /tmp/CTLFireability17493801047696193297.gal : 0 ms
[2025-06-03 02:28:39] [INFO ] Time to serialize properties into /tmp/CTLFireability2268828052057380026.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/CTLFireability17493801047696193297.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2268828052057380026.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,116,0.003108,3660,2,14,5,183,6,0,22,221,0


Converting to forward existential form...Done !
original formula: AG(EF(AG((p68==0))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(E(TRUE U !((p68==0)))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t6, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total...165
(forward)formula 0,1,0.005893,3916,1,0,28,251,34,14,118,277,33
FORMULA DiscoveryGPU-PT-08a-CTLFireability-2023-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 102/102 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 74 transition count 96
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 74 transition count 96
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 17 place count 69 transition count 91
Iterating global reduction 0 with 5 rules applied. Total rules applied 22 place count 69 transition count 91
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 25 place count 66 transition count 88
Iterating global reduction 0 with 3 rules applied. Total rules applied 28 place count 66 transition count 88
Applied a total of 28 rules in 6 ms. Remains 66 /80 variables (removed 14) and now considering 88/102 (removed 14) transitions.
// Phase 1: matrix 88 rows 66 cols
[2025-06-03 02:28:39] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:28:39] [INFO ] Implicit Places using invariants in 71 ms returned []
[2025-06-03 02:28:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:28:40] [INFO ] State equation strengthened by 58 read => feed constraints.
[2025-06-03 02:28:40] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 203 ms to find 0 implicit places.
Running 87 sub problems to find dead transitions.
[2025-06-03 02:28:40] [INFO ] Invariant cache hit.
[2025-06-03 02:28:40] [INFO ] State equation strengthened by 58 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 1 (OVERLAPS) 1/66 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 3 (OVERLAPS) 88/154 variables, 66/68 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 58/126 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/154 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 6 (OVERLAPS) 0/154 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 87 unsolved
No progress, stopping.
After SMT solving in domain Real declared 154/154 variables, and 126 constraints, problems are : Problem set: 0 solved, 87 unsolved in 2773 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 66/66 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 87/87 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 87 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 1 (OVERLAPS) 1/66 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 3 (OVERLAPS) 88/154 variables, 66/68 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 58/126 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/154 variables, 87/213 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/154 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 7 (OVERLAPS) 0/154 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 87 unsolved
No progress, stopping.
After SMT solving in domain Int declared 154/154 variables, and 213 constraints, problems are : Problem set: 0 solved, 87 unsolved in 4103 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 66/66 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 87/87 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6893ms problems are : Problem set: 0 solved, 87 unsolved
Search for dead transitions found 0 dead transitions in 6894ms
Starting structural reductions in LTL mode, iteration 1 : 66/80 places, 88/102 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7103 ms. Remains : 66/80 places, 88/102 transitions.
[2025-06-03 02:28:46] [INFO ] Flatten gal took : 4 ms
[2025-06-03 02:28:47] [INFO ] Flatten gal took : 3 ms
[2025-06-03 02:28:47] [INFO ] Input system was already deterministic with 88 transitions.
[2025-06-03 02:28:47] [INFO ] Flatten gal took : 3 ms
[2025-06-03 02:28:47] [INFO ] Flatten gal took : 3 ms
[2025-06-03 02:28:47] [INFO ] Time to serialize gal into /tmp/CTLFireability14182122494845193263.gal : 1 ms
[2025-06-03 02:28:47] [INFO ] Time to serialize properties into /tmp/CTLFireability12814230121734871952.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/CTLFireability14182122494845193263.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12814230121734871952.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,1.16537e+08,0.399444,11872,2,1240,5,48572,6,0,340,31691,0


Converting to forward existential form...Done !
original formula: (EF(AX(EG((EG((p41==1)) * AG(((p3==1)&&(p82==1))))))) * EX(((p14==0)||(p82==0))))
=> equivalent forward existential formula: [(EY((Init * E(TRUE U !(EX(!(EG((EG((p41==1)) * !(E(TRUE U !(((p3==1)&&(p82==1))))))))))))) * ((p14==0)||(p82==0...168
Reverse transition relation is NOT exact ! Due to transitions t14, t17, t21, t23, t25, t27, t30, t34, t78, t79, t80, t81, t82, t83, t84, t85, t86, t87, In...250
(forward)formula 0,1,3.41214,79640,1,0,214,433926,207,130,2093,410012,302
FORMULA DiscoveryGPU-PT-08a-CTLFireability-2023-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 102/102 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 75 transition count 97
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 75 transition count 97
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 15 place count 70 transition count 92
Iterating global reduction 0 with 5 rules applied. Total rules applied 20 place count 70 transition count 92
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 23 place count 67 transition count 89
Iterating global reduction 0 with 3 rules applied. Total rules applied 26 place count 67 transition count 89
Applied a total of 26 rules in 5 ms. Remains 67 /80 variables (removed 13) and now considering 89/102 (removed 13) transitions.
// Phase 1: matrix 89 rows 67 cols
[2025-06-03 02:28:50] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:28:50] [INFO ] Implicit Places using invariants in 95 ms returned []
[2025-06-03 02:28:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:28:50] [INFO ] State equation strengthened by 59 read => feed constraints.
[2025-06-03 02:28:50] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 206 ms to find 0 implicit places.
Running 88 sub problems to find dead transitions.
[2025-06-03 02:28:50] [INFO ] Invariant cache hit.
[2025-06-03 02:28:50] [INFO ] State equation strengthened by 59 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 1 (OVERLAPS) 1/67 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 3 (OVERLAPS) 89/156 variables, 67/69 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 59/128 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 6 (OVERLAPS) 0/156 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 88 unsolved
No progress, stopping.
After SMT solving in domain Real declared 156/156 variables, and 128 constraints, problems are : Problem set: 0 solved, 88 unsolved in 3234 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 67/67 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 88 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 1 (OVERLAPS) 1/67 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 3 (OVERLAPS) 89/156 variables, 67/69 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 59/128 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 88/216 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/156 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 7 (OVERLAPS) 0/156 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 88 unsolved
No progress, stopping.
After SMT solving in domain Int declared 156/156 variables, and 216 constraints, problems are : Problem set: 0 solved, 88 unsolved in 3183 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 67/67 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6432ms problems are : Problem set: 0 solved, 88 unsolved
Search for dead transitions found 0 dead transitions in 6432ms
Starting structural reductions in LTL mode, iteration 1 : 67/80 places, 89/102 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6645 ms. Remains : 67/80 places, 89/102 transitions.
[2025-06-03 02:28:57] [INFO ] Flatten gal took : 3 ms
[2025-06-03 02:28:57] [INFO ] Flatten gal took : 3 ms
[2025-06-03 02:28:57] [INFO ] Input system was already deterministic with 89 transitions.
[2025-06-03 02:28:57] [INFO ] Flatten gal took : 3 ms
[2025-06-03 02:28:57] [INFO ] Flatten gal took : 3 ms
[2025-06-03 02:28:57] [INFO ] Time to serialize gal into /tmp/CTLFireability18330111871623105175.gal : 0 ms
[2025-06-03 02:28:57] [INFO ] Time to serialize properties into /tmp/CTLFireability3311746986070009709.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/CTLFireability18330111871623105175.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3311746986070009709.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.23003e+08,0.327603,10540,2,922,5,43272,6,0,345,25521,0


Converting to forward existential form...Done !
original formula: AX((AG(((EF(((p3==1)&&(p82==1))) + AF(((p2==1)&&(p81==1)))) + (p61==1))) + ((p24==1)&&((p50==0)||(p81==0)))))
=> equivalent forward existential formula: [FwdG(((FwdU((EY(Init) * !(((p24==1)&&((p50==0)||(p81==0))))),TRUE) * !((p61==1))) * !(E(TRUE U ((p3==1)&&(p82==...194
Reverse transition relation is NOT exact ! Due to transitions t21, t23, t25, t27, t30, t32, t72, t74, t79, t80, t81, t82, t83, t84, t85, t86, t87, t88, In...250
Hit Full ! (commute/partial/dont) 44/0/45
(forward)formula 0,0,1.31279,31584,1,0,141,169737,215,92,2294,138492,201
FORMULA DiscoveryGPU-PT-08a-CTLFireability-2023-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

[2025-06-03 02:28:58] [INFO ] Flatten gal took : 4 ms
[2025-06-03 02:28:58] [INFO ] Flatten gal took : 3 ms
Total runtime 227484 ms.

BK_STOP 1748917738542

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ 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 CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DiscoveryGPU-PT-08a"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is DiscoveryGPU-PT-08a, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r058-smll-174854064500642"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DiscoveryGPU-PT-08a.tgz
mv DiscoveryGPU-PT-08a execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLFireability.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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;