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.r050-smll-177946901000074.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 Champagne-PT-H07T0R, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r050-smll-177946901000074
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 608K
-rw-r--r-- 1 mcc users 7.9K Mar 6 10:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K Mar 6 10:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Mar 6 10:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Mar 6 10:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 15 07:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 15 07:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 07:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 15 07:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Mar 6 10:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 123K Mar 6 10:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Mar 6 10:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K Mar 6 10:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 07:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 07:59 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 169K 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 Champagne-PT-H07T0R-CTLFireability-2024-00
FORMULA_NAME Champagne-PT-H07T0R-CTLFireability-2024-01
FORMULA_NAME Champagne-PT-H07T0R-CTLFireability-2024-02
FORMULA_NAME Champagne-PT-H07T0R-CTLFireability-2024-03
FORMULA_NAME Champagne-PT-H07T0R-CTLFireability-2024-04
FORMULA_NAME Champagne-PT-H07T0R-CTLFireability-2024-05
FORMULA_NAME Champagne-PT-H07T0R-CTLFireability-2024-06
FORMULA_NAME Champagne-PT-H07T0R-CTLFireability-2024-07
FORMULA_NAME Champagne-PT-H07T0R-CTLFireability-2024-08
FORMULA_NAME Champagne-PT-H07T0R-CTLFireability-2024-09
FORMULA_NAME Champagne-PT-H07T0R-CTLFireability-2024-10
FORMULA_NAME Champagne-PT-H07T0R-CTLFireability-2024-11
FORMULA_NAME Champagne-PT-H07T0R-CTLFireability-2024-12
FORMULA_NAME Champagne-PT-H07T0R-CTLFireability-2024-13
FORMULA_NAME Champagne-PT-H07T0R-CTLFireability-2024-14
FORMULA_NAME Champagne-PT-H07T0R-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1779499899972

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Champagne-PT-H07T0R
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202604301425
[2026-05-23 01:31:42] [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-23 01:31:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 01:31:42] [INFO ] Load time of PNML (sax parser for PT used): 219 ms
[2026-05-23 01:31:42] [INFO ] Transformed 539 places.
[2026-05-23 01:31:42] [INFO ] Transformed 742 transitions.
[2026-05-23 01:31:42] [INFO ] Found NUPN structural information;
[2026-05-23 01:31:42] [INFO ] Parsed PT model containing 539 places and 742 transitions and 1934 arcs in 473 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 20 ms.
Support contains 99 out of 539 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 539/539 places, 742/742 transitions.
Discarding 112 places :
Symmetric choice reduction at 0 with 112 rule applications. Total rules 112 place count 427 transition count 630
Iterating global reduction 0 with 112 rules applied. Total rules applied 224 place count 427 transition count 630
Discarding 57 places :
Symmetric choice reduction at 0 with 57 rule applications. Total rules 281 place count 370 transition count 573
Iterating global reduction 0 with 57 rules applied. Total rules applied 338 place count 370 transition count 573
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 365 place count 343 transition count 538
Iterating global reduction 0 with 27 rules applied. Total rules applied 392 place count 343 transition count 538
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 398 place count 343 transition count 532
Applied a total of 398 rules in 171 ms. Remains 343 /539 variables (removed 196) and now considering 532/742 (removed 210) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17314434194540327583.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7674133849907448309.kers'
[2026-05-23 01:31:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17314434194540327583.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7674133849907448309.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 532 rows 343 cols 1492 entries
Finished phase 1 with 316 SingleSign rule and 0 generalized
[2026-05-23 01:31:43] [INFO ] Computed 27 invariants in 2 ms
Computed 27 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-7674133849907448309.kers
Total runtime 5 ms.
[2026-05-23 01:31:43] [INFO ] Implicit Places using invariants in 780 ms returned []
[2026-05-23 01:31:43] [INFO ] Invariant cache hit.
[2026-05-23 01:31:44] [INFO ] Implicit Places using invariants and state equation in 705 ms returned []
Implicit Place search using SMT with State Equation took 1542 ms to find 0 implicit places.
Running 531 sub problems to find dead transitions.
[2026-05-23 01:31:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/342 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 531 unsolved
At refinement iteration 1 (OVERLAPS) 1/343 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 531 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/343 variables, 13/40 constraints. Problems are: Problem set: 0 solved, 531 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 343/875 variables, and 40 constraints, problems are : Problem set: 0 solved, 531 unsolved in 30075 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 0/343 constraints, PredecessorRefiner: 531/531 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 531 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/342 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 531 unsolved
At refinement iteration 1 (OVERLAPS) 1/343 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 531 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/343 variables, 13/40 constraints. Problems are: Problem set: 0 solved, 531 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/343 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 531 unsolved
At refinement iteration 4 (OVERLAPS) 532/875 variables, 343/383 constraints. Problems are: Problem set: 0 solved, 531 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/875 variables, 531/914 constraints. Problems are: Problem set: 0 solved, 531 unsolved
SMT process timed out in 60561ms, After SMT, problems are : Problem set: 0 solved, 531 unsolved
Search for dead transitions found 0 dead transitions in 60597ms
Starting structural reductions in LTL mode, iteration 1 : 343/539 places, 532/742 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62383 ms. Remains : 343/539 places, 532/742 transitions.
Starting structural reductions in LTL mode, iteration 0 : 343/343 places, 532/532 transitions.
Applied a total of 0 rules in 11 ms. Remains 343 /343 variables (removed 0) and now considering 532/532 (removed 0) transitions.
[2026-05-23 01:32:45] [INFO ] Invariant cache hit.
[2026-05-23 01:32:45] [INFO ] Implicit Places using invariants in 197 ms returned []
[2026-05-23 01:32:45] [INFO ] Invariant cache hit.
[2026-05-23 01:32:45] [INFO ] Implicit Places using invariants and state equation in 426 ms returned []
Implicit Place search using SMT with State Equation took 626 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 639 ms. Remains : 343/343 places, 532/532 transitions.
Support contains 99 out of 343 places after structural reductions.
[2026-05-23 01:32:46] [INFO ] Flatten gal took : 129 ms
[2026-05-23 01:32:46] [INFO ] Flatten gal took : 71 ms
[2026-05-23 01:32:46] [INFO ] Input system was already deterministic with 532 transitions.
Support contains 98 out of 343 places (down from 99) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 75 to 74
RANDOM walk for 40000 steps (116 resets) in 3339 ms. (11 steps per ms) remains 8/74 properties
BEST_FIRST walk for 40001 steps (8 resets) in 123 ms. (322 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 200 ms. (199 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 67 ms. (588 steps per ms) remains 5/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 126 ms. (314 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 82 ms. (481 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 66 ms. (597 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (9 resets) in 82 ms. (481 steps per ms) remains 4/4 properties
[2026-05-23 01:32:47] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 81/88 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 255/343 variables, 21/27 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/343 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 532/875 variables, 343/370 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/875 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/875 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 875/875 variables, and 370 constraints, problems are : Problem set: 0 solved, 4 unsolved in 514 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 343/343 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem AtomicPropp49 is UNSAT
At refinement iteration 1 (OVERLAPS) 81/88 variables, 6/6 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 255/343 variables, 21/27 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/343 variables, 2/29 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/343 variables, 0/29 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 532/875 variables, 343/372 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/875 variables, 3/375 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/875 variables, 1/376 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/875 variables, 0/376 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/875 variables, 0/376 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 875/875 variables, and 376 constraints, problems are : Problem set: 1 solved, 3 unsolved in 1238 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 343/343 constraints, PredecessorRefiner: 3/4 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1761ms problems are : Problem set: 1 solved, 3 unsolved
Finished Parikh walk after 283 steps, including 1 resets, run visited all 3 properties in 8 ms. (steps per millisecond=35 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 3 properties in 19 ms.
Successfully simplified 1 atomic propositions for a total of 16 simplifications.
[2026-05-23 01:32:49] [INFO ] Flatten gal took : 49 ms
[2026-05-23 01:32:49] [INFO ] Flatten gal took : 51 ms
[2026-05-23 01:32:49] [INFO ] Input system was already deterministic with 532 transitions.
Computed a total of 42 stabilizing places and 42 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 343/343 places, 532/532 transitions.
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 40 place count 303 transition count 467
Iterating global reduction 0 with 40 rules applied. Total rules applied 80 place count 303 transition count 467
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 87 place count 303 transition count 460
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 111 place count 279 transition count 421
Iterating global reduction 1 with 24 rules applied. Total rules applied 135 place count 279 transition count 421
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 140 place count 279 transition count 416
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 155 place count 264 transition count 379
Iterating global reduction 2 with 15 rules applied. Total rules applied 170 place count 264 transition count 379
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 178 place count 264 transition count 371
Applied a total of 178 rules in 60 ms. Remains 264 /343 variables (removed 79) and now considering 371/532 (removed 161) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2599422875769779123.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16233935996007788133.kers'
[2026-05-23 01:32:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2599422875769779123.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16233935996007788133.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 371 rows 264 cols 1014 entries
Finished phase 1 with 237 SingleSign rule and 0 generalized
[2026-05-23 01:32:50] [INFO ] Computed 27 invariants in 2 ms
Computed 27 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-16233935996007788133.kers
Total runtime 4 ms.
[2026-05-23 01:32:50] [INFO ] Implicit Places using invariants in 164 ms returned []
[2026-05-23 01:32:50] [INFO ] Invariant cache hit.
[2026-05-23 01:32:50] [INFO ] Implicit Places using invariants and state equation in 294 ms returned []
Implicit Place search using SMT with State Equation took 462 ms to find 0 implicit places.
Running 370 sub problems to find dead transitions.
[2026-05-23 01:32:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/263 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 1 (OVERLAPS) 1/264 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/264 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 3 (OVERLAPS) 371/635 variables, 264/291 constraints. Problems are: Problem set: 0 solved, 370 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 635/635 variables, and 291 constraints, problems are : Problem set: 0 solved, 370 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 264/264 constraints, PredecessorRefiner: 370/370 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 370 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/263 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 1 (OVERLAPS) 1/264 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/264 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 3 (OVERLAPS) 371/635 variables, 264/291 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/635 variables, 370/661 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/635 variables, 1/662 constraints. Problems are: Problem set: 0 solved, 370 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 635/635 variables, and 662 constraints, problems are : Problem set: 0 solved, 370 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 264/264 constraints, PredecessorRefiner: 370/370 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60117ms problems are : Problem set: 0 solved, 370 unsolved
Search for dead transitions found 0 dead transitions in 60122ms
Starting structural reductions in LTL mode, iteration 1 : 264/343 places, 371/532 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60646 ms. Remains : 264/343 places, 371/532 transitions.
[2026-05-23 01:33:50] [INFO ] Flatten gal took : 31 ms
[2026-05-23 01:33:50] [INFO ] Flatten gal took : 30 ms
[2026-05-23 01:33:50] [INFO ] Input system was already deterministic with 371 transitions.
[2026-05-23 01:33:50] [INFO ] Flatten gal took : 29 ms
[2026-05-23 01:33:50] [INFO ] Flatten gal took : 26 ms
[2026-05-23 01:33:50] [INFO ] Time to serialize gal into /tmp/CTLFireability4777776488711674292.gal : 21 ms
[2026-05-23 01:33:50] [INFO ] Time to serialize properties into /tmp/CTLFireability1285440660653191800.ctl : 11 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/CTLFireability4777776488711674292.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1285440660653191800.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.44731e+25,0.42392,10364,2,1789,5,33349,6,0,1429,23638,0


Converting to forward existential form...Done !
original formula: EF(EX(AG((EX((p20==0)) * ((p298==0)||(p389==0))))))
=> equivalent forward existential formula: [(EY(FwdU(Init,TRUE)) * !(E(TRUE U !((EX((p20==0)) * ((p298==0)||(p389==0)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t6, t25, t26, t30, t35, t39, t44, t45, t49, t55, t59, t64, t68, t73, t74, t78, t85, t89, t95,...441
(forward)formula 0,0,11.9256,279320,1,0,774,1.56532e+06,764,403,8853,1.5533e+06,960
FORMULA Champagne-PT-H07T0R-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 343/343 places, 532/532 transitions.
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 39 place count 304 transition count 471
Iterating global reduction 0 with 39 rules applied. Total rules applied 78 place count 304 transition count 471
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 85 place count 304 transition count 464
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 107 place count 282 transition count 427
Iterating global reduction 1 with 22 rules applied. Total rules applied 129 place count 282 transition count 427
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 134 place count 282 transition count 422
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 147 place count 269 transition count 390
Iterating global reduction 2 with 13 rules applied. Total rules applied 160 place count 269 transition count 390
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 166 place count 269 transition count 384
Applied a total of 166 rules in 29 ms. Remains 269 /343 variables (removed 74) and now considering 384/532 (removed 148) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7441514803164676647.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4439194819159694943.kers'
[2026-05-23 01:34:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7441514803164676647.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4439194819159694943.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 384 rows 269 cols 1054 entries
Finished phase 1 with 242 SingleSign rule and 0 generalized
[2026-05-23 01:34:02] [INFO ] Computed 27 invariants in 1 ms
Computed 27 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-4439194819159694943.kers
Total runtime 3 ms.
[2026-05-23 01:34:03] [INFO ] Implicit Places using invariants in 151 ms returned []
[2026-05-23 01:34:03] [INFO ] Invariant cache hit.
[2026-05-23 01:34:03] [INFO ] Implicit Places using invariants and state equation in 418 ms returned []
Implicit Place search using SMT with State Equation took 572 ms to find 0 implicit places.
Running 383 sub problems to find dead transitions.
[2026-05-23 01:34:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/268 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 383 unsolved
At refinement iteration 1 (OVERLAPS) 1/269 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 383 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/269 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 383 unsolved
At refinement iteration 3 (OVERLAPS) 384/653 variables, 269/296 constraints. Problems are: Problem set: 0 solved, 383 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 653/653 variables, and 296 constraints, problems are : Problem set: 0 solved, 383 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 269/269 constraints, PredecessorRefiner: 383/383 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 383 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/268 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 383 unsolved
At refinement iteration 1 (OVERLAPS) 1/269 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 383 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/269 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 383 unsolved
At refinement iteration 3 (OVERLAPS) 384/653 variables, 269/296 constraints. Problems are: Problem set: 0 solved, 383 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/653 variables, 383/679 constraints. Problems are: Problem set: 0 solved, 383 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/653 variables, 1/680 constraints. Problems are: Problem set: 0 solved, 383 unsolved
SMT process timed out in 60164ms, After SMT, problems are : Problem set: 0 solved, 383 unsolved
Search for dead transitions found 0 dead transitions in 60166ms
Starting structural reductions in LTL mode, iteration 1 : 269/343 places, 384/532 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60771 ms. Remains : 269/343 places, 384/532 transitions.
[2026-05-23 01:35:03] [INFO ] Flatten gal took : 26 ms
[2026-05-23 01:35:03] [INFO ] Flatten gal took : 31 ms
[2026-05-23 01:35:03] [INFO ] Input system was already deterministic with 384 transitions.
[2026-05-23 01:35:03] [INFO ] Flatten gal took : 22 ms
[2026-05-23 01:35:03] [INFO ] Flatten gal took : 22 ms
[2026-05-23 01:35:03] [INFO ] Time to serialize gal into /tmp/CTLFireability1971465997949099320.gal : 10 ms
[2026-05-23 01:35:03] [INFO ] Time to serialize properties into /tmp/CTLFireability14322802893979356374.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/CTLFireability1971465997949099320.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14322802893979356374.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,5.60271e+25,0.427055,10836,2,1878,5,35153,6,0,1462,25610,0


Converting to forward existential form...Done !
original formula: EF(AG((AX(E((p428==1) U (p51==1))) + AF(((p80==1)&&(p172==1))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !((!(EX(!(E((p428==1) U (p51==1))))) + !(EG(!(((p80==1)&&(p172==1))))))))))] != F...159
Reverse transition relation is NOT exact ! Due to transitions t6, t25, t26, t30, t35, t39, t44, t45, t49, t55, t59, t62, t67, t71, t76, t77, t81, t87, t91,...441
Detected timeout of ITS tools.
[2026-05-23 01:35:33] [INFO ] Flatten gal took : 12 ms
[2026-05-23 01:35:33] [INFO ] Applying decomposition
[2026-05-23 01:35:33] [INFO ] Flatten gal took : 11 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/graph6263079962888700677.txt' '-o' '/tmp/graph6263079962888700677.bin' '-w' '/tmp/graph6263079962888700677.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph6263079962888700677.bin' '-l' '-1' '-v' '-w' '/tmp/graph6263079962888700677.weights' '-q' '0' '-e' '0.001'
[2026-05-23 01:35:34] [INFO ] Decomposing Gal with order
[2026-05-23 01:35:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 01:35:34] [INFO ] Removed a total of 284 redundant transitions.
[2026-05-23 01:35:34] [INFO ] Flatten gal took : 165 ms
[2026-05-23 01:35:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 27 ms.
[2026-05-23 01:35:34] [INFO ] Time to serialize gal into /tmp/CTLFireability7863890045762774747.gal : 25 ms
[2026-05-23 01:35:34] [INFO ] Time to serialize properties into /tmp/CTLFireability13485243004646560556.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/CTLFireability7863890045762774747.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13485243004646560556.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,5.60271e+25,0.195015,7028,484,32,4926,547,579,5988,71,1083,0


Converting to forward existential form...Done !
original formula: EF(AG((AX(E((i21.u66.p428==1) U (i3.u8.p51==1))) + AF(((i4.u10.p80==1)&&(i8.u24.p172==1))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !((!(EX(!(E((i21.u66.p428==1) U (i3.u8.p51==1))))) + !(EG(!(((i4.u10.p80==1)&&(i8...187
Reverse transition relation is NOT exact ! Due to transitions t6, t25, t44, t76, t115, t154, i0.i1.t219, i1.t271, i2.t262, i3.t249, i4.t239, i5.t229, i6.i0...702
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 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
(forward)formula 0,1,2.48162,74460,1,0,162140,759,3917,185820,396,1549,225753
FORMULA Champagne-PT-H07T0R-CTLFireability-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 343/343 places, 532/532 transitions.
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 41 place count 302 transition count 463
Iterating global reduction 0 with 41 rules applied. Total rules applied 82 place count 302 transition count 463
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 90 place count 302 transition count 455
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 114 place count 278 transition count 416
Iterating global reduction 1 with 24 rules applied. Total rules applied 138 place count 278 transition count 416
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 143 place count 278 transition count 411
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 158 place count 263 transition count 374
Iterating global reduction 2 with 15 rules applied. Total rules applied 173 place count 263 transition count 374
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 181 place count 263 transition count 366
Applied a total of 181 rules in 21 ms. Remains 263 /343 variables (removed 80) and now considering 366/532 (removed 166) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12884937232168690126.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14844523697890081315.kers'
[2026-05-23 01:35:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12884937232168690126.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14844523697890081315.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 366 rows 263 cols 996 entries
Finished phase 1 with 236 SingleSign rule and 0 generalized
[2026-05-23 01:35:36] [INFO ] Computed 27 invariants in 1 ms
Computed 27 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-14844523697890081315.kers
Total runtime 2 ms.
[2026-05-23 01:35:37] [INFO ] Implicit Places using invariants in 132 ms returned []
[2026-05-23 01:35:37] [INFO ] Invariant cache hit.
[2026-05-23 01:35:37] [INFO ] Implicit Places using invariants and state equation in 301 ms returned []
Implicit Place search using SMT with State Equation took 436 ms to find 0 implicit places.
Running 365 sub problems to find dead transitions.
[2026-05-23 01:35:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/262 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 1 (OVERLAPS) 1/263 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/263 variables, 6/33 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/263 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 4 (OVERLAPS) 366/629 variables, 263/296 constraints. Problems are: Problem set: 0 solved, 365 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 629/629 variables, and 296 constraints, problems are : Problem set: 0 solved, 365 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 263/263 constraints, PredecessorRefiner: 365/365 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 365 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/262 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 1 (OVERLAPS) 1/263 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/263 variables, 6/33 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/263 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 4 (OVERLAPS) 366/629 variables, 263/296 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/629 variables, 365/661 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/629 variables, 3/664 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/629 variables, 1/665 constraints. Problems are: Problem set: 0 solved, 365 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 629/629 variables, and 665 constraints, problems are : Problem set: 0 solved, 365 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 263/263 constraints, PredecessorRefiner: 365/365 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60088ms problems are : Problem set: 0 solved, 365 unsolved
Search for dead transitions found 0 dead transitions in 60090ms
Starting structural reductions in LTL mode, iteration 1 : 263/343 places, 366/532 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60551 ms. Remains : 263/343 places, 366/532 transitions.
[2026-05-23 01:36:37] [INFO ] Flatten gal took : 18 ms
[2026-05-23 01:36:37] [INFO ] Flatten gal took : 18 ms
[2026-05-23 01:36:37] [INFO ] Input system was already deterministic with 366 transitions.
[2026-05-23 01:36:37] [INFO ] Flatten gal took : 18 ms
[2026-05-23 01:36:37] [INFO ] Flatten gal took : 17 ms
[2026-05-23 01:36:37] [INFO ] Time to serialize gal into /tmp/CTLFireability6120854255938574669.gal : 5 ms
[2026-05-23 01:36:37] [INFO ] Time to serialize properties into /tmp/CTLFireability5230064827728791021.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/CTLFireability6120854255938574669.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5230064827728791021.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.04649e+25,0.55459,12948,2,2158,5,47373,6,0,1420,35856,0


Converting to forward existential form...Done !
original formula: AF(AX(EF((p302==1))))
=> equivalent forward existential formula: [FwdG(Init,!(!(EX(!(E(TRUE U (p302==1)))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t6, t25, t26, t30, t35, t39, t44, t45, t49, t54, t55, t59, t64, t68, t73, t74, t78, t84, t88,...469
(forward)formula 0,1,16.6586,389004,1,0,857,2.10708e+06,759,411,8963,2.24161e+06,1040
FORMULA Champagne-PT-H07T0R-CTLFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 343/343 places, 532/532 transitions.
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 41 place count 302 transition count 466
Iterating global reduction 0 with 41 rules applied. Total rules applied 82 place count 302 transition count 466
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 89 place count 302 transition count 459
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 112 place count 279 transition count 427
Iterating global reduction 1 with 23 rules applied. Total rules applied 135 place count 279 transition count 427
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 139 place count 279 transition count 423
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 154 place count 264 transition count 386
Iterating global reduction 2 with 15 rules applied. Total rules applied 169 place count 264 transition count 386
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 177 place count 264 transition count 378
Applied a total of 177 rules in 19 ms. Remains 264 /343 variables (removed 79) and now considering 378/532 (removed 154) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2757622289853340718.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13361157660059241868.kers'
[2026-05-23 01:36:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2757622289853340718.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13361157660059241868.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 378 rows 264 cols 1042 entries
Finished phase 1 with 237 SingleSign rule and 0 generalized
[2026-05-23 01:36:54] [INFO ] Computed 27 invariants in 1 ms
Computed 27 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-13361157660059241868.kers
Total runtime 2 ms.
[2026-05-23 01:36:54] [INFO ] Implicit Places using invariants in 132 ms returned []
[2026-05-23 01:36:54] [INFO ] Invariant cache hit.
[2026-05-23 01:36:54] [INFO ] Implicit Places using invariants and state equation in 370 ms returned []
Implicit Place search using SMT with State Equation took 505 ms to find 0 implicit places.
Running 377 sub problems to find dead transitions.
[2026-05-23 01:36:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/263 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 1 (OVERLAPS) 1/264 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/264 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 3 (OVERLAPS) 378/642 variables, 264/291 constraints. Problems are: Problem set: 0 solved, 377 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 642/642 variables, and 291 constraints, problems are : Problem set: 0 solved, 377 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 264/264 constraints, PredecessorRefiner: 377/377 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 377 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/263 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 1 (OVERLAPS) 1/264 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/264 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 3 (OVERLAPS) 378/642 variables, 264/291 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/642 variables, 377/668 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/642 variables, 1/669 constraints. Problems are: Problem set: 0 solved, 377 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 642/642 variables, and 669 constraints, problems are : Problem set: 0 solved, 377 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 264/264 constraints, PredecessorRefiner: 377/377 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60095ms problems are : Problem set: 0 solved, 377 unsolved
Search for dead transitions found 0 dead transitions in 60097ms
Starting structural reductions in LTL mode, iteration 1 : 264/343 places, 378/532 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60624 ms. Remains : 264/343 places, 378/532 transitions.
[2026-05-23 01:37:55] [INFO ] Flatten gal took : 16 ms
[2026-05-23 01:37:55] [INFO ] Flatten gal took : 16 ms
[2026-05-23 01:37:55] [INFO ] Input system was already deterministic with 378 transitions.
[2026-05-23 01:37:55] [INFO ] Flatten gal took : 15 ms
[2026-05-23 01:37:55] [INFO ] Flatten gal took : 14 ms
[2026-05-23 01:37:55] [INFO ] Time to serialize gal into /tmp/CTLFireability13391741550156185904.gal : 6 ms
[2026-05-23 01:37:55] [INFO ] Time to serialize properties into /tmp/CTLFireability997474752909870750.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/CTLFireability13391741550156185904.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability997474752909870750.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.41188e+25,0.460619,10508,2,1786,5,33713,6,0,1436,23832,0


Converting to forward existential form...Done !
original formula: EF((EX(EX(AX(((p61==0)||(p210==0))))) * EF(((p359==1)&&(p449==1)))))
=> equivalent forward existential formula: [(FwdU((FwdU(Init,TRUE) * EX(EX(!(EX(!(((p61==0)||(p210==0)))))))),TRUE) * ((p359==1)&&(p449==1)))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t6, t25, t26, t30, t35, t39, t44, t45, t49, t56, t60, t65, t69, t74, t75, t79, t85, t89, t95,...435
(forward)formula 0,1,3.42839,79552,1,0,621,478167,775,330,9027,355301,774
FORMULA Champagne-PT-H07T0R-CTLFireability-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 343/343 places, 532/532 transitions.
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 36 place count 307 transition count 472
Iterating global reduction 0 with 36 rules applied. Total rules applied 72 place count 307 transition count 472
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 78 place count 307 transition count 466
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 100 place count 285 transition count 433
Iterating global reduction 1 with 22 rules applied. Total rules applied 122 place count 285 transition count 433
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 126 place count 285 transition count 429
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 139 place count 272 transition count 403
Iterating global reduction 2 with 13 rules applied. Total rules applied 152 place count 272 transition count 403
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 158 place count 272 transition count 397
Applied a total of 158 rules in 19 ms. Remains 272 /343 variables (removed 71) and now considering 397/532 (removed 135) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13322450665984293226.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15038052850182248259.kers'
[2026-05-23 01:37:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13322450665984293226.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15038052850182248259.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 397 rows 272 cols 1102 entries
Finished phase 1 with 245 SingleSign rule and 0 generalized
[2026-05-23 01:37:58] [INFO ] Computed 27 invariants in 4 ms
Computed 27 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-15038052850182248259.kers
Total runtime 5 ms.
[2026-05-23 01:37:58] [INFO ] Implicit Places using invariants in 141 ms returned []
[2026-05-23 01:37:58] [INFO ] Invariant cache hit.
[2026-05-23 01:37:59] [INFO ] Implicit Places using invariants and state equation in 317 ms returned []
Implicit Place search using SMT with State Equation took 473 ms to find 0 implicit places.
Running 396 sub problems to find dead transitions.
[2026-05-23 01:37:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/271 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 1 (OVERLAPS) 1/272 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/272 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 3 (OVERLAPS) 397/669 variables, 272/299 constraints. Problems are: Problem set: 0 solved, 396 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 669/669 variables, and 299 constraints, problems are : Problem set: 0 solved, 396 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 272/272 constraints, PredecessorRefiner: 396/396 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 396 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/271 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 1 (OVERLAPS) 1/272 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/272 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 3 (OVERLAPS) 397/669 variables, 272/299 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/669 variables, 396/695 constraints. Problems are: Problem set: 0 solved, 396 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 669/669 variables, and 696 constraints, problems are : Problem set: 0 solved, 396 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 272/272 constraints, PredecessorRefiner: 396/396 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60079ms problems are : Problem set: 0 solved, 396 unsolved
Search for dead transitions found 0 dead transitions in 60081ms
Starting structural reductions in LTL mode, iteration 1 : 272/343 places, 397/532 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60575 ms. Remains : 272/343 places, 397/532 transitions.
[2026-05-23 01:38:59] [INFO ] Flatten gal took : 16 ms
[2026-05-23 01:38:59] [INFO ] Flatten gal took : 29 ms
[2026-05-23 01:38:59] [INFO ] Input system was already deterministic with 397 transitions.
[2026-05-23 01:38:59] [INFO ] Flatten gal took : 14 ms
[2026-05-23 01:38:59] [INFO ] Flatten gal took : 14 ms
[2026-05-23 01:38:59] [INFO ] Time to serialize gal into /tmp/CTLFireability11857405813044104535.gal : 5 ms
[2026-05-23 01:38:59] [INFO ] Time to serialize properties into /tmp/CTLFireability2453117542409303899.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/CTLFireability11857405813044104535.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2453117542409303899.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,7.77575e+25,0.442262,11024,2,1891,5,36118,6,0,1487,26242,0


Converting to forward existential form...Done !
original formula: (AX(AG((((AG((p199==0)) * AF((p196==0))) + (((p497==0)||(p509==0))&&((p199==0)||(p271==0)))) + ((p346==0)||(p98==0))))) * AG(((AF((((p378...236
=> equivalent forward existential formula: (([(FwdU(((FwdU(EY(Init),TRUE) * !(((p346==0)||(p98==0)))) * !((((p497==0)||(p509==0))&&((p199==0)||(p271==0))))...456
Hit Full ! (commute/partial/dont) 377/0/20
(forward)formula 0,0,2.82373,67248,1,0,74,344500,24,8,7139,223953,69
FORMULA Champagne-PT-H07T0R-CTLFireability-2024-04 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 : 343/343 places, 532/532 transitions.
Discarding 42 places :
Symmetric choice reduction at 0 with 42 rule applications. Total rules 42 place count 301 transition count 462
Iterating global reduction 0 with 42 rules applied. Total rules applied 84 place count 301 transition count 462
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 92 place count 301 transition count 454
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 116 place count 277 transition count 415
Iterating global reduction 1 with 24 rules applied. Total rules applied 140 place count 277 transition count 415
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 145 place count 277 transition count 410
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 160 place count 262 transition count 373
Iterating global reduction 2 with 15 rules applied. Total rules applied 175 place count 262 transition count 373
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 183 place count 262 transition count 365
Applied a total of 183 rules in 16 ms. Remains 262 /343 variables (removed 81) and now considering 365/532 (removed 167) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7740221547750350114.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7139522335120503189.kers'
[2026-05-23 01:39:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7740221547750350114.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7139522335120503189.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 365 rows 262 cols 994 entries
Finished phase 1 with 235 SingleSign rule and 0 generalized
[2026-05-23 01:39:02] [INFO ] Computed 27 invariants in 1 ms
Computed 27 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7139522335120503189.kers
Total runtime 2 ms.
[2026-05-23 01:39:02] [INFO ] Implicit Places using invariants in 136 ms returned []
[2026-05-23 01:39:02] [INFO ] Invariant cache hit.
[2026-05-23 01:39:02] [INFO ] Implicit Places using invariants and state equation in 275 ms returned []
Implicit Place search using SMT with State Equation took 413 ms to find 0 implicit places.
Running 364 sub problems to find dead transitions.
[2026-05-23 01:39:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/261 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 1 (OVERLAPS) 1/262 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/262 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 3 (OVERLAPS) 365/627 variables, 262/289 constraints. Problems are: Problem set: 0 solved, 364 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 627/627 variables, and 289 constraints, problems are : Problem set: 0 solved, 364 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 262/262 constraints, PredecessorRefiner: 364/364 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 364 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/261 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 1 (OVERLAPS) 1/262 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/262 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 3 (OVERLAPS) 365/627 variables, 262/289 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/627 variables, 364/653 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/627 variables, 1/654 constraints. Problems are: Problem set: 0 solved, 364 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 627/627 variables, and 654 constraints, problems are : Problem set: 0 solved, 364 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 262/262 constraints, PredecessorRefiner: 364/364 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60072ms problems are : Problem set: 0 solved, 364 unsolved
Search for dead transitions found 0 dead transitions in 60073ms
Starting structural reductions in LTL mode, iteration 1 : 262/343 places, 365/532 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60504 ms. Remains : 262/343 places, 365/532 transitions.
[2026-05-23 01:40:02] [INFO ] Flatten gal took : 19 ms
[2026-05-23 01:40:02] [INFO ] Flatten gal took : 13 ms
[2026-05-23 01:40:02] [INFO ] Input system was already deterministic with 365 transitions.
[2026-05-23 01:40:02] [INFO ] Flatten gal took : 14 ms
[2026-05-23 01:40:02] [INFO ] Flatten gal took : 12 ms
[2026-05-23 01:40:02] [INFO ] Time to serialize gal into /tmp/CTLFireability12386895969937001563.gal : 4 ms
[2026-05-23 01:40:02] [INFO ] Time to serialize properties into /tmp/CTLFireability12068153972918182338.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/CTLFireability12386895969937001563.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12068153972918182338.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.7632e+25,0.394796,10484,2,1774,5,33142,6,0,1415,23518,0


Converting to forward existential form...Done !
original formula: AG(AX(EF((p137==0))))
=> equivalent forward existential formula: [(EY(FwdU(Init,TRUE)) * !(E(TRUE U (p137==0))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t6, t25, t26, t30, t35, t39, t44, t45, t49, t55, t59, t64, t68, t73, t74, t78, t84, t88, t94,...435
(forward)formula 0,1,2.76683,68660,1,0,598,412299,751,312,8603,272288,740
FORMULA Champagne-PT-H07T0R-CTLFireability-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 343/343 places, 532/532 transitions.
Graph (trivial) has 315 edges and 343 vertex of which 53 / 343 are part of one of the 9 SCC in 6 ms
Free SCC test removed 44 places
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 61 transitions
Trivial Post-agglo rules discarded 61 transitions
Performed 61 trivial Post agglomeration. Transition count delta: 61
Iterating post reduction 0 with 61 rules applied. Total rules applied 62 place count 298 transition count 420
Reduce places removed 61 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 1 with 106 rules applied. Total rules applied 168 place count 237 transition count 375
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 2 with 21 rules applied. Total rules applied 189 place count 216 transition count 375
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 189 place count 216 transition count 363
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 213 place count 204 transition count 363
Discarding 27 places :
Symmetric choice reduction at 3 with 27 rule applications. Total rules 240 place count 177 transition count 314
Iterating global reduction 3 with 27 rules applied. Total rules applied 267 place count 177 transition count 314
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 273 place count 177 transition count 308
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 273 place count 177 transition count 302
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 285 place count 171 transition count 302
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 290 place count 166 transition count 273
Iterating global reduction 4 with 5 rules applied. Total rules applied 295 place count 166 transition count 273
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 300 place count 166 transition count 268
Performed 78 Post agglomeration using F-continuation condition.Transition count delta: 78
Deduced a syphon composed of 78 places in 0 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 5 with 156 rules applied. Total rules applied 456 place count 88 transition count 190
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 460 place count 84 transition count 173
Iterating global reduction 5 with 4 rules applied. Total rules applied 464 place count 84 transition count 173
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 468 place count 84 transition count 169
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 470 place count 82 transition count 167
Applied a total of 470 rules in 108 ms. Remains 82 /343 variables (removed 261) and now considering 167/532 (removed 365) transitions.
[2026-05-23 01:40:05] [INFO ] Flow matrix only has 94 transitions (discarded 73 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5531751831693946325.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11877277275219786701.kers'
[2026-05-23 01:40:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5531751831693946325.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11877277275219786701.kers]
Normalized transition count is 93 out of 94 initially.
Culling duplicate invariants (modulo rational): removing 7 columns.
Culled 7 columns in 0 ms.
// Phase 1: matrix 93 rows 75 cols 252 entries
Finished phase 1 with 55 SingleSign rule and 0 generalized
[2026-05-23 01:40:05] [INFO ] Computed 27 invariants in 0 ms
Computed 27 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-11877277275219786701.kers
Total runtime 1 ms.
[2026-05-23 01:40:05] [INFO ] Implicit Places using invariants in 99 ms returned []
[2026-05-23 01:40:05] [INFO ] Flow matrix only has 94 transitions (discarded 73 similar events)
[2026-05-23 01:40:05] [INFO ] Invariant cache hit.
[2026-05-23 01:40:05] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 224 ms to find 0 implicit places.
[2026-05-23 01:40:05] [INFO ] Redundant transitions in 6 ms returned []
Running 112 sub problems to find dead transitions.
[2026-05-23 01:40:05] [INFO ] Flow matrix only has 94 transitions (discarded 73 similar events)
[2026-05-23 01:40:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 2 (OVERLAPS) 5/82 variables, 5/27 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 4 (OVERLAPS) 93/175 variables, 82/109 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/175 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 6 (OVERLAPS) 0/175 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Real declared 175/176 variables, and 109 constraints, problems are : Problem set: 0 solved, 112 unsolved in 5623 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 82/82 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 112 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 2 (OVERLAPS) 5/82 variables, 5/27 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 4 (OVERLAPS) 93/175 variables, 82/109 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/175 variables, 112/221 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/175 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 7 (OVERLAPS) 0/175 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Int declared 175/176 variables, and 221 constraints, problems are : Problem set: 0 solved, 112 unsolved in 5777 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 82/82 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 11417ms problems are : Problem set: 0 solved, 112 unsolved
Search for dead transitions found 0 dead transitions in 11418ms
Starting structural reductions in SI_CTL mode, iteration 1 : 82/343 places, 167/532 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 11763 ms. Remains : 82/343 places, 167/532 transitions.
[2026-05-23 01:40:17] [INFO ] Flatten gal took : 7 ms
[2026-05-23 01:40:17] [INFO ] Flatten gal took : 7 ms
[2026-05-23 01:40:17] [INFO ] Input system was already deterministic with 167 transitions.
[2026-05-23 01:40:17] [INFO ] Flatten gal took : 7 ms
[2026-05-23 01:40:17] [INFO ] Flatten gal took : 7 ms
[2026-05-23 01:40:17] [INFO ] Time to serialize gal into /tmp/CTLFireability647812643851059010.gal : 2 ms
[2026-05-23 01:40:17] [INFO ] Time to serialize properties into /tmp/CTLFireability10207932574028255943.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/CTLFireability647812643851059010.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10207932574028255943.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.91821e+12,0.057841,4972,2,138,5,1977,6,0,488,1033,0


Converting to forward existential form...Done !
original formula: EF((EG((p219==1)) * !(E((((p378==1)&&(p446==1))||(p178==1)) U EF(((p359==1)&&(p411==1)))))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * EG((p219==1))) * !(E((((p378==1)&&(p446==1))||(p178==1)) U E(TRUE U ((p359==1)&&(p411==1)))...168
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 153/0/14
(forward)formula 0,1,0.345801,10116,1,0,14,31605,30,6,2524,28527,12
FORMULA Champagne-PT-H07T0R-CTLFireability-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 343/343 places, 532/532 transitions.
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 38 place count 305 transition count 466
Iterating global reduction 0 with 38 rules applied. Total rules applied 76 place count 305 transition count 466
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 84 place count 305 transition count 458
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 104 place count 285 transition count 429
Iterating global reduction 1 with 20 rules applied. Total rules applied 124 place count 285 transition count 429
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 128 place count 285 transition count 425
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 140 place count 273 transition count 397
Iterating global reduction 2 with 12 rules applied. Total rules applied 152 place count 273 transition count 397
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 157 place count 273 transition count 392
Applied a total of 157 rules in 20 ms. Remains 273 /343 variables (removed 70) and now considering 392/532 (removed 140) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17744472424020563806.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16608471134452511397.kers'
[2026-05-23 01:40:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17744472424020563806.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16608471134452511397.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 392 rows 273 cols 1076 entries
Finished phase 1 with 246 SingleSign rule and 0 generalized
[2026-05-23 01:40:17] [INFO ] Computed 27 invariants in 2 ms
Computed 27 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-16608471134452511397.kers
Total runtime 3 ms.
[2026-05-23 01:40:17] [INFO ] Implicit Places using invariants in 130 ms returned []
[2026-05-23 01:40:17] [INFO ] Invariant cache hit.
[2026-05-23 01:40:18] [INFO ] Implicit Places using invariants and state equation in 280 ms returned []
Implicit Place search using SMT with State Equation took 412 ms to find 0 implicit places.
Running 391 sub problems to find dead transitions.
[2026-05-23 01:40:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/272 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 1 (OVERLAPS) 1/273 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/273 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 3 (OVERLAPS) 392/665 variables, 273/300 constraints. Problems are: Problem set: 0 solved, 391 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 665/665 variables, and 300 constraints, problems are : Problem set: 0 solved, 391 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 273/273 constraints, PredecessorRefiner: 391/391 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 391 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/272 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 1 (OVERLAPS) 1/273 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/273 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 3 (OVERLAPS) 392/665 variables, 273/300 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/665 variables, 391/691 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/665 variables, 4/695 constraints. Problems are: Problem set: 0 solved, 391 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 665/665 variables, and 699 constraints, problems are : Problem set: 0 solved, 391 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 273/273 constraints, PredecessorRefiner: 391/391 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60089ms problems are : Problem set: 0 solved, 391 unsolved
Search for dead transitions found 0 dead transitions in 60090ms
Starting structural reductions in LTL mode, iteration 1 : 273/343 places, 392/532 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60524 ms. Remains : 273/343 places, 392/532 transitions.
[2026-05-23 01:41:18] [INFO ] Flatten gal took : 13 ms
[2026-05-23 01:41:18] [INFO ] Flatten gal took : 19 ms
[2026-05-23 01:41:18] [INFO ] Input system was already deterministic with 392 transitions.
[2026-05-23 01:41:18] [INFO ] Flatten gal took : 13 ms
[2026-05-23 01:41:18] [INFO ] Flatten gal took : 14 ms
[2026-05-23 01:41:18] [INFO ] Time to serialize gal into /tmp/CTLFireability4063059662487060619.gal : 5 ms
[2026-05-23 01:41:18] [INFO ] Time to serialize properties into /tmp/CTLFireability3549335008144453212.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/CTLFireability4063059662487060619.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3549335008144453212.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.55501e+25,0.480017,11428,2,1951,5,37497,6,0,1486,28698,0


Converting to forward existential form...Done !
original formula: EG(EF(((AG(EX((p190==1))) * AX(A(((p23==1)&&(p210==1)) U (p515==1)))) * (((p59==1)||((p116==1)&&(p32==1)))&&((p189==0)||((p108==1)&&(p230...165
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U ((!(E(TRUE U !(EX((p190==1))))) * !(EX(!(!((E(!((p515==1)) U (!(((p23==1)&&(p210==1))) * !((...279
Reverse transition relation is NOT exact ! Due to transitions t6, t25, t26, t30, t35, t39, t44, t45, t49, t55, t59, t64, t68, t73, t74, t78, t84, t88, t94,...453
(forward)formula 0,0,28.6141,654448,1,0,2001,3.80841e+06,822,966,9488,4.64565e+06,2273
FORMULA Champagne-PT-H07T0R-CTLFireability-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 343/343 places, 532/532 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 306 transition count 481
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 306 transition count 481
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 79 place count 306 transition count 476
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 100 place count 285 transition count 444
Iterating global reduction 1 with 21 rules applied. Total rules applied 121 place count 285 transition count 444
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 125 place count 285 transition count 440
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 140 place count 270 transition count 403
Iterating global reduction 2 with 15 rules applied. Total rules applied 155 place count 270 transition count 403
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 163 place count 270 transition count 395
Applied a total of 163 rules in 21 ms. Remains 270 /343 variables (removed 73) and now considering 395/532 (removed 137) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-616757646315526097.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8585174599673407926.kers'
[2026-05-23 01:41:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-616757646315526097.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8585174599673407926.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 395 rows 270 cols 1098 entries
Finished phase 1 with 243 SingleSign rule and 0 generalized
[2026-05-23 01:41:47] [INFO ] Computed 27 invariants in 2 ms
Computed 27 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-8585174599673407926.kers
Total runtime 3 ms.
[2026-05-23 01:41:47] [INFO ] Implicit Places using invariants in 143 ms returned []
[2026-05-23 01:41:47] [INFO ] Invariant cache hit.
[2026-05-23 01:41:47] [INFO ] Implicit Places using invariants and state equation in 282 ms returned []
Implicit Place search using SMT with State Equation took 428 ms to find 0 implicit places.
Running 394 sub problems to find dead transitions.
[2026-05-23 01:41:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/269 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 1 (OVERLAPS) 1/270 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/270 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 3 (OVERLAPS) 395/665 variables, 270/297 constraints. Problems are: Problem set: 0 solved, 394 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 665/665 variables, and 297 constraints, problems are : Problem set: 0 solved, 394 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 270/270 constraints, PredecessorRefiner: 394/394 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 394 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/269 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 1 (OVERLAPS) 1/270 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/270 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 3 (OVERLAPS) 395/665 variables, 270/297 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/665 variables, 394/691 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/665 variables, 1/692 constraints. Problems are: Problem set: 0 solved, 394 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 665/665 variables, and 692 constraints, problems are : Problem set: 0 solved, 394 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 270/270 constraints, PredecessorRefiner: 394/394 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60102ms problems are : Problem set: 0 solved, 394 unsolved
Search for dead transitions found 0 dead transitions in 60104ms
Starting structural reductions in LTL mode, iteration 1 : 270/343 places, 395/532 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60556 ms. Remains : 270/343 places, 395/532 transitions.
[2026-05-23 01:42:47] [INFO ] Flatten gal took : 11 ms
[2026-05-23 01:42:47] [INFO ] Flatten gal took : 11 ms
[2026-05-23 01:42:47] [INFO ] Input system was already deterministic with 395 transitions.
[2026-05-23 01:42:47] [INFO ] Flatten gal took : 10 ms
[2026-05-23 01:42:47] [INFO ] Flatten gal took : 10 ms
[2026-05-23 01:42:47] [INFO ] Time to serialize gal into /tmp/CTLFireability421171204544038522.gal : 5 ms
[2026-05-23 01:42:47] [INFO ] Time to serialize properties into /tmp/CTLFireability6821806174668988179.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/CTLFireability421171204544038522.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6821806174668988179.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,6.37817e+25,0.427631,10832,2,1867,5,35114,6,0,1477,25188,0


Converting to forward existential form...Done !
original formula: EF(((A((AF((((p137==1)&&(p229==1))||(p279==1))) * (EX(((p161==1)&&(p252==1))) + EG(((p438==1)&&(p486==1))))) U (p421==1)) * AX((((p61==1)...206
=> equivalent forward existential formula: [(((FwdU(Init,TRUE) * ((p178==0)||(p44==0))) * !((E(!((p421==1)) U (!((!(EG(!((((p137==1)&&(p229==1))||(p279==1)...317
Reverse transition relation is NOT exact ! Due to transitions t6, t25, t26, t30, t36, t40, t45, t46, t50, t56, t60, t66, t69, t73, t76, t77, t81, t87, t91,...441
Detected timeout of ITS tools.
[2026-05-23 01:43:17] [INFO ] Flatten gal took : 6 ms
[2026-05-23 01:43:17] [INFO ] Applying decomposition
[2026-05-23 01:43:17] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph3895348417498384598.txt' '-o' '/tmp/graph3895348417498384598.bin' '-w' '/tmp/graph3895348417498384598.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph3895348417498384598.bin' '-l' '-1' '-v' '-w' '/tmp/graph3895348417498384598.weights' '-q' '0' '-e' '0.001'
[2026-05-23 01:43:18] [INFO ] Decomposing Gal with order
[2026-05-23 01:43:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 01:43:18] [INFO ] Removed a total of 313 redundant transitions.
[2026-05-23 01:43:18] [INFO ] Flatten gal took : 25 ms
[2026-05-23 01:43:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 24 labels/synchronizations in 11 ms.
[2026-05-23 01:43:18] [INFO ] Time to serialize gal into /tmp/CTLFireability394018436384219668.gal : 6 ms
[2026-05-23 01:43:18] [INFO ] Time to serialize properties into /tmp/CTLFireability17728434955458263180.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/CTLFireability394018436384219668.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17728434955458263180.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 -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.37817e+25,0.177506,7404,470,25,5845,667,570,7888,74,1523,0


Converting to forward existential form...Done !
original formula: EF(((A((AF((((i6.u16.p137==1)&&(i11.u30.p229==1))||(i14.u40.p279==1))) * (EX(((i8.i1.u22.p161==1)&&(i13.u35.p252==1))) + EG(((i22.u67.p43...306
=> equivalent forward existential formula: [(((FwdU(Init,TRUE) * ((i7.u24.p178==0)||(i0.u5.p44==0))) * !((E(!((i21.u64.p421==1)) U (!((!(EG(!((((i6.u16.p13...433
Reverse transition relation is NOT exact ! Due to transitions t6, t25, t76, t115, t155, i0.u7.t262, i1.i1.t271, i2.t251, i3.t241, i4.t231, i5.u15.t221, i6....718
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
(forward)formula 0,0,4.03187,125704,1,0,259843,828,3912,306094,411,2025,315443
FORMULA Champagne-PT-H07T0R-CTLFireability-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 343/343 places, 532/532 transitions.
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 38 place count 305 transition count 476
Iterating global reduction 0 with 38 rules applied. Total rules applied 76 place count 305 transition count 476
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 82 place count 305 transition count 470
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 105 place count 282 transition count 432
Iterating global reduction 1 with 23 rules applied. Total rules applied 128 place count 282 transition count 432
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 133 place count 282 transition count 427
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 147 place count 268 transition count 391
Iterating global reduction 2 with 14 rules applied. Total rules applied 161 place count 268 transition count 391
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 169 place count 268 transition count 383
Applied a total of 169 rules in 18 ms. Remains 268 /343 variables (removed 75) and now considering 383/532 (removed 149) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13733606164338991644.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17167986884782108626.kers'
[2026-05-23 01:43:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13733606164338991644.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17167986884782108626.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 383 rows 268 cols 1054 entries
Finished phase 1 with 241 SingleSign rule and 0 generalized
[2026-05-23 01:43:22] [INFO ] Computed 27 invariants in 2 ms
Computed 27 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-17167986884782108626.kers
Total runtime 3 ms.
[2026-05-23 01:43:22] [INFO ] Implicit Places using invariants in 128 ms returned []
[2026-05-23 01:43:22] [INFO ] Invariant cache hit.
[2026-05-23 01:43:22] [INFO ] Implicit Places using invariants and state equation in 280 ms returned []
Implicit Place search using SMT with State Equation took 422 ms to find 0 implicit places.
Running 382 sub problems to find dead transitions.
[2026-05-23 01:43:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/267 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 1 (OVERLAPS) 1/268 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/268 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/268 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 4 (OVERLAPS) 383/651 variables, 268/297 constraints. Problems are: Problem set: 0 solved, 382 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 651/651 variables, and 297 constraints, problems are : Problem set: 0 solved, 382 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 268/268 constraints, PredecessorRefiner: 382/382 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 382 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/267 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 1 (OVERLAPS) 1/268 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/268 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/268 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 4 (OVERLAPS) 383/651 variables, 268/297 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/651 variables, 382/679 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/651 variables, 7/686 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/651 variables, 5/691 constraints. Problems are: Problem set: 0 solved, 382 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 651/651 variables, and 691 constraints, problems are : Problem set: 0 solved, 382 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 268/268 constraints, PredecessorRefiner: 382/382 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60069ms problems are : Problem set: 0 solved, 382 unsolved
Search for dead transitions found 0 dead transitions in 60070ms
Starting structural reductions in LTL mode, iteration 1 : 268/343 places, 383/532 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60512 ms. Remains : 268/343 places, 383/532 transitions.
[2026-05-23 01:44:22] [INFO ] Flatten gal took : 10 ms
[2026-05-23 01:44:22] [INFO ] Flatten gal took : 11 ms
[2026-05-23 01:44:22] [INFO ] Input system was already deterministic with 383 transitions.
[2026-05-23 01:44:22] [INFO ] Flatten gal took : 10 ms
[2026-05-23 01:44:22] [INFO ] Flatten gal took : 10 ms
[2026-05-23 01:44:22] [INFO ] Time to serialize gal into /tmp/CTLFireability10844345724334287245.gal : 3 ms
[2026-05-23 01:44:22] [INFO ] Time to serialize properties into /tmp/CTLFireability8841169480211844880.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/CTLFireability10844345724334287245.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8841169480211844880.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,4.9259e+25,0.601111,13596,2,2242,5,50059,6,0,1457,40125,0


Converting to forward existential form...Done !
original formula: (AG(AF((p341==0))) + ((E(((p536==1) + !(EF((p397==1)))) U (p436==1)) * EX(((p99==1)||((p237==1)&&(p287==1))))) * (EF((AX(((p65==1)&&(p217...210
=> equivalent forward existential formula: (([((Init * !(!(E(TRUE U !(!(EG(!((p341==0))))))))) * !(E(((p536==1) + !(E(TRUE U (p397==1)))) U (p436==1))))] =...504
Reverse transition relation is NOT exact ! Due to transitions t6, t25, t26, t30, t35, t39, t44, t45, t49, t54, t55, t59, t64, t68, t73, t74, t78, t84, t88,...470
(forward)formula 0,0,9.14706,215352,1,0,1039,1.2092e+06,797,473,9638,1.3268e+06,1277
FORMULA Champagne-PT-H07T0R-CTLFireability-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 343/343 places, 532/532 transitions.
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 39 place count 304 transition count 465
Iterating global reduction 0 with 39 rules applied. Total rules applied 78 place count 304 transition count 465
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 86 place count 304 transition count 457
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 107 place count 283 transition count 428
Iterating global reduction 1 with 21 rules applied. Total rules applied 128 place count 283 transition count 428
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 131 place count 283 transition count 425
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 145 place count 269 transition count 395
Iterating global reduction 2 with 14 rules applied. Total rules applied 159 place count 269 transition count 395
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 166 place count 269 transition count 388
Applied a total of 166 rules in 17 ms. Remains 269 /343 variables (removed 74) and now considering 388/532 (removed 144) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14765166041912100414.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15266197633570603301.kers'
[2026-05-23 01:44:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14765166041912100414.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15266197633570603301.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 388 rows 269 cols 1072 entries
Finished phase 1 with 242 SingleSign rule and 0 generalized
[2026-05-23 01:44:32] [INFO ] Computed 27 invariants in 3 ms
Computed 27 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-15266197633570603301.kers
Total runtime 4 ms.
[2026-05-23 01:44:32] [INFO ] Implicit Places using invariants in 139 ms returned []
[2026-05-23 01:44:32] [INFO ] Invariant cache hit.
[2026-05-23 01:44:32] [INFO ] Implicit Places using invariants and state equation in 275 ms returned []
Implicit Place search using SMT with State Equation took 415 ms to find 0 implicit places.
Running 387 sub problems to find dead transitions.
[2026-05-23 01:44:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/268 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 387 unsolved
At refinement iteration 1 (OVERLAPS) 1/269 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 387 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/269 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 387 unsolved
At refinement iteration 3 (OVERLAPS) 388/657 variables, 269/296 constraints. Problems are: Problem set: 0 solved, 387 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 657/657 variables, and 296 constraints, problems are : Problem set: 0 solved, 387 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 269/269 constraints, PredecessorRefiner: 387/387 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 387 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/268 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 387 unsolved
At refinement iteration 1 (OVERLAPS) 1/269 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 387 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/269 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 387 unsolved
At refinement iteration 3 (OVERLAPS) 388/657 variables, 269/296 constraints. Problems are: Problem set: 0 solved, 387 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/657 variables, 387/683 constraints. Problems are: Problem set: 0 solved, 387 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/657 variables, 0/683 constraints. Problems are: Problem set: 0 solved, 387 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 657/657 variables, and 683 constraints, problems are : Problem set: 0 solved, 387 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 269/269 constraints, PredecessorRefiner: 387/387 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60075ms problems are : Problem set: 0 solved, 387 unsolved
Search for dead transitions found 0 dead transitions in 60076ms
Starting structural reductions in LTL mode, iteration 1 : 269/343 places, 388/532 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60510 ms. Remains : 269/343 places, 388/532 transitions.
[2026-05-23 01:45:32] [INFO ] Flatten gal took : 7 ms
[2026-05-23 01:45:32] [INFO ] Flatten gal took : 6 ms
[2026-05-23 01:45:32] [INFO ] Input system was already deterministic with 388 transitions.
[2026-05-23 01:45:32] [INFO ] Flatten gal took : 6 ms
[2026-05-23 01:45:32] [INFO ] Flatten gal took : 6 ms
[2026-05-23 01:45:32] [INFO ] Time to serialize gal into /tmp/CTLFireability11833923367654688034.gal : 2 ms
[2026-05-23 01:45:32] [INFO ] Time to serialize properties into /tmp/CTLFireability13657596167071293779.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/CTLFireability11833923367654688034.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13657596167071293779.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,5.62211e+25,0.356233,11760,2,1976,5,38368,6,0,1466,30924,0


Converting to forward existential form...Done !
original formula: !(A((!(((A(E((p58==1) U (p340==1)) U (p315!=1)) + A((p478==1) U (p536==1))) + ((p206!=1)||(p197!=1)))) + EX((((p497==1)&&(p525==1)) + EG(...185
=> equivalent forward existential formula: ([((FwdU(Init,!(E(TRUE U (p42==1)))) * !((!(((!((E(!((p315!=1)) U (!(E((p58==1) U (p340==1))) * !((p315!=1)))) +...408
Reverse transition relation is NOT exact ! Due to transitions t6, t26, t27, t31, t36, t40, t45, t46, t50, t56, t60, t65, t69, t74, t75, t79, t85, t89, t95,...459
Detected timeout of ITS tools.
[2026-05-23 01:46:02] [INFO ] Flatten gal took : 6 ms
[2026-05-23 01:46:02] [INFO ] Applying decomposition
[2026-05-23 01:46:02] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph2227552995478570916.txt' '-o' '/tmp/graph2227552995478570916.bin' '-w' '/tmp/graph2227552995478570916.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph2227552995478570916.bin' '-l' '-1' '-v' '-w' '/tmp/graph2227552995478570916.weights' '-q' '0' '-e' '0.001'
[2026-05-23 01:46:02] [INFO ] Decomposing Gal with order
[2026-05-23 01:46:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 01:46:02] [INFO ] Removed a total of 304 redundant transitions.
[2026-05-23 01:46:02] [INFO ] Flatten gal took : 37 ms
[2026-05-23 01:46:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 11 ms.
[2026-05-23 01:46:02] [INFO ] Time to serialize gal into /tmp/CTLFireability6014328809566392771.gal : 8 ms
[2026-05-23 01:46:02] [INFO ] Time to serialize properties into /tmp/CTLFireability3749063852663689573.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/CTLFireability6014328809566392771.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3749063852663689573.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 -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.62211e+25,0.130987,7200,412,25,5022,621,605,5937,63,1380,0


Converting to forward existential form...Done !
original formula: !(A((!(((A(E((i0.u9.p58==1) U (i18.u56.p340==1)) U (i16.u50.p315!=1)) + A((i25.i1.u78.p478==1) U (i25.i2.u88.p536==1))) + ((i10.u32.p206!...276
=> equivalent forward existential formula: ([((FwdU(Init,!(E(TRUE U (i2.u5.p42==1)))) * !((!(((!((E(!((i16.u50.p315!=1)) U (!(E((i0.u9.p58==1) U (i18.u56.p...549
Reverse transition relation is NOT exact ! Due to transitions t6, t26, t45, t74, t113, t152, t206, i0.t250, i0.u8.t252, i1.i1.t271, i2.t262, i3.t241, i4.u1...731
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
(forward)formula 0,0,5.75495,136892,1,0,280329,621,4192,434197,352,1380,338895
FORMULA Champagne-PT-H07T0R-CTLFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 343/343 places, 532/532 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 308 transition count 482
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 308 transition count 482
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 75 place count 308 transition count 477
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 95 place count 288 transition count 447
Iterating global reduction 1 with 20 rules applied. Total rules applied 115 place count 288 transition count 447
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 118 place count 288 transition count 444
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 130 place count 276 transition count 416
Iterating global reduction 2 with 12 rules applied. Total rules applied 142 place count 276 transition count 416
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 148 place count 276 transition count 410
Applied a total of 148 rules in 20 ms. Remains 276 /343 variables (removed 67) and now considering 410/532 (removed 122) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10405225770577855813.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15759663463998697796.kers'
[2026-05-23 01:46:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10405225770577855813.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15759663463998697796.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 410 rows 276 cols 1144 entries
Finished phase 1 with 249 SingleSign rule and 0 generalized
[2026-05-23 01:46:08] [INFO ] Computed 27 invariants in 2 ms
Computed 27 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-15759663463998697796.kers
Total runtime 3 ms.
[2026-05-23 01:46:08] [INFO ] Implicit Places using invariants in 189 ms returned []
[2026-05-23 01:46:08] [INFO ] Invariant cache hit.
[2026-05-23 01:46:09] [INFO ] Implicit Places using invariants and state equation in 414 ms returned []
Implicit Place search using SMT with State Equation took 605 ms to find 0 implicit places.
Running 409 sub problems to find dead transitions.
[2026-05-23 01:46:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/275 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 1 (OVERLAPS) 1/276 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/276 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 3 (OVERLAPS) 410/686 variables, 276/303 constraints. Problems are: Problem set: 0 solved, 409 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 686/686 variables, and 303 constraints, problems are : Problem set: 0 solved, 409 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 276/276 constraints, PredecessorRefiner: 409/409 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 409 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/275 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 1 (OVERLAPS) 1/276 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/276 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 3 (OVERLAPS) 410/686 variables, 276/303 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/686 variables, 409/712 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/686 variables, 1/713 constraints. Problems are: Problem set: 0 solved, 409 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 686/686 variables, and 713 constraints, problems are : Problem set: 0 solved, 409 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 276/276 constraints, PredecessorRefiner: 409/409 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60102ms problems are : Problem set: 0 solved, 409 unsolved
Search for dead transitions found 0 dead transitions in 60104ms
Starting structural reductions in LTL mode, iteration 1 : 276/343 places, 410/532 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60732 ms. Remains : 276/343 places, 410/532 transitions.
[2026-05-23 01:47:09] [INFO ] Flatten gal took : 11 ms
[2026-05-23 01:47:09] [INFO ] Flatten gal took : 7 ms
[2026-05-23 01:47:09] [INFO ] Input system was already deterministic with 410 transitions.
[2026-05-23 01:47:09] [INFO ] Flatten gal took : 7 ms
[2026-05-23 01:47:09] [INFO ] Flatten gal took : 6 ms
[2026-05-23 01:47:09] [INFO ] Time to serialize gal into /tmp/CTLFireability2673634744882905335.gal : 2 ms
[2026-05-23 01:47:09] [INFO ] Time to serialize properties into /tmp/CTLFireability7360091007618150924.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/CTLFireability2673634744882905335.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7360091007618150924.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.16572e+26,0.288193,11048,2,1911,5,36258,6,0,1516,25912,0


Converting to forward existential form...Done !
original formula: AG((((EG((p20==0)) + EG(E((p311==1) U ((p180==1)&&(p290==1))))) + (E((p251==1) U !((((p478==1)&&(p528==1))&&((p137==1)&&(p169==1))))) + (...298
=> equivalent forward existential formula: [((((FwdU(Init,TRUE) * !((((p21==1) * ((EX((p61==1)) + (p42==0)) + ((p153==0)||(p29==1)))) * (((p99==1)&&(p172==...361
Reverse transition relation is NOT exact ! Due to transitions t6, t26, t27, t31, t36, t40, t45, t46, t50, t57, t61, t66, t70, t75, t76, t80, t86, t90, t96,...448
Detected timeout of ITS tools.
[2026-05-23 01:47:39] [INFO ] Flatten gal took : 7 ms
[2026-05-23 01:47:39] [INFO ] Applying decomposition
[2026-05-23 01:47:39] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph12946804992104791283.txt' '-o' '/tmp/graph12946804992104791283.bin' '-w' '/tmp/graph12946804992104791283.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph12946804992104791283.bin' '-l' '-1' '-v' '-w' '/tmp/graph12946804992104791283.weights' '-q' '0' '-e' '0.001'
[2026-05-23 01:47:39] [INFO ] Decomposing Gal with order
[2026-05-23 01:47:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 01:47:39] [INFO ] Removed a total of 324 redundant transitions.
[2026-05-23 01:47:39] [INFO ] Flatten gal took : 22 ms
[2026-05-23 01:47:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 28 labels/synchronizations in 6 ms.
[2026-05-23 01:47:39] [INFO ] Time to serialize gal into /tmp/CTLFireability18043997172945904024.gal : 5 ms
[2026-05-23 01:47:39] [INFO ] Time to serialize properties into /tmp/CTLFireability8567847263260027442.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/CTLFireability18043997172945904024.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8567847263260027442.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,1.16572e+26,0.581123,15988,2042,37,27446,834,654,35224,84,1966,0


Converting to forward existential form...Done !
original formula: AG((((EG((i1.u4.p20==0)) + EG(E((i16.i0.u45.p311==1) U ((i0.u26.p180==1)&&(i15.u42.p290==1))))) + (E((i13.u37.p251==1) U !((((i23.i0.u72....457
=> equivalent forward existential formula: [((((FwdU(Init,TRUE) * !((((i1.u4.p21==1) * ((EX((i3.i1.u9.p61==1)) + (i2.u7.p42==0)) + ((i8.u21.p153==0)||(i2.u...520
Reverse transition relation is NOT exact ! Due to transitions t6, t26, t45, t75, t127, t159, i0.t190, i0.u25.t194, i1.t276, i1.u5.t278, i2.t265, i3.i1.t255...721
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
(forward)formula 0,0,8.88663,210816,1,0,454300,1008,4483,481650,490,2336,651084
FORMULA Champagne-PT-H07T0R-CTLFireability-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 343/343 places, 532/532 transitions.
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 36 place count 307 transition count 472
Iterating global reduction 0 with 36 rules applied. Total rules applied 72 place count 307 transition count 472
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 79 place count 307 transition count 465
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 97 place count 289 transition count 433
Iterating global reduction 1 with 18 rules applied. Total rules applied 115 place count 289 transition count 433
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 119 place count 289 transition count 429
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 129 place count 279 transition count 416
Iterating global reduction 2 with 10 rules applied. Total rules applied 139 place count 279 transition count 416
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 143 place count 279 transition count 412
Applied a total of 143 rules in 24 ms. Remains 279 /343 variables (removed 64) and now considering 412/532 (removed 120) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8577125617915036484.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14776152725359210514.kers'
[2026-05-23 01:47:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8577125617915036484.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14776152725359210514.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 412 rows 279 cols 1148 entries
Finished phase 1 with 252 SingleSign rule and 0 generalized
[2026-05-23 01:47:48] [INFO ] Computed 27 invariants in 2 ms
Computed 27 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-14776152725359210514.kers
Total runtime 3 ms.
[2026-05-23 01:47:48] [INFO ] Implicit Places using invariants in 193 ms returned []
[2026-05-23 01:47:48] [INFO ] Invariant cache hit.
[2026-05-23 01:47:49] [INFO ] Implicit Places using invariants and state equation in 393 ms returned []
Implicit Place search using SMT with State Equation took 588 ms to find 0 implicit places.
Running 411 sub problems to find dead transitions.
[2026-05-23 01:47:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/278 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 1 (OVERLAPS) 1/279 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/279 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 3 (OVERLAPS) 412/691 variables, 279/306 constraints. Problems are: Problem set: 0 solved, 411 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 691/691 variables, and 306 constraints, problems are : Problem set: 0 solved, 411 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 279/279 constraints, PredecessorRefiner: 411/411 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 411 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/278 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 1 (OVERLAPS) 1/279 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/279 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 3 (OVERLAPS) 412/691 variables, 279/306 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/691 variables, 411/717 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/691 variables, 1/718 constraints. Problems are: Problem set: 0 solved, 411 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 691/691 variables, and 720 constraints, problems are : Problem set: 0 solved, 411 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 279/279 constraints, PredecessorRefiner: 411/411 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 60097ms problems are : Problem set: 0 solved, 411 unsolved
Search for dead transitions found 0 dead transitions in 60099ms
Starting structural reductions in LTL mode, iteration 1 : 279/343 places, 412/532 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60714 ms. Remains : 279/343 places, 412/532 transitions.
[2026-05-23 01:48:49] [INFO ] Flatten gal took : 10 ms
[2026-05-23 01:48:49] [INFO ] Flatten gal took : 11 ms
[2026-05-23 01:48:49] [INFO ] Input system was already deterministic with 412 transitions.
[2026-05-23 01:48:49] [INFO ] Flatten gal took : 11 ms
[2026-05-23 01:48:49] [INFO ] Flatten gal took : 10 ms
[2026-05-23 01:48:49] [INFO ] Time to serialize gal into /tmp/CTLFireability13233786997754781230.gal : 3 ms
[2026-05-23 01:48:49] [INFO ] Time to serialize properties into /tmp/CTLFireability6798955535265847385.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/CTLFireability13233786997754781230.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6798955535265847385.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.51313e+26,0.544271,12848,2,2224,5,43165,6,0,1530,36185,0


Converting to forward existential form...Done !
original formula: AX((EG(EF((((p535==1)||(p524==1))||((p232==1)||((p378==1)&&(p430==1)))))) + ((EG(A((p99==1) U ((p199==1)&&(p287==1)))) * ((AX((p260==0)) ...279
=> equivalent forward existential formula: (([((EY(Init) * !(EG(E(TRUE U (((p535==1)||(p524==1))||((p232==1)||((p378==1)&&(p430==1)))))))) * !(EG(!((E(!(((...761
Reverse transition relation is NOT exact ! Due to transitions t6, t15, t27, t28, t32, t37, t41, t46, t47, t51, t57, t61, t67, t71, t76, t77, t81, t87, t91,...471
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Detected timeout of ITS tools.
[2026-05-23 01:49:19] [INFO ] Flatten gal took : 7 ms
[2026-05-23 01:49:19] [INFO ] Applying decomposition
[2026-05-23 01:49:19] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph16678297110306513910.txt' '-o' '/tmp/graph16678297110306513910.bin' '-w' '/tmp/graph16678297110306513910.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph16678297110306513910.bin' '-l' '-1' '-v' '-w' '/tmp/graph16678297110306513910.weights' '-q' '0' '-e' '0.001'
[2026-05-23 01:49:19] [INFO ] Decomposing Gal with order
[2026-05-23 01:49:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 01:49:19] [INFO ] Removed a total of 339 redundant transitions.
[2026-05-23 01:49:19] [INFO ] Flatten gal took : 21 ms
[2026-05-23 01:49:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 5 ms.
[2026-05-23 01:49:19] [INFO ] Time to serialize gal into /tmp/CTLFireability8525969620321942185.gal : 5 ms
[2026-05-23 01:49:19] [INFO ] Time to serialize properties into /tmp/CTLFireability15497162178068148447.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/CTLFireability8525969620321942185.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15497162178068148447.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,1.51313e+26,0.290607,12312,1941,27,14778,484,635,19123,72,863,0


Converting to forward existential form...Done !
original formula: AX((EG(EF((((i23.i1.u85.p535==1)||(i23.i1.u83.p524==1))||((i0.u33.p232==1)||((i19.u60.p378==1)&&(i21.i1.u69.p430==1)))))) + ((EG(A((i5.u1...424
=> equivalent forward existential formula: (([((EY(Init) * !(EG(E(TRUE U (((i23.i1.u85.p535==1)||(i23.i1.u83.p524==1))||((i0.u33.p232==1)||((i19.u60.p378==...1089
Reverse transition relation is NOT exact ! Due to transitions t6, t27, t46, t76, t115, t170, t214, i0.t167, i0.u32.t159, i0.u33.t163, i1.i1.t281, i2.t272, ...756
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
(forward)formula 0,1,15.748,373072,1,0,765467,688,4431,954389,370,1797,1070270
FORMULA Champagne-PT-H07T0R-CTLFireability-2024-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 343/343 places, 532/532 transitions.
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 39 place count 304 transition count 465
Iterating global reduction 0 with 39 rules applied. Total rules applied 78 place count 304 transition count 465
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 86 place count 304 transition count 457
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 109 place count 281 transition count 423
Iterating global reduction 1 with 23 rules applied. Total rules applied 132 place count 281 transition count 423
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 136 place count 281 transition count 419
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 151 place count 266 transition count 382
Iterating global reduction 2 with 15 rules applied. Total rules applied 166 place count 266 transition count 382
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 174 place count 266 transition count 374
Applied a total of 174 rules in 22 ms. Remains 266 /343 variables (removed 77) and now considering 374/532 (removed 158) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6625580915425903527.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16820848006893507185.kers'
[2026-05-23 01:49:35] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6625580915425903527.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16820848006893507185.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 374 rows 266 cols 1022 entries
Finished phase 1 with 239 SingleSign rule and 0 generalized
[2026-05-23 01:49:35] [INFO ] Computed 27 invariants in 1 ms
Computed 27 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-16820848006893507185.kers
Total runtime 2 ms.
[2026-05-23 01:49:35] [INFO ] Implicit Places using invariants in 140 ms returned []
[2026-05-23 01:49:35] [INFO ] Invariant cache hit.
[2026-05-23 01:49:35] [INFO ] Implicit Places using invariants and state equation in 287 ms returned []
Implicit Place search using SMT with State Equation took 449 ms to find 0 implicit places.
Running 373 sub problems to find dead transitions.
[2026-05-23 01:49:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/265 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 1 (OVERLAPS) 1/266 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/266 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 3 (OVERLAPS) 374/640 variables, 266/293 constraints. Problems are: Problem set: 0 solved, 373 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 640/640 variables, and 293 constraints, problems are : Problem set: 0 solved, 373 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 266/266 constraints, PredecessorRefiner: 373/373 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 373 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/265 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 1 (OVERLAPS) 1/266 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/266 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 3 (OVERLAPS) 374/640 variables, 266/293 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/640 variables, 373/666 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/640 variables, 8/674 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/640 variables, 1/675 constraints. Problems are: Problem set: 0 solved, 373 unsolved
SMT process timed out in 60134ms, After SMT, problems are : Problem set: 0 solved, 373 unsolved
Search for dead transitions found 0 dead transitions in 60135ms
Starting structural reductions in LTL mode, iteration 1 : 266/343 places, 374/532 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60611 ms. Remains : 266/343 places, 374/532 transitions.
[2026-05-23 01:50:35] [INFO ] Flatten gal took : 19 ms
[2026-05-23 01:50:36] [INFO ] Flatten gal took : 10 ms
[2026-05-23 01:50:36] [INFO ] Input system was already deterministic with 374 transitions.
[2026-05-23 01:50:36] [INFO ] Flatten gal took : 10 ms
[2026-05-23 01:50:36] [INFO ] Flatten gal took : 10 ms
[2026-05-23 01:50:36] [INFO ] Time to serialize gal into /tmp/CTLFireability9907708028275959575.gal : 3 ms
[2026-05-23 01:50:36] [INFO ] Time to serialize properties into /tmp/CTLFireability5076433261620765087.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/CTLFireability9907708028275959575.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5076433261620765087.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,4.17958e+25,0.613515,13756,2,2285,5,50678,6,0,1440,41588,0


Converting to forward existential form...Done !
original formula: !(E((AG(AX(EX((p377==1)))) + !(E(((p457==1) * EG((p121==1))) U EF((p8==1))))) U (p267==1)))
=> equivalent forward existential formula: [(FwdU(Init,(!(E(TRUE U !(!(EX(!(EX((p377==1)))))))) + !(E(((p457==1) * EG((p121==1))) U E(TRUE U (p8==1)))))) *...175
Reverse transition relation is NOT exact ! Due to transitions t6, t25, t26, t30, t35, t39, t44, t45, t49, t54, t55, t59, t64, t68, t73, t74, t78, t84, t88,...475
(forward)formula 0,1,28.9804,607144,1,0,1276,3.20677e+06,786,585,9126,3.88338e+06,1558
FORMULA Champagne-PT-H07T0R-CTLFireability-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 343/343 places, 532/532 transitions.
Graph (trivial) has 326 edges and 343 vertex of which 51 / 343 are part of one of the 9 SCC in 1 ms
Free SCC test removed 42 places
Ensure Unique test removed 47 transitions
Reduce isomorphic transitions removed 47 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 65 place count 300 transition count 420
Reduce places removed 64 places and 0 transitions.
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 1 with 111 rules applied. Total rules applied 176 place count 236 transition count 373
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 2 with 22 rules applied. Total rules applied 198 place count 214 transition count 373
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 198 place count 214 transition count 362
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 220 place count 203 transition count 362
Discarding 29 places :
Symmetric choice reduction at 3 with 29 rule applications. Total rules 249 place count 174 transition count 305
Iterating global reduction 3 with 29 rules applied. Total rules applied 278 place count 174 transition count 305
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 286 place count 174 transition count 297
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 286 place count 174 transition count 290
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 300 place count 167 transition count 290
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 305 place count 162 transition count 261
Iterating global reduction 4 with 5 rules applied. Total rules applied 310 place count 162 transition count 261
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 315 place count 162 transition count 256
Performed 78 Post agglomeration using F-continuation condition.Transition count delta: 78
Deduced a syphon composed of 78 places in 0 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 5 with 156 rules applied. Total rules applied 471 place count 84 transition count 178
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 475 place count 80 transition count 161
Iterating global reduction 5 with 4 rules applied. Total rules applied 479 place count 80 transition count 161
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 483 place count 80 transition count 157
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 485 place count 78 transition count 155
Applied a total of 485 rules in 64 ms. Remains 78 /343 variables (removed 265) and now considering 155/532 (removed 377) transitions.
[2026-05-23 01:51:05] [INFO ] Flow matrix only has 77 transitions (discarded 78 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12302236132420768890.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16072786928114555241.kers'
[2026-05-23 01:51:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12302236132420768890.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16072786928114555241.kers]
Normalized transition count is 76 out of 77 initially.
Culling duplicate invariants (modulo rational): removing 6 columns.
Culled 6 columns in 0 ms.
// Phase 1: matrix 76 rows 72 cols 198 entries
Finished phase 1 with 51 SingleSign rule and 0 generalized
[2026-05-23 01:51:05] [INFO ] Computed 27 invariants in 0 ms
Computed 27 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-16072786928114555241.kers
Total runtime 1 ms.
[2026-05-23 01:51:05] [INFO ] Implicit Places using invariants in 111 ms returned []
[2026-05-23 01:51:05] [INFO ] Flow matrix only has 77 transitions (discarded 78 similar events)
[2026-05-23 01:51:05] [INFO ] Invariant cache hit.
[2026-05-23 01:51:05] [INFO ] Implicit Places using invariants and state equation in 170 ms returned []
Implicit Place search using SMT with State Equation took 283 ms to find 0 implicit places.
[2026-05-23 01:51:05] [INFO ] Redundant transitions in 5 ms returned []
Running 98 sub problems to find dead transitions.
[2026-05-23 01:51:05] [INFO ] Flow matrix only has 77 transitions (discarded 78 similar events)
[2026-05-23 01:51:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (OVERLAPS) 2/78 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (OVERLAPS) 76/154 variables, 78/105 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/154 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (OVERLAPS) 0/154 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Real declared 154/155 variables, and 105 constraints, problems are : Problem set: 0 solved, 98 unsolved in 4762 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 78/78 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/76 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (OVERLAPS) 2/78 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (OVERLAPS) 76/154 variables, 78/105 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/154 variables, 98/203 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/154 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (OVERLAPS) 0/154 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Int declared 154/155 variables, and 203 constraints, problems are : Problem set: 0 solved, 98 unsolved in 4862 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 78/78 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9640ms problems are : Problem set: 0 solved, 98 unsolved
Search for dead transitions found 0 dead transitions in 9640ms
Starting structural reductions in SI_CTL mode, iteration 1 : 78/343 places, 155/532 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 10000 ms. Remains : 78/343 places, 155/532 transitions.
[2026-05-23 01:51:15] [INFO ] Flatten gal took : 6 ms
[2026-05-23 01:51:15] [INFO ] Flatten gal took : 4 ms
[2026-05-23 01:51:15] [INFO ] Input system was already deterministic with 155 transitions.
[2026-05-23 01:51:15] [INFO ] Flatten gal took : 4 ms
[2026-05-23 01:51:15] [INFO ] Flatten gal took : 4 ms
[2026-05-23 01:51:15] [INFO ] Time to serialize gal into /tmp/CTLFireability5506487112613384232.gal : 2 ms
[2026-05-23 01:51:15] [INFO ] Time to serialize properties into /tmp/CTLFireability3132228027856404816.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/CTLFireability5506487112613384232.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3132228027856404816.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.48769e+12,0.050443,4872,2,130,5,1504,6,0,461,781,0


Converting to forward existential form...Done !
original formula: A(EG(AF((p391==1))) U EF((p14==1)))
=> equivalent forward existential formula: [((Init * !(EG(!(E(TRUE U (p14==1)))))) * !(E(!(E(TRUE U (p14==1))) U (!(EG(!(EG(!((p391==1)))))) * !(E(TRUE U (...178
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 153/0/2
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,1,1.18819,29820,1,0,97,118354,33,67,2399,190819,70
FORMULA Champagne-PT-H07T0R-CTLFireability-2024-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 343/343 places, 532/532 transitions.
Graph (trivial) has 313 edges and 343 vertex of which 49 / 343 are part of one of the 8 SCC in 1 ms
Free SCC test removed 41 places
Ensure Unique test removed 47 transitions
Reduce isomorphic transitions removed 47 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 61 transitions
Trivial Post-agglo rules discarded 61 transitions
Performed 61 trivial Post agglomeration. Transition count delta: 61
Iterating post reduction 0 with 61 rules applied. Total rules applied 62 place count 301 transition count 423
Reduce places removed 61 places and 0 transitions.
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 1 with 104 rules applied. Total rules applied 166 place count 240 transition count 380
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 186 place count 220 transition count 380
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 186 place count 220 transition count 369
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 208 place count 209 transition count 369
Discarding 27 places :
Symmetric choice reduction at 3 with 27 rule applications. Total rules 235 place count 182 transition count 321
Iterating global reduction 3 with 27 rules applied. Total rules applied 262 place count 182 transition count 321
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 268 place count 182 transition count 315
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 268 place count 182 transition count 309
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 280 place count 176 transition count 309
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 285 place count 171 transition count 280
Iterating global reduction 4 with 5 rules applied. Total rules applied 290 place count 171 transition count 280
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 295 place count 171 transition count 275
Performed 78 Post agglomeration using F-continuation condition.Transition count delta: 78
Deduced a syphon composed of 78 places in 0 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 5 with 156 rules applied. Total rules applied 451 place count 93 transition count 197
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 454 place count 90 transition count 187
Iterating global reduction 5 with 3 rules applied. Total rules applied 457 place count 90 transition count 187
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 460 place count 90 transition count 184
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 461 place count 89 transition count 183
Applied a total of 461 rules in 50 ms. Remains 89 /343 variables (removed 254) and now considering 183/532 (removed 349) transitions.
[2026-05-23 01:51:16] [INFO ] Flow matrix only has 110 transitions (discarded 73 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18024388199332360127.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15854010487722398804.kers'
[2026-05-23 01:51:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18024388199332360127.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15854010487722398804.kers]
Normalized transition count is 109 out of 110 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 109 rows 89 cols 316 entries
Finished phase 1 with 62 SingleSign rule and 0 generalized
[2026-05-23 01:51:16] [INFO ] Computed 27 invariants in 0 ms
Computed 27 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-15854010487722398804.kers
Total runtime 1 ms.
[2026-05-23 01:51:16] [INFO ] Implicit Places using invariants in 128 ms returned []
[2026-05-23 01:51:16] [INFO ] Flow matrix only has 110 transitions (discarded 73 similar events)
[2026-05-23 01:51:16] [INFO ] Invariant cache hit.
[2026-05-23 01:51:16] [INFO ] State equation strengthened by 7 read => feed constraints.
[2026-05-23 01:51:16] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 270 ms to find 0 implicit places.
[2026-05-23 01:51:16] [INFO ] Redundant transitions in 8 ms returned []
Running 138 sub problems to find dead transitions.
[2026-05-23 01:51:16] [INFO ] Flow matrix only has 110 transitions (discarded 73 similar events)
[2026-05-23 01:51:16] [INFO ] Invariant cache hit.
[2026-05-23 01:51:16] [INFO ] State equation strengthened by 7 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 2 (OVERLAPS) 4/89 variables, 10/27 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 4 (OVERLAPS) 109/198 variables, 89/116 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/198 variables, 7/123 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 1/124 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/198 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 8 (OVERLAPS) 0/198 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 138 unsolved
No progress, stopping.
After SMT solving in domain Real declared 198/199 variables, and 124 constraints, problems are : Problem set: 0 solved, 138 unsolved in 9109 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 89/89 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 138/138 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 138 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 2 (OVERLAPS) 4/89 variables, 10/27 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 4 (OVERLAPS) 109/198 variables, 89/116 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/198 variables, 7/123 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 138/261 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/198 variables, 1/262 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/198 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 9 (OVERLAPS) 0/198 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 138 unsolved
No progress, stopping.
After SMT solving in domain Int declared 198/199 variables, and 262 constraints, problems are : Problem set: 0 solved, 138 unsolved in 8595 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 89/89 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 138/138 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 17718ms problems are : Problem set: 0 solved, 138 unsolved
Search for dead transitions found 0 dead transitions in 17719ms
Starting structural reductions in SI_CTL mode, iteration 1 : 89/343 places, 183/532 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 18054 ms. Remains : 89/343 places, 183/532 transitions.
[2026-05-23 01:51:34] [INFO ] Flatten gal took : 5 ms
[2026-05-23 01:51:34] [INFO ] Flatten gal took : 5 ms
[2026-05-23 01:51:34] [INFO ] Input system was already deterministic with 183 transitions.
[2026-05-23 01:51:34] [INFO ] Flatten gal took : 5 ms
[2026-05-23 01:51:34] [INFO ] Flatten gal took : 5 ms
[2026-05-23 01:51:34] [INFO ] Time to serialize gal into /tmp/CTLFireability9642492413413131064.gal : 2 ms
[2026-05-23 01:51:34] [INFO ] Time to serialize properties into /tmp/CTLFireability9076304703889862667.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/CTLFireability9642492413413131064.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9076304703889862667.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.34076e+13,0.068693,5080,2,181,5,2251,6,0,533,1264,0


Converting to forward existential form...Done !
original formula: !(A(AF((!(EG((p148==1))) * !((AG((p338==1)) + ((p99==1)&&(p229==1)))))) U AF(((EG((p2==1)) + (p353!=1)) * EF((((p497==1)&&(p509==1))||(p2...167
=> equivalent forward existential formula: ([FwdG((FwdU(Init,!(!(EG(!(((EG((p2==1)) + (p353!=1)) * E(TRUE U (((p497==1)&&(p509==1))||(p230==1))))))))) * !(...446
Reverse transition relation is NOT exact ! Due to transitions t16, t81, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/tot...171
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,11.1834,283880,1,0,842,1.07965e+06,415,469,3693,2.50716e+06,1018
FORMULA Champagne-PT-H07T0R-CTLFireability-2024-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

[2026-05-23 01:51:45] [INFO ] Flatten gal took : 14 ms
[2026-05-23 01:51:45] [INFO ] Flatten gal took : 13 ms
Total runtime 1203725 ms.

BK_STOP 1779501105985

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
++ perl -pe 's/.*\.//g'
+ 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="Champagne-PT-H07T0R"
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 Champagne-PT-H07T0R, 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 r050-smll-177946901000074"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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