fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r185-oct2-158987931300241
Last Updated
Jun 28, 2020

About the Execution of ITS-LoLa for JoinFreeModules-PT-0003

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15736.940 1800000.00 13662.00 101.10 F normal

Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2020-input.r185-oct2-158987931300241.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2020-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is JoinFreeModules-PT-0003, examination is ReachabilityDeadlock
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r185-oct2-158987931300241
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 184K
-rw-r--r-- 1 mcc users 3.2K Apr 7 18:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 16K Apr 7 18:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 6 20:35 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 6 20:35 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.2K Apr 14 12:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Apr 14 12:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 6 04:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 6 04:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 5 10:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 5 10:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 6 20:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 6 20:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 18K Mar 24 05:37 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME ReachabilityDeadlock

=== Now, execution of the tool begins

BK_START 1591281152233

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-04 14:32:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityDeadlock, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 1800, -rebuildPNML]
[2020-06-04 14:32:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-04 14:32:34] [INFO ] Load time of PNML (sax parser for PT used): 27 ms
[2020-06-04 14:32:34] [INFO ] Transformed 16 places.
[2020-06-04 14:32:34] [INFO ] Transformed 25 transitions.
[2020-06-04 14:32:34] [INFO ] Parsed PT model containing 16 places and 25 transitions in 57 ms.
Reduce places removed 1 places and 0 transitions.
Parsed 1 properties from file /home/mcc/execution/ReachabilityDeadlock.xml in 7 ms.
Working with output stream class java.io.PrintStream
Built sparse matrix representations for Structural reductions in 2 ms.15128KB memory used
Starting structural reductions, iteration 0 : 15/15 places, 25/25 transitions.
Applied a total of 0 rules in 10 ms. Remains 15 /15 variables (removed 0) and now considering 25/25 (removed 0) transitions.
// Phase 1: matrix 25 rows 15 cols
[2020-06-04 14:32:34] [INFO ] Computed 3 place invariants in 3 ms
[2020-06-04 14:32:34] [INFO ] Dead Transitions using invariants and state equation in 133 ms returned []
Finished structural reductions, in 1 iterations. Remains : 15/15 places, 25/25 transitions.
Starting structural reductions, iteration 0 : 15/15 places, 25/25 transitions.
Applied a total of 0 rules in 14 ms. Remains 15 /15 variables (removed 0) and now considering 25/25 (removed 0) transitions.
// Phase 1: matrix 25 rows 15 cols
[2020-06-04 14:32:34] [INFO ] Computed 3 place invariants in 1 ms
[2020-06-04 14:32:34] [INFO ] Implicit Places using invariants in 13 ms returned []
// Phase 1: matrix 25 rows 15 cols
[2020-06-04 14:32:34] [INFO ] Computed 3 place invariants in 0 ms
[2020-06-04 14:32:34] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2020-06-04 14:32:34] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 25 rows 15 cols
[2020-06-04 14:32:34] [INFO ] Computed 3 place invariants in 1 ms
[2020-06-04 14:32:34] [INFO ] Dead Transitions using invariants and state equation in 29 ms returned []
Finished structural reductions, in 1 iterations. Remains : 15/15 places, 25/25 transitions.
Random walk for 1250000 steps, including 0 resets, run took 753 ms (no deadlock found). (steps per millisecond=1660 )
Random directed walk for 1250001 steps, including 0 resets, run took 606 ms (no deadlock found). (steps per millisecond=2062 )
// Phase 1: matrix 25 rows 15 cols
[2020-06-04 14:32:35] [INFO ] Computed 3 place invariants in 7 ms
[2020-06-04 14:32:36] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2020-06-04 14:32:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 14:32:36] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2020-06-04 14:32:36] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 14:32:36] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2020-06-04 14:32:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 14:32:36] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2020-06-04 14:32:36] [INFO ] Computed and/alt/rep : 18/45/18 causal constraints in 11 ms.
[2020-06-04 14:32:36] [INFO ] Added : 18 causal constraints over 4 iterations in 113 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 4 ms.
Parikh directed walk for 67700 steps, including 674 resets, run took 75 ms. (steps per millisecond=902 )
Random directed walk for 500000 steps, including 0 resets, run took 224 ms (no deadlock found). (steps per millisecond=2232 )
Random walk for 500000 steps, including 0 resets, run took 306 ms (no deadlock found). (steps per millisecond=1633 )
Random directed walk for 500003 steps, including 0 resets, run took 249 ms (no deadlock found). (steps per millisecond=2008 )
Random walk for 500000 steps, including 0 resets, run took 264 ms (no deadlock found). (steps per millisecond=1893 )
[2020-06-04 14:32:37] [INFO ] Flatten gal took : 20 ms
[2020-06-04 14:32:37] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityDeadlock.sr.xml took 1 ms.
[2020-06-04 14:32:37] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 0 ms.
info: Time: 1800 - MCC
vrfy: Checking ReachabilityDeadlock @ JoinFreeModules-PT-0003 @ 1770 seconds

