fond
Model Checking Contest 2018
8th edition, Bratislava, Slovakia, June 26, 2018
Execution of r188-qhx2-152732140200098
Last Updated
June 26, 2018

About the Execution of ITS-Tools for Referendum-COL-0010

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15744.770 29190.00 22339.00 450.90 TFFFFFTFFTFFFTFF normal

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 180K
-rw-r--r-- 1 mcc users 4.1K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K 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.4K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.6K May 26 09:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K May 26 09:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 26 09:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.1K May 26 09:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.5K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 23K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 110 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 348 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.7K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:50 equiv_pt
-rw-r--r-- 1 mcc users 5 May 15 18:50 instance
-rw-r--r-- 1 mcc users 5 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 3.5K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool itstools
Input is Referendum-COL-0010, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r188-qhx2-152732140200098
=====================================================================


--------------------
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 Referendum-COL-0010-LTLFireability-00
FORMULA_NAME Referendum-COL-0010-LTLFireability-01
FORMULA_NAME Referendum-COL-0010-LTLFireability-02
FORMULA_NAME Referendum-COL-0010-LTLFireability-03
FORMULA_NAME Referendum-COL-0010-LTLFireability-04
FORMULA_NAME Referendum-COL-0010-LTLFireability-05
FORMULA_NAME Referendum-COL-0010-LTLFireability-06
FORMULA_NAME Referendum-COL-0010-LTLFireability-07
FORMULA_NAME Referendum-COL-0010-LTLFireability-08
FORMULA_NAME Referendum-COL-0010-LTLFireability-09
FORMULA_NAME Referendum-COL-0010-LTLFireability-10
FORMULA_NAME Referendum-COL-0010-LTLFireability-11
FORMULA_NAME Referendum-COL-0010-LTLFireability-12
FORMULA_NAME Referendum-COL-0010-LTLFireability-13
FORMULA_NAME Referendum-COL-0010-LTLFireability-14
FORMULA_NAME Referendum-COL-0010-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1528290059993

