Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r098-tall-177955695500282.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-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-5973
Executing tool itstools
Input is DiscoveryGPU-PT-09a, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r098-tall-177955695500282
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 524K
-rw-r--r-- 1 mcc users 6.9K Mar 6 16:34 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Mar 6 16:34 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Mar 6 16:31 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Mar 6 16:31 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Mar 15 09:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 15 09:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 09:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 09:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Mar 6 16:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 155K Mar 6 16:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Mar 6 16:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K Mar 6 16:34 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 09:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 09:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 32K Mar 3 18:30 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-09a-CTLFireability-2024-00
FORMULA_NAME DiscoveryGPU-PT-09a-CTLFireability-2024-01
FORMULA_NAME DiscoveryGPU-PT-09a-CTLFireability-2024-02
FORMULA_NAME DiscoveryGPU-PT-09a-CTLFireability-2024-03
FORMULA_NAME DiscoveryGPU-PT-09a-CTLFireability-2024-04
FORMULA_NAME DiscoveryGPU-PT-09a-CTLFireability-2024-05
FORMULA_NAME DiscoveryGPU-PT-09a-CTLFireability-2024-06
FORMULA_NAME DiscoveryGPU-PT-09a-CTLFireability-2024-07
FORMULA_NAME DiscoveryGPU-PT-09a-CTLFireability-2024-08
FORMULA_NAME DiscoveryGPU-PT-09a-CTLFireability-2024-09
FORMULA_NAME DiscoveryGPU-PT-09a-CTLFireability-2024-10
FORMULA_NAME DiscoveryGPU-PT-09a-CTLFireability-2024-11
FORMULA_NAME DiscoveryGPU-PT-09a-CTLFireability-2024-12
FORMULA_NAME DiscoveryGPU-PT-09a-CTLFireability-2024-13
FORMULA_NAME DiscoveryGPU-PT-09a-CTLFireability-2024-14
FORMULA_NAME DiscoveryGPU-PT-09a-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1779597747787

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-09a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202604301425
[2026-05-24 04:42:28] [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]
[2026-05-24 04:42:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 04:42:29] [INFO ] Load time of PNML (sax parser for PT used): 52 ms
[2026-05-24 04:42:29] [INFO ] Transformed 93 places.
[2026-05-24 04:42:29] [INFO ] Transformed 127 transitions.
[2026-05-24 04:42:29] [INFO ] Found NUPN structural information;
[2026-05-24 04:42:29] [INFO ] Parsed PT model containing 93 places and 127 transitions and 408 arcs in 158 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 10 ms.
Support contains 57 out of 93 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 93/93 places, 127/127 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 88 transition count 122
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 88 transition count 122
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 87 transition count 121
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 87 transition count 121
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 0 with 9 rules applied. Total rules applied 21 place count 87 transition count 112
Applied a total of 21 rules in 26 ms. Remains 87 /93 variables (removed 6) and now considering 112/127 (removed 15) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-494030082454660011.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6100556888681621620.kers'
[2026-05-24 04:42:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-494030082454660011.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6100556888681621620.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 112 rows 85 cols 219 entries
Finished phase 1 with 85 SingleSign rule and 0 generalized
[2026-05-24 04:42:29] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6100556888681621620.kers
Total runtime 1 ms.
[2026-05-24 04:42:29] [INFO ] Implicit Places using invariants in 222 ms returned []
[2026-05-24 04:42:29] [INFO ] Invariant cache hit.
[2026-05-24 04:42:29] [INFO ] State equation strengthened by 71 read => feed constraints.
[2026-05-24 04:42:29] [INFO ] Implicit Places using invariants and state equation in 193 ms returned []
Implicit Place search using SMT with State Equation took 454 ms to find 0 implicit places.
Running 111 sub problems to find dead transitions.
[2026-05-24 04:42:29] [INFO ] Invariant cache hit.
[2026-05-24 04:42:29] [INFO ] State equation strengthened by 71 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 1 (OVERLAPS) 1/87 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 3 (OVERLAPS) 112/199 variables, 87/89 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/199 variables, 71/160 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/199 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 6 (OVERLAPS) 0/199 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 111 unsolved
No progress, stopping.
After SMT solving in domain Real declared 199/199 variables, and 160 constraints, problems are : Problem set: 0 solved, 111 unsolved in 3376 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 87/87 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 111/111 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 111 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 1 (OVERLAPS) 1/87 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 3 (OVERLAPS) 112/199 variables, 87/89 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/199 variables, 71/160 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/199 variables, 111/271 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/199 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 7 (OVERLAPS) 0/199 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 111 unsolved
No progress, stopping.
After SMT solving in domain Int declared 199/199 variables, and 271 constraints, problems are : Problem set: 0 solved, 111 unsolved in 4655 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 87/87 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 111/111 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8086ms problems are : Problem set: 0 solved, 111 unsolved
Search for dead transitions found 0 dead transitions in 8103ms
Starting structural reductions in LTL mode, iteration 1 : 87/93 places, 112/127 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8616 ms. Remains : 87/93 places, 112/127 transitions.
Starting structural reductions in LTL mode, iteration 0 : 87/87 places, 112/112 transitions.
Applied a total of 0 rules in 2 ms. Remains 87 /87 variables (removed 0) and now considering 112/112 (removed 0) transitions.
[2026-05-24 04:42:37] [INFO ] Invariant cache hit.
[2026-05-24 04:42:37] [INFO ] Implicit Places using invariants in 32 ms returned []
[2026-05-24 04:42:37] [INFO ] Invariant cache hit.
[2026-05-24 04:42:37] [INFO ] State equation strengthened by 71 read => feed constraints.
[2026-05-24 04:42:37] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 104 ms. Remains : 87/87 places, 112/112 transitions.
Support contains 57 out of 87 places after structural reductions.
[2026-05-24 04:42:38] [INFO ] Flatten gal took : 24 ms
[2026-05-24 04:42:38] [INFO ] Flatten gal took : 9 ms
[2026-05-24 04:42:38] [INFO ] Input system was already deterministic with 112 transitions.
RANDOM walk for 40000 steps (412 resets) in 856 ms. (46 steps per ms) remains 1/59 properties
BEST_FIRST walk for 40003 steps (41 resets) in 172 ms. (231 steps per ms) remains 1/1 properties
[2026-05-24 04:42:38] [INFO ] Invariant cache hit.
[2026-05-24 04:42:38] [INFO ] State equation strengthened by 71 read => feed constraints.
Problem AtomicPropp14 is UNSAT
After SMT solving in domain Real declared 5/199 variables, and 2 constraints, problems are : Problem set: 1 solved, 0 unsolved in 15 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 0/87 constraints, ReadFeed: 0/71 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 19ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 16 simplifications.
FORMULA DiscoveryGPU-PT-09a-CTLFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-24 04:42:38] [INFO ] Flatten gal took : 5 ms
[2026-05-24 04:42:38] [INFO ] Flatten gal took : 6 ms
[2026-05-24 04:42:38] [INFO ] Input system was already deterministic with 112 transitions.
Computed a total of 12 stabilizing places and 10 stable transitions
Graph (complete) has 249 edges and 87 vertex of which 83 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.4 ms
Starting structural reductions in LTL mode, iteration 0 : 87/87 places, 112/112 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 80 transition count 105
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 80 transition count 105
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 21 place count 73 transition count 98
Iterating global reduction 0 with 7 rules applied. Total rules applied 28 place count 73 transition count 98
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 31 place count 70 transition count 95
Iterating global reduction 0 with 3 rules applied. Total rules applied 34 place count 70 transition count 95
Applied a total of 34 rules in 8 ms. Remains 70 /87 variables (removed 17) and now considering 95/112 (removed 17) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9103447465236359118.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12348885916119453277.kers'
[2026-05-24 04:42:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9103447465236359118.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12348885916119453277.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 95 rows 68 cols 188 entries
Finished phase 1 with 68 SingleSign rule and 0 generalized
[2026-05-24 04:42:38] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-12348885916119453277.kers
Total runtime 2 ms.
[2026-05-24 04:42:38] [INFO ] Implicit Places using invariants in 34 ms returned []
[2026-05-24 04:42:38] [INFO ] Invariant cache hit.
[2026-05-24 04:42:38] [INFO ] State equation strengthened by 64 read => feed constraints.
[2026-05-24 04:42:38] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 114 ms to find 0 implicit places.
Running 94 sub problems to find dead transitions.
[2026-05-24 04:42:38] [INFO ] Invariant cache hit.
[2026-05-24 04:42:38] [INFO ] State equation strengthened by 64 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 1 (OVERLAPS) 1/70 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 3 (OVERLAPS) 95/165 variables, 70/72 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 64/136 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/165 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 6 (OVERLAPS) 0/165 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 94 unsolved
No progress, stopping.
After SMT solving in domain Real declared 165/165 variables, and 136 constraints, problems are : Problem set: 0 solved, 94 unsolved in 2178 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 70/70 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 94/94 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 94 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 1 (OVERLAPS) 1/70 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 3 (OVERLAPS) 95/165 variables, 70/72 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 64/136 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/165 variables, 94/230 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/165 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 7 (OVERLAPS) 0/165 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 94 unsolved
No progress, stopping.
After SMT solving in domain Int declared 165/165 variables, and 230 constraints, problems are : Problem set: 0 solved, 94 unsolved in 2441 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 70/70 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 94/94 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4637ms problems are : Problem set: 0 solved, 94 unsolved
Search for dead transitions found 0 dead transitions in 4639ms
Starting structural reductions in LTL mode, iteration 1 : 70/87 places, 95/112 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4763 ms. Remains : 70/87 places, 95/112 transitions.
[2026-05-24 04:42:43] [INFO ] Flatten gal took : 10 ms
[2026-05-24 04:42:43] [INFO ] Flatten gal took : 5 ms
[2026-05-24 04:42:43] [INFO ] Input system was already deterministic with 95 transitions.
[2026-05-24 04:42:43] [INFO ] Flatten gal took : 5 ms
[2026-05-24 04:42:43] [INFO ] Flatten gal took : 3 ms
[2026-05-24 04:42:43] [INFO ] Time to serialize gal into /tmp/CTLFireability16645334834886660969.gal : 2 ms
[2026-05-24 04:42:43] [INFO ] Time to serialize properties into /tmp/CTLFireability11356575097614657426.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16645334834886660969.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11356575097614657426.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/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,9.09902e+08,0.438217,20140,2,3120,5,103822,6,0,363,63339,0


Converting to forward existential form...Done !
original formula: AG(A(A(((p40==1)&&(p91==1)) U ((AX(((p53==1)&&(p92==1))) + EX(((p25==1)&&(p91==1)))) + ((p58==1)&&(p92==1)))) U EF(((p86==1)&&(p91==1))))...156
=> equivalent forward existential formula: ([((FwdU(FwdU(Init,TRUE),!(E(TRUE U ((p86==1)&&(p91==1))))) * !(!((E(!(((!(EX(!(((p53==1)&&(p92==1))))) + EX(((p...531
Reverse transition relation is NOT exact ! Due to transitions t7, t18, t22, t24, t26, t28, t29, t31, t33, t37, t85, t86, t87, t88, t89, t90, t91, t92, t93,...259
(forward)formula 0,0,1.76031,54720,1,0,142,260973,217,93,2212,311497,208
FORMULA DiscoveryGPU-PT-09a-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 87/87 places, 112/112 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 81 transition count 106
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 81 transition count 106
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 16 place count 77 transition count 102
Iterating global reduction 0 with 4 rules applied. Total rules applied 20 place count 77 transition count 102
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 76 transition count 101
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 76 transition count 101
Applied a total of 22 rules in 6 ms. Remains 76 /87 variables (removed 11) and now considering 101/112 (removed 11) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2682334648129985127.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12683541782681746960.kers'
[2026-05-24 04:42:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2682334648129985127.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12683541782681746960.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 101 rows 74 cols 199 entries
Finished phase 1 with 74 SingleSign rule and 0 generalized
[2026-05-24 04:42:45] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-12683541782681746960.kers
Total runtime 13 ms.
[2026-05-24 04:42:45] [INFO ] Implicit Places using invariants in 80 ms returned []
[2026-05-24 04:42:45] [INFO ] Invariant cache hit.
[2026-05-24 04:42:45] [INFO ] State equation strengthened by 67 read => feed constraints.
[2026-05-24 04:42:45] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 199 ms to find 0 implicit places.
Running 100 sub problems to find dead transitions.
[2026-05-24 04:42:45] [INFO ] Invariant cache hit.
[2026-05-24 04:42:45] [INFO ] State equation strengthened by 67 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (OVERLAPS) 1/76 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (OVERLAPS) 101/177 variables, 76/78 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/177 variables, 67/145 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/177 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (OVERLAPS) 0/177 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Real declared 177/177 variables, and 145 constraints, problems are : Problem set: 0 solved, 100 unsolved in 2523 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 76/76 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 100 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (OVERLAPS) 1/76 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (OVERLAPS) 101/177 variables, 76/78 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/177 variables, 67/145 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/177 variables, 100/245 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/177 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (OVERLAPS) 0/177 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Int declared 177/177 variables, and 245 constraints, problems are : Problem set: 0 solved, 100 unsolved in 2493 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 76/76 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5060ms problems are : Problem set: 0 solved, 100 unsolved
Search for dead transitions found 0 dead transitions in 5061ms
Starting structural reductions in LTL mode, iteration 1 : 76/87 places, 101/112 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5267 ms. Remains : 76/87 places, 101/112 transitions.
[2026-05-24 04:42:50] [INFO ] Flatten gal took : 8 ms
[2026-05-24 04:42:50] [INFO ] Flatten gal took : 5 ms
[2026-05-24 04:42:50] [INFO ] Input system was already deterministic with 101 transitions.
[2026-05-24 04:42:50] [INFO ] Flatten gal took : 4 ms
[2026-05-24 04:42:50] [INFO ] Flatten gal took : 4 ms
[2026-05-24 04:42:50] [INFO ] Time to serialize gal into /tmp/CTLFireability16982245594092924214.gal : 2 ms
[2026-05-24 04:42:50] [INFO ] Time to serialize properties into /tmp/CTLFireability18352224197636310336.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16982245594092924214.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18352224197636310336.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/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.30888e+09,0.237394,13924,2,1484,5,62945,6,0,392,36229,0


Converting to forward existential form...Done !
original formula: (EG((p66==1)) + E((((EF(((!((p47==1)&&(p91==1)))||((p18==1)&&(p92==1)))) * (p2==1)) * (p91==1)) + A(!(((p12==1)&&(p91==1))) U ((((p34==1)...317
=> equivalent forward existential formula: ([FwdG(Init,(p66==1))] != FALSE + [(FwdU((FwdU(Init,(((E(TRUE U ((!((p47==1)&&(p91==1)))||((p18==1)&&(p92==1))))...561
Reverse transition relation is NOT exact ! Due to transitions t24, t28, t30, t35, t37, t39, t82, t83, t85, t90, t91, t92, t93, t94, t95, t96, t97, t98, t99...262
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,14.2669,414404,1,0,1229,2.36416e+06,259,769,2517,3.0562e+06,1345
FORMULA DiscoveryGPU-PT-09a-CTLFireability-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 87/87 places, 112/112 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 79 transition count 104
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 79 transition count 104
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 23 place count 72 transition count 97
Iterating global reduction 0 with 7 rules applied. Total rules applied 30 place count 72 transition count 97
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 33 place count 69 transition count 94
Iterating global reduction 0 with 3 rules applied. Total rules applied 36 place count 69 transition count 94
Applied a total of 36 rules in 7 ms. Remains 69 /87 variables (removed 18) and now considering 94/112 (removed 18) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12718949197172614404.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6489168252661795373.kers'
[2026-05-24 04:43:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12718949197172614404.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6489168252661795373.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 94 rows 67 cols 186 entries
Finished phase 1 with 67 SingleSign rule and 0 generalized
[2026-05-24 04:43:04] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-6489168252661795373.kers
Total runtime 2 ms.
[2026-05-24 04:43:05] [INFO ] Implicit Places using invariants in 47 ms returned []
[2026-05-24 04:43:05] [INFO ] Invariant cache hit.
[2026-05-24 04:43:05] [INFO ] State equation strengthened by 64 read => feed constraints.
[2026-05-24 04:43:05] [INFO ] Implicit Places using invariants and state equation in 94 ms returned [68]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 144 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 68/87 places, 94/112 transitions.
Applied a total of 0 rules in 2 ms. Remains 68 /68 variables (removed 0) and now considering 94/94 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 153 ms. Remains : 68/87 places, 94/112 transitions.
[2026-05-24 04:43:05] [INFO ] Flatten gal took : 4 ms
[2026-05-24 04:43:05] [INFO ] Flatten gal took : 4 ms
[2026-05-24 04:43:05] [INFO ] Input system was already deterministic with 94 transitions.
[2026-05-24 04:43:05] [INFO ] Flatten gal took : 3 ms
[2026-05-24 04:43:05] [INFO ] Flatten gal took : 2 ms
[2026-05-24 04:43:05] [INFO ] Time to serialize gal into /tmp/CTLFireability81358177779143326.gal : 1 ms
[2026-05-24 04:43:05] [INFO ] Time to serialize properties into /tmp/CTLFireability1535797068914930469.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability81358177779143326.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1535797068914930469.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...281
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,8.35715e+08,0.440782,22316,2,5324,5,123961,6,0,356,67148,0


Converting to forward existential form...Done !
original formula: EF(AG(AX(AG(((p86==0)||(p91==0))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(!(EX(!(!(E(TRUE U !(((p86==0)||(p91==0))))))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t21, t23, t25, t27, t28, t30, t32, t34, t36, t84, t85, t86, t87, t88, t89, t90, t91, t92, t93...255
(forward)formula 0,1,2.74014,86904,1,0,141,437187,210,93,2138,464760,206
FORMULA DiscoveryGPU-PT-09a-CTLFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 87/87 places, 112/112 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 80 transition count 105
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 80 transition count 105
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 20 place count 74 transition count 99
Iterating global reduction 0 with 6 rules applied. Total rules applied 26 place count 74 transition count 99
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 28 place count 72 transition count 97
Iterating global reduction 0 with 2 rules applied. Total rules applied 30 place count 72 transition count 97
Applied a total of 30 rules in 8 ms. Remains 72 /87 variables (removed 15) and now considering 97/112 (removed 15) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17308189172210633628.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8271571830079717974.kers'
[2026-05-24 04:43:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17308189172210633628.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8271571830079717974.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 97 rows 70 cols 191 entries
Finished phase 1 with 70 SingleSign rule and 0 generalized
[2026-05-24 04:43:07] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-8271571830079717974.kers
Total runtime 1 ms.
[2026-05-24 04:43:07] [INFO ] Implicit Places using invariants in 38 ms returned []
[2026-05-24 04:43:07] [INFO ] Invariant cache hit.
[2026-05-24 04:43:07] [INFO ] State equation strengthened by 65 read => feed constraints.
[2026-05-24 04:43:08] [INFO ] Implicit Places using invariants and state equation in 101 ms returned [71]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 141 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 71/87 places, 97/112 transitions.
Applied a total of 0 rules in 1 ms. Remains 71 /71 variables (removed 0) and now considering 97/97 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 150 ms. Remains : 71/87 places, 97/112 transitions.
[2026-05-24 04:43:08] [INFO ] Flatten gal took : 4 ms
[2026-05-24 04:43:08] [INFO ] Flatten gal took : 4 ms
[2026-05-24 04:43:08] [INFO ] Input system was already deterministic with 97 transitions.
[2026-05-24 04:43:08] [INFO ] Flatten gal took : 3 ms
[2026-05-24 04:43:08] [INFO ] Flatten gal took : 3 ms
[2026-05-24 04:43:08] [INFO ] Time to serialize gal into /tmp/CTLFireability8519347293172557154.gal : 1 ms
[2026-05-24 04:43:08] [INFO ] Time to serialize properties into /tmp/CTLFireability14216625620800186482.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8519347293172557154.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14216625620800186482.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/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.0006e+09,0.968447,38956,2,10126,5,230657,6,0,370,130257,0


Converting to forward existential form...Done !
original formula: AG(EX(AX(((((p31==0)||(p10==0))||(p91==0))&&((p28==0)||(p86==0))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!(EX(!(((((p31==0)||(p10==0))||(p91==0))&&((p28==0)||(p86==0)))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t22, t24, t26, t28, t29, t31, t35, t37, t86, t87, t88, t89, t90, t91, t92, t93, t94, t95, t96...255
(forward)formula 0,0,6.17519,186236,1,0,144,988333,211,95,2135,1.17869e+06,205
FORMULA DiscoveryGPU-PT-09a-CTLFireability-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 87/87 places, 112/112 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 79 transition count 104
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 79 transition count 104
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 23 place count 72 transition count 97
Iterating global reduction 0 with 7 rules applied. Total rules applied 30 place count 72 transition count 97
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 33 place count 69 transition count 94
Iterating global reduction 0 with 3 rules applied. Total rules applied 36 place count 69 transition count 94
Applied a total of 36 rules in 10 ms. Remains 69 /87 variables (removed 18) and now considering 94/112 (removed 18) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11338971086435744375.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17765052203201775581.kers'
[2026-05-24 04:43:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11338971086435744375.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17765052203201775581.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 94 rows 67 cols 186 entries
Finished phase 1 with 67 SingleSign rule and 0 generalized
[2026-05-24 04:43:14] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-17765052203201775581.kers
Total runtime 1 ms.
[2026-05-24 04:43:14] [INFO ] Implicit Places using invariants in 38 ms returned []
[2026-05-24 04:43:14] [INFO ] Invariant cache hit.
[2026-05-24 04:43:14] [INFO ] State equation strengthened by 64 read => feed constraints.
[2026-05-24 04:43:14] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
Running 93 sub problems to find dead transitions.
[2026-05-24 04:43:14] [INFO ] Invariant cache hit.
[2026-05-24 04:43:14] [INFO ] State equation strengthened by 64 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 1 (OVERLAPS) 1/69 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 3 (OVERLAPS) 94/163 variables, 69/71 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 64/135 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/163 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 6 (OVERLAPS) 0/163 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 93 unsolved
No progress, stopping.
After SMT solving in domain Real declared 163/163 variables, and 135 constraints, problems are : Problem set: 0 solved, 93 unsolved in 2205 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 69/69 constraints, ReadFeed: 64/64 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
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 1 (OVERLAPS) 1/69 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 3 (OVERLAPS) 94/163 variables, 69/71 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 64/135 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/163 variables, 93/228 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/163 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 7 (OVERLAPS) 0/163 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 93 unsolved
No progress, stopping.
After SMT solving in domain Int declared 163/163 variables, and 228 constraints, problems are : Problem set: 0 solved, 93 unsolved in 2361 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 69/69 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 93/93 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4573ms problems are : Problem set: 0 solved, 93 unsolved
Search for dead transitions found 0 dead transitions in 4574ms
Starting structural reductions in LTL mode, iteration 1 : 69/87 places, 94/112 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4687 ms. Remains : 69/87 places, 94/112 transitions.
[2026-05-24 04:43:18] [INFO ] Flatten gal took : 10 ms
[2026-05-24 04:43:19] [INFO ] Flatten gal took : 5 ms
[2026-05-24 04:43:19] [INFO ] Input system was already deterministic with 94 transitions.
[2026-05-24 04:43:19] [INFO ] Flatten gal took : 4 ms
[2026-05-24 04:43:19] [INFO ] Flatten gal took : 3 ms
[2026-05-24 04:43:19] [INFO ] Time to serialize gal into /tmp/CTLFireability4243120226902728081.gal : 1 ms
[2026-05-24 04:43:19] [INFO ] Time to serialize properties into /tmp/CTLFireability9407610091646225538.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability4243120226902728081.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9407610091646225538.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/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,8.35715e+08,0.233146,14120,2,1660,5,65946,6,0,358,39404,0


Converting to forward existential form...Done !
original formula: EG(AF((((p59==1)&&(p91==1)) + (AG(((p54==0)||(p92==0))) * EX((p8==0))))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(!((((p59==1)&&(p91==1)) + (!(E(TRUE U !(((p54==0)||(p92==0))))) * EX((p8==0))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t21, t23, t25, t27, t28, t30, t32, t34, t36, t84, t85, t86, t87, t88, t89, t90, t91, t92, t93...255
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,4.10904,136128,1,0,516,785859,224,352,2278,926514,560
FORMULA DiscoveryGPU-PT-09a-CTLFireability-2024-05 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 : 87/87 places, 112/112 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 79 transition count 104
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 79 transition count 104
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 23 place count 72 transition count 97
Iterating global reduction 0 with 7 rules applied. Total rules applied 30 place count 72 transition count 97
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 33 place count 69 transition count 94
Iterating global reduction 0 with 3 rules applied. Total rules applied 36 place count 69 transition count 94
Applied a total of 36 rules in 5 ms. Remains 69 /87 variables (removed 18) and now considering 94/112 (removed 18) transitions.
[2026-05-24 04:43:23] [INFO ] Invariant cache hit.
[2026-05-24 04:43:23] [INFO ] Implicit Places using invariants in 37 ms returned []
[2026-05-24 04:43:23] [INFO ] Invariant cache hit.
[2026-05-24 04:43:23] [INFO ] State equation strengthened by 64 read => feed constraints.
[2026-05-24 04:43:23] [INFO ] Implicit Places using invariants and state equation in 102 ms returned [68]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 141 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 68/87 places, 94/112 transitions.
Applied a total of 0 rules in 4 ms. Remains 68 /68 variables (removed 0) and now considering 94/94 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 151 ms. Remains : 68/87 places, 94/112 transitions.
[2026-05-24 04:43:23] [INFO ] Flatten gal took : 7 ms
[2026-05-24 04:43:23] [INFO ] Flatten gal took : 11 ms
[2026-05-24 04:43:23] [INFO ] Input system was already deterministic with 94 transitions.
[2026-05-24 04:43:23] [INFO ] Flatten gal took : 8 ms
[2026-05-24 04:43:23] [INFO ] Flatten gal took : 3 ms
[2026-05-24 04:43:23] [INFO ] Time to serialize gal into /tmp/CTLFireability4510896753674026250.gal : 0 ms
[2026-05-24 04:43:23] [INFO ] Time to serialize properties into /tmp/CTLFireability3248454243101385468.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability4510896753674026250.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3248454243101385468.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/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,8.35715e+08,0.458387,22348,2,5324,5,123961,6,0,356,67148,0


Converting to forward existential form...Done !
original formula: AX(AG(EF(AG((p6==1)))))
=> equivalent forward existential formula: [(FwdU(EY(Init),TRUE) * !(E(TRUE U !(E(TRUE U !((p6==1)))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t21, t23, t25, t27, t28, t30, t32, t34, t36, t84, t85, t86, t87, t88, t89, t90, t91, t92, t93...255
(forward)formula 0,0,3.41681,110360,1,0,136,553567,211,89,2256,530289,201
FORMULA DiscoveryGPU-PT-09a-CTLFireability-2024-06 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 : 87/87 places, 112/112 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 80 transition count 105
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 80 transition count 105
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 19 place count 75 transition count 100
Iterating global reduction 0 with 5 rules applied. Total rules applied 24 place count 75 transition count 100
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 27 place count 72 transition count 97
Iterating global reduction 0 with 3 rules applied. Total rules applied 30 place count 72 transition count 97
Applied a total of 30 rules in 3 ms. Remains 72 /87 variables (removed 15) and now considering 97/112 (removed 15) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16246324850052882025.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4245558384274106101.kers'
[2026-05-24 04:43:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16246324850052882025.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4245558384274106101.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 97 rows 70 cols 192 entries
Finished phase 1 with 70 SingleSign rule and 0 generalized
[2026-05-24 04:43:26] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-4245558384274106101.kers
Total runtime 1 ms.
[2026-05-24 04:43:26] [INFO ] Implicit Places using invariants in 47 ms returned []
[2026-05-24 04:43:26] [INFO ] Invariant cache hit.
[2026-05-24 04:43:26] [INFO ] State equation strengthened by 65 read => feed constraints.
[2026-05-24 04:43:26] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 114 ms to find 0 implicit places.
Running 96 sub problems to find dead transitions.
[2026-05-24 04:43:26] [INFO ] Invariant cache hit.
[2026-05-24 04:43:26] [INFO ] State equation strengthened by 65 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (OVERLAPS) 1/72 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (OVERLAPS) 97/169 variables, 72/74 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/169 variables, 65/139 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/169 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (OVERLAPS) 0/169 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Real declared 169/169 variables, and 139 constraints, problems are : Problem set: 0 solved, 96 unsolved in 2430 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 72/72 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 96 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (OVERLAPS) 1/72 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (OVERLAPS) 97/169 variables, 72/74 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/169 variables, 65/139 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/169 variables, 96/235 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/169 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (OVERLAPS) 0/169 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Int declared 169/169 variables, and 235 constraints, problems are : Problem set: 0 solved, 96 unsolved in 2357 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 72/72 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4799ms problems are : Problem set: 0 solved, 96 unsolved
Search for dead transitions found 0 dead transitions in 4799ms
Starting structural reductions in LTL mode, iteration 1 : 72/87 places, 97/112 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4917 ms. Remains : 72/87 places, 97/112 transitions.
[2026-05-24 04:43:31] [INFO ] Flatten gal took : 8 ms
[2026-05-24 04:43:31] [INFO ] Flatten gal took : 6 ms
[2026-05-24 04:43:31] [INFO ] Input system was already deterministic with 97 transitions.
[2026-05-24 04:43:31] [INFO ] Flatten gal took : 2 ms
[2026-05-24 04:43:31] [INFO ] Flatten gal took : 3 ms
[2026-05-24 04:43:31] [INFO ] Time to serialize gal into /tmp/CTLFireability10225050936711501116.gal : 1 ms
[2026-05-24 04:43:31] [INFO ] Time to serialize properties into /tmp/CTLFireability3913069612355758191.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability10225050936711501116.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3913069612355758191.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/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.0488e+09,0.307593,17096,2,3038,5,80745,6,0,373,52349,0


Converting to forward existential form...Done !
original formula: (AX((AF(((p13==0) + ((E((p28==1) U ((p36==1)&&(p91==1))) * (p66==1)) * ((p50==1)&&(p91==1))))) + ((p89==1)&&(p91==1)))) * EF(AG((EF(((p82...202
=> equivalent forward existential formula: ([FwdG((EY(Init) * !(((p89==1)&&(p91==1)))),!(((p13==0) + ((E((p28==1) U ((p36==1)&&(p91==1))) * (p66==1)) * ((p...302
Reverse transition relation is NOT exact ! Due to transitions t16, t19, t25, t27, t29, t30, t34, t36, t38, t77, t81, t87, t88, t89, t90, t91, t92, t93, t94...265
(forward)formula 0,1,2.75734,88320,1,0,310,435694,237,173,2337,543843,416
FORMULA DiscoveryGPU-PT-09a-CTLFireability-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 87/87 places, 112/112 transitions.
Graph (complete) has 249 edges and 87 vertex of which 83 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 8 Pre rules applied. Total rules applied 1 place count 83 transition count 100
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 17 place count 75 transition count 100
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 25 place count 67 transition count 92
Iterating global reduction 0 with 8 rules applied. Total rules applied 33 place count 67 transition count 92
Applied a total of 33 rules in 28 ms. Remains 67 /87 variables (removed 20) and now considering 92/112 (removed 20) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4551889374193016676.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13544654924248464833.kers'
[2026-05-24 04:43:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4551889374193016676.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13544654924248464833.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 92 rows 65 cols 182 entries
Finished phase 1 with 65 SingleSign rule and 0 generalized
[2026-05-24 04:43:34] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-13544654924248464833.kers
Total runtime 0 ms.
[2026-05-24 04:43:34] [INFO ] Implicit Places using invariants in 30 ms returned []
[2026-05-24 04:43:34] [INFO ] Invariant cache hit.
[2026-05-24 04:43:34] [INFO ] State equation strengthened by 64 read => feed constraints.
[2026-05-24 04:43:34] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
[2026-05-24 04:43:34] [INFO ] Redundant transitions in 3 ms returned []
Running 91 sub problems to find dead transitions.
[2026-05-24 04:43:34] [INFO ] Invariant cache hit.
[2026-05-24 04:43:34] [INFO ] State equation strengthened by 64 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (OVERLAPS) 1/67 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 3 (OVERLAPS) 92/159 variables, 67/69 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 64/133 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/159 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (OVERLAPS) 0/159 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Real declared 159/159 variables, and 133 constraints, problems are : Problem set: 0 solved, 91 unsolved in 2301 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 67/67 constraints, ReadFeed: 64/64 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
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (OVERLAPS) 1/67 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 3 (OVERLAPS) 92/159 variables, 67/69 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 64/133 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/159 variables, 91/224 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/159 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (OVERLAPS) 0/159 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Int declared 159/159 variables, and 224 constraints, problems are : Problem set: 0 solved, 91 unsolved in 2119 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 67/67 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4436ms problems are : Problem set: 0 solved, 91 unsolved
Search for dead transitions found 0 dead transitions in 4437ms
Starting structural reductions in SI_CTL mode, iteration 1 : 67/87 places, 92/112 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4577 ms. Remains : 67/87 places, 92/112 transitions.
[2026-05-24 04:43:39] [INFO ] Flatten gal took : 7 ms
[2026-05-24 04:43:39] [INFO ] Flatten gal took : 5 ms
[2026-05-24 04:43:39] [INFO ] Input system was already deterministic with 92 transitions.
[2026-05-24 04:43:39] [INFO ] Flatten gal took : 3 ms
[2026-05-24 04:43:39] [INFO ] Flatten gal took : 3 ms
[2026-05-24 04:43:39] [INFO ] Time to serialize gal into /tmp/CTLFireability16816541575194417266.gal : 0 ms
[2026-05-24 04:43:39] [INFO ] Time to serialize properties into /tmp/CTLFireability14019994535177417524.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16816541575194417266.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14019994535177417524.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/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,2.85213e+08,0.115757,9296,2,954,5,34308,6,0,349,18409,0


Converting to forward existential form...Done !
original formula: EF(AG(((p68==0)&&(((p34==1)&&(p92==1))||((p84==1)&&(p92==1))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(((p68==0)&&(((p34==1)&&(p92==1))||((p84==1)&&(p92==1))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t20, t22, t24, t26, t27, t29, t31, t33, t35, t82, t83, t84, t85, t86, t87, t88, t89, t90, t91...255
(forward)formula 0,0,0.464021,20988,1,0,132,90140,206,86,2081,88429,194
FORMULA DiscoveryGPU-PT-09a-CTLFireability-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 87/87 places, 112/112 transitions.
Graph (complete) has 249 edges and 87 vertex of which 83 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 7 Pre rules applied. Total rules applied 1 place count 83 transition count 101
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 15 place count 76 transition count 101
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 23 place count 68 transition count 93
Iterating global reduction 0 with 8 rules applied. Total rules applied 31 place count 68 transition count 93
Applied a total of 31 rules in 7 ms. Remains 68 /87 variables (removed 19) and now considering 93/112 (removed 19) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13760663295289629228.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10124155471760132465.kers'
[2026-05-24 04:43:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13760663295289629228.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10124155471760132465.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 93 rows 66 cols 184 entries
Finished phase 1 with 66 SingleSign rule and 0 generalized
[2026-05-24 04:43:39] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-10124155471760132465.kers
Total runtime 1 ms.
[2026-05-24 04:43:39] [INFO ] Implicit Places using invariants in 32 ms returned []
[2026-05-24 04:43:39] [INFO ] Invariant cache hit.
[2026-05-24 04:43:39] [INFO ] State equation strengthened by 64 read => feed constraints.
[2026-05-24 04:43:39] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
[2026-05-24 04:43:39] [INFO ] Redundant transitions in 1 ms returned []
Running 92 sub problems to find dead transitions.
[2026-05-24 04:43:39] [INFO ] Invariant cache hit.
[2026-05-24 04:43:39] [INFO ] State equation strengthened by 64 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 1 (OVERLAPS) 1/68 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 3 (OVERLAPS) 93/161 variables, 68/70 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/161 variables, 64/134 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/161 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 6 (OVERLAPS) 0/161 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Real declared 161/161 variables, and 134 constraints, problems are : Problem set: 0 solved, 92 unsolved in 2125 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 68/68 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 92/92 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 92 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 1 (OVERLAPS) 1/68 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 3 (OVERLAPS) 93/161 variables, 68/70 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/161 variables, 64/134 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/161 variables, 92/226 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/161 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 7 (OVERLAPS) 0/161 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Int declared 161/161 variables, and 226 constraints, problems are : Problem set: 0 solved, 92 unsolved in 2121 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 68/68 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 92/92 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4251ms problems are : Problem set: 0 solved, 92 unsolved
Search for dead transitions found 0 dead transitions in 4251ms
Starting structural reductions in SI_CTL mode, iteration 1 : 68/87 places, 93/112 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4361 ms. Remains : 68/87 places, 93/112 transitions.
[2026-05-24 04:43:43] [INFO ] Flatten gal took : 8 ms
[2026-05-24 04:43:44] [INFO ] Flatten gal took : 6 ms
[2026-05-24 04:43:44] [INFO ] Input system was already deterministic with 93 transitions.
[2026-05-24 04:43:44] [INFO ] Flatten gal took : 2 ms
[2026-05-24 04:43:44] [INFO ] Flatten gal took : 3 ms
[2026-05-24 04:43:44] [INFO ] Time to serialize gal into /tmp/CTLFireability5883668203947794424.gal : 1 ms
[2026-05-24 04:43:44] [INFO ] Time to serialize properties into /tmp/CTLFireability6766938225742203873.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability5883668203947794424.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6766938225742203873.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/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,3.18767e+08,0.155355,11016,2,1784,5,42619,6,0,354,24936,0


Converting to forward existential form...Done !
original formula: EF(((EF(((((p59==0)||(p91==0))&&(p76==1))&&(p91==1))) * (p43==1)) * ((p92==1) * ((EF(((p88==1)&&(p92==1))) + (p79==0)) + (p91==0)))))
=> equivalent forward existential formula: (([(FwdU(((FwdU(Init,TRUE) * (E(TRUE U ((((p59==0)||(p91==0))&&(p76==1))&&(p91==1))) * (p43==1))) * (p92==1)),TR...448
Reverse transition relation is NOT exact ! Due to transitions t9, t21, t23, t27, t28, t30, t32, t34, t36, t83, t84, t85, t86, t87, t88, t89, t90, t91, t92,...254
(forward)formula 0,1,0.832823,34016,1,0,139,160037,211,90,2192,163946,201
FORMULA DiscoveryGPU-PT-09a-CTLFireability-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 87/87 places, 112/112 transitions.
Graph (complete) has 249 edges and 87 vertex of which 84 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 91 edges and 81 vertex of which 66 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.1 ms
Discarding 15 places :
Also discarding 15 output transitions
Drop transitions (Output transitions of discarded places.) removed 15 transitions
Graph (trivial) has 74 edges and 66 vertex of which 36 / 66 are part of one of the 18 SCC in 2 ms
Free SCC test removed 18 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 48 transition count 83
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 43 place count 38 transition count 65
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 50 place count 31 transition count 51
Iterating global reduction 2 with 7 rules applied. Total rules applied 57 place count 31 transition count 51
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 64 place count 24 transition count 37
Iterating global reduction 2 with 7 rules applied. Total rules applied 71 place count 24 transition count 37
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 78 place count 17 transition count 23
Iterating global reduction 2 with 7 rules applied. Total rules applied 85 place count 17 transition count 23
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 92 place count 10 transition count 16
Iterating global reduction 2 with 7 rules applied. Total rules applied 99 place count 10 transition count 16
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 100 place count 10 transition count 15
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 101 place count 10 transition count 14
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 102 place count 9 transition count 14
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 104 place count 7 transition count 12
Applied a total of 104 rules in 22 ms. Remains 7 /87 variables (removed 80) and now considering 12/112 (removed 100) transitions.
[2026-05-24 04:43:44] [INFO ] Flow matrix only has 9 transitions (discarded 3 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18032351572387152116.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12308839262222428028.kers'
[2026-05-24 04:43:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18032351572387152116.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12308839262222428028.kers]
Normalized transition count is 8 out of 9 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 8 rows 7 cols 13 entries
Finished phase 1 with 7 SingleSign rule and 0 generalized
[2026-05-24 04:43:44] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-12308839262222428028.kers
Total runtime 0 ms.
[2026-05-24 04:43:44] [INFO ] Implicit Places using invariants in 18 ms returned []
[2026-05-24 04:43:44] [INFO ] Flow matrix only has 9 transitions (discarded 3 similar events)
[2026-05-24 04:43:44] [INFO ] Invariant cache hit.
[2026-05-24 04:43:44] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
[2026-05-24 04:43:44] [INFO ] Redundant transitions in 0 ms returned []
Running 8 sub problems to find dead transitions.
[2026-05-24 04:43:44] [INFO ] Flow matrix only has 9 transitions (discarded 3 similar events)
[2026-05-24 04:43:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 8/13 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 2/15 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 0/15 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 15/16 variables, and 7 constraints, problems are : Problem set: 0 solved, 8 unsolved in 65 ms.
Refiners :[State Equation: 7/7 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 8/13 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 2/15 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 0/15 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 15/16 variables, and 15 constraints, problems are : Problem set: 0 solved, 8 unsolved in 60 ms.
Refiners :[State Equation: 7/7 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 129ms problems are : Problem set: 0 solved, 8 unsolved
Search for dead transitions found 0 dead transitions in 130ms
Starting structural reductions in SI_CTL mode, iteration 1 : 7/87 places, 12/112 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 196 ms. Remains : 7/87 places, 12/112 transitions.
[2026-05-24 04:43:45] [INFO ] Flatten gal took : 1 ms
[2026-05-24 04:43:45] [INFO ] Flatten gal took : 0 ms
[2026-05-24 04:43:45] [INFO ] Input system was already deterministic with 12 transitions.
RANDOM walk for 130 steps (2 resets) in 5 ms. (21 steps per ms) remains 0/1 properties
FORMULA DiscoveryGPU-PT-09a-CTLFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2026-05-24 04:43:45] [INFO ] Flatten gal took : 2 ms
[2026-05-24 04:43:45] [INFO ] Flatten gal took : 2 ms
[2026-05-24 04:43:45] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality18213817875730337532.gal : 0 ms
[2026-05-24 04:43:45] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14260885727277703894.prop : 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.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality18213817875730337532.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14260885727277703894.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 87/87 places, 112/112 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 82 transition count 107
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 82 transition count 107
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 15 place count 77 transition count 102
Iterating global reduction 0 with 5 rules applied. Total rules applied 20 place count 77 transition count 102
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 76 transition count 101
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 76 transition count 101
Applied a total of 22 rules in 5 ms. Remains 76 /87 variables (removed 11) and now considering 101/112 (removed 11) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7578236436131791495.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14363431323474469053.kers'
[2026-05-24 04:43:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7578236436131791495.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14363431323474469053.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 101 rows 74 cols 198 entries
Finished phase 1 with 74 SingleSign rule and 0 generalized
[2026-05-24 04:43:45] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-14363431323474469053.kers
Total runtime 0 ms.
[2026-05-24 04:43:45] [INFO ] Implicit Places using invariants in 33 ms returned []
[2026-05-24 04:43:45] [INFO ] Invariant cache hit.
[2026-05-24 04:43:45] [INFO ] State equation strengthened by 66 read => feed constraints.
[2026-05-24 04:43:45] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
Running 100 sub problems to find dead transitions.
[2026-05-24 04:43:45] [INFO ] Invariant cache hit.
[2026-05-24 04:43:45] [INFO ] State equation strengthened by 66 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (OVERLAPS) 1/76 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (OVERLAPS) 101/177 variables, 76/78 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/177 variables, 66/144 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/177 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (OVERLAPS) 0/177 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Real declared 177/177 variables, and 144 constraints, problems are : Problem set: 0 solved, 100 unsolved in 2266 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 76/76 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 100 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (OVERLAPS) 1/76 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (OVERLAPS) 101/177 variables, 76/78 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/177 variables, 66/144 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/177 variables, 100/244 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/177 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (OVERLAPS) 0/177 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Int declared 177/177 variables, and 244 constraints, problems are : Problem set: 0 solved, 100 unsolved in 2516 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 76/76 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4790ms problems are : Problem set: 0 solved, 100 unsolved
Search for dead transitions found 0 dead transitions in 4790ms
Starting structural reductions in LTL mode, iteration 1 : 76/87 places, 101/112 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4894 ms. Remains : 76/87 places, 101/112 transitions.
[2026-05-24 04:43:49] [INFO ] Flatten gal took : 11 ms
[2026-05-24 04:43:49] [INFO ] Flatten gal took : 4 ms
[2026-05-24 04:43:49] [INFO ] Input system was already deterministic with 101 transitions.
[2026-05-24 04:43:49] [INFO ] Flatten gal took : 3 ms
[2026-05-24 04:43:49] [INFO ] Flatten gal took : 3 ms
[2026-05-24 04:43:49] [INFO ] Time to serialize gal into /tmp/CTLFireability145724513515808146.gal : 1 ms
[2026-05-24 04:43:49] [INFO ] Time to serialize properties into /tmp/CTLFireability7749343608287715573.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability145724513515808146.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7749343608287715573.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/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,1.28191e+09,0.3159,18224,2,2408,5,95137,6,0,391,49998,0


Converting to forward existential form...Done !
original formula: A(AX(((p80==1)&&(p91==1))) U !(AG(!((((p31==1) + AG(((p73==1)&&(p92==1)))) * ((((p64==1)&&(p92==1))||(p1==1))||(!((p58==1)&&(p92==1))))))...158
=> equivalent forward existential formula: [((Init * !(EG(!(!(!(E(TRUE U !(!((((p31==1) + !(E(TRUE U !(((p73==1)&&(p92==1)))))) * ((((p64==1)&&(p92==1))||(...533
Reverse transition relation is NOT exact ! Due to transitions t3, t17, t24, t26, t28, t30, t33, t37, t89, t90, t91, t92, t93, t94, t95, t96, t97, t98, t99,...261
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,6.5486,204124,1,0,517,1.18416e+06,236,348,2488,1.33182e+06,568
FORMULA DiscoveryGPU-PT-09a-CTLFireability-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 87/87 places, 112/112 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 80 transition count 105
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 80 transition count 105
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 20 place count 74 transition count 99
Iterating global reduction 0 with 6 rules applied. Total rules applied 26 place count 74 transition count 99
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 29 place count 71 transition count 96
Iterating global reduction 0 with 3 rules applied. Total rules applied 32 place count 71 transition count 96
Applied a total of 32 rules in 11 ms. Remains 71 /87 variables (removed 16) and now considering 96/112 (removed 16) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2752872266768044857.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17995614075558264726.kers'
[2026-05-24 04:43:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2752872266768044857.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17995614075558264726.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 96 rows 69 cols 190 entries
Finished phase 1 with 69 SingleSign rule and 0 generalized
[2026-05-24 04:43:56] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-17995614075558264726.kers
Total runtime 3 ms.
[2026-05-24 04:43:56] [INFO ] Implicit Places using invariants in 39 ms returned []
[2026-05-24 04:43:56] [INFO ] Invariant cache hit.
[2026-05-24 04:43:56] [INFO ] State equation strengthened by 65 read => feed constraints.
[2026-05-24 04:43:56] [INFO ] Implicit Places using invariants and state equation in 76 ms returned [70]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 116 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 70/87 places, 96/112 transitions.
Applied a total of 0 rules in 1 ms. Remains 70 /70 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 128 ms. Remains : 70/87 places, 96/112 transitions.
[2026-05-24 04:43:56] [INFO ] Flatten gal took : 3 ms
[2026-05-24 04:43:56] [INFO ] Flatten gal took : 2 ms
[2026-05-24 04:43:56] [INFO ] Input system was already deterministic with 96 transitions.
[2026-05-24 04:43:56] [INFO ] Flatten gal took : 3 ms
[2026-05-24 04:43:56] [INFO ] Flatten gal took : 2 ms
[2026-05-24 04:43:56] [INFO ] Time to serialize gal into /tmp/CTLFireability3641153108934025758.gal : 0 ms
[2026-05-24 04:43:56] [INFO ] Time to serialize properties into /tmp/CTLFireability10915397318767738313.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3641153108934025758.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10915397318767738313.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/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.67311e+08,0.570233,26148,2,7170,5,144647,6,0,366,83884,0


Converting to forward existential form...Done !
original formula: EF((AF(EG(A(((p42==1)&&(p91==1)) U (p24==1)))) * ((AX(((p15==0)||(p91==0))) + (p75==0)) + (p91==0))))
=> equivalent forward existential formula: (([((FwdU(Init,TRUE) * !(EG(!(EG(!((E(!((p24==1)) U (!(((p42==1)&&(p91==1))) * !((p24==1)))) + EG(!((p24==1)))))...486
Reverse transition relation is NOT exact ! Due to transitions t22, t24, t28, t29, t31, t33, t35, t37, t78, t80, t86, t87, t88, t89, t90, t91, t92, t93, t94...260
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Detected timeout of ITS tools.
[2026-05-24 04:44:26] [INFO ] Flatten gal took : 3 ms
[2026-05-24 04:44:26] [INFO ] Applying decomposition
[2026-05-24 04:44:26] [INFO ] Flatten gal took : 2 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph6142570270195257968.txt' '-o' '/tmp/graph6142570270195257968.bin' '-w' '/tmp/graph6142570270195257968.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph6142570270195257968.bin' '-l' '-1' '-v' '-w' '/tmp/graph6142570270195257968.weights' '-q' '0' '-e' '0.001'
[2026-05-24 04:44:26] [INFO ] Decomposing Gal with order
[2026-05-24 04:44:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 04:44:26] [INFO ] Removed a total of 52 redundant transitions.
[2026-05-24 04:44:26] [INFO ] Flatten gal took : 57 ms
[2026-05-24 04:44:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 64 labels/synchronizations in 6 ms.
[2026-05-24 04:44:26] [INFO ] Time to serialize gal into /tmp/CTLFireability16764645974624447478.gal : 2 ms
[2026-05-24 04:44:26] [INFO ] Time to serialize properties into /tmp/CTLFireability9632452896979928224.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16764645974624447478.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9632452896979928224.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9.67311e+08,0.092873,8776,320,52,10957,674,170,17906,41,3508,0


Converting to forward existential form...Done !
original formula: EF((AF(EG(A(((i5.u9.p42==1)&&(i10.u20.p91==1)) U (i3.u5.p24==1)))) * ((AX(((i10.u3.p15==0)||(i10.u20.p91==0))) + (i0.u16.p75==0)) + (i10....169
=> equivalent forward existential formula: (([((FwdU(Init,TRUE) * !(EG(!(EG(!((E(!((i3.u5.p24==1)) U (!(((i5.u9.p42==1)&&(i10.u20.p91==1))) * !((i3.u5.p24=...612
Reverse transition relation is NOT exact ! Due to transitions t22, t24, t28, t29, t31, t33, t78, t80, i0.t37, i0.t35, i0.u12.t94, i0.u16.t95, i1.u1.t91, i3...334
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
(forward)formula 0,1,2.90487,111904,1,0,221364,2190,975,345259,208,10196,153088
FORMULA DiscoveryGPU-PT-09a-CTLFireability-2024-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 87/87 places, 112/112 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 82 transition count 107
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 82 transition count 107
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 13 place count 79 transition count 104
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 79 transition count 104
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 78 transition count 103
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 78 transition count 103
Applied a total of 18 rules in 9 ms. Remains 78 /87 variables (removed 9) and now considering 103/112 (removed 9) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6555970756225978169.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6664122667772304059.kers'
[2026-05-24 04:44:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6555970756225978169.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6664122667772304059.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 103 rows 76 cols 203 entries
Finished phase 1 with 76 SingleSign rule and 0 generalized
[2026-05-24 04:44:29] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-6664122667772304059.kers
Total runtime 1 ms.
[2026-05-24 04:44:29] [INFO ] Implicit Places using invariants in 39 ms returned []
[2026-05-24 04:44:29] [INFO ] Invariant cache hit.
[2026-05-24 04:44:29] [INFO ] State equation strengthened by 66 read => feed constraints.
[2026-05-24 04:44:30] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
Running 102 sub problems to find dead transitions.
[2026-05-24 04:44:30] [INFO ] Invariant cache hit.
[2026-05-24 04:44:30] [INFO ] State equation strengthened by 66 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (OVERLAPS) 1/78 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (OVERLAPS) 103/181 variables, 78/80 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/181 variables, 66/146 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/181 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (OVERLAPS) 0/181 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Real declared 181/181 variables, and 146 constraints, problems are : Problem set: 0 solved, 102 unsolved in 2606 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 78/78 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 102 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (OVERLAPS) 1/78 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (OVERLAPS) 103/181 variables, 78/80 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/181 variables, 66/146 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/181 variables, 102/248 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/181 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (OVERLAPS) 0/181 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Int declared 181/181 variables, and 248 constraints, problems are : Problem set: 0 solved, 102 unsolved in 2519 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 78/78 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5132ms problems are : Problem set: 0 solved, 102 unsolved
Search for dead transitions found 0 dead transitions in 5132ms
Starting structural reductions in LTL mode, iteration 1 : 78/87 places, 103/112 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5263 ms. Remains : 78/87 places, 103/112 transitions.
[2026-05-24 04:44:35] [INFO ] Flatten gal took : 11 ms
[2026-05-24 04:44:35] [INFO ] Flatten gal took : 3 ms
[2026-05-24 04:44:35] [INFO ] Input system was already deterministic with 103 transitions.
[2026-05-24 04:44:35] [INFO ] Flatten gal took : 2 ms
[2026-05-24 04:44:35] [INFO ] Flatten gal took : 2 ms
[2026-05-24 04:44:35] [INFO ] Time to serialize gal into /tmp/CTLFireability4931030299949736566.gal : 1 ms
[2026-05-24 04:44:35] [INFO ] Time to serialize properties into /tmp/CTLFireability8325514224221830531.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability4931030299949736566.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8325514224221830531.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/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.48543e+09,0.914238,35816,2,6985,5,224882,6,0,402,112347,0


Converting to forward existential form...Done !
original formula: (A(!((AX(AX((p38==1))) * ((E(((p20==1)&&(p91==1)) U ((p57==1)&&(p91==1))) + !(AX(((p40==1)&&(p91==1))))) + ((((((p83==1)&&(p92==1))||(p46...516
=> equivalent forward existential formula: ((([(EY((FwdU(Init,!((!(EX(!(E(TRUE U !(((p58==1)&&(p92==1))))))) * ((!(E(TRUE U ((p69==1)&&(p91==1)))) + (EX(((...1509
Reverse transition relation is NOT exact ! Due to transitions t1, t8, t11, t20, t23, t29, t36, t42, t84, t85, t92, t93, t94, t95, t96, t97, t98, t99, t100,...267
Detected timeout of ITS tools.
[2026-05-24 04:45:05] [INFO ] Flatten gal took : 8 ms
[2026-05-24 04:45:05] [INFO ] Applying decomposition
[2026-05-24 04:45:05] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph11529669741494084108.txt' '-o' '/tmp/graph11529669741494084108.bin' '-w' '/tmp/graph11529669741494084108.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph11529669741494084108.bin' '-l' '-1' '-v' '-w' '/tmp/graph11529669741494084108.weights' '-q' '0' '-e' '0.001'
[2026-05-24 04:45:05] [INFO ] Decomposing Gal with order
[2026-05-24 04:45:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 04:45:05] [INFO ] Removed a total of 58 redundant transitions.
[2026-05-24 04:45:05] [INFO ] Flatten gal took : 7 ms
[2026-05-24 04:45:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 54 labels/synchronizations in 7 ms.
[2026-05-24 04:45:05] [INFO ] Time to serialize gal into /tmp/CTLFireability17434001939154992259.gal : 2 ms
[2026-05-24 04:45:05] [INFO ] Time to serialize properties into /tmp/CTLFireability10077239496402944191.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17434001939154992259.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10077239496402944191.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.48543e+09,0.636906,27940,590,829,35603,25633,232,68803,53,135631,0


Converting to forward existential form...Done !
original formula: (A(!((AX(AX((i5.u15.p38==1))) * ((E(((i2.u7.p20==1)&&(i7.u0.p91==1)) U ((i7.u20.p57==1)&&(i7.u0.p91==1))) + !(AX(((i5.u15.p40==1)&&(i7.u0...718
=> equivalent forward existential formula: ((([(EY((FwdU(Init,!((!(EX(!(E(TRUE U !(((i7.u21.p58==1)&&(u1.p92==1))))))) * ((!(E(TRUE U ((i8.u24.p69==1)&&(i7...1999
Reverse transition relation is NOT exact ! Due to transitions t29, t36, t42, t84, t85, u1.t1, u1.t8, u1.t11, u1.t20, u1.t23, i0.u29.t92, i1.u3.t97, i2.u6.t...358
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found a local SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
(forward)formula 0,1,5.57925,184312,1,0,227484,136877,1321,601383,274,1.22893e+06,169940
FORMULA DiscoveryGPU-PT-09a-CTLFireability-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 87/87 places, 112/112 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 80 transition count 105
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 80 transition count 105
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 19 place count 75 transition count 100
Iterating global reduction 0 with 5 rules applied. Total rules applied 24 place count 75 transition count 100
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 26 place count 73 transition count 98
Iterating global reduction 0 with 2 rules applied. Total rules applied 28 place count 73 transition count 98
Applied a total of 28 rules in 9 ms. Remains 73 /87 variables (removed 14) and now considering 98/112 (removed 14) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3936538756181422269.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1481936166532013122.kers'
[2026-05-24 04:45:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3936538756181422269.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1481936166532013122.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 98 rows 71 cols 193 entries
Finished phase 1 with 71 SingleSign rule and 0 generalized
[2026-05-24 04:45:10] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-1481936166532013122.kers
Total runtime 3 ms.
[2026-05-24 04:45:10] [INFO ] Implicit Places using invariants in 44 ms returned []
[2026-05-24 04:45:10] [INFO ] Invariant cache hit.
[2026-05-24 04:45:11] [INFO ] State equation strengthened by 65 read => feed constraints.
[2026-05-24 04:45:11] [INFO ] Implicit Places using invariants and state equation in 71 ms returned [72]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 116 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 72/87 places, 98/112 transitions.
Applied a total of 0 rules in 1 ms. Remains 72 /72 variables (removed 0) and now considering 98/98 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 126 ms. Remains : 72/87 places, 98/112 transitions.
[2026-05-24 04:45:11] [INFO ] Flatten gal took : 2 ms
[2026-05-24 04:45:11] [INFO ] Flatten gal took : 2 ms
[2026-05-24 04:45:11] [INFO ] Input system was already deterministic with 98 transitions.
[2026-05-24 04:45:11] [INFO ] Flatten gal took : 2 ms
[2026-05-24 04:45:11] [INFO ] Flatten gal took : 2 ms
[2026-05-24 04:45:11] [INFO ] Time to serialize gal into /tmp/CTLFireability4009403995913283550.gal : 1 ms
[2026-05-24 04:45:11] [INFO ] Time to serialize properties into /tmp/CTLFireability17015314716088089641.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability4009403995913283550.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17015314716088089641.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/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.08544e+09,0.350677,18516,2,3477,5,98881,6,0,375,49575,0


Converting to forward existential form...Done !
original formula: (AG(((((!(A((p28==1) U (p68==1))) + ((p44==0)&&((p66==0)||(p91==0)))) + AF(((p46==0)||(p91==0)))) * (p13==0)) + EX(((p88==0) * AF((p61==0...277
=> equivalent forward existential formula: (([FwdG(((FwdU(Init,TRUE) * !(EX(((p88==0) * !(EG(!((p61==0)))))))) * !((!(!((E(!((p68==1)) U (!((p28==1)) * !((...541
Reverse transition relation is NOT exact ! Due to transitions t16, t19, t23, t27, t29, t30, t34, t36, t38, t87, t88, t89, t90, t91, t92, t93, t94, t95, t96...260
(forward)formula 0,0,15.4662,460564,1,0,1488,2.62509e+06,248,745,2213,3.43547e+06,1719
FORMULA DiscoveryGPU-PT-09a-CTLFireability-2024-14 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 : 87/87 places, 112/112 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 81 transition count 106
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 81 transition count 106
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 17 place count 76 transition count 101
Iterating global reduction 0 with 5 rules applied. Total rules applied 22 place count 76 transition count 101
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 24 place count 74 transition count 99
Iterating global reduction 0 with 2 rules applied. Total rules applied 26 place count 74 transition count 99
Applied a total of 26 rules in 3 ms. Remains 74 /87 variables (removed 13) and now considering 99/112 (removed 13) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-815274548175814898.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14097010951596378857.kers'
[2026-05-24 04:45:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-815274548175814898.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14097010951596378857.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 99 rows 72 cols 195 entries
Finished phase 1 with 72 SingleSign rule and 0 generalized
[2026-05-24 04:45:26] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-14097010951596378857.kers
Total runtime 0 ms.
[2026-05-24 04:45:26] [INFO ] Implicit Places using invariants in 43 ms returned []
[2026-05-24 04:45:26] [INFO ] Invariant cache hit.
[2026-05-24 04:45:26] [INFO ] State equation strengthened by 66 read => feed constraints.
[2026-05-24 04:45:26] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 127 ms to find 0 implicit places.
Running 98 sub problems to find dead transitions.
[2026-05-24 04:45:26] [INFO ] Invariant cache hit.
[2026-05-24 04:45:26] [INFO ] State equation strengthened by 66 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (OVERLAPS) 1/74 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (OVERLAPS) 99/173 variables, 74/76 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/173 variables, 66/142 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/173 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (OVERLAPS) 0/173 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Real declared 173/173 variables, and 142 constraints, problems are : Problem set: 0 solved, 98 unsolved in 2468 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 74/74 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 98 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (OVERLAPS) 1/74 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (OVERLAPS) 99/173 variables, 74/76 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/173 variables, 66/142 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/173 variables, 98/240 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/173 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (OVERLAPS) 0/173 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Int declared 173/173 variables, and 240 constraints, problems are : Problem set: 0 solved, 98 unsolved in 2573 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 74/74 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5047ms problems are : Problem set: 0 solved, 98 unsolved
Search for dead transitions found 0 dead transitions in 5047ms
Starting structural reductions in LTL mode, iteration 1 : 74/87 places, 99/112 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5177 ms. Remains : 74/87 places, 99/112 transitions.
[2026-05-24 04:45:31] [INFO ] Flatten gal took : 6 ms
[2026-05-24 04:45:31] [INFO ] Flatten gal took : 3 ms
[2026-05-24 04:45:31] [INFO ] Input system was already deterministic with 99 transitions.
[2026-05-24 04:45:31] [INFO ] Flatten gal took : 2 ms
[2026-05-24 04:45:31] [INFO ] Flatten gal took : 1 ms
[2026-05-24 04:45:31] [INFO ] Time to serialize gal into /tmp/CTLFireability14387746278279894995.gal : 0 ms
[2026-05-24 04:45:31] [INFO ] Time to serialize properties into /tmp/CTLFireability4307921812149942345.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14387746278279894995.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4307921812149942345.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/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.1501e+09,0.250588,14324,2,1977,5,64146,6,0,382,40156,0


Converting to forward existential form...Done !
original formula: AX(AX(EF(((p1==1)&&(((p58==1)||((p82==1)&&(p91==1)))||(((p8==1)&&(p92==1))||((p25==1)&&(p91==1))))))))
=> equivalent forward existential formula: [(EY(EY(Init)) * !(E(TRUE U ((p1==1)&&(((p58==1)||((p82==1)&&(p91==1)))||(((p8==1)&&(p92==1))||((p25==1)&&(p91==...173
Reverse transition relation is NOT exact ! Due to transitions t25, t27, t29, t32, t34, t36, t38, t77, t83, t88, t89, t90, t91, t92, t93, t94, t95, t96, t97...260
(forward)formula 0,1,2.41186,83248,1,0,144,513215,219,93,2331,351279,210
FORMULA DiscoveryGPU-PT-09a-CTLFireability-2024-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2026-05-24 04:45:34] [INFO ] Flatten gal took : 6 ms
[2026-05-24 04:45:34] [INFO ] Flatten gal took : 3 ms
Total runtime 185442 ms.

BK_STOP 1779597934390

--------------------
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.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /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-09a"
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-5973"
echo " Executing tool itstools"
echo " Input is DiscoveryGPU-PT-09a, 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 r098-tall-177955695500282"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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