FORMULA ReachabilityDeadlock FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS SYMMETRIES TOPOLOGICAL USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 1767
rslt: Output for ReachabilityDeadlock @ JoinFreeModules-PT-0003

{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2020",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=ReachabilityDeadlock.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=combined",
"--siphontrap=par",
"--siphondepth=10",
"--findpath=par",
"--retrylimit=0",
"--depthlimit=1000000",
"--symmetry",
"--symmtimelimit=300",
"--threads=2",
"--symmetrydepth=1073741824",
"--timelimit=1770",
"--json=ReachabilityDeadlock.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Thu Jun 4 14:32:37 2020
",
"timelimit": 1770
},
"child": null,
"exit":
{
"error": null,
"memory": 19572,
"runtime": 3.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityDeadlock.xml",
"net": "model.pnml"
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 1,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 0
},
"processed": "E (F (DEADLOCK))",
"processed_size": 16,
"rewrites": 1,
"skeleton": "E(F(**))"
},
"net":
{
"arcs": 69,
"conflict_clusters": 13,
"places": 15,
"places_significant": 12,
"singleton_clusters": 0,
"transitions": 25
},
"result":
{
"edges": 176,
"markings": 98,
"produced_by": "state space",
"value": false
},
"task":
{
"findpath":
{
"depthlimit": 1000000,
"retrylimit": null,
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 2
},
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"symmetry":
{
"card": 6.000000,
"composed": 0,
"dead_branches": 0,
"generators": 3,
"interrupted": false,
"real_computed": 3,
"timelimit": 300
},
"threads": 2,
"type": "dfs"
},
"type": "reachability",
"workflow": "findpath||search"
}
}
lola: LoLA will run for 1770 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 40/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 480
lola: finding significant places
lola: 15 places, 25 transitions, 12 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from ReachabilityDeadlock.xml
lola: E (F (DEADLOCK))
lola: checking reachability
lola: Planning: workflow for reachability check: findpath||search (--findpath=par)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (DEADLOCK))
lola: processed formula length: 16
lola: 1 rewrites
lola: closed formula file ReachabilityDeadlock.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: SEARCH (findpath)
lola: findpath: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: findpath: starting randomized, memory-less exploration (--findpath)
lola: findpath: searching for paths with maximal depth 1000000 (--depthlimit)
lola: findpath: no retry limit given (--retrylimit)
lola: findpath: transitions are chosen hash-driven
lola: computing symmetries (--symmetry)
lola: time limit for symmetry computation of 300 seconds given (--symmtimelimit)
lola: computed 3 generators (3 in search tree, 0 by composition)
lola: representing 6 symmetries
lola: 0 dead branches visited in search tree
lola: RESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 98 markings, 176 edges
lola: memory consumption: 19572 KB
lola: time consumption: 3 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityDeadlock.json
lola: closed JSON file ReachabilityDeadlock.json
rslt: finished

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

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="JoinFreeModules-PT-0003"
export BK_EXAMINATION="ReachabilityDeadlock"
export BK_TOOL="itslola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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-4028"
echo " Executing tool itslola"
echo " Input is JoinFreeModules-PT-0003, examination is ReachabilityDeadlock"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r185-oct2-158987931300241"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/JoinFreeModules-PT-0003.tgz
mv JoinFreeModules-PT-0003 execution
cd execution
if [ "ReachabilityDeadlock" = "ReachabilityDeadlock" ] || [ "ReachabilityDeadlock" = "UpperBounds" ] || [ "ReachabilityDeadlock" = "QuasiLiveness" ] || [ "ReachabilityDeadlock" = "StableMarking" ] || [ "ReachabilityDeadlock" = "Liveness" ] || [ "ReachabilityDeadlock" = "OneSafe" ] || [ "ReachabilityDeadlock" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityDeadlock" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityDeadlock" != "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 "ReachabilityDeadlock.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityDeadlock.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityDeadlock.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 '' ReachabilityDeadlock.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityDeadlock" = "ReachabilityDeadlock" ] || [ "ReachabilityDeadlock" = "QuasiLiveness" ] || [ "ReachabilityDeadlock" = "StableMarking" ] || [ "ReachabilityDeadlock" = "Liveness" ] || [ "ReachabilityDeadlock" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityDeadlock"
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 ;