13:01:24.507 [main] ERROR PNML validation - The rng grammar file can't be accessed : www.pnml.org
13:01:24.517 [main] ERROR import - Grammar file errors have been raised, the validation can't be done, process will continue without Grammar validation
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.201805151631/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.201805151631/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 : !((("((((((((((Voters0.voting_0>=1)||(Voters1.voting_1>=1))||(Voters2.voting_2>=1))||(Voters3.voting_3>=1))||(Voters4.voting_4>=1))||(Voters5.voting_5>=1))||(Voters6.voting_6>=1))||(Voters7.voting_7>=1))||(Voters8.voting_8>=1))||(Voters9.voting_9>=1))")U(X(X("((((((((((Voters0.voting_0>=1)||(Voters1.voting_1>=1))||(Voters2.voting_2>=1))||(Voters3.voting_3>=1))||(Voters4.voting_4>=1))||(Voters5.voting_5>=1))||(Voters6.voting_6>=1))||(Voters7.voting_7>=1))||(Voters8.voting_8>=1))||(Voters9.voting_9>=1))")))))
Formula 0 simplified : !("((((((((((Voters0.voting_0>=1)||(Voters1.voting_1>=1))||(Voters2.voting_2>=1))||(Voters3.voting_3>=1))||(Voters4.voting_4>=1))||(Voters5.voting_5>=1))||(Voters6.voting_6>=1))||(Voters7.voting_7>=1))||(Voters8.voting_8>=1))||(Voters9.voting_9>=1))" U XX"((((((((((Voters0.voting_0>=1)||(Voters1.voting_1>=1))||(Voters2.voting_2>=1))||(Voters3.voting_3>=1))||(Voters4.voting_4>=1))||(Voters5.voting_5>=1))||(Voters6.voting_6>=1))||(Voters7.voting_7>=1))||(Voters8.voting_8>=1))||(Voters9.voting_9>=1))")
built 1 ordering constraints for composite.
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 1024 deadlock states
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
3 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,0.105497,16896,1,0,163,43,163,81,51,39,409
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA Referendum-COL-0010-LTLFireability-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((G(X(X(("((((((((((Voters0.voting_0>=1)||(Voters1.voting_1>=1))||(Voters2.voting_2>=1))||(Voters3.voting_3>=1))||(Voters4.voting_4>=1))||(Voters5.voting_5>=1))||(Voters6.voting_6>=1))||(Voters7.voting_7>=1))||(Voters8.voting_8>=1))||(Voters9.voting_9>=1))")U("((((((((((Voters0.voting_0>=1)||(Voters1.voting_1>=1))||(Voters2.voting_2>=1))||(Voters3.voting_3>=1))||(Voters4.voting_4>=1))||(Voters5.voting_5>=1))||(Voters6.voting_6>=1))||(Voters7.voting_7>=1))||(Voters8.voting_8>=1))||(Voters9.voting_9>=1))"))))))
Formula 1 simplified : !GXX"((((((((((Voters0.voting_0>=1)||(Voters1.voting_1>=1))||(Voters2.voting_2>=1))||(Voters3.voting_3>=1))||(Voters4.voting_4>=1))||(Voters5.voting_5>=1))||(Voters6.voting_6>=1))||(Voters7.voting_7>=1))||(Voters8.voting_8>=1))||(Voters9.voting_9>=1))"
Computing Next relation with stutter on 1024 deadlock states
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 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,0.111845,17108,1,0,516,43,201,506,54,41,1165
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA Referendum-COL-0010-LTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((("((((((((((Voters0.voting_0>=1)||(Voters1.voting_1>=1))||(Voters2.voting_2>=1))||(Voters3.voting_3>=1))||(Voters4.voting_4>=1))||(Voters5.voting_5>=1))||(Voters6.voting_6>=1))||(Voters7.voting_7>=1))||(Voters8.voting_8>=1))||(Voters9.voting_9>=1))")U(G(F(X("((((((((((Voters0.voting_0>=1)||(Voters1.voting_1>=1))||(Voters2.voting_2>=1))||(Voters3.voting_3>=1))||(Voters4.voting_4>=1))||(Voters5.voting_5>=1))||(Voters6.voting_6>=1))||(Voters7.voting_7>=1))||(Voters8.voting_8>=1))||(Voters9.voting_9>=1))"))))))
Formula 2 simplified : !("((((((((((Voters0.voting_0>=1)||(Voters1.voting_1>=1))||(Voters2.voting_2>=1))||(Voters3.voting_3>=1))||(Voters4.voting_4>=1))||(Voters5.voting_5>=1))||(Voters6.voting_6>=1))||(Voters7.voting_7>=1))||(Voters8.voting_8>=1))||(Voters9.voting_9>=1))" U GFX"((((((((((Voters0.voting_0>=1)||(Voters1.voting_1>=1))||(Voters2.voting_2>=1))||(Voters3.voting_3>=1))||(Voters4.voting_4>=1))||(Voters5.voting_5>=1))||(Voters6.voting_6>=1))||(Voters7.voting_7>=1))||(Voters8.voting_8>=1))||(Voters9.voting_9>=1))")
Computing Next relation with stutter on 1024 deadlock states
14 unique states visited
14 strongly connected components in search stack
15 transitions explored
14 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,0.116912,17688,1,0,605,44,207,731,54,44,1600
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA Referendum-COL-0010-LTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((G((G(X("((((((((((Voters0.voting_0>=1)||(Voters1.voting_1>=1))||(Voters2.voting_2>=1))||(Voters3.voting_3>=1))||(Voters4.voting_4>=1))||(Voters5.voting_5>=1))||(Voters6.voting_6>=1))||(Voters7.voting_7>=1))||(Voters8.voting_8>=1))||(Voters9.voting_9>=1))")))U(G(G("((((((((((Voters0.voting_0>=1)||(Voters1.voting_1>=1))||(Voters2.voting_2>=1))||(Voters3.voting_3>=1))||(Voters4.voting_4>=1))||(Voters5.voting_5>=1))||(Voters6.voting_6>=1))||(Voters7.voting_7>=1))||(Voters8.voting_8>=1))||(Voters9.voting_9>=1))"))))))
Formula 3 simplified : !G(GX"((((((((((Voters0.voting_0>=1)||(Voters1.voting_1>=1))||(Voters2.voting_2>=1))||(Voters3.voting_3>=1))||(Voters4.voting_4>=1))||(Voters5.voting_5>=1))||(Voters6.voting_6>=1))||(Voters7.voting_7>=1))||(Voters8.voting_8>=1))||(Voters9.voting_9>=1))" U G"((((((((((Voters0.voting_0>=1)||(Voters1.voting_1>=1))||(Voters2.voting_2>=1))||(Voters3.voting_3>=1))||(Voters4.voting_4>=1))||(Voters5.voting_5>=1))||(Voters6.voting_6>=1))||(Voters7.voting_7>=1))||(Voters8.voting_8>=1))||(Voters9.voting_9>=1))")
Computing Next relation with stutter on 1024 deadlock states
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,0.121799,18012,1,0,645,44,207,803,54,44,1732
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA Referendum-COL-0010-LTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((X((G(G("(ready.ready_0>=1)")))U("(ready.ready_0>=1)"))))
Formula 4 simplified : !X(G"(ready.ready_0>=1)" U "(ready.ready_0>=1)")
Computing Next relation with stutter on 1024 deadlock states
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,0.122305,18012,1,0,645,44,212,803,55,44,1756
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA Referendum-COL-0010-LTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !(((X("(ready.ready_0>=1)"))U(G(G(X("((((((((((Voters0.voting_0>=1)||(Voters1.voting_1>=1))||(Voters2.voting_2>=1))||(Voters3.voting_3>=1))||(Voters4.voting_4>=1))||(Voters5.voting_5>=1))||(Voters6.voting_6>=1))||(Voters7.voting_7>=1))||(Voters8.voting_8>=1))||(Voters9.voting_9>=1))"))))))
Formula 5 simplified : !(X"(ready.ready_0>=1)" U GX"((((((((((Voters0.voting_0>=1)||(Voters1.voting_1>=1))||(Voters2.voting_2>=1))||(Voters3.voting_3>=1))||(Voters4.voting_4>=1))||(Voters5.voting_5>=1))||(Voters6.voting_6>=1))||(Voters7.voting_7>=1))||(Voters8.voting_8>=1))||(Voters9.voting_9>=1))")
Computing Next relation with stutter on 1024 deadlock states
15 unique states visited
15 strongly connected components in search stack
16 transitions explored
15 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,0.132423,18408,1,0,645,44,218,803,55,44,1762
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA Referendum-COL-0010-LTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !(("(ready.ready_0>=1)"))
Formula 6 simplified : !"(ready.ready_0>=1)"
Computing Next relation with stutter on 1024 deadlock states
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,0.13283,18408,1,0,645,44,218,803,55,44,1765
no accepting run found
Formula 6 is TRUE no accepting run found.
FORMULA Referendum-COL-0010-LTLFireability-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !(((("(ready.ready_0>=1)")U(G("((((((((((Voters0.voting_0>=1)||(Voters1.voting_1>=1))||(Voters2.voting_2>=1))||(Voters3.voting_3>=1))||(Voters4.voting_4>=1))||(Voters5.voting_5>=1))||(Voters6.voting_6>=1))||(Voters7.voting_7>=1))||(Voters8.voting_8>=1))||(Voters9.voting_9>=1))")))U(X(("((((((((((Voters0.voting_0>=1)||(Voters1.voting_1>=1))||(Voters2.voting_2>=1))||(Voters3.voting_3>=1))||(Voters4.voting_4>=1))||(Voters5.voting_5>=1))||(Voters6.voting_6>=1))||(Voters7.voting_7>=1))||(Voters8.voting_8>=1))||(Voters9.voting_9>=1))")U("(ready.ready_0>=1)")))))
Formula 7 simplified : !(("(ready.ready_0>=1)" U G"((((((((((Voters0.voting_0>=1)||(Voters1.voting_1>=1))||(Voters2.voting_2>=1))||(Voters3.voting_3>=1))||(Voters4.voting_4>=1))||(Voters5.voting_5>=1))||(Voters6.voting_6>=1))||(Voters7.voting_7>=1))||(Voters8.voting_8>=1))||(Voters9.voting_9>=1))") U X("((((((((((Voters0.voting_0>=1)||(Voters1.voting_1>=1))||(Voters2.voting_2>=1))||(Voters3.voting_3>=1))||(Voters4.voting_4>=1))||(Voters5.voting_5>=1))||(Voters6.voting_6>=1))||(Voters7.voting_7>=1))||(Voters8.voting_8>=1))||(Voters9.voting_9>=1))" U "(ready.ready_0>=1)"))
Computing Next relation with stutter on 1024 deadlock states
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 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,0.13787,18804,1,0,645,44,220,803,55,44,1808
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA Referendum-COL-0010-LTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((F((X(F("(ready.ready_0>=1)")))U(G(F("((((((((((Voters0.voting_0>=1)||(Voters1.voting_1>=1))||(Voters2.voting_2>=1))||(Voters3.voting_3>=1))||(Voters4.voting_4>=1))||(Voters5.voting_5>=1))||(Voters6.voting_6>=1))||(Voters7.voting_7>=1))||(Voters8.voting_8>=1))||(Voters9.voting_9>=1))"))))))
Formula 8 simplified : !F(XF"(ready.ready_0>=1)" U GF"((((((((((Voters0.voting_0>=1)||(Voters1.voting_1>=1))||(Voters2.voting_2>=1))||(Voters3.voting_3>=1))||(Voters4.voting_4>=1))||(Voters5.voting_5>=1))||(Voters6.voting_6>=1))||(Voters7.voting_7>=1))||(Voters8.voting_8>=1))||(Voters9.voting_9>=1))")
Computing Next relation with stutter on 1024 deadlock states
14 unique states visited
14 strongly connected components in search stack
15 transitions explored
14 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,0.140368,18804,1,0,731,44,220,898,55,44,1923
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA Referendum-COL-0010-LTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((F((G(X("((((((((((Voters0.voting_0>=1)||(Voters1.voting_1>=1))||(Voters2.voting_2>=1))||(Voters3.voting_3>=1))||(Voters4.voting_4>=1))||(Voters5.voting_5>=1))||(Voters6.voting_6>=1))||(Voters7.voting_7>=1))||(Voters8.voting_8>=1))||(Voters9.voting_9>=1))")))U(F(X("((((((((((Voters0.voting_0>=1)||(Voters1.voting_1>=1))||(Voters2.voting_2>=1))||(Voters3.voting_3>=1))||(Voters4.voting_4>=1))||(Voters5.voting_5>=1))||(Voters6.voting_6>=1))||(Voters7.voting_7>=1))||(Voters8.voting_8>=1))||(Voters9.voting_9>=1))"))))))
Formula 9 simplified : !F(GX"((((((((((Voters0.voting_0>=1)||(Voters1.voting_1>=1))||(Voters2.voting_2>=1))||(Voters3.voting_3>=1))||(Voters4.voting_4>=1))||(Voters5.voting_5>=1))||(Voters6.voting_6>=1))||(Voters7.voting_7>=1))||(Voters8.voting_8>=1))||(Voters9.voting_9>=1))" U FX"((((((((((Voters0.voting_0>=1)||(Voters1.voting_1>=1))||(Voters2.voting_2>=1))||(Voters3.voting_3>=1))||(Voters4.voting_4>=1))||(Voters5.voting_5>=1))||(Voters6.voting_6>=1))||(Voters7.voting_7>=1))||(Voters8.voting_8>=1))||(Voters9.voting_9>=1))")
Computing Next relation with stutter on 1024 deadlock states
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,0.142032,18804,1,0,731,44,220,898,55,44,1926
no accepting run found
Formula 9 is TRUE no accepting run found.
FORMULA Referendum-COL-0010-LTLFireability-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((F(X("(ready.ready_0>=1)"))))
Formula 10 simplified : !FX"(ready.ready_0>=1)"
Computing Next relation with stutter on 1024 deadlock states
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,0.142617,18804,1,0,731,44,232,899,55,44,1964
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA Referendum-COL-0010-LTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((X(G(G("(ready.ready_0>=1)")))))
Formula 11 simplified : !XG"(ready.ready_0>=1)"
Computing Next relation with stutter on 1024 deadlock states
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,0.143027,18804,1,0,731,44,240,899,55,44,1971
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA Referendum-COL-0010-LTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !((G("(ready.ready_0>=1)")))
Formula 12 simplified : !G"(ready.ready_0>=1)"
Computing Next relation with stutter on 1024 deadlock states
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,0.14342,18804,1,0,731,44,240,901,55,44,1985
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA Referendum-COL-0010-LTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !((X(X(X("((((((((((Voters0.voting_0>=1)||(Voters1.voting_1>=1))||(Voters2.voting_2>=1))||(Voters3.voting_3>=1))||(Voters4.voting_4>=1))||(Voters5.voting_5>=1))||(Voters6.voting_6>=1))||(Voters7.voting_7>=1))||(Voters8.voting_8>=1))||(Voters9.voting_9>=1))")))))
Formula 13 simplified : !XXX"((((((((((Voters0.voting_0>=1)||(Voters1.voting_1>=1))||(Voters2.voting_2>=1))||(Voters3.voting_3>=1))||(Voters4.voting_4>=1))||(Voters5.voting_5>=1))||(Voters6.voting_6>=1))||(Voters7.voting_7>=1))||(Voters8.voting_8>=1))||(Voters9.voting_9>=1))"
Computing Next relation with stutter on 1024 deadlock states
4 unique states visited
0 strongly connected components in search stack
3 transitions explored
4 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,0.144411,18804,1,0,738,44,240,908,55,44,2012
no accepting run found
Formula 13 is TRUE no accepting run found.
FORMULA Referendum-COL-0010-LTLFireability-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 14 : !(("((((((((((Voters0.voting_0>=1)||(Voters1.voting_1>=1))||(Voters2.voting_2>=1))||(Voters3.voting_3>=1))||(Voters4.voting_4>=1))||(Voters5.voting_5>=1))||(Voters6.voting_6>=1))||(Voters7.voting_7>=1))||(Voters8.voting_8>=1))||(Voters9.voting_9>=1))"))
Formula 14 simplified : !"((((((((((Voters0.voting_0>=1)||(Voters1.voting_1>=1))||(Voters2.voting_2>=1))||(Voters3.voting_3>=1))||(Voters4.voting_4>=1))||(Voters5.voting_5>=1))||(Voters6.voting_6>=1))||(Voters7.voting_7>=1))||(Voters8.voting_8>=1))||(Voters9.voting_9>=1))"
Computing Next relation with stutter on 1024 deadlock states
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,0.145335,18804,1,0,738,44,240,908,55,44,2014
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA Referendum-COL-0010-LTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 15 : !(("((((((((((Voters0.voting_0>=1)||(Voters1.voting_1>=1))||(Voters2.voting_2>=1))||(Voters3.voting_3>=1))||(Voters4.voting_4>=1))||(Voters5.voting_5>=1))||(Voters6.voting_6>=1))||(Voters7.voting_7>=1))||(Voters8.voting_8>=1))||(Voters9.voting_9>=1))"))
Formula 15 simplified : !"((((((((((Voters0.voting_0>=1)||(Voters1.voting_1>=1))||(Voters2.voting_2>=1))||(Voters3.voting_3>=1))||(Voters4.voting_4>=1))||(Voters5.voting_5>=1))||(Voters6.voting_6>=1))||(Voters7.voting_7>=1))||(Voters8.voting_8>=1))||(Voters9.voting_9>=1))"
Computing Next relation with stutter on 1024 deadlock states
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,0.146136,18804,1,0,738,44,240,908,55,44,2014
an accepting run exists (use option '-e' to print it)
Formula 15 is FALSE accepting run found.
FORMULA Referendum-COL-0010-LTLFireability-15 FALSE 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 1528290089183

