Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2019-input.r107-oct2-155272231100529.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2019-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................
=====================================================================
Generated by BenchKit 2-3954
Executing tool itstools
Input is Peterson-PT-2, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r107-oct2-155272231100529
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 364K
-rw-r--r-- 1 mcc users 9.9K Feb 12 04:12 CTLCardinality.txt
-rw-r--r-- 1 mcc users 35K Feb 12 04:12 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K Feb 8 03:17 CTLFireability.txt
-rw-r--r-- 1 mcc users 22K Feb 8 03:17 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Mar 10 17:31 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 100 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 338 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 4.7K Feb 5 00:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 18K Feb 5 00:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.3K Feb 4 22:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 13K Feb 4 22:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 4 07:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 37K Feb 4 07:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Feb 1 02:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 32K Feb 1 02:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.7K Feb 4 22:22 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.7K Feb 4 22:22 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Jan 29 09:34 equiv_col
-rw-r--r-- 1 mcc users 2 Jan 29 09:34 instance
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 iscolored
-rw-r--r-- 1 mcc users 98K Mar 10 17:31 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 Peterson-PT-2-LTLFireability-00
FORMULA_NAME Peterson-PT-2-LTLFireability-01
FORMULA_NAME Peterson-PT-2-LTLFireability-02
FORMULA_NAME Peterson-PT-2-LTLFireability-03
FORMULA_NAME Peterson-PT-2-LTLFireability-04
FORMULA_NAME Peterson-PT-2-LTLFireability-05
FORMULA_NAME Peterson-PT-2-LTLFireability-06
FORMULA_NAME Peterson-PT-2-LTLFireability-07
FORMULA_NAME Peterson-PT-2-LTLFireability-08
FORMULA_NAME Peterson-PT-2-LTLFireability-09
FORMULA_NAME Peterson-PT-2-LTLFireability-10
FORMULA_NAME Peterson-PT-2-LTLFireability-11
FORMULA_NAME Peterson-PT-2-LTLFireability-12
FORMULA_NAME Peterson-PT-2-LTLFireability-13
FORMULA_NAME Peterson-PT-2-LTLFireability-14
FORMULA_NAME Peterson-PT-2-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1552936495203

