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 224K
-rw-r--r-- 1 mcc users 4.4K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.2K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 20K 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.3K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 26 09:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 13K May 26 09:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 26 09:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 12K May 26 09:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.4K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 114 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 352 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.6K 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 3 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 29K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool itstools
Input is DatabaseWithMutex-PT-02, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r236-blw3-152732477000011
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527943336708

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/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.201805151631/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 : !((F(X(("((((Acknowledge_2_2+Acknowledge_1_2)+Acknowledge_2_1)+Acknowledge_1_1)>=3)")U("((((Message_2_2+Message_1_2)+Message_2_1)+Message_1_1)>=3)")))))
Formula 0 simplified : !FX("((((Acknowledge_2_2+Acknowledge_1_2)+Acknowledge_2_1)+Acknowledge_1_1)>=3)" U "((((Message_2_2+Message_1_2)+Message_2_1)+Message_1_1)>=3)")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 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,0.055285,17576,1,0,25,7057,20,13,832,6502,80
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA DatabaseWithMutex-PT-02-LTLCardinality-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 1 : !((F(X(X(X("((((Acknowledge_2_2+Acknowledge_1_2)+Acknowledge_2_1)+Acknowledge_1_1)<=(((RecBuff_1_1+RecBuff_2_1)+RecBuff_1_2)+RecBuff_2_2))"))))))
Formula 1 simplified : !FXXX"((((Acknowledge_2_2+Acknowledge_1_2)+Acknowledge_2_1)+Acknowledge_1_1)<=(((RecBuff_1_1+RecBuff_2_1)+RecBuff_1_2)+RecBuff_2_2))"
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.05639,17988,1,0,26,7099,29,13,841,6538,87
no accepting run found
Formula 1 is TRUE no accepting run found.
FORMULA DatabaseWithMutex-PT-02-LTLCardinality-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 2 : !(("((((WaitMutex_1_1+WaitMutex_2_2)+WaitMutex_1_2)+WaitMutex_2_1)<=(all_passive_2+all_passive_1))"))
Formula 2 simplified : !"((((WaitMutex_1_1+WaitMutex_2_2)+WaitMutex_1_2)+WaitMutex_2_1)<=(all_passive_2+all_passive_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,0.056775,18224,1,0,26,7099,32,13,848,6538,89
no accepting run found
Formula 2 is TRUE no accepting run found.
FORMULA DatabaseWithMutex-PT-02-LTLCardinality-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 3 : !(("((((WaitMutex_1_1+WaitMutex_2_2)+WaitMutex_1_2)+WaitMutex_2_1)>=3)"))
Formula 3 simplified : !"((((WaitMutex_1_1+WaitMutex_2_2)+WaitMutex_1_2)+WaitMutex_2_1)>=3)"
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.05917,18224,1,0,26,7178,41,13,904,6752,98
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA DatabaseWithMutex-PT-02-LTLCardinality-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 4 : !((X((X("((Mutex_2+Mutex_1)<=(all_passive_2+all_passive_1))"))U(G("((all_active_1+all_active_2)<=(((Active_1_2+Active_2_2)+Active_1_1)+Active_2_1))")))))
Formula 4 simplified : !X(X"((Mutex_2+Mutex_1)<=(all_passive_2+all_passive_1))" U G"((all_active_1+all_active_2)<=(((Active_1_2+Active_2_2)+Active_1_1)+Active_2_1))")
3 unique states visited
3 strongly connected components in search stack
3 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.06578,19316,1,0,31,7690,47,14,944,7635,123
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA DatabaseWithMutex-PT-02-LTLCardinality-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 5 : !(((F(X("((Mutex_2+Mutex_1)>=3)")))U("((((RecBuff_1_1+RecBuff_2_1)+RecBuff_1_2)+RecBuff_2_2)>=1)")))
Formula 5 simplified : !(FX"((Mutex_2+Mutex_1)>=3)" U "((((RecBuff_1_1+RecBuff_2_1)+RecBuff_1_2)+RecBuff_2_2)>=1)")
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 32 rows 38 cols
invariant :MesBuffReply_1_2 + Message_1_2 + -1'Active_2_2 + Acknowledge_1_2 + updating_1_2 + RecBuff_1_2 = 0
invariant :Message_2_2 + Acknowledge_2_2 + -1'Active_1_2 + RecBuff_2_2 + updating_2_2 + MesBuffReply_2_2 = 0
invariant :Modify_2_1 + Modify_1_1 + Active_1_1 + Mutex_1 + Active_2_1 = 1
invariant :WaitMutex_2_2 + -1'Modify_1_1 + all_active_2 + -1'Active_1_2 + -1'Mutex_2 + -1'Active_1_1 + -1'Mutex_1 + -1'Modify_1_2 + WaitMutex_2_1 = -1
invariant :Modify_2_2 + Active_1_2 + Active_2_2 + Mutex_2 + Modify_1_2 = 1
invariant :WaitMutex_1_1 + all_active_1 + Modify_1_1 + WaitMutex_1_2 + Active_1_2 + Active_1_1 + Modify_1_2 = 1
invariant :RecBuff_1_1 + -1'updating_1_2 + Acknowledge_1_1 + -1'Active_2_1 + -1'all_passive_1 + MesBuffReply_1_1 + Message_1_1 = -1
invariant :updating_1_1 + updating_1_2 + all_passive_1 = 1
invariant :MesBuffReply_2_1 + RecBuff_2_1 + updating_2_1 + Acknowledge_2_1 + -1'Active_1_1 + Message_2_1 = 0
invariant :all_passive_2 + updating_2_1 + updating_2_2 = 1
10 unique states visited
9 strongly connected components in search stack
10 transitions explored
9 items max in DFS search stack
5 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.122148,21404,1,0,113,15169,58,70,956,28234,454
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA DatabaseWithMutex-PT-02-LTLCardinality-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 6 : !((F(X(G(G("((((MesBuffReply_2_1+MesBuffReply_1_2)+MesBuffReply_2_2)+MesBuffReply_1_1)<=(all_passive_2+all_passive_1))"))))))
Formula 6 simplified : !FXG"((((MesBuffReply_2_1+MesBuffReply_1_2)+MesBuffReply_2_2)+MesBuffReply_1_1)<=(all_passive_2+all_passive_1))"
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,0.125511,21924,1,0,113,15179,71,70,997,28265,489
no accepting run found
Formula 6 is TRUE no accepting run found.
FORMULA DatabaseWithMutex-PT-02-LTLCardinality-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 7 : !((X("((((Message_2_2+Message_1_2)+Message_2_1)+Message_1_1)<=(((updating_2_1+updating_1_1)+updating_1_2)+updating_2_2))")))
Formula 7 simplified : !X"((((Message_2_2+Message_1_2)+Message_2_1)+Message_1_1)<=(((updating_2_1+updating_1_1)+updating_1_2)+updating_2_2))"
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.125972,21924,1,0,113,15179,74,70,1006,28265,491
no accepting run found
Formula 7 is TRUE no accepting run found.
FORMULA DatabaseWithMutex-PT-02-LTLCardinality-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 8 : !(("(Message_1_2<=MesBuffReply_2_2)"))
Formula 8 simplified : !"(Message_1_2<=MesBuffReply_2_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,0.126205,21924,1,0,113,15179,77,70,1009,28267,493
no accepting run found
Formula 8 is TRUE no accepting run found.
FORMULA DatabaseWithMutex-PT-02-LTLCardinality-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 9 : !((F(F("(all_active_1<=MesBuffReply_2_1)"))))
Formula 9 simplified : !F"(all_active_1<=MesBuffReply_2_1)"
2 unique states visited
2 strongly connected components in search stack
2 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.128684,21924,1,0,134,15787,86,78,1013,29194,537
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA DatabaseWithMutex-PT-02-LTLCardinality-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 10 : !(((X(G("(Active_2_1<=Active_1_2)")))U(("(MesBuffReply_2_2<=Modify_1_2)")U("(updating_2_1<=MesBuffReply_2_1)"))))
Formula 10 simplified : !(XG"(Active_2_1<=Active_1_2)" U ("(MesBuffReply_2_2<=Modify_1_2)" U "(updating_2_1<=MesBuffReply_2_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,0.130132,22364,1,0,134,15787,97,78,1022,29195,543
no accepting run found
Formula 10 is TRUE no accepting run found.
FORMULA DatabaseWithMutex-PT-02-LTLCardinality-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 11 : !((X(G(("(Acknowledge_2_1<=Active_2_1)")U("(Message_2_2<=Acknowledge_1_1)")))))
Formula 11 simplified : !XG("(Acknowledge_2_1<=Active_2_1)" U "(Message_2_2<=Acknowledge_1_1)")
9 unique states visited
0 strongly connected components in search stack
9 transitions explored
9 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.134203,22744,1,0,148,16013,115,83,1038,29892,632
no accepting run found
Formula 11 is TRUE no accepting run found.
FORMULA DatabaseWithMutex-PT-02-LTLCardinality-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 12 : !(("(Active_2_1<=Mutex_2)"))
Formula 12 simplified : !"(Active_2_1<=Mutex_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,0.134478,22744,1,0,148,16013,118,83,1041,29892,634
no accepting run found
Formula 12 is TRUE no accepting run found.
FORMULA DatabaseWithMutex-PT-02-LTLCardinality-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 13 : !((F(X("(Active_1_2<=Modify_2_2)"))))
Formula 13 simplified : !FX"(Active_1_2<=Modify_2_2)"
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.134772,22744,1,0,148,16013,127,83,1045,29894,638
no accepting run found
Formula 13 is TRUE no accepting run found.
FORMULA DatabaseWithMutex-PT-02-LTLCardinality-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 14 : !((F("(Acknowledge_2_1<=Message_2_1)")))
Formula 14 simplified : !F"(Acknowledge_2_1<=Message_2_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,0.135028,22744,1,0,148,16013,136,83,1048,29894,642
no accepting run found
Formula 14 is TRUE no accepting run found.
FORMULA DatabaseWithMutex-PT-02-LTLCardinality-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 15 : !((F("(Message_2_2<=Message_2_1)")))
Formula 15 simplified : !F"(Message_2_2<=Message_2_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,0.135282,22744,1,0,148,16013,145,83,1051,29895,646
no accepting run found
Formula 15 is TRUE no accepting run found.
FORMULA DatabaseWithMutex-PT-02-LTLCardinality-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
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 1527943339192

--------------------
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/ -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/ -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 02, 2018 12:42:18 PM 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/, -smt]
Jun 02, 2018 12:42:18 PM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Jun 02, 2018 12:42:18 PM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 33 ms
Jun 02, 2018 12:42:18 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 38 places.
Jun 02, 2018 12:42:18 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 32 transitions.
Jun 02, 2018 12:42:18 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 6 ms
Jun 02, 2018 12:42:18 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 63 ms
Jun 02, 2018 12:42:18 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 1 ms
Jun 02, 2018 12:42:18 PM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLCardinality.ltl : 1 ms
Jun 02, 2018 12:42:18 PM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 32 transitions.
Jun 02, 2018 12:42:18 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 10 place invariants in 10 ms
Jun 02, 2018 12:42:18 PM fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver checkSat
WARNING: SMT solver unexpectedly returned 'unknown' answer, retrying.
Skipping mayMatrices nes/nds SMT solver raised an exception or timeout :(error "Failed to check-sat")
java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:297)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:305)
at fr.lip6.move.gal.gal2smt.bmc.KInductionSolver.init(KInductionSolver.java:116)
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 02, 2018 12:42:18 PM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 156ms 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="DatabaseWithMutex-PT-02"
export BK_EXAMINATION="LTLCardinality"
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/DatabaseWithMutex-PT-02.tgz
mv DatabaseWithMutex-PT-02 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 DatabaseWithMutex-PT-02, 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 r236-blw3-152732477000011"
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 ;