Execution Chart

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

Trace from the execution

Waiting for the VM to be ready (probing ssh)
...............................................................
/home/mcc/execution
total 384K
-rw-r--r-- 1 mcc users 8.5K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 33K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 24K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 5.9K May 26 09:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 19K May 26 09:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K May 26 09:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 26 09:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 35K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 104 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 342 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 12K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 42K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.7K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.9K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 2 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 98K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool itstoolsl
Input is Peterson-PT-2, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r261-csrt-152732586000159
=====================================================================

--------------------
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 Peterson-PT-2-LTLCardinality-00
FORMULA_NAME Peterson-PT-2-LTLCardinality-01
FORMULA_NAME Peterson-PT-2-LTLCardinality-02
FORMULA_NAME Peterson-PT-2-LTLCardinality-03
FORMULA_NAME Peterson-PT-2-LTLCardinality-04
FORMULA_NAME Peterson-PT-2-LTLCardinality-05
FORMULA_NAME Peterson-PT-2-LTLCardinality-06
FORMULA_NAME Peterson-PT-2-LTLCardinality-07
FORMULA_NAME Peterson-PT-2-LTLCardinality-08
FORMULA_NAME Peterson-PT-2-LTLCardinality-09
FORMULA_NAME Peterson-PT-2-LTLCardinality-10
FORMULA_NAME Peterson-PT-2-LTLCardinality-11
FORMULA_NAME Peterson-PT-2-LTLCardinality-12
FORMULA_NAME Peterson-PT-2-LTLCardinality-13
FORMULA_NAME Peterson-PT-2-LTLCardinality-14
FORMULA_NAME Peterson-PT-2-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1527504640114

Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201805241334/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], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201805241334/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
Read 16 LTL properties
Checking formula 0 : !(((X(G("((((((Turn_0_0+Turn_1_2)+Turn_0_1)+Turn_1_0)+Turn_0_2)+Turn_1_1)>=2)")))U(G(F("(((Idle_0+Idle_2)+Idle_1)>=3)")))))
Formula 0 simplified : !(XG"((((((Turn_0_0+Turn_1_2)+Turn_0_1)+Turn_1_0)+Turn_0_2)+Turn_1_1)>=2)" U GF"(((Idle_0+Idle_2)+Idle_1)>=3)")
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 120
// Phase 1: matrix 120 rows 102 cols
invariant :WantSection_2_T + Idle_2 = 1
invariant :WantSection_0_F + -1'Idle_0 = 0
invariant :Turn_1_2 + Turn_1_0 + Turn_1_1 = 1
invariant :IsEndLoop_2_0_0 + IsEndLoop_2_1_0 + IsEndLoop_2_0_1 + IsEndLoop_2_1_1 + IsEndLoop_2_0_2 + IsEndLoop_2_1_2 + EndTurn_2_0 + EndTurn_2_1 + BeginLoop_2_0_0 + BeginLoop_2_0_1 + BeginLoop_2_1_0 + BeginLoop_2_1_1 + BeginLoop_2_0_2 + BeginLoop_2_1_2 + TestAlone_2_1_0 + TestAlone_2_0_0 + TestAlone_2_1_1 + TestAlone_2_0_1 + TestTurn_2_1 + TestIdentity_2_0_0 + TestTurn_2_0 + TestIdentity_2_0_1 + TestIdentity_2_1_0 + TestIdentity_2_1_2 + TestIdentity_2_1_1 + TestIdentity_2_0_2 + Idle_2 + AskForSection_2_1 + AskForSection_2_0 + CS_2 = 1
invariant :WantSection_1_T + Idle_1 = 1
invariant :Turn_0_0 + Turn_0_1 + Turn_0_2 = 1
invariant :WantSection_0_T + Idle_0 = 1
invariant :IsEndLoop_1_0_0 + IsEndLoop_1_1_0 + IsEndLoop_1_0_1 + IsEndLoop_1_1_1 + IsEndLoop_1_0_2 + IsEndLoop_1_1_2 + EndTurn_1_0 + EndTurn_1_1 + BeginLoop_1_0_0 + BeginLoop_1_1_0 + BeginLoop_1_0_1 + BeginLoop_1_1_1 + BeginLoop_1_1_2 + BeginLoop_1_0_2 + TestAlone_1_0_0 + TestAlone_1_1_0 + TestAlone_1_1_2 + TestAlone_1_0_2 + TestIdentity_1_0_0 + TestTurn_1_0 + TestTurn_1_1 + TestIdentity_1_0_1 + TestIdentity_1_1_1 + TestIdentity_1_1_0 + TestIdentity_1_1_2 + TestIdentity_1_0_2 + Idle_1 + CS_1 + AskForSection_1_1 + AskForSection_1_0 = 1
invariant :WantSection_2_F + -1'Idle_2 = 0
invariant :IsEndLoop_0_0_0 + IsEndLoop_0_1_0 + IsEndLoop_0_0_1 + IsEndLoop_0_1_1 + IsEndLoop_0_0_2 + IsEndLoop_0_1_2 + EndTurn_0_0 + EndTurn_0_1 + BeginLoop_0_0_0 + BeginLoop_0_1_0 + BeginLoop_0_0_1 + BeginLoop_0_0_2 + BeginLoop_0_1_1 + BeginLoop_0_1_2 + TestAlone_0_0_1 + TestAlone_0_0_2 + TestAlone_0_1_1 + TestTurn_0_0 + TestAlone_0_1_2 + TestIdentity_0_0_0 + TestTurn_0_1 + TestIdentity_0_1_1 + TestIdentity_0_1_0 + TestIdentity_0_0_1 + TestIdentity_0_1_2 + TestIdentity_0_0_2 + Idle_0 + CS_0 + AskForSection_0_1 + AskForSection_0_0 = 1
invariant :WantSection_1_F + -1'Idle_1 = 0
Reverse transition relation is NOT exact ! Due to transitions EndLoop_1_0, EndLoop_2_0, EndLoop_0_0, NotAlone_0_2_0, NotAlone_2_1_0, NotAlone_1_2_0, NotAlone_2_1_1, NotAlone_0_2_1, NotAlone_1_2_1, UpdateTurn_0_0_0, UpdateTurn_1_0_0, UpdateTurn_1_1_0, UpdateTurn_2_1_0, UpdateTurn_2_0_0, UpdateTurn_0_1_0, UpdateTurn_0_2_1, UpdateTurn_2_1_1, UpdateTurn_2_2_1, UpdateTurn_1_2_1, UpdateTurn_2_0_1, UpdateTurn_1_0_1, UpdateTurn_1_1_1, UpdateTurn_0_1_1, UpdateTurn_1_2_0, UpdateTurn_0_2_0, UpdateTurn_0_0_1, UpdateTurn_2_2_0, BecomeIdle_2, BecomeIdle_1, BecomeIdle_0, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/96/30/126
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
153 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,1.55698,62560,1,0,289,198760,282,130,3291,192077,362
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Peterson-PT-2-LTLCardinality-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !(("((((((((((((TestAlone_1_0_0+TestAlone_0_0_1)+TestAlone_2_1_0)+TestAlone_1_1_0)+TestAlone_2_0_0)+TestAlone_0_0_2)+TestAlone_2_1_1)+TestAlone_0_1_1)+TestAlone_2_0_1)+TestAlone_1_1_2)+TestAlone_0_1_2)+TestAlone_1_0_2)<=(((((AskForSection_1_1+AskForSection_2_1)+AskForSection_2_0)+AskForSection_0_1)+AskForSection_0_0)+AskForSection_1_0))"))
Formula 1 simplified : !"((((((((((((TestAlone_1_0_0+TestAlone_0_0_1)+TestAlone_2_1_0)+TestAlone_1_1_0)+TestAlone_2_0_0)+TestAlone_0_0_2)+TestAlone_2_1_1)+TestAlone_0_1_1)+TestAlone_2_0_1)+TestAlone_1_1_2)+TestAlone_0_1_2)+TestAlone_1_0_2)<=(((((AskForSection_1_1+AskForSection_2_1)+AskForSection_2_0)+AskForSection_0_1)+AskForSection_0_0)+AskForSection_1_0))"
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
0 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,1.55893,62560,1,0,289,198760,285,130,3310,192077,364
no accepting run found
Formula 1 is TRUE no accepting run found.
FORMULA Peterson-PT-2-LTLCardinality-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((("((((((TestTurn_0_0+TestTurn_2_1)+TestTurn_1_0)+TestTurn_2_0)+TestTurn_0_1)+TestTurn_1_1)>=2)")U(X("((((((Turn_0_0+Turn_1_2)+Turn_0_1)+Turn_1_0)+Turn_0_2)+Turn_1_1)>=3)"))))
Formula 2 simplified : !("((((((TestTurn_0_0+TestTurn_2_1)+TestTurn_1_0)+TestTurn_2_0)+TestTurn_0_1)+TestTurn_1_1)>=2)" U X"((((((Turn_0_0+Turn_1_2)+Turn_0_1)+Turn_1_0)+Turn_0_2)+Turn_1_1)>=3)")
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
3 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,1.59738,63704,1,0,291,201473,294,130,3329,197112,380
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA Peterson-PT-2-LTLCardinality-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((X((X("((((((((((((((((((TestIdentity_0_0_0+TestIdentity_1_0_0)+TestIdentity_2_0_0)+TestIdentity_1_0_1)+TestIdentity_2_0_1)+TestIdentity_0_1_1)+TestIdentity_1_1_1)+TestIdentity_0_1_0)+TestIdentity_1_1_0)+TestIdentity_2_1_0)+TestIdentity_0_0_1)+TestIdentity_1_1_2)+TestIdentity_0_1_2)+TestIdentity_2_1_2)+TestIdentity_0_0_2)+TestIdentity_2_1_1)+TestIdentity_2_0_2)+TestIdentity_1_0_2)>=2)"))U(F("((((((((((((((((((BeginLoop_0_0_0+BeginLoop_2_0_0)+BeginLoop_1_0_0)+BeginLoop_1_1_0)+BeginLoop_0_1_0)+BeginLoop_1_0_1)+BeginLoop_2_0_1)+BeginLoop_2_1_0)+BeginLoop_0_0_1)+BeginLoop_2_1_1)+BeginLoop_0_0_2)+BeginLoop_0_1_1)+BeginLoop_1_1_1)+BeginLoop_0_1_2)+BeginLoop_1_1_2)+BeginLoop_1_0_2)+BeginLoop_2_0_2)+BeginLoop_2_1_2)<=(((((((((((((((((TestIdentity_0_0_0+TestIdentity_1_0_0)+TestIdentity_2_0_0)+TestIdentity_1_0_1)+TestIdentity_2_0_1)+TestIdentity_0_1_1)+TestIdentity_1_1_1)+TestIdentity_0_1_0)+TestIdentity_1_1_0)+TestIdentity_2_1_0)+TestIdentity_0_0_1)+TestIdentity_1_1_2)+TestIdentity_0_1_2)+TestIdentity_2_1_2)+TestIdentity_0_0_2)+TestIdentity_2_1_1)+TestIdentity_2_0_2)+TestIdentity_1_0_2))")))))
Formula 3 simplified : !X(X"((((((((((((((((((TestIdentity_0_0_0+TestIdentity_1_0_0)+TestIdentity_2_0_0)+TestIdentity_1_0_1)+TestIdentity_2_0_1)+TestIdentity_0_1_1)+TestIdentity_1_1_1)+TestIdentity_0_1_0)+TestIdentity_1_1_0)+TestIdentity_2_1_0)+TestIdentity_0_0_1)+TestIdentity_1_1_2)+TestIdentity_0_1_2)+TestIdentity_2_1_2)+TestIdentity_0_0_2)+TestIdentity_2_1_1)+TestIdentity_2_0_2)+TestIdentity_1_0_2)>=2)" U F"((((((((((((((((((BeginLoop_0_0_0+BeginLoop_2_0_0)+BeginLoop_1_0_0)+BeginLoop_1_1_0)+BeginLoop_0_1_0)+BeginLoop_1_0_1)+BeginLoop_2_0_1)+BeginLoop_2_1_0)+BeginLoop_0_0_1)+BeginLoop_2_1_1)+BeginLoop_0_0_2)+BeginLoop_0_1_1)+BeginLoop_1_1_1)+BeginLoop_0_1_2)+BeginLoop_1_1_2)+BeginLoop_1_0_2)+BeginLoop_2_0_2)+BeginLoop_2_1_2)<=(((((((((((((((((TestIdentity_0_0_0+TestIdentity_1_0_0)+TestIdentity_2_0_0)+TestIdentity_1_0_1)+TestIdentity_2_0_1)+TestIdentity_0_1_1)+TestIdentity_1_1_1)+TestIdentity_0_1_0)+TestIdentity_1_1_0)+TestIdentity_2_1_0)+TestIdentity_0_0_1)+TestIdentity_1_1_2)+TestIdentity_0_1_2)+TestIdentity_2_1_2)+TestIdentity_0_0_2)+TestIdentity_2_1_1)+TestIdentity_2_0_2)+TestIdentity_1_0_2))")
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 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,1.6007,63968,1,0,291,201473,303,130,3367,197112,384
no accepting run found
Formula 3 is TRUE no accepting run found.
FORMULA Peterson-PT-2-LTLCardinality-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((G(X(F(X("((((((((((((TestAlone_1_0_0+TestAlone_0_0_1)+TestAlone_2_1_0)+TestAlone_1_1_0)+TestAlone_2_0_0)+TestAlone_0_0_2)+TestAlone_2_1_1)+TestAlone_0_1_1)+TestAlone_2_0_1)+TestAlone_1_1_2)+TestAlone_0_1_2)+TestAlone_1_0_2)<=(((((((((((((((((BeginLoop_0_0_0+BeginLoop_2_0_0)+BeginLoop_1_0_0)+BeginLoop_1_1_0)+BeginLoop_0_1_0)+BeginLoop_1_0_1)+BeginLoop_2_0_1)+BeginLoop_2_1_0)+BeginLoop_0_0_1)+BeginLoop_2_1_1)+BeginLoop_0_0_2)+BeginLoop_0_1_1)+BeginLoop_1_1_1)+BeginLoop_0_1_2)+BeginLoop_1_1_2)+BeginLoop_1_0_2)+BeginLoop_2_0_2)+BeginLoop_2_1_2))"))))))
Formula 4 simplified : !GXFX"((((((((((((TestAlone_1_0_0+TestAlone_0_0_1)+TestAlone_2_1_0)+TestAlone_1_1_0)+TestAlone_2_0_0)+TestAlone_0_0_2)+TestAlone_2_1_1)+TestAlone_0_1_1)+TestAlone_2_0_1)+TestAlone_1_1_2)+TestAlone_0_1_2)+TestAlone_1_0_2)<=(((((((((((((((((BeginLoop_0_0_0+BeginLoop_2_0_0)+BeginLoop_1_0_0)+BeginLoop_1_1_0)+BeginLoop_0_1_0)+BeginLoop_1_0_1)+BeginLoop_2_0_1)+BeginLoop_2_1_0)+BeginLoop_0_0_1)+BeginLoop_2_1_1)+BeginLoop_0_0_2)+BeginLoop_0_1_1)+BeginLoop_1_1_1)+BeginLoop_0_1_2)+BeginLoop_1_1_2)+BeginLoop_1_0_2)+BeginLoop_2_0_2)+BeginLoop_2_1_2))"
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
82 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.41746,90276,1,0,317,311992,312,131,3970,316772,457
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA Peterson-PT-2-LTLCardinality-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !(("((((((WantSection_1_T+WantSection_2_T)+WantSection_0_T)+WantSection_2_F)+WantSection_1_F)+WantSection_0_F)>=1)"))
Formula 5 simplified : !"((((((WantSection_1_T+WantSection_2_T)+WantSection_0_T)+WantSection_2_F)+WantSection_1_F)+WantSection_0_F)>=1)"
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
0 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.41846,90276,1,0,317,311992,315,131,3977,316772,459
no accepting run found
Formula 5 is TRUE no accepting run found.
FORMULA Peterson-PT-2-LTLCardinality-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !(("((((((((((((((((((TestIdentity_0_0_0+TestIdentity_1_0_0)+TestIdentity_2_0_0)+TestIdentity_1_0_1)+TestIdentity_2_0_1)+TestIdentity_0_1_1)+TestIdentity_1_1_1)+TestIdentity_0_1_0)+TestIdentity_1_1_0)+TestIdentity_2_1_0)+TestIdentity_0_0_1)+TestIdentity_1_1_2)+TestIdentity_0_1_2)+TestIdentity_2_1_2)+TestIdentity_0_0_2)+TestIdentity_2_1_1)+TestIdentity_2_0_2)+TestIdentity_1_0_2)<=(((((((((((TestAlone_1_0_0+TestAlone_0_0_1)+TestAlone_2_1_0)+TestAlone_1_1_0)+TestAlone_2_0_0)+TestAlone_0_0_2)+TestAlone_2_1_1)+TestAlone_0_1_1)+TestAlone_2_0_1)+TestAlone_1_1_2)+TestAlone_0_1_2)+TestAlone_1_0_2))"))
Formula 6 simplified : !"((((((((((((((((((TestIdentity_0_0_0+TestIdentity_1_0_0)+TestIdentity_2_0_0)+TestIdentity_1_0_1)+TestIdentity_2_0_1)+TestIdentity_0_1_1)+TestIdentity_1_1_1)+TestIdentity_0_1_0)+TestIdentity_1_1_0)+TestIdentity_2_1_0)+TestIdentity_0_0_1)+TestIdentity_1_1_2)+TestIdentity_0_1_2)+TestIdentity_2_1_2)+TestIdentity_0_0_2)+TestIdentity_2_1_1)+TestIdentity_2_0_2)+TestIdentity_1_0_2)<=(((((((((((TestAlone_1_0_0+TestAlone_0_0_1)+TestAlone_2_1_0)+TestAlone_1_1_0)+TestAlone_2_0_0)+TestAlone_0_0_2)+TestAlone_2_1_1)+TestAlone_0_1_1)+TestAlone_2_0_1)+TestAlone_1_1_2)+TestAlone_0_1_2)+TestAlone_1_0_2))"
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 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,2.42023,90540,1,0,317,311992,318,131,4008,316772,461
no accepting run found
Formula 6 is TRUE no accepting run found.
FORMULA Peterson-PT-2-LTLCardinality-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !(("((((((EndTurn_0_0+EndTurn_2_0)+EndTurn_1_0)+EndTurn_1_1)+EndTurn_0_1)+EndTurn_2_1)<=(((((((((((((((((TestIdentity_0_0_0+TestIdentity_1_0_0)+TestIdentity_2_0_0)+TestIdentity_1_0_1)+TestIdentity_2_0_1)+TestIdentity_0_1_1)+TestIdentity_1_1_1)+TestIdentity_0_1_0)+TestIdentity_1_1_0)+TestIdentity_2_1_0)+TestIdentity_0_0_1)+TestIdentity_1_1_2)+TestIdentity_0_1_2)+TestIdentity_2_1_2)+TestIdentity_0_0_2)+TestIdentity_2_1_1)+TestIdentity_2_0_2)+TestIdentity_1_0_2))"))
Formula 7 simplified : !"((((((EndTurn_0_0+EndTurn_2_0)+EndTurn_1_0)+EndTurn_1_1)+EndTurn_0_1)+EndTurn_2_1)<=(((((((((((((((((TestIdentity_0_0_0+TestIdentity_1_0_0)+TestIdentity_2_0_0)+TestIdentity_1_0_1)+TestIdentity_2_0_1)+TestIdentity_0_1_1)+TestIdentity_1_1_1)+TestIdentity_0_1_0)+TestIdentity_1_1_0)+TestIdentity_2_1_0)+TestIdentity_0_0_1)+TestIdentity_1_1_2)+TestIdentity_0_1_2)+TestIdentity_2_1_2)+TestIdentity_0_0_2)+TestIdentity_2_1_1)+TestIdentity_2_0_2)+TestIdentity_1_0_2))"
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
0 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.42161,90540,1,0,317,311992,321,131,4033,316772,463
no accepting run found
Formula 7 is TRUE no accepting run found.
FORMULA Peterson-PT-2-LTLCardinality-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((("(TestIdentity_1_0_0<=IsEndLoop_0_1_2)")U(X(G("(TestIdentity_1_0_1<=TestIdentity_1_0_0)")))))
Formula 8 simplified : !("(TestIdentity_1_0_0<=IsEndLoop_0_1_2)" U XG"(TestIdentity_1_0_1<=TestIdentity_1_0_0)")
19 unique states visited
19 strongly connected components in search stack
20 transitions explored
19 items max in DFS search stack
281 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.24327,162040,1,0,595,616260,335,232,4044,762440,1061
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA Peterson-PT-2-LTLCardinality-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((G((X("(TestAlone_2_0_0<=TestIdentity_0_0_2)"))U("(TestTurn_0_0<=TestTurn_1_1)"))))
Formula 9 simplified : !G(X"(TestAlone_2_0_0<=TestIdentity_0_0_2)" U "(TestTurn_0_0<=TestTurn_1_1)")
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 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,5.37214,166488,1,0,600,630373,341,232,4053,779163,1081
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA Peterson-PT-2-LTLCardinality-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((("(IsEndLoop_0_1_0<=TestAlone_0_1_1)")U(X(G("(IsEndLoop_0_0_0<=IsEndLoop_2_1_1)")))))
Formula 10 simplified : !("(IsEndLoop_0_1_0<=TestAlone_0_1_1)" U XG"(IsEndLoop_0_0_0<=IsEndLoop_2_1_1)")
5 unique states visited
5 strongly connected components in search stack
6 transitions explored
5 items max in DFS search stack
350 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,8.87548,243576,1,0,960,957034,355,360,4064,1.24241e+06,1744
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA Peterson-PT-2-LTLCardinality-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((F(F(G(F("(IsEndLoop_2_0_0<=BeginLoop_2_1_0)"))))))
Formula 11 simplified : !FGF"(IsEndLoop_2_0_0<=BeginLoop_2_1_0)"
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
8 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,8.95575,246728,1,0,989,969064,364,361,4069,1.25468e+06,1827
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA Peterson-PT-2-LTLCardinality-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !((X(X(G(G("(TestTurn_0_1<=TestIdentity_1_1_0)"))))))
Formula 12 simplified : !XXG"(TestTurn_0_1<=TestIdentity_1_1_0)"
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
120 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,10.159,281056,1,0,1169,1.11826e+06,370,424,4073,1.48388e+06,2151
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA Peterson-PT-2-LTLCardinality-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !((X(X(X(G("(Turn_1_0<=AskForSection_0_0)"))))))
Formula 13 simplified : !XXXG"(Turn_1_0<=AskForSection_0_0)"
6 unique states visited
6 strongly connected components in search stack
6 transitions explored
6 items max in DFS search stack
28 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,10.4423,290016,1,0,1264,1.14869e+06,376,456,4077,1.53095e+06,2320
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA Peterson-PT-2-LTLCardinality-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 14 : !((true))
Formula 14 simplified : 0
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
0 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,10.4425,290016,1,0,1264,1.14869e+06,376,456,4077,1.53095e+06,2320
no accepting run found
Formula 14 is TRUE no accepting run found.
FORMULA Peterson-PT-2-LTLCardinality-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 15 : !((X(X(F(X("(BeginLoop_1_0_1<=IsEndLoop_2_1_1)"))))))
Formula 15 simplified : !XXFX"(BeginLoop_1_0_1<=IsEndLoop_2_1_1)"
4 unique states visited
0 strongly connected components in search stack
3 transitions explored
4 items max in DFS search stack
0 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,10.4433,290016,1,0,1264,1.14869e+06,385,456,4081,1.53095e+06,2324
no accepting run found
Formula 15 is TRUE no accepting run found.
FORMULA Peterson-PT-2-LTLCardinality-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit//lts_install_dir//include, -I., -std=c99, -fPIC, -O3, model.c], workingDir=/home/mcc/execution]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.

