Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r147-tall-174876819800344.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............
=====================================================================
Generated by BenchKit 2-5832
Executing tool itstools
Input is Peterson-COL-2, examination is Liveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r147-tall-174876819800344
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 444K
-rw-r--r-- 1 mcc users 7.0K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.1K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.3K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 73K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_pt
-rw-r--r-- 1 mcc users 2 May 29 14:32 instance
-rw-r--r-- 1 mcc users 5 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 42K May 29 14:32 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME Liveness

=== Now, execution of the tool begins

BK_START 1748810290678

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=Liveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=Peterson-COL-2
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
Liveness COL
Running Version 202505121319
[2025-06-01 20:38:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, Liveness, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2025-06-01 20:38:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 20:38:11] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2025-06-01 20:38:12] [WARNING] Using fallBack plugin, rng conformance not checked
[2025-06-01 20:38:12] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 551 ms
[2025-06-01 20:38:12] [INFO ] Imported 11 HL places and 14 HL transitions for a total of 108 PT places and 159.0 transition bindings in 17 ms.
[2025-06-01 20:38:12] [INFO ] Built PT skeleton of HLPN with 11 places and 14 transitions 42 arcs in 5 ms.
[2025-06-01 20:38:12] [INFO ] Skeletonized 0 HLPN properties in 0 ms.
[2025-06-01 20:38:12] [INFO ] Unfolded HLPN to a Petri net with 108 places and 138 transitions 432 arcs in 16 ms.
[2025-06-01 20:38:12] [INFO ] Unfolded 0 HLPN properties in 0 ms.
[2025-06-01 20:38:12] [INFO ] Unfolded HLPN to a Petri net with 108 places and 138 transitions 432 arcs in 6 ms.
[2025-06-01 20:38:12] [INFO ] Unfolded 14 HLPN properties in 0 ms.
[2025-06-01 20:38:12] [INFO ] Built PT skeleton of HLPN with 11 places and 14 transitions 42 arcs in 0 ms.
[2025-06-01 20:38:12] [INFO ] Skeletonized 14 HLPN properties in 1 ms.
Reduce places removed 2 places and 0 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Prefix of Interest using HLPN skeleton for deadlock discarded 0 places and 0 transitions.
Domain [Process(3), Tour(2), Process(3)] of place BeginLoop breaks symmetries in sort Process
Symmetric sort wr.t. initial and guards and successors and join/free detected :Bool
Arc [1:1*[$i, 0]] contains constants of sort Bool
Transition Ask : constants on arcs in [[1:1*[$i, 0]]] introduces in Bool(2) partition with 1 elements that refines current partition to 2 subsets.
Arc [2:1*[$i, (MOD (ADD $j 1) 2)]] contains successor/predecessor on variables of sort Tour
[2025-06-01 20:38:12] [INFO ] Unfolded HLPN to a Petri net with 108 places and 138 transitions 432 arcs in 14 ms.
[2025-06-01 20:38:12] [INFO ] Unfolded 14 HLPN properties in 0 ms.
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 12 transitions.
Built sparse matrix representations for Structural reductions in 0 ms.16988KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 102/102 places, 126/126 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 12 ms. Remains 102 /102 variables (removed 0) and now considering 126/126 (removed 0) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 20 ms. Remains : 102/102 places, 126/126 transitions.
Starting structural reductions in DEADLOCK mode, iteration 0 : 102/102 places, 126/126 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 5 ms. Remains 102 /102 variables (removed 0) and now considering 126/126 (removed 0) transitions.
[2025-06-01 20:38:12] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
// Phase 1: matrix 120 rows 102 cols
[2025-06-01 20:38:12] [INFO ] Computed 11 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 20:38:12] [INFO ] Implicit Places using invariants in 169 ms returned []
[2025-06-01 20:38:12] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
[2025-06-01 20:38:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 20:38:12] [INFO ] State equation strengthened by 22 read => feed constraints.
[2025-06-01 20:38:12] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 289 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 20:38:12] [INFO ] Redundant transitions in 2 ms returned []
Running 123 sub problems to find dead transitions.
[2025-06-01 20:38:12] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
[2025-06-01 20:38:13] [INFO ] Invariant cache hit.
[2025-06-01 20:38:13] [INFO ] State equation strengthened by 22 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 123 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 20:38:13] [INFO ] Deduced a trap composed of 11 places in 73 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 20:38:13] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 20:38:13] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 20:38:13] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 20:38:13] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 20:38:13] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 20:38:13] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 20:38:14] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 20:38:14] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 20:38:14] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 20:38:14] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 20:38:14] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 20:38:14] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 20:38:14] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 20:38:14] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 15/23 constraints. Problems are: Problem set: 0 solved, 123 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 20:38:14] [INFO ] Deduced a trap composed of 37 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 20:38:15] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 20:38:15] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 3/26 constraints. Problems are: Problem set: 0 solved, 123 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 20:38:15] [INFO ] Deduced a trap composed of 29 places in 52 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 20:38:15] [INFO ] Deduced a trap composed of 40 places in 44 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/99 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 6 (OVERLAPS) 3/102 variables, 3/31 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/102 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 8 (OVERLAPS) 120/222 variables, 102/133 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/222 variables, 22/155 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/222 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 123 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 20:38:19] [INFO ] Deduced a trap composed of 36 places in 84 ms of which 6 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/222 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/222 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 13 (OVERLAPS) 0/222 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Real declared 222/222 variables, and 156 constraints, problems are : Problem set: 0 solved, 123 unsolved in 9799 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 102/102 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 123 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 21/29 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 4 (OVERLAPS) 3/102 variables, 3/32 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 6 (OVERLAPS) 120/222 variables, 102/134 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/222 variables, 22/156 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/222 variables, 123/279 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/222 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 10 (OVERLAPS) 0/222 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Int declared 222/222 variables, and 279 constraints, problems are : Problem set: 0 solved, 123 unsolved in 7124 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 102/102 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 16968ms problems are : Problem set: 0 solved, 123 unsolved
Search for dead transitions found 0 dead transitions in 16974ms
Finished structural reductions in DEADLOCK mode , in 1 iterations and 17283 ms. Remains : 102/102 places, 126/126 transitions.
Random walk for 1250000 steps, including 0 resets, run took 843 ms (no deadlock found). (steps per millisecond=1482 )
Random directed walk for 1250000 steps, including 0 resets, run took 782 ms (no deadlock found). (steps per millisecond=1598 )
[2025-06-01 20:38:31] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
[2025-06-01 20:38:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 300.0 s and query timeout 30000.0 ms
[2025-06-01 20:38:31] [INFO ] [Real]Absence check using 8 positive place invariants in 10 ms returned sat
[2025-06-01 20:38:31] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 2 ms returned unsat
[2025-06-01 20:38:31] [INFO ] Unfolded HLPN to a Petri net with 108 places and 138 transitions 432 arcs in 3 ms.
[2025-06-01 20:38:31] [INFO ] Unfolded 14 HLPN properties in 0 ms.
Initial state reduction rules removed 1 formulas.
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 12 transitions.
RANDOM walk for 40000 steps (8 resets) in 470 ms. (84 steps per ms) remains 1/13 properties
[2025-06-01 20:38:31] [INFO ] Flatten gal took : 42 ms
[2025-06-01 20:38:31] [INFO ] Flatten gal took : 28 ms
BEST_FIRST walk for 40004 steps (8 resets) in 186 ms. (213 steps per ms) remains 1/1 properties
[2025-06-01 20:38:31] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
[2025-06-01 20:38:31] [INFO ] Invariant cache hit.
[2025-06-01 20:38:31] [INFO ] State equation strengthened by 22 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-01 20:38:31] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17812960707664214385.gal : 14 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 20:38:31] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4382331498272570327.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17812960707664214385.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4382331498272570327.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
At refinement iteration 1 (OVERLAPS) 87/93 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Loading property file /tmp/ReachabilityCardinality4382331498272570327.prop.
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 3/96 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 4
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :4 after 12
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :12 after 23
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :23 after 59
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :59 after 594
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :594 after 976
Reachability property qltransition_13 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 257 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,1559,0.053331,5492,2,1080,13,6318,6,0,537,4035,0
Total reachable state count : 1559

