Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r303-tall-162124171000001.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2020
Input is CANConstruction-PT-005, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r303-tall-162124171000001
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 20K May 15 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 118K May 15 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 18K May 15 08:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 99K May 15 08:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 12 07:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 12 07:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 12 07:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 12 07:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 08:13 NewModel
-rw-r--r-- 1 mcc users 4.0K May 11 18:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K May 11 18:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.4K May 11 15:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K May 11 15:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 12 04:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 12 04:39 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 08:13 equiv_col
-rw-r--r-- 1 mcc users 4 May 12 08:13 instance
-rw-r--r-- 1 mcc users 6 May 12 08:13 iscolored
-rw-r--r-- 1 mcc users 167K May 12 08:13 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME CANConstruction-PT-005-00
FORMULA_NAME CANConstruction-PT-005-01
FORMULA_NAME CANConstruction-PT-005-02
FORMULA_NAME CANConstruction-PT-005-03
FORMULA_NAME CANConstruction-PT-005-04
FORMULA_NAME CANConstruction-PT-005-05
FORMULA_NAME CANConstruction-PT-005-06
FORMULA_NAME CANConstruction-PT-005-07
FORMULA_NAME CANConstruction-PT-005-08
FORMULA_NAME CANConstruction-PT-005-09
FORMULA_NAME CANConstruction-PT-005-10
FORMULA_NAME CANConstruction-PT-005-11
FORMULA_NAME CANConstruction-PT-005-12
FORMULA_NAME CANConstruction-PT-005-13
FORMULA_NAME CANConstruction-PT-005-14
FORMULA_NAME CANConstruction-PT-005-15

=== Now, execution of the tool begins

BK_START 1621320674186

