Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r233-tall-171649622600129.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-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-5568
Executing tool itstools
Input is LamportFastMutEx-COL-2, examination is Liveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r233-tall-171649622600129
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 464K
-rw-r--r-- 1 mcc users 11K Apr 13 07:34 CTLCardinality.txt
-rw-r--r-- 1 mcc users 112K Apr 13 07:34 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Apr 13 07:33 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Apr 13 07:33 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.1K Apr 13 07:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 71K Apr 13 07:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Apr 13 07:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K Apr 13 07:35 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 22 14:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:51 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_pt
-rw-r--r-- 1 mcc users 2 May 18 16:42 instance
-rw-r--r-- 1 mcc users 5 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 38K May 18 16:42 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 1716538584160

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=Liveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=LamportFastMutEx-COL-2
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
Liveness COL
Running Version 202405141337
[2024-05-24 08:16:25] [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]
[2024-05-24 08:16:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 08:16:25] [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.
[2024-05-24 08:16:25] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-24 08:16:25] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 530 ms
[2024-05-24 08:16:25] [INFO ] Imported 18 HL places and 17 HL transitions for a total of 69 PT places and 117.0 transition bindings in 15 ms.
[2024-05-24 08:16:25] [INFO ] Built PT skeleton of HLPN with 18 places and 17 transitions 68 arcs in 4 ms.
[2024-05-24 08:16:26] [INFO ] Skeletonized 0 HLPN properties in 0 ms.
[2024-05-24 08:16:26] [INFO ] Unfolded HLPN to a Petri net with 69 places and 96 transitions 402 arcs in 13 ms.
[2024-05-24 08:16:26] [INFO ] Unfolded 0 HLPN properties in 0 ms.
[2024-05-24 08:16:26] [INFO ] Unfolded HLPN to a Petri net with 69 places and 96 transitions 402 arcs in 5 ms.
[2024-05-24 08:16:26] [INFO ] Unfolded 17 HLPN properties in 1 ms.
[2024-05-24 08:16:26] [INFO ] Built PT skeleton of HLPN with 18 places and 17 transitions 68 arcs in 0 ms.
[2024-05-24 08:16:26] [INFO ] Skeletonized 17 HLPN properties in 2 ms.
Reduce places removed 3 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 [pid(3), pid(3)] of place P_wait breaks symmetries in sort pid
Symmetric sort wr.t. initial and guards and successors and join/free detected :P_bool
Arc [3:1*[$i, 1]] contains constants of sort P_bool
Transition T_setbi_2 : constants on arcs in [[3:1*[$i, 1]]] introduces in P_bool(2) partition with 1 elements that refines current partition to 2 subsets.
[2024-05-24 08:16:26] [INFO ] Unfolded HLPN to a Petri net with 69 places and 96 transitions 402 arcs in 12 ms.
[2024-05-24 08:16:26] [INFO ] Unfolded 17 HLPN properties in 0 ms.
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 34 transitions.
Built sparse matrix representations for Structural reductions in 0 ms.29140KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 44/44 places, 62/62 transitions.
Computed a total of 1 stabilizing places and 2 stable transitions
Computed a total of 1 stabilizing places and 2 stable transitions
Computed a total of 1 stabilizing places and 2 stable transitions
Applied a total of 0 rules in 11 ms. Remains 44 /44 variables (removed 0) and now considering 62/62 (removed 0) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 22 ms. Remains : 44/44 places, 62/62 transitions.
Starting structural reductions in DEADLOCK mode, iteration 0 : 44/44 places, 62/62 transitions.
Computed a total of 1 stabilizing places and 2 stable transitions
Computed a total of 1 stabilizing places and 2 stable transitions
Computed a total of 1 stabilizing places and 2 stable transitions
Applied a total of 0 rules in 4 ms. Remains 44 /44 variables (removed 0) and now considering 62/62 (removed 0) transitions.
[2024-05-24 08:16:26] [INFO ] Flow matrix only has 56 transitions (discarded 6 similar events)
// Phase 1: matrix 56 rows 44 cols
[2024-05-24 08:16:26] [INFO ] Computed 10 invariants in 9 ms
[2024-05-24 08:16:26] [INFO ] Implicit Places using invariants in 165 ms returned []
[2024-05-24 08:16:26] [INFO ] Flow matrix only has 56 transitions (discarded 6 similar events)
[2024-05-24 08:16:26] [INFO ] Invariant cache hit.
[2024-05-24 08:16:26] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-05-24 08:16:26] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 283 ms to find 0 implicit places.
[2024-05-24 08:16:26] [INFO ] Redundant transitions in 1 ms returned []
Running 60 sub problems to find dead transitions.
[2024-05-24 08:16:26] [INFO ] Flow matrix only has 56 transitions (discarded 6 similar events)
[2024-05-24 08:16:26] [INFO ] Invariant cache hit.
[2024-05-24 08:16:26] [INFO ] State equation strengthened by 16 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-05-24 08:16:26] [INFO ] Deduced a trap composed of 9 places in 101 ms of which 16 ms to minimize.
Problem TDEAD2 is UNSAT
[2024-05-24 08:16:26] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-05-24 08:16:26] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
[2024-05-24 08:16:26] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
Problem TDEAD3 is UNSAT
[2024-05-24 08:16:26] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
Problem TDEAD10 is UNSAT
[2024-05-24 08:16:27] [INFO ] Deduced a trap composed of 8 places in 82 ms of which 1 ms to minimize.
Problem TDEAD13 is UNSAT
[2024-05-24 08:16:27] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 1 ms to minimize.
Problem TDEAD14 is UNSAT
[2024-05-24 08:16:27] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 0 ms to minimize.
Problem TDEAD15 is UNSAT
[2024-05-24 08:16:27] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 1 ms to minimize.
[2024-05-24 08:16:27] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
[2024-05-24 08:16:27] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
[2024-05-24 08:16:27] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 1 ms to minimize.
Problem TDEAD24 is UNSAT
Problem TDEAD27 is UNSAT
[2024-05-24 08:16:27] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-05-24 08:16:27] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
Problem TDEAD28 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
[2024-05-24 08:16:27] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
[2024-05-24 08:16:27] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
[2024-05-24 08:16:27] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 0 ms to minimize.
[2024-05-24 08:16:27] [INFO ] Deduced a trap composed of 11 places in 21 ms of which 0 ms to minimize.
[2024-05-24 08:16:27] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 19/29 constraints. Problems are: Problem set: 12 solved, 48 unsolved
[2024-05-24 08:16:27] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 0 ms to minimize.
[2024-05-24 08:16:27] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 2/31 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 0/31 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 4 (OVERLAPS) 56/100 variables, 44/75 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 16/91 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 0/91 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 7 (OVERLAPS) 0/100 variables, 0/91 constraints. Problems are: Problem set: 12 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Real declared 100/100 variables, and 91 constraints, problems are : Problem set: 12 solved, 48 unsolved in 1746 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 44/44 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 12 solved, 48 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 4/4 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 13/17 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/17 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 3 (OVERLAPS) 2/44 variables, 6/23 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 8/31 constraints. Problems are: Problem set: 12 solved, 48 unsolved
[2024-05-24 08:16:28] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 1/32 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/44 variables, 0/32 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 7 (OVERLAPS) 56/100 variables, 44/76 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/100 variables, 16/92 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/100 variables, 48/140 constraints. Problems are: Problem set: 12 solved, 48 unsolved
[2024-05-24 08:16:28] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/100 variables, 1/141 constraints. Problems are: Problem set: 12 solved, 48 unsolved
[2024-05-24 08:16:28] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/100 variables, 1/142 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/100 variables, 0/142 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 13 (OVERLAPS) 0/100 variables, 0/142 constraints. Problems are: Problem set: 12 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Int declared 100/100 variables, and 142 constraints, problems are : Problem set: 12 solved, 48 unsolved in 1250 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 44/44 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 48/60 constraints, Known Traps: 24/24 constraints]
After SMT, in 3072ms problems are : Problem set: 12 solved, 48 unsolved
Search for dead transitions found 12 dead transitions in 3081ms
Found 12 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 12 transitions
Dead transitions reduction (with SMT) removed 12 transitions
Starting structural reductions in DEADLOCK mode, iteration 1 : 44/44 places, 50/62 transitions.
Computed a total of 1 stabilizing places and 2 stable transitions
Computed a total of 1 stabilizing places and 2 stable transitions
Computed a total of 1 stabilizing places and 2 stable transitions
Applied a total of 0 rules in 8 ms. Remains 44 /44 variables (removed 0) and now considering 50/50 (removed 0) transitions.
[2024-05-24 08:16:29] [INFO ] Redundant transitions in 0 ms returned []
Finished structural reductions in DEADLOCK mode , in 2 iterations and 3393 ms. Remains : 44/44 places, 50/62 transitions.
Random walk for 1250000 steps, including 0 resets, run took 930 ms (no deadlock found). (steps per millisecond=1344 )
Random directed walk for 1250000 steps, including 0 resets, run took 635 ms (no deadlock found). (steps per millisecond=1968 )
[2024-05-24 08:16:31] [INFO ] Flow matrix only has 48 transitions (discarded 2 similar events)
// Phase 1: matrix 48 rows 44 cols
[2024-05-24 08:16:31] [INFO ] Computed 10 invariants in 3 ms
[2024-05-24 08:16:31] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-05-24 08:16:31] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2024-05-24 08:16:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 08:16:31] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-05-24 08:16:31] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2024-05-24 08:16:31] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-24 08:16:31] [INFO ] [Nat]Added 14 Read/Feed constraints in 2 ms returned sat
[2024-05-24 08:16:31] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
[2024-05-24 08:16:31] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 0 ms to minimize.
[2024-05-24 08:16:31] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
[2024-05-24 08:16:31] [INFO ] Deduced a trap composed of 8 places in 18 ms of which 2 ms to minimize.
[2024-05-24 08:16:31] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
[2024-05-24 08:16:31] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 2 ms to minimize.
[2024-05-24 08:16:31] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 9 ms to minimize.
[2024-05-24 08:16:31] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 1 ms to minimize.
[2024-05-24 08:16:31] [INFO ] Deduced a trap composed of 8 places in 18 ms of which 1 ms to minimize.
[2024-05-24 08:16:31] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 1 ms to minimize.
[2024-05-24 08:16:31] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-05-24 08:16:31] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 0 ms to minimize.
[2024-05-24 08:16:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 12 trap constraints in 369 ms
[2024-05-24 08:16:31] [INFO ] Unfolded HLPN to a Petri net with 69 places and 96 transitions 402 arcs in 7 ms.
[2024-05-24 08:16:31] [INFO ] Unfolded 17 HLPN properties in 0 ms.
Initial state reduction rules removed 1 formulas.
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 34 transitions.
RANDOM walk for 347 steps (0 resets) in 44 ms. (7 steps per ms) remains 0/16 properties
[2024-05-24 08:16:31] [INFO ] Flatten gal took : 43 ms
[2024-05-24 08:16:31] [INFO ] Flatten gal took : 14 ms
[2024-05-24 08:16:31] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8492338079593606044.gal : 35 ms
[2024-05-24 08:16:31] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4292409388332340364.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality8492338079593606044.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4292409388332340364.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
ITS tools runner thread asked to quit. Dying gracefully.
Able to resolve query QuasiLiveness after proving 17 properties.
Net is quasi-live, checking if it is reversible to establish liveness.
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 34 transitions.
[2024-05-24 08:16:31] [INFO ] Flatten gal took : 6 ms
[2024-05-24 08:16:31] [INFO ] Flatten gal took : 6 ms
[2024-05-24 08:16:31] [INFO ] Time to serialize gal into /tmp/CTLFireability8271970972935937612.gal : 2 ms
[2024-05-24 08:16:31] [INFO ] Time to serialize properties into /tmp/CTLFireability15036869329333044636.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8271970972935937612.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15036869329333044636.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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,380,0.041391,4092,2,479,5,2275,6,0,240,2421,0


Converting to forward existential form...Done !
original formula: AG(EF((((((((P_start_1_1==1)&&(P_start_1_2==1))&&((x_0==1)&&(x_1==0)))&&(((x_2==0)&&(y_0==1))&&((y_1==0)&&(y_2==0))))&&((((P_b_2==1)&&(P_...802
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (((((((P_start_1_1==1)&&(P_start_1_2==1))&&((x_0==1)&&(x_1==0)))&&(((x_2==0)&&(y_...862
Reverse transition relation is NOT exact ! Due to transitions T_setx_3i1x0, T_setx_3i1x1, T_setx_3i1x2, T_setx_3i2x0, T_setx_3i2x1, T_setx_3i2x2, T_awaityi...551
(forward)formula 0,0,0.157908,6192,1,0,127,12746,131,52,1669,10148,118
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 34 transitions.
[2024-05-24 08:16:32] [INFO ] Flatten gal took : 20 ms
[2024-05-24 08:16:32] [INFO ] Flatten gal took : 6 ms
[2024-05-24 08:16:32] [INFO ] Time to serialize gal into /tmp/CTLFireability14205909599257996801.gal : 2 ms
[2024-05-24 08:16:32] [INFO ] Time to serialize properties into /tmp/CTLFireability6998611398134665997.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14205909599257996801.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6998611398134665997.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 17 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,380,0.018606,4164,2,479,5,2275,6,0,240,2421,0


Converting to forward existential form...Done !
original formula: AG(EF(((((P_start_1_2>=1)&&(P_b_5>=1))||((P_start_1_2>=1)&&(P_b_4>=1)))||(((P_start_1_1>=1)&&(P_b_3>=1))||((P_start_1_1>=1)&&(P_b_2>=1)))...158
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((((P_start_1_2>=1)&&(P_b_5>=1))||((P_start_1_2>=1)&&(P_b_4>=1)))||(((P_start_1_1...218
Reverse transition relation is NOT exact ! Due to transitions T_setx_3i1x0, T_setx_3i1x1, T_setx_3i1x2, T_setx_3i2x0, T_setx_3i2x1, T_setx_3i2x2, T_awaityi...551
(forward)formula 0,1,0.158282,7860,1,0,138,22073,131,58,1596,19010,138
Formula is TRUE !

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

original formula: AG(EF((((((x_1>=1)&&(P_setx_3_2>=1))||((x_1>=1)&&(P_setx_3_1>=1)))||(((x_2>=1)&&(P_setx_3_1>=1))||((x_2>=1)&&(P_setx_3_2>=1))))||(((x_0>=...208
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (((((x_1>=1)&&(P_setx_3_2>=1))||((x_1>=1)&&(P_setx_3_1>=1)))||(((x_2>=1)&&(P_setx...268
(forward)formula 1,1,0.174893,8652,1,0,151,26099,132,64,1599,23065,155
Formula is TRUE !

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

original formula: AG(EF(((((y_1>=1)&&(P_ify0_4_1>=1))||((y_1>=1)&&(P_ify0_4_2>=1)))||(((y_2>=1)&&(P_ify0_4_1>=1))||((y_2>=1)&&(P_ify0_4_2>=1))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((((y_1>=1)&&(P_ify0_4_1>=1))||((y_1>=1)&&(P_ify0_4_2>=1)))||(((y_2>=1)&&(P_ify0_...206
(forward)formula 2,1,0.22825,11028,1,0,182,39446,133,81,1601,35496,201
Formula is TRUE !

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

original formula: AG(EF(((((P_b_3>=1)&&(P_setbi_5_1>=1))||((P_b_5>=1)&&(P_setbi_5_2>=1)))||(((P_b_4>=1)&&(P_setbi_5_2>=1))||((P_b_2>=1)&&(P_setbi_5_1>=1)))...158
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((((P_b_3>=1)&&(P_setbi_5_1>=1))||((P_b_5>=1)&&(P_setbi_5_2>=1)))||(((P_b_4>=1)&&...218
(forward)formula 3,1,0.254728,12348,1,0,209,46904,134,95,1604,43443,237
Formula is TRUE !

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

original formula: AG(EF((((y_0>=1)&&(P_awaity_1>=1))||((y_0>=1)&&(P_awaity_2>=1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (((y_0>=1)&&(P_awaity_1>=1))||((y_0>=1)&&(P_awaity_2>=1))))))] = FALSE
(forward)formula 4,1,0.30438,14196,1,0,228,57206,135,107,1605,53041,268
Formula is TRUE !

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

original formula: AG(EF((((y_0>=1)&&(P_ify0_4_1>=1))||((y_0>=1)&&(P_ify0_4_2>=1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (((y_0>=1)&&(P_ify0_4_1>=1))||((y_0>=1)&&(P_ify0_4_2>=1))))))] = FALSE
(forward)formula 5,1,0.328931,15780,1,0,244,64017,136,116,1606,59865,294
Formula is TRUE !

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

original formula: AG(EF((((((y_2>=1)&&(P_sety_9_2>=1))||((y_0>=1)&&(P_sety_9_1>=1)))||(((y_2>=1)&&(P_sety_9_1>=1))||((y_1>=1)&&(P_sety_9_1>=1))))||(((y_1>=...208
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (((((y_2>=1)&&(P_sety_9_2>=1))||((y_0>=1)&&(P_sety_9_1>=1)))||(((y_2>=1)&&(P_sety...268
(forward)formula 6,1,0.361224,16672,1,0,259,67735,137,124,1609,63681,315
Formula is TRUE !

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

original formula: AG(EF(((((x_0>=1)&&(P_ifxi_10_2>=1))||((x_2>=1)&&(P_ifxi_10_1>=1)))||(((x_0>=1)&&(P_ifxi_10_1>=1))||((x_1>=1)&&(P_ifxi_10_2>=1))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((((x_0>=1)&&(P_ifxi_10_2>=1))||((x_2>=1)&&(P_ifxi_10_1>=1)))||(((x_0>=1)&&(P_ifx...210
(forward)formula 7,1,0.391235,17992,1,0,290,77206,138,141,1611,72685,361
Formula is TRUE !

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

original formula: AG(EF(((((P_b_4>=1)&&(P_setbi_11_2>=1))||((P_b_3>=1)&&(P_setbi_11_1>=1)))||(((P_b_5>=1)&&(P_setbi_11_2>=1))||((P_b_2>=1)&&(P_setbi_11_1>=...162
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((((P_b_4>=1)&&(P_setbi_11_2>=1))||((P_b_3>=1)&&(P_setbi_11_1>=1)))||(((P_b_5>=1)...222
(forward)formula 8,1,0.416193,19048,1,0,322,83785,139,158,1614,79601,407
Formula is TRUE !

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

original formula: AG(EF(((P_fordo_12_1>=1)||(P_fordo_12_2>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((P_fordo_12_1>=1)||(P_fordo_12_2>=1)))))] = FALSE
(forward)formula 9,1,0.434739,19840,1,0,354,89161,140,175,1615,84551,453
Formula is TRUE !

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

original formula: AG(EF((((((P_b_2>=1)&&(P_wait_7>=1))&&(P_await_13_2>=1))||(((P_b_4>=1)&&(P_wait_8>=1))&&(P_await_13_2>=1)))||((((P_b_4>=1)&&(P_wait_5>=1)...230
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (((((P_b_2>=1)&&(P_wait_7>=1))&&(P_await_13_2>=1))||(((P_b_4>=1)&&(P_wait_8>=1))&...290
(forward)formula 10,1,0.451124,20632,1,0,382,92694,141,189,1621,88977,490
Formula is TRUE !

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

original formula: AG(EF(((((P_await_13_1>=1)&&(P_done_4>=1))&&(P_done_5>=1))||(((P_await_13_2>=1)&&(P_done_7>=1))&&(P_done_8>=1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((((P_await_13_1>=1)&&(P_done_4>=1))&&(P_done_5>=1))||(((P_await_13_2>=1)&&(P_don...192
(forward)formula 11,1,0.469454,21424,1,0,409,96924,142,203,1624,93656,526
Formula is TRUE !

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

original formula: AG(EF(((((y_2>=1)&&(P_ifyi_15_1>=1))||((y_0>=1)&&(P_ifyi_15_1>=1)))||(((y_1>=1)&&(P_ifyi_15_2>=1))||((y_0>=1)&&(P_ifyi_15_2>=1))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((((y_2>=1)&&(P_ifyi_15_1>=1))||((y_0>=1)&&(P_ifyi_15_1>=1)))||(((y_1>=1)&&(P_ify...210
(forward)formula 12,1,0.498259,22480,1,0,437,103336,143,221,1626,99924,573
Formula is TRUE !

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

original formula: AG(EF((((y_2>=1)&&(P_ifyi_15_2>=1))||((y_1>=1)&&(P_ifyi_15_1>=1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (((y_2>=1)&&(P_ifyi_15_2>=1))||((y_1>=1)&&(P_ifyi_15_1>=1))))))] = FALSE
(forward)formula 13,1,0.564553,23800,1,0,462,109688,144,235,1627,106514,608
Formula is TRUE !

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

original formula: AG(EF((((x_1>=1)&&(P_ifxi_10_1>=1))||((x_2>=1)&&(P_ifxi_10_2>=1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (((x_1>=1)&&(P_ifxi_10_1>=1))||((x_2>=1)&&(P_ifxi_10_2>=1))))))] = FALSE
(forward)formula 14,1,0.582439,24856,1,0,477,114558,145,243,1628,111351,630
Formula is TRUE !

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

original formula: AG(EF((((((y_1>=1)&&(P_CS_21_2>=1))||((y_0>=1)&&(P_CS_21_1>=1)))||(((y_0>=1)&&(P_CS_21_2>=1))||((y_2>=1)&&(P_CS_21_1>=1))))||(((y_2>=1)&&...202
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (((((y_1>=1)&&(P_CS_21_2>=1))||((y_0>=1)&&(P_CS_21_1>=1)))||(((y_0>=1)&&(P_CS_21_...262
(forward)formula 15,1,0.607141,25912,1,0,490,120666,146,249,1631,117241,647
Formula is TRUE !

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

original formula: AG(EF(((((P_b_3>=1)&&(P_setbi_24_1>=1))||((P_b_5>=1)&&(P_setbi_24_2>=1)))||(((P_b_4>=1)&&(P_setbi_24_2>=1))||((P_b_2>=1)&&(P_setbi_24_1>=...162
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((((P_b_3>=1)&&(P_setbi_24_1>=1))||((P_b_5>=1)&&(P_setbi_24_2>=1)))||(((P_b_4>=1)...222
(forward)formula 16,1,0.628524,26968,1,0,502,125982,147,255,1634,122747,664
Formula is TRUE !

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

Able to resolve query Liveness after proving 18 properties.
FORMULA Liveness TRUE TECHNIQUES RANDOM_WALK DECISION_DIAGRAMS TOPOLOGICAL INITIAL_STATE
Total runtime 7501 ms.

BK_STOP 1716538592875

--------------------
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
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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="LamportFastMutEx-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-5568"
echo " Executing tool itstools"
echo " Input is LamportFastMutEx-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 r233-tall-171649622600129"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/LamportFastMutEx-COL-2.tgz
mv LamportFastMutEx-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.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property Liveness.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -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 ;