Verifying 1 reachability properties.
Reachability property qltransition_13 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_13,1,0.054263,5620,2,103,13,6318,7,0,544,4035,0
After SMT solving in domain Real declared 216/222 variables, and 105 constraints, problems are : Problem set: 1 solved, 0 unsolved in 116 ms.
Refiners :[Positive P Invariants (semi-flows): 6/8 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 96/102 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 123ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Able to resolve query QuasiLiveness after proving 14 properties.
Net is quasi-live, checking if it is reversible to establish liveness.
Net is conservative; using simplified expression for initial state.
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 12 transitions.
[2025-06-01 20:38:32] [INFO ] Flatten gal took : 10 ms
[2025-06-01 20:38:32] [INFO ] Flatten gal took : 10 ms
[2025-06-01 20:38:32] [INFO ] Time to serialize gal into /tmp/CTLFireability10994607567678971863.gal : 3 ms
[2025-06-01 20:38:32] [INFO ] Time to serialize properties into /tmp/CTLFireability14107848926421590044.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability10994607567678971863.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14107848926421590044.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: AG(EF(((((Idle_0==1)&&(Idle_1==1))&&((Idle_2==1)&&(WantSection_0==1)))&&(((WantSection_2==1)&&(WantSection_4==1))&&((Turn_0==1)&&(Turn_3=...163
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((((Idle_0==1)&&(Idle_1==1))&&((Idle_2==1)&&(WantSection_0==1)))&&(((WantSection_...223
Reverse transition relation is NOT exact ! Due to transitions UpdateTurnj0k0i0, UpdateTurnj0k0i1, UpdateTurnj0k0i2, UpdateTurnj0k1i0, UpdateTurnj0k1i1, Upd...662
(forward)formula 0,0,1.15881,43632,1,0,283,185650,273,148,3151,132519,305
ITS tools runner thread asked to quit. Dying gracefully.
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 12 transitions.
[2025-06-01 20:38:33] [INFO ] Flatten gal took : 10 ms
[2025-06-01 20:38:33] [INFO ] Flatten gal took : 10 ms
[2025-06-01 20:38:33] [INFO ] Time to serialize gal into /tmp/CTLFireability446526950543074512.gal : 3 ms
[2025-06-01 20:38:33] [INFO ] Time to serialize properties into /tmp/CTLFireability18347343161039828831.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability446526950543074512.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18347343161039828831.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 14 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,20754,0.194704,12056,2,3064,5,29503,6,0,537,38664,0


Converting to forward existential form...Done !
original formula: AG(EF(((((Idle_1>=1)&&(WantSection_2>=1))||((Idle_0>=1)&&(WantSection_0>=1)))||((Idle_2>=1)&&(WantSection_4>=1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((((Idle_1>=1)&&(WantSection_2>=1))||((Idle_0>=1)&&(WantSection_0>=1)))||((Idle_2...193
Reverse transition relation is NOT exact ! Due to transitions UpdateTurnj0k0i0, UpdateTurnj0k0i1, UpdateTurnj0k0i2, UpdateTurnj0k1i0, UpdateTurnj0k1i1, Upd...662
(forward)formula 0,1,1.76132,60576,1,0,271,315178,273,139,3136,214663,290
Formula is TRUE !

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

original formula: AG(EF((((((((AskForSection_3>=1)&&(Turn_3>=1))||((AskForSection_3>=1)&&(Turn_4>=1)))||(((AskForSection_2>=1)&&(Turn_0>=1))||((AskForSecti...724
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (((((((AskForSection_3>=1)&&(Turn_3>=1))||((AskForSection_3>=1)&&(Turn_4>=1)))||(...784
(forward)formula 1,1,1.96876,68640,1,0,279,371709,274,143,3144,244800,302
Formula is TRUE !

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

original formula: AG(EF((((((Turn_1>=1)&&(TestTurn_2>=1))||((Turn_5>=1)&&(TestTurn_5>=1)))||(((Turn_4>=1)&&(TestTurn_3>=1))||((Turn_3>=1)&&(TestTurn_1>=1))...226
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (((((Turn_1>=1)&&(TestTurn_2>=1))||((Turn_5>=1)&&(TestTurn_5>=1)))||(((Turn_4>=1)...286
(forward)formula 2,1,2.12839,74528,1,0,283,412152,275,145,3149,267126,309
Formula is TRUE !

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

original formula: AG(EF(((((((Turn_0>=1)&&(TestTurn_4>=1))||((Turn_1>=1)&&(TestTurn_0>=1)))||(((Turn_2>=1)&&(TestTurn_0>=1))||((Turn_5>=1)&&(TestTurn_3>=1)...430
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((((((Turn_0>=1)&&(TestTurn_4>=1))||((Turn_1>=1)&&(TestTurn_0>=1)))||(((Turn_2>=1...490
(forward)formula 3,1,2.61547,90016,1,0,293,520059,276,151,3156,323946,325
Formula is TRUE !
Detected timeout of ITS tools.
[2025-06-01 20:38:36] [INFO ] Flatten gal took : 10 ms
[2025-06-01 20:38:36] [INFO ] Applying decomposition
[2025-06-01 20:38:36] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph12406889133070353164.txt' '-o' '/tmp/graph12406889133070353164.bin' '-w' '/tmp/graph12406889133070353164.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph12406889133070353164.bin' '-l' '-1' '-v' '-w' '/tmp/graph12406889133070353164.weights' '-q' '0' '-e' '0.001'
[2025-06-01 20:38:36] [INFO ] Decomposing Gal with order
[2025-06-01 20:38:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 20:38:36] [INFO ] Removed a total of 66 redundant transitions.
[2025-06-01 20:38:36] [INFO ] Flatten gal took : 29 ms
[2025-06-01 20:38:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2025-06-01 20:38:36] [INFO ] Time to serialize gal into /tmp/CTLFireability11114208699255730145.gal : 3 ms
[2025-06-01 20:38:36] [INFO ] Time to serialize properties into /tmp/CTLFireability11520751578615376250.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability11114208699255730145.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11520751578615376250.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 10 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,20754,0.065274,6268,418,22,4431,138,398,6963,43,329,0


Converting to forward existential form...Done !
original formula: AG(EF((((i7.i0.u22.EndTurn_3>=1)||(i5.i1.u20.EndTurn_5>=1))||(i6.u21.EndTurn_1>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (((i7.i0.u22.EndTurn_3>=1)||(i5.i1.u20.EndTurn_5>=1))||(i6.u21.EndTurn_1>=1)))))]...163
Reverse transition relation is NOT exact ! Due to transitions UpdateTurnj0k0i1, UpdateTurnj0k0i2, UpdateTurnj0k1i0, UpdateTurnj0k1i2, UpdateTurnj0k2i0, Upd...738
(forward)formula 0,1,0.168959,10364,1,0,11872,190,1798,23068,194,634,41764
Formula is TRUE !

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

original formula: AG(EF((((i4.i2.u37.EndTurn_4>=1)||(i3.u17.EndTurn_0>=1))||(i0.u19.EndTurn_2>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (((i4.i2.u37.EndTurn_4>=1)||(i3.u17.EndTurn_0>=1))||(i0.u19.EndTurn_2>=1)))))] = ...160
(forward)formula 1,1,0.192168,11132,1,0,13432,190,1807,25416,194,634,46616
Formula is TRUE !

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

original formula: AG(EF(((((i1.i0.u1.WantSection_3>=1)&&(i7.i0.u22.CS_1>=1))||((i6.u0.WantSection_1>=1)&&(i6.u21.CS_0>=1)))||((i0.u2.WantSection_5>=1)&&(i5...175
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((((i1.i0.u1.WantSection_3>=1)&&(i7.i0.u22.CS_1>=1))||((i6.u0.WantSection_1>=1)&&...235
(forward)formula 2,1,0.206683,11516,1,0,14122,190,1827,26316,194,634,47994
Formula is TRUE !

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

original formula: AG(EF(((((((i1.i0.u10.BeginLoop_5>=1)||(i0.u11.BeginLoop_6>=1))||((i2.u12.BeginLoop_7>=1)||(i2.u29.BeginLoop_8>=1)))||(((i7.i0.u30.BeginL...550
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((((((i1.i0.u10.BeginLoop_5>=1)||(i0.u11.BeginLoop_6>=1))||((i2.u12.BeginLoop_7>=...610
(forward)formula 3,1,0.237279,12540,1,0,16155,200,1893,30894,194,687,54781
Formula is TRUE !

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

original formula: AG(EF(((((i7.i1.u13.TestIdentity_10>=1)||(i4.i2.u15.TestIdentity_14>=1))||((i5.i1.u34.TestIdentity_17>=1)||(i3.u23.TestIdentity_0>=1)))||...217
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((((i7.i1.u13.TestIdentity_10>=1)||(i4.i2.u15.TestIdentity_14>=1))||((i5.i1.u34.T...277
(forward)formula 4,1,0.265266,13820,1,0,18660,200,1907,34900,194,689,62383
Formula is TRUE !

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

original formula: AG(EF((((((i7.i1.u31.TestIdentity_11>=1)||(i4.i1.u35.TestIdentity_13>=1))||((i4.i0.u32.TestIdentity_12>=1)||(i5.i0.u33.TestIdentity_15>=1...410
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (((((i7.i1.u31.TestIdentity_11>=1)||(i4.i1.u35.TestIdentity_13>=1))||((i4.i0.u32....470
(forward)formula 5,1,0.283741,14588,1,0,19932,202,1948,37475,194,689,67551
Formula is TRUE !

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

original formula: AG(EF((((((i2.u28.IsEndLoop_7>=1)||(i2.u12.IsEndLoop_6>=1))||((i7.i1.u13.IsEndLoop_9>=1)||(i7.i1.u36.IsEndLoop_10>=1)))||(((i4.i2.u15.IsE...374
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (((((i2.u28.IsEndLoop_7>=1)||(i2.u12.IsEndLoop_6>=1))||((i7.i1.u13.IsEndLoop_9>=1...434
(forward)formula 6,1,0.319121,15996,1,0,22676,216,1984,42504,194,728,75722
Formula is TRUE !

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

original formula: AG(EF(((((((i1.i0.u1.WantSection_3>=1)&&(i3.u24.TestAlone_1>=1))||((i1.i0.u1.WantSection_3>=1)&&(i4.i1.u35.TestAlone_13>=1)))||(((i0.u2.W...722
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((((((i1.i0.u1.WantSection_3>=1)&&(i3.u24.TestAlone_1>=1))||((i1.i0.u1.WantSectio...782
(forward)formula 7,1,0.333877,16380,1,0,23317,216,2059,43696,194,728,78929
Formula is TRUE !

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

original formula: AG(EF(((((((i1.i0.u1.WantSection_2>=1)&&(i5.i0.u16.TestAlone_16>=1))||((i0.u2.WantSection_4>=1)&&(i7.i1.u31.TestAlone_11>=1)))||(((i1.i0....722
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((((((i1.i0.u1.WantSection_2>=1)&&(i5.i0.u16.TestAlone_16>=1))||((i0.u2.WantSecti...782
(forward)formula 8,1,0.36158,17404,1,0,25466,216,2116,46354,194,728,84598
Formula is TRUE !

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

original formula: AG(EF(((((i0.u19.IsEndLoop_8>=1)||(i7.i0.u22.IsEndLoop_11>=1))||((i4.i2.u37.IsEndLoop_14>=1)||(i5.i1.u20.IsEndLoop_17>=1)))||((i3.u17.IsE...196
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((((i0.u19.IsEndLoop_8>=1)||(i7.i0.u22.IsEndLoop_11>=1))||((i4.i2.u37.IsEndLoop_1...256
(forward)formula 9,0,0.386618,18044,1,0,26644,218,2131,48161,194,736,88491
FORMULA Liveness FALSE TECHNIQUES RANDOM_WALK DECISION_DIAGRAMS COLLATERAL_PROCESSING TOPOLOGICAL INITIAL_STATE USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 25012 ms.

BK_STOP 1748810316977

--------------------
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
+ [[ Liveness = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution Liveness -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ 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.202505121319.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination Liveness -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800

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="Peterson-COL-2"
export BK_EXAMINATION="Liveness"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is Peterson-COL-2, examination is Liveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r147-tall-174876819800344"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Peterson-COL-2.tgz
mv Peterson-COL-2 execution
cd execution
if [ "Liveness" = "ReachabilityDeadlock" ] || [ "Liveness" = "UpperBounds" ] || [ "Liveness" = "QuasiLiveness" ] || [ "Liveness" = "StableMarking" ] || [ "Liveness" = "Liveness" ] || [ "Liveness" = "OneSafe" ] || [ "Liveness" = "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 [ "Liveness" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "Liveness" != "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 "Liveness.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 '' Liveness.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "Liveness" = "ReachabilityDeadlock" ] || [ "Liveness" = "QuasiLiveness" ] || [ "Liveness" = "StableMarking" ] || [ "Liveness" = "Liveness" ] || [ "Liveness" = "OneSafe" ] ; then
echo "FORMULA_NAME Liveness"
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 ;