[2021-05-18 06:51:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-18 06:51:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-18 06:51:16] [INFO ] Load time of PNML (sax parser for PT used): 55 ms
[2021-05-18 06:51:16] [INFO ] Transformed 112 places.
[2021-05-18 06:51:16] [INFO ] Transformed 140 transitions.
[2021-05-18 06:51:16] [INFO ] Parsed PT model containing 112 places and 140 transitions in 97 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 17 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 1310 resets, run finished after 347 ms. (steps per millisecond=288 ) properties seen :[1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 1, 0, 1, 1, 1, 1, 0, 0, 0, 1, 0, 1, 0, 1, 1, 1, 0, 0, 0, 0, 0, 1, 1, 1, 0, 1, 1, 1, 0]
// Phase 1: matrix 140 rows 112 cols
[2021-05-18 06:51:16] [INFO ] Computed 11 place invariants in 6 ms
[2021-05-18 06:51:17] [INFO ] [Real]Absence check using 6 positive place invariants in 57 ms returned unsat
[2021-05-18 06:51:17] [INFO ] [Real]Absence check using 6 positive place invariants in 9 ms returned unsat
[2021-05-18 06:51:17] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned unsat
[2021-05-18 06:51:17] [INFO ] [Real]Absence check using 6 positive place invariants in 7 ms returned sat
[2021-05-18 06:51:17] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 2 ms returned sat
[2021-05-18 06:51:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 06:51:17] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2021-05-18 06:51:17] [INFO ] State equation strengthened by 45 read => feed constraints.
[2021-05-18 06:51:17] [INFO ] [Real]Added 45 Read/Feed constraints in 6 ms returned sat
[2021-05-18 06:51:17] [INFO ] Computed and/alt/rep : 135/305/135 causal constraints in 11 ms.
[2021-05-18 06:51:17] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 06:51:17] [INFO ] [Nat]Absence check using 6 positive place invariants in 14 ms returned sat
[2021-05-18 06:51:17] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 3 ms returned sat
[2021-05-18 06:51:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 06:51:17] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2021-05-18 06:51:17] [INFO ] [Nat]Added 45 Read/Feed constraints in 6 ms returned sat
[2021-05-18 06:51:17] [INFO ] Computed and/alt/rep : 135/305/135 causal constraints in 9 ms.
[2021-05-18 06:51:17] [INFO ] Added : 40 causal constraints over 8 iterations in 116 ms. Result :unsat
[2021-05-18 06:51:17] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned unsat
[2021-05-18 06:51:17] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned unsat
[2021-05-18 06:51:17] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned unsat
[2021-05-18 06:51:17] [INFO ] [Real]Absence check using 6 positive place invariants in 6 ms returned unsat
[2021-05-18 06:51:17] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned unsat
[2021-05-18 06:51:17] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned unsat
[2021-05-18 06:51:17] [INFO ] [Real]Absence check using 6 positive place invariants in 9 ms returned unsat
[2021-05-18 06:51:17] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2021-05-18 06:51:17] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 3 ms returned sat
[2021-05-18 06:51:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 06:51:17] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2021-05-18 06:51:17] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 06:51:17] [INFO ] [Nat]Absence check using 6 positive place invariants in 8 ms returned unsat
[2021-05-18 06:51:17] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned unsat
[2021-05-18 06:51:17] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned unsat
[2021-05-18 06:51:17] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned unsat
[2021-05-18 06:51:17] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned unsat
[2021-05-18 06:51:18] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned unsat
[2021-05-18 06:51:18] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned unsat
Successfully simplified 18 atomic propositions for a total of 21 simplifications.
[2021-05-18 06:51:18] [INFO ] Initial state reduction rules for CTL removed 12 formulas.
[2021-05-18 06:51:18] [INFO ] Flatten gal took : 44 ms
FORMULA CANConstruction-PT-005-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-005-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-005-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-005-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-005-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-005-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-005-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-005-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-005-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-005-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-005-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-005-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-18 06:51:18] [INFO ] Flatten gal took : 13 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2021-05-18 06:51:18] [INFO ] Applying decomposition
[2021-05-18 06:51:18] [INFO ] Flatten gal took : 17 ms
[2021-05-18 06:51:18] [INFO ] Input system was already deterministic with 140 transitions.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 140 rows 112 cols
[2021-05-18 06:51:18] [INFO ] Computed 11 place invariants in 3 ms
inv : Node4ReadyToInsert + Node4DHTinfo + Node4ID + Node4ResZone + Node4IsInserted + Node4DHTinfo2 + Node4ID2 + Node4Bootstrap + Node4JoinMsg + Node4Request + Node4OKshare + Node4NOshare + Node4IsNonInsertedNode + Node0GiveAnswer4 + Node1GiveAnswer4 + Node2GiveAnswer4 + Node3GiveAnswer4 + Node4requestsent0 + Node4requestsent1 + Node4requestsent2 + Node4requestsent3 = 1
inv : -Node1Request + Node1WaitAnswer - Node1OKshare - Node1NOshare - Node0GiveAnswer1 - Node1requestsent0 - Node1requestsent2 - Node1requestsent3 - Node1requestsent4 - Node2GiveAnswer1 - Node3GiveAnswer1 - Node4GiveAnswer1 = 0
inv : Node2ReadyToInsert + Node2DHTinfo + Node2ID + Node2ResZone + Node2IsInserted + Node2DHTinfo2 + Node2ID2 + Node2Bootstrap + Node2JoinMsg + Node2Request + Node2OKshare + Node2NOshare + Node2IsNonInsertedNode + Node0GiveAnswer2 + Node1GiveAnswer2 + Node2requestsent0 + Node2requestsent1 + Node2requestsent3 + Node2requestsent4 + Node3GiveAnswer2 + Node4GiveAnswer2 = 1
inv : Node1ReadyToInsert + Node1DHTinfo + Node1ID + Node1ResZone + Node1IsInserted + Node1DHTinfo2 + Node1ID2 + Node1Bootstrap + Node1JoinMsg + Node1Request + Node1OKshare + Node1NOshare + Node1IsNonInsertedNode + Node0GiveAnswer1 + Node1requestsent0 + Node1requestsent2 + Node1requestsent3 + Node1requestsent4 + Node2GiveAnswer1 + Node3GiveAnswer1 + Node4GiveAnswer1 = 1
inv : -Node2Request + Node2WaitAnswer - Node2OKshare - Node2NOshare - Node0GiveAnswer2 - Node1GiveAnswer2 - Node2requestsent0 - Node2requestsent1 - Node2requestsent3 - Node2requestsent4 - Node3GiveAnswer2 - Node4GiveAnswer2 = 0
inv : -Node4Request + Node4WaitAnswer - Node4OKshare - Node4NOshare - Node0GiveAnswer4 - Node1GiveAnswer4 - Node2GiveAnswer4 - Node3GiveAnswer4 - Node4requestsent0 - Node4requestsent1 - Node4requestsent2 - Node4requestsent3 = 0
inv : InsertedCount + Node0ReadyToInsert + Node0DHTinfo + Node0ID + Node0ResZone + Node0DHTinfo2 + Node0ID2 + Node0Bootstrap + Node0JoinMsg + Node0Request + Node0OKshare + Node0NOshare + Node0IsNonInsertedNode + Node1ReadyToInsert + Node1DHTinfo + Node1ID + Node1ResZone + Node1DHTinfo2 + Node1ID2 + Node1Bootstrap + Node1JoinMsg + Node1Request + Node1OKshare + Node1NOshare + Node1IsNonInsertedNode + Node2ReadyToInsert + Node2DHTinfo + Node2ID + Node2ResZone + Node2DHTinfo2 + Node2ID2 + Node2Bootstrap + Node2JoinMsg + Node2Request + Node2OKshare + Node2NOshare + Node2IsNonInsertedNode + Node3ReadyToInsert + Node3DHTinfo + Node3ID + Node3ResZone + Node3DHTinfo2 + Node3ID2 + Node3Bootstrap + Node3JoinMsg + Node3Request + Node3OKshare + Node3NOshare + Node3IsNonInsertedNode + Node4ReadyToInsert + Node4DHTinfo + Node4ID + Node4ResZone + Node4DHTinfo2 + Node4ID2 + Node4Bootstrap + Node4JoinMsg + Node4Request + Node4OKshare + Node4NOshare + Node4IsNonInsertedNode + Node0requestsent1 + Node0GiveAnswer1 + Node0requestsent2 + Node0GiveAnswer2 + Node0requestsent3 + Node0GiveAnswer3 + Node0requestsent4 + Node0GiveAnswer4 + Node1requestsent0 + Node1GiveAnswer0 + Node1requestsent2 + Node1GiveAnswer2 + Node1requestsent3 + Node1GiveAnswer3 + Node1requestsent4 + Node1GiveAnswer4 + Node2requestsent0 + Node2GiveAnswer0 + Node2requestsent1 + Node2GiveAnswer1 + Node2requestsent3 + Node2GiveAnswer3 + Node2requestsent4 + Node2GiveAnswer4 + Node3requestsent0 + Node3GiveAnswer0 + Node3requestsent1 + Node3GiveAnswer1 + Node3requestsent2 + Node3GiveAnswer2 + Node3requestsent4 + Node3GiveAnswer4 + Node4requestsent0 + Node4GiveAnswer0 + Node4requestsent1 + Node4GiveAnswer1 + Node4requestsent2 + Node4GiveAnswer2 + Node4requestsent3 + Node4GiveAnswer3 = 5
inv : -Node3Request + Node3WaitAnswer - Node3OKshare - Node3NOshare - Node0GiveAnswer3 - Node1GiveAnswer3 - Node2GiveAnswer3 - Node3requestsent0 - Node3requestsent1 - Node3requestsent2 - Node3requestsent4 - Node4GiveAnswer3 = 0
inv : Node0ReadyToInsert + Node0DHTinfo + Node0ID + Node0ResZone + Node0IsInserted + Node0DHTinfo2 + Node0ID2 + Node0Bootstrap + Node0JoinMsg + Node0Request + Node0OKshare + Node0NOshare + Node0IsNonInsertedNode + Node0requestsent1 + Node0requestsent2 + Node0requestsent3 + Node0requestsent4 + Node1GiveAnswer0 + Node2GiveAnswer0 + Node3GiveAnswer0 + Node4GiveAnswer0 = 1
inv : Node3ReadyToInsert + Node3DHTinfo + Node3ID + Node3ResZone + Node3IsInserted + Node3DHTinfo2 + Node3ID2 + Node3Bootstrap + Node3JoinMsg + Node3Request + Node3OKshare + Node3NOshare + Node3IsNonInsertedNode + Node0GiveAnswer3 + Node1GiveAnswer3 + Node2GiveAnswer3 + Node3requestsent0 + Node3requestsent1 + Node3requestsent2 + Node3requestsent4 + Node4GiveAnswer3 = 1
inv : -Node0Request + Node0WaitAnswer - Node0OKshare - Node0NOshare - Node0requestsent1 - Node0requestsent2 - Node0requestsent3 - Node0requestsent4 - Node1GiveAnswer0 - Node2GiveAnswer0 - Node3GiveAnswer0 - Node4GiveAnswer0 = 0
Total of 11 invariants.
[2021-05-18 06:51:18] [INFO ] Computed 11 place invariants in 4 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/convert-linux64, -i, /tmp/graph17225377854124382410.txt, -o, /tmp/graph17225377854124382410.bin, -w, /tmp/graph17225377854124382410.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/louvain-linux64, /tmp/graph17225377854124382410.bin, -l, -1, -v, -w, /tmp/graph17225377854124382410.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-18 06:51:18] [INFO ] Decomposing Gal with order
[2021-05-18 06:51:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-18 06:51:18] [INFO ] Removed a total of 68 redundant transitions.
[2021-05-18 06:51:18] [INFO ] Flatten gal took : 40 ms
[2021-05-18 06:51:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 44 labels/synchronizations in 21 ms.
[2021-05-18 06:51:18] [INFO ] Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 4 ms
[2021-05-18 06:51:18] [INFO ] Time to serialize properties into /home/mcc/execution/LTLCardinality.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /home/mcc/execution/LTLCardinality.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLCardinality.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64 --gc-threshold 2000000 -i /home/mcc/execution/LTLCardinality.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLCardinality.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 4 LTL properties
Checking formula 0 : !((!(F(!(G(!(G((!(X("(gu35.Node4GiveAnswer3<=gu35.Node3ID2)")))U(F("(gi3.gi1.gi0.gu18.Node3DHTinfo2>=1)"))))))))))
Formula 0 simplified : F!G!G(!X"(gu35.Node4GiveAnswer3<=gu35.Node3ID2)" U F"(gi3.gi1.gi0.gu18.Node3DHTinfo2>=1)")
[2021-05-18 06:51:18] [INFO ] Proved 112 variables to be positive in 256 ms
[2021-05-18 06:51:18] [INFO ] Computing symmetric may disable matrix : 140 transitions.
[2021-05-18 06:51:18] [INFO ] Computation of disable matrix completed :0/140 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-18 06:51:18] [INFO ] Computation of Complete disable matrix. took 18 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-18 06:51:18] [INFO ] Computing symmetric may enable matrix : 140 transitions.
[2021-05-18 06:51:18] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-18 06:51:18] [INFO ] Computing symmetric co enabling matrix : 140 transitions.
Reverse transition relation is NOT exact ! Due to transitions gi3.gi0.gi1.gu21.Node0SendAccept3, gi3.gi0.gi1.gu21.Node0SendRefuse3, gi3.gi0.gi1.gu21.Node1SendAccept3, gi3.gi0.gi1.gu21.Node1SendRefuse3, gi3.gi0.gi1.gu21.Node2SendAccept3, gi3.gi0.gi1.gu21.Node2SendRefuse3, gi3.gi1.gi1.gu5.Node2SendAccept0, gi3.gi1.gi1.gu5.Node2SendRefuse0, gi3.gi1.gi1.gu5.Node3SendAccept0, gi3.gi1.gi1.gu5.Node3SendRefuse0, gi3.gi1.gi1.gu5.Node4SendAccept0, gi3.gi1.gi1.gu5.Node4SendRefuse0, gi3.gi1.gi2.gu10.Node0SendAccept1, gi3.gi1.gi2.gu10.Node4SendAccept1, gi3.gi1.gi2.gu33.Node2SendRefuse1, gi3.gi1.gi2.Node4SendRefuse1, gi3.gi1.gi2.Node3SendRefuse1, gi3.gi1.gi2.Node3SendAccept1, gi3.gi1.gi2.Node2SendAccept1, gi3.gi1.gi3.gu14.Node0SendAccept2, gi3.gi1.gi3.gu15.Node3SendRefuse2, gi3.gi1.gi3.gu15.Node4SendRefuse2, gi3.gi1.gi3.Node4SendAccept2, gi3.gi1.gi3.Node1SendRefuse2, gi3.gi1.gi3.Node1SendAccept2, gi3.gi1.gi3.Node0SendRefuse2, gi3.gi1.gi4.gu26.Node1SendAccept4, gi3.gi1.gi4.gu26.Node1SendRefuse4, gi3.gi1.gi4.gu26.Node3SendAccept4, gi3.gi1.gi4.gu26.Node3SendRefuse4, gi3.gi1.gi4.Node0SendRefuse4, gi3.gi1.Node1AssociatesDHTInfo, gi3.gi1.Node1InsertNode, gi3.gi1.Node3AssociatesDHTInfo, gi3.gi1.Node4AssociatesDHTInfo, gi3.Node3InsertNode, Node0AssociatesDHTInfo, Node0InsertNode, Node2AssociatesDHTInfo, Node2InsertNode, Node4InsertNode, Node1SendAccept0, Node2SendRefuse4, Node4SendRefuse3, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/85/44/129
Computing Next relation with stutter on 1 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
275 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,2.78493,99356,1,0,428,375628,288,297,3125,427755,679
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA CANConstruction-PT-005-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((G(X(G(F("(gi2.gu12.Node2IsInserted<=gi2.gu12.Node4requestsent0)"))))))
Formula 1 simplified : !GXGF"(gi2.gu12.Node2IsInserted<=gi2.gu12.Node4requestsent0)"
Computing Next relation with stutter on 1 deadlock states
8 unique states visited
8 strongly connected components in search stack
9 transitions explored
8 items max in DFS search stack
13 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,2.91499,103832,1,0,432,384928,301,313,3286,446826,744
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA CANConstruction-PT-005-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((!(X(((X("(gi5.gu22.Node4ID2<=gi5.gu22.Node4ReadyToInsert)"))||("(gu30.Node1JoinMsg<=gu30.Node1requestsent4)"))U((G("(gu32.Node2GiveAnswer4<=gu32.Node0IsInserted)"))U("(gi3.gi0.gi0.gu16.Node2IsNonInsertedNode>=1)"))))))
Formula 2 simplified : X(("(gu30.Node1JoinMsg<=gu30.Node1requestsent4)" | X"(gi5.gu22.Node4ID2<=gi5.gu22.Node4ReadyToInsert)") U (G"(gu32.Node2GiveAnswer4<=gu32.Node0IsInserted)" U "(gi3.gi0.gi0.gu16.Node2IsNonInsertedNode>=1)"))
Computing Next relation with stutter on 1 deadlock states
[2021-05-18 06:51:21] [INFO ] Computation of co-enabling matrix(9/140) took 2829 ms. Total solver calls (SAT/UNSAT): 1345(1041/304)
20 unique states visited
20 strongly connected components in search stack
21 transitions explored
20 items max in DFS search stack
253 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,5.44755,173508,1,0,611,683237,323,474,3302,842788,1158
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA CANConstruction-PT-005-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((G(!(F(G((X("(gu0.Node1GiveAnswer0<=gu0.Node0ReadyToInsert)"))||("(gu3.Node4DHTinfo<=gu3.Node0JoinMsg)")))))))
Formula 3 simplified : !G!FG("(gu3.Node4DHTinfo<=gu3.Node0JoinMsg)" | X"(gu0.Node1GiveAnswer0<=gu0.Node0ReadyToInsert)")
Computing Next relation with stutter on 1 deadlock states
7 unique states visited
7 strongly connected components in search stack
8 transitions explored
7 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,5.4557,173764,1,0,615,683534,329,478,3306,843270,1179
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA CANConstruction-PT-005-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
[2021-05-18 06:51:24] [INFO ] Computation of co-enabling matrix(19/140) took 5924 ms. Total solver calls (SAT/UNSAT): 2590(1986/604)
Skipping mayMatrices nes/nds SMT solver raised an exception or timeout.
java.lang.RuntimeException: SMT solver raised an exception or timeout.
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeCoEnablingMatrix(NecessaryEnablingsolver.java:482)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:530)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printDependencyMatrix(Gal2PinsTransformerNext.java:209)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.buildBodyFile(Gal2PinsTransformerNext.java:85)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.transform(Gal2PinsTransformerNext.java:831)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:73)
at java.base/java.lang.Thread.run(Thread.java:834)
[2021-05-18 06:51:24] [INFO ] Built C files in 6702ms conformant to PINS in folder :/home/mcc/execution
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit//lts_install_dir//include, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/home/mcc/execution]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.

BK_STOP 1621320686120

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLCardinality -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6

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="CANConstruction-PT-005"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="gold2020"
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-4028"
echo " Executing tool gold2020"
echo " Input is CANConstruction-PT-005, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r303-tall-162124171000001"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CANConstruction-PT-005.tgz
mv CANConstruction-PT-005 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;