BK_STOP 1527504659468

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -louvain -smt
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -consoleLog -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/ -louvain -smt -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss8m -Xms40m -Xmx8192m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6
May 28, 2018 10:50:42 AM fr.lip6.move.gal.application.Application start
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/, -louvain, -smt]
May 28, 2018 10:50:42 AM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
May 28, 2018 10:50:42 AM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 66 ms
May 28, 2018 10:50:42 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 102 places.
May 28, 2018 10:50:42 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 126 transitions.
May 28, 2018 10:50:42 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 20 ms
May 28, 2018 10:50:42 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 103 ms
May 28, 2018 10:50:42 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 4 ms
May 28, 2018 10:50:42 AM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLCardinality.ltl : 2 ms
May 28, 2018 10:50:43 AM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 126 transitions.
May 28, 2018 10:50:43 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 11 place invariants in 54 ms
May 28, 2018 10:50:44 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 102 variables to be positive in 577 ms
May 28, 2018 10:50:44 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 126 transitions.
May 28, 2018 10:50:44 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of disable matrix completed :0/126 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
May 28, 2018 10:50:44 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete disable matrix. took 14 ms. Total solver calls (SAT/UNSAT): 0(0/0)
May 28, 2018 10:50:44 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may enable matrix : 126 transitions.
May 28, 2018 10:50:44 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
May 28, 2018 10:50:53 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeCoEnablingMatrix
INFO: Computing symmetric co enabling matrix : 126 transitions.
May 28, 2018 10:50:53 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(0/126) took 119 ms. Total solver calls (SAT/UNSAT): 41(0/41)
May 28, 2018 10:50:56 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(38/126) took 3171 ms. Total solver calls (SAT/UNSAT): 1418(56/1362)
May 28, 2018 10:50:59 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Finished co-enabling matrix. took 5422 ms. Total solver calls (SAT/UNSAT): 2859(132/2727)
Skipping mayMatrices nes/nds SMT solver raised an error on invariants :(error "Failed to assert expression: java.io.IOException: Stream closed (invariants (select s 2))")
java.lang.RuntimeException: SMT solver raised an error on invariants :(error "Failed to assert expression: java.io.IOException: Stream closed (invariants (select s 2))")
at fr.lip6.move.gal.gal2smt.bmc.KInductionSolver.addKnownInvariants(KInductionSolver.java:456)
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeDoNotAccord(NecessaryEnablingsolver.java:572)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:538)
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:830)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:71)
at java.lang.Thread.run(Thread.java:748)
May 28, 2018 10:50:59 AM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 16085ms conformant to PINS in folder :/home/mcc/execution

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-PT-2"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstoolsl"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# 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

tar xzf /home/mcc/BenchKit/INPUTS/Peterson-PT-2.tgz
mv Peterson-PT-2 execution
cd execution
pwd
ls -lh

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool itstoolsl"
echo " Input is Peterson-PT-2, 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 r261-csrt-152732586000159"
echo "====================================================================="
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
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 ;