Working with output stream class java.io.PrintStream
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.201903111103/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /home/mcc/execution/LTLFireability.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLFireability.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.201903111103/bin/its-ltl-linux64 --gc-threshold 2000000 -i /home/mcc/execution/LTLFireability.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLFireability.ltl -c -stutter-deadlock
Read 16 LTL properties
Checking formula 0 : !((G(G(G(F("(((((((Turn_0_1>=1)&&(TestTurn_1_0>=1))||((Turn_0_2>=1)&&(TestTurn_2_0>=1)))||((Turn_0_0>=1)&&(TestTurn_0_0>=1)))||((TestTurn_2_1>=1)&&(Turn_1_2>=1)))||((TestTurn_0_1>=1)&&(Turn_1_0>=1)))||((TestTurn_1_1>=1)&&(Turn_1_1>=1)))"))))))
Formula 0 simplified : !GF"(((((((Turn_0_1>=1)&&(TestTurn_1_0>=1))||((Turn_0_2>=1)&&(TestTurn_2_0>=1)))||((Turn_0_0>=1)&&(TestTurn_0_0>=1)))||((TestTurn_2_1>=1)&&(Turn_1_2>=1)))||((TestTurn_0_1>=1)&&(Turn_1_0>=1)))||((TestTurn_1_1>=1)&&(Turn_1_1>=1)))"
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
2 unique states visited
0 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
215 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.18269,97004,1,0,306,365260,282,130,3293,338086,400
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA Peterson-PT-2-LTLFireability-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 1 : !((F(G(F(F(F("((((((IsEndLoop_2_1_2>=1)||(IsEndLoop_0_1_2>=1))||(IsEndLoop_1_1_2>=1))||(IsEndLoop_1_0_2>=1))||(IsEndLoop_2_0_2>=1))||(IsEndLoop_0_0_2>=1))")))))))
Formula 1 simplified : !FGF"((((((IsEndLoop_2_1_2>=1)||(IsEndLoop_0_1_2>=1))||(IsEndLoop_1_1_2>=1))||(IsEndLoop_1_0_2>=1))||(IsEndLoop_2_0_2>=1))||(IsEndLoop_0_0_2>=1))"
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
11 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.28545,100568,1,0,342,379042,291,131,3305,355373,498
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA Peterson-PT-2-LTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 2 : !(("((((CS_2>=1)&&(WantSection_2_T>=1))||((CS_1>=1)&&(WantSection_1_T>=1)))||((CS_0>=1)&&(WantSection_0_T>=1)))"))
Formula 2 simplified : !"((((CS_2>=1)&&(WantSection_2_T>=1))||((CS_1>=1)&&(WantSection_1_T>=1)))||((CS_0>=1)&&(WantSection_0_T>=1)))"
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
2 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.31033,101356,1,0,343,381221,296,131,3317,358907,507
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA Peterson-PT-2-LTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 3 : !((G((F(F("(((EndTurn_0_0>=1)||(EndTurn_1_0>=1))||(EndTurn_2_0>=1))")))U(("(((EndTurn_0_0>=1)||(EndTurn_1_0>=1))||(EndTurn_2_0>=1))")U("((((((((((((TestIdentity_2_0_0>=1)||(TestIdentity_1_0_0>=1))||(TestIdentity_2_0_1>=1))||(TestIdentity_0_0_1>=1))||(TestIdentity_0_1_1>=1))||(TestIdentity_2_1_1>=1))||(TestIdentity_0_1_2>=1))||(TestIdentity_1_1_2>=1))||(TestIdentity_0_0_2>=1))||(TestIdentity_1_0_2>=1))||(TestIdentity_1_1_0>=1))||(TestIdentity_2_1_0>=1))")))))
Formula 3 simplified : !G(F"(((EndTurn_0_0>=1)||(EndTurn_1_0>=1))||(EndTurn_2_0>=1))" U ("(((EndTurn_0_0>=1)||(EndTurn_1_0>=1))||(EndTurn_2_0>=1))" U "((((((((((((TestIdentity_2_0_0>=1)||(TestIdentity_1_0_0>=1))||(TestIdentity_2_0_1>=1))||(TestIdentity_0_0_1>=1))||(TestIdentity_0_1_1>=1))||(TestIdentity_2_1_1>=1))||(TestIdentity_0_1_2>=1))||(TestIdentity_1_1_2>=1))||(TestIdentity_0_0_2>=1))||(TestIdentity_1_0_2>=1))||(TestIdentity_1_1_0>=1))||(TestIdentity_2_1_0>=1))"))
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
76 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,3.06686,116768,1,0,414,458036,311,134,3356,449149,690
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA Peterson-PT-2-LTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 4 : !((X(F("((((((((((((TestIdentity_2_0_0>=1)||(TestIdentity_1_0_0>=1))||(TestIdentity_2_0_1>=1))||(TestIdentity_0_0_1>=1))||(TestIdentity_0_1_1>=1))||(TestIdentity_2_1_1>=1))||(TestIdentity_0_1_2>=1))||(TestIdentity_1_1_2>=1))||(TestIdentity_0_0_2>=1))||(TestIdentity_1_0_2>=1))||(TestIdentity_1_1_0>=1))||(TestIdentity_2_1_0>=1))"))))
Formula 4 simplified : !XF"((((((((((((TestIdentity_2_0_0>=1)||(TestIdentity_1_0_0>=1))||(TestIdentity_2_0_1>=1))||(TestIdentity_0_0_1>=1))||(TestIdentity_0_1_1>=1))||(TestIdentity_2_1_1>=1))||(TestIdentity_0_1_2>=1))||(TestIdentity_1_1_2>=1))||(TestIdentity_0_0_2>=1))||(TestIdentity_1_0_2>=1))||(TestIdentity_1_1_0>=1))||(TestIdentity_2_1_0>=1))"
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
20 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,3.26386,126272,1,0,496,497333,317,154,3356,499428,865
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA Peterson-PT-2-LTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 5 : !(("((((((((((((((((((BeginLoop_2_0_1>=1)||(BeginLoop_0_0_2>=1))||(BeginLoop_1_0_2>=1))||(BeginLoop_2_0_2>=1))||(BeginLoop_0_1_0>=1))||(BeginLoop_1_1_0>=1))||(BeginLoop_2_1_0>=1))||(BeginLoop_0_1_1>=1))||(BeginLoop_0_0_0>=1))||(BeginLoop_1_0_0>=1))||(BeginLoop_2_0_0>=1))||(BeginLoop_0_0_1>=1))||(BeginLoop_1_0_1>=1))||(BeginLoop_1_1_2>=1))||(BeginLoop_0_1_2>=1))||(BeginLoop_2_1_1>=1))||(BeginLoop_1_1_1>=1))||(BeginLoop_2_1_2>=1))"))
Formula 5 simplified : !"((((((((((((((((((BeginLoop_2_0_1>=1)||(BeginLoop_0_0_2>=1))||(BeginLoop_1_0_2>=1))||(BeginLoop_2_0_2>=1))||(BeginLoop_0_1_0>=1))||(BeginLoop_1_1_0>=1))||(BeginLoop_2_1_0>=1))||(BeginLoop_0_1_1>=1))||(BeginLoop_0_0_0>=1))||(BeginLoop_1_0_0>=1))||(BeginLoop_2_0_0>=1))||(BeginLoop_0_0_1>=1))||(BeginLoop_1_0_1>=1))||(BeginLoop_1_1_2>=1))||(BeginLoop_0_1_2>=1))||(BeginLoop_2_1_1>=1))||(BeginLoop_1_1_1>=1))||(BeginLoop_2_1_2>=1))"
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 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,3.26522,126272,1,0,496,497333,320,154,3392,499441,867
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA Peterson-PT-2-LTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 6 : !(((F("((((((((((((IsEndLoop_0_0_0>=1)||(IsEndLoop_2_1_0>=1))||(IsEndLoop_1_1_0>=1))||(IsEndLoop_0_1_0>=1))||(IsEndLoop_2_0_1>=1))||(IsEndLoop_1_0_1>=1))||(IsEndLoop_0_0_1>=1))||(IsEndLoop_2_0_0>=1))||(IsEndLoop_1_0_0>=1))||(IsEndLoop_2_1_1>=1))||(IsEndLoop_1_1_1>=1))||(IsEndLoop_0_1_1>=1))"))U(X(("((((Idle_1>=1)&&(WantSection_1_F>=1))||((WantSection_2_F>=1)&&(Idle_2>=1)))||((Idle_0>=1)&&(WantSection_0_F>=1)))")U("((((((TestIdentity_1_1_1>=1)||(TestIdentity_2_1_2>=1))||(TestIdentity_0_0_0>=1))||(TestIdentity_1_0_1>=1))||(TestIdentity_2_0_2>=1))||(TestIdentity_0_1_0>=1))")))))
Formula 6 simplified : !(F"((((((((((((IsEndLoop_0_0_0>=1)||(IsEndLoop_2_1_0>=1))||(IsEndLoop_1_1_0>=1))||(IsEndLoop_0_1_0>=1))||(IsEndLoop_2_0_1>=1))||(IsEndLoop_1_0_1>=1))||(IsEndLoop_0_0_1>=1))||(IsEndLoop_2_0_0>=1))||(IsEndLoop_1_0_0>=1))||(IsEndLoop_2_1_1>=1))||(IsEndLoop_1_1_1>=1))||(IsEndLoop_0_1_1>=1))" U X("((((Idle_1>=1)&&(WantSection_1_F>=1))||((WantSection_2_F>=1)&&(Idle_2>=1)))||((Idle_0>=1)&&(WantSection_0_F>=1)))" U "((((((TestIdentity_1_1_1>=1)||(TestIdentity_2_1_2>=1))||(TestIdentity_0_0_0>=1))||(TestIdentity_1_0_1>=1))||(TestIdentity_2_0_2>=1))||(TestIdentity_0_1_0>=1))"))
6 unique states visited
5 strongly connected components in search stack
6 transitions explored
5 items max in DFS search stack
41 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,3.68018,142628,1,0,596,568747,341,184,3475,592472,1074
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA Peterson-PT-2-LTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 7 : !((X("((((Idle_1>=1)&&(WantSection_1_F>=1))||((WantSection_2_F>=1)&&(Idle_2>=1)))||((Idle_0>=1)&&(WantSection_0_F>=1)))")))
Formula 7 simplified : !X"((((Idle_1>=1)&&(WantSection_1_F>=1))||((WantSection_2_F>=1)&&(Idle_2>=1)))||((Idle_0>=1)&&(WantSection_0_F>=1)))"
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 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,3.68145,142628,1,0,596,568747,342,184,3476,592472,1076
no accepting run found
Formula 7 is TRUE no accepting run found.
FORMULA Peterson-PT-2-LTLFireability-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 8 : !((X("(IsEndLoop_0_1_1>=1)")))
Formula 8 simplified : !X"(IsEndLoop_0_1_1>=1)"
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
2 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,3.70311,143420,1,0,596,570689,345,184,3476,596555,1080
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA Peterson-PT-2-LTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 9 : !((F((G(F("(BeginLoop_1_1_1>=1)")))U("(EndTurn_0_1>=1)"))))
Formula 9 simplified : !F(GF"(BeginLoop_1_1_1>=1)" U "(EndTurn_0_1>=1)")
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
213 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.82669,194372,1,0,804,796099,354,248,3477,917729,1493
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA Peterson-PT-2-LTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 10 : !((F(F(F(F(G("(EndTurn_0_0>=1)")))))))
Formula 10 simplified : !FG"(EndTurn_0_0>=1)"
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
115 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,6.97758,224992,1,0,1107,922466,367,367,3477,1.112e+06,2067
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA Peterson-PT-2-LTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 11 : !(("(BeginLoop_0_1_2>=1)"))
Formula 11 simplified : !"(BeginLoop_0_1_2>=1)"
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 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,6.97847,224992,1,0,1107,922466,370,367,3477,1.112e+06,2069
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA Peterson-PT-2-LTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 12 : !(((X(F("(BeginLoop_0_0_1>=1)")))U(F(X(G("(TestIdentity_0_1_0>=1)"))))))
Formula 12 simplified : !(XF"(BeginLoop_0_0_1>=1)" U FXG"(TestIdentity_0_1_0>=1)")
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
99 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,7.97585,251272,1,0,1344,1.0296e+06,383,483,3477,1.27066e+06,2594
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA Peterson-PT-2-LTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 13 : !(("(BeginLoop_1_0_2>=1)"))
Formula 13 simplified : !"(BeginLoop_1_0_2>=1)"
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 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,7.97617,251272,1,0,1344,1.0296e+06,386,483,3477,1.27066e+06,2596
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA Peterson-PT-2-LTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 14 : !((F(F("(IsEndLoop_0_1_0>=1)"))))
Formula 14 simplified : !F"(IsEndLoop_0_1_0>=1)"
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
69 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.66475,271616,1,0,1539,1.11995e+06,395,537,3477,1.40219e+06,2982
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA Peterson-PT-2-LTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 15 : !((G(X(G(("((Turn_1_2>=1)&&(AskForSection_2_1>=1))")U("(EndTurn_2_1>=1)"))))))
Formula 15 simplified : !GXG("((Turn_1_2>=1)&&(AskForSection_2_1>=1))" U "(EndTurn_2_1>=1)")
4 unique states visited
4 strongly connected components in search stack
4 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,8.66668,272460,1,0,1539,1.11995e+06,411,537,3487,1.4022e+06,2989
an accepting run exists (use option '-e' to print it)
Formula 15 is FALSE accepting run found.
FORMULA Peterson-PT-2-LTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
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 1552936508042

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -smt
+ 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 LTLFireability -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -smt -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss8m -Xms40m -Xmx8192m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6
Mar 18, 2019 7:14:56 PM fr.lip6.move.gal.application.Application start
INFO: Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -smt]
Mar 18, 2019 7:14:56 PM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Mar 18, 2019 7:14:57 PM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 68 ms
Mar 18, 2019 7:14:57 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 102 places.
Mar 18, 2019 7:14:57 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 126 transitions.
Mar 18, 2019 7:14:57 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 8 ms
Mar 18, 2019 7:14:57 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 55 ms
Mar 18, 2019 7:14:57 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 3 ms
Mar 18, 2019 7:14:57 PM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 1 ms
Mar 18, 2019 7:14:57 PM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 126 transitions.
Mar 18, 2019 7:14:57 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 11 place invariants in 37 ms
Mar 18, 2019 7:14:58 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 102 variables to be positive in 218 ms
Mar 18, 2019 7:14:58 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 126 transitions.
Mar 18, 2019 7:14:58 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of disable matrix completed :0/126 took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Mar 18, 2019 7:14:58 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Mar 18, 2019 7:14:58 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may enable matrix : 126 transitions.
Mar 18, 2019 7:14:58 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Mar 18, 2019 7:15:01 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeCoEnablingMatrix
INFO: Computing symmetric co enabling matrix : 126 transitions.
Mar 18, 2019 7:15:01 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(0/126) took 23 ms. Total solver calls (SAT/UNSAT): 41(0/41)
Mar 18, 2019 7:15:04 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(36/126) took 3230 ms. Total solver calls (SAT/UNSAT): 1356(53/1303)
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:480)
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:830)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:71)
at java.lang.Thread.run(Thread.java:748)
Mar 18, 2019 7:15:07 PM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 10164ms 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="LTLFireability"
export BK_TOOL="itstools"
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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3954"
echo " Executing tool itstools"
echo " Input is Peterson-PT-2, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r107-oct2-155272231100529"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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