--------------------
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 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 -consoleLog -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
Jun 06, 2018 1:01:03 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]
Jun 06, 2018 1:01:03 PM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Jun 06, 2018 1:01:03 PM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
Jun 06, 2018 1:01:25 PM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Load time of PNML (colored model parsed with PNMLFW) : 21860 ms
Jun 06, 2018 1:01:25 PM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: Transformed 4 places.
Jun 06, 2018 1:01:25 PM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: Computed order using colors.
Jun 06, 2018 1:01:25 PM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: sort/places :Dot->ready,
Voters->voted_no,voted_yes,voting,

Jun 06, 2018 1:01:25 PM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: Transformed 3 transitions.
Jun 06, 2018 1:01:25 PM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Computed order based on color domains.
Jun 06, 2018 1:01:25 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 6 ms
Jun 06, 2018 1:01:25 PM fr.lip6.move.gal.application.MccTranslator applyOrder
INFO: Applying decomposition
Jun 06, 2018 1:01:26 PM fr.lip6.move.gal.instantiate.CompositeBuilder decomposeWithOrder
INFO: Decomposing Gal with order
Jun 06, 2018 1:01:26 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 43 ms
Jun 06, 2018 1:01:26 PM fr.lip6.move.gal.instantiate.CompositeBuilder rewriteArraysToAllowPartition
INFO: Rewriting arrays voted_no, voted_yes, voting to variables to allow decomposition.
Jun 06, 2018 1:01:26 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 3 ms
Jun 06, 2018 1:01:26 PM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 5 ms
Jun 06, 2018 1:01:27 PM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 21 transitions.
Jun 06, 2018 1:01:27 PM org.smtlib.impl.Script execute
WARNING: Script execution failed on command (declare-fun s () (Array Int (Array Int Int))) with error (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Skipping mayMatrices nes/nds Error when declaring system variables to SMT solver.(error "Error writing to Z3 solver: java.io.IOException: Stream closed")
java.lang.RuntimeException: Error when declaring system variables to SMT solver.(error "Error writing to Z3 solver: java.io.IOException: Stream closed")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.init(NextBMCSolver.java:93)
at fr.lip6.move.gal.gal2smt.bmc.KInductionSolver.init(KInductionSolver.java:59)
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.init(NecessaryEnablingsolver.java:71)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:471)
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)
Jun 06, 2018 1:01:27 PM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 548ms 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="Referendum-COL-0010"
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

tar xzf /home/mcc/BenchKit/INPUTS/Referendum-COL-0010.tgz
mv Referendum-COL-0010 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 itstools"
echo " Input is Referendum-COL-0010, 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 r188-qhx2-152732140200098"
echo "====================================================================="
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 ;