Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2020-input.r170-smll-158987816000527.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is GPPP-PT-C0100N0000100000, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r170-smll-158987816000527
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 200K
-rw-r--r-- 1 mcc users 3.4K Apr 4 20:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 4 20:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Apr 4 09:15 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 4 09:15 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.7K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 8 14:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 8 14:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Apr 3 21:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Apr 3 21:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.9K Apr 3 13:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 3 13:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 4 01:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 4 01:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 17 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 1 Mar 24 05:37 large_marking
-rw-r--r-- 1 mcc users 21K 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

here is the order used to build the result vector(from text file)
FORMULA_NAME GPPP-PT-C0100N0000100000-ReachabilityFireability-00
FORMULA_NAME GPPP-PT-C0100N0000100000-ReachabilityFireability-01
FORMULA_NAME GPPP-PT-C0100N0000100000-ReachabilityFireability-02
FORMULA_NAME GPPP-PT-C0100N0000100000-ReachabilityFireability-03
FORMULA_NAME GPPP-PT-C0100N0000100000-ReachabilityFireability-04
FORMULA_NAME GPPP-PT-C0100N0000100000-ReachabilityFireability-05
FORMULA_NAME GPPP-PT-C0100N0000100000-ReachabilityFireability-06
FORMULA_NAME GPPP-PT-C0100N0000100000-ReachabilityFireability-07
FORMULA_NAME GPPP-PT-C0100N0000100000-ReachabilityFireability-08
FORMULA_NAME GPPP-PT-C0100N0000100000-ReachabilityFireability-09
FORMULA_NAME GPPP-PT-C0100N0000100000-ReachabilityFireability-10
FORMULA_NAME GPPP-PT-C0100N0000100000-ReachabilityFireability-11
FORMULA_NAME GPPP-PT-C0100N0000100000-ReachabilityFireability-12
FORMULA_NAME GPPP-PT-C0100N0000100000-ReachabilityFireability-13
FORMULA_NAME GPPP-PT-C0100N0000100000-ReachabilityFireability-14
FORMULA_NAME GPPP-PT-C0100N0000100000-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1591484470047

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-06 23:01:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-06 23:01:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-06 23:01:13] [INFO ] Load time of PNML (sax parser for PT used): 65 ms
[2020-06-06 23:01:13] [INFO ] Transformed 33 places.
[2020-06-06 23:01:13] [INFO ] Transformed 22 transitions.
[2020-06-06 23:01:13] [INFO ] Parsed PT model containing 33 places and 22 transitions in 143 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 33 ms.
Working with output stream class java.io.PrintStream
FORMULA GPPP-PT-C0100N0000100000-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0100N0000100000-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0100N0000100000-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10090 steps, including 3 resets, run finished after 42 ms. (steps per millisecond=240 ) properties seen :[0, 1, 0, 1, 1, 1, 0, 0, 0, 1, 0, 0, 0]
FORMULA GPPP-PT-C0100N0000100000-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPPP-PT-C0100N0000100000-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPPP-PT-C0100N0000100000-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPPP-PT-C0100N0000100000-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPPP-PT-C0100N0000100000-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 72 ms. (steps per millisecond=138 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 47 ms. (steps per millisecond=212 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 88 ms. (steps per millisecond=113 ) properties seen :[0, 0, 1, 0, 0, 0, 0, 0]
FORMULA GPPP-PT-C0100N0000100000-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 41 ms. (steps per millisecond=243 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 31 ms. (steps per millisecond=322 ) properties seen :[0, 1, 0, 0, 0, 0, 0]
FORMULA GPPP-PT-C0100N0000100000-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 51 ms. (steps per millisecond=196 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 29 ms. (steps per millisecond=344 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 31 ms. (steps per millisecond=322 ) properties seen :[0, 0, 0, 0, 0, 0]
// Phase 1: matrix 22 rows 33 cols
[2020-06-06 23:01:13] [INFO ] Computed 12 place invariants in 9 ms
[2020-06-06 23:01:13] [INFO ] [Real]Absence check using 6 positive place invariants in 19 ms returned unsat
[2020-06-06 23:01:13] [INFO ] [Real]Absence check using 6 positive place invariants in 6 ms returned sat
[2020-06-06 23:01:13] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 5 ms returned unsat
[2020-06-06 23:01:13] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2020-06-06 23:01:13] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 5 ms returned sat
[2020-06-06 23:01:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-06 23:01:13] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2020-06-06 23:01:13] [INFO ] Solution in real domain found non-integer solution.
[2020-06-06 23:01:14] [INFO ] [Nat]Absence check using 6 positive place invariants in 10 ms returned sat
[2020-06-06 23:01:14] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 3 ms returned sat
[2020-06-06 23:01:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-06 23:01:14] [INFO ] [Nat]Absence check using state equation in 54 ms returned unsat
[2020-06-06 23:01:14] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2020-06-06 23:01:14] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 12 ms returned sat
[2020-06-06 23:01:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-06 23:01:14] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2020-06-06 23:01:14] [INFO ] Solution in real domain found non-integer solution.
[2020-06-06 23:01:14] [INFO ] [Nat]Absence check using 6 positive place invariants in 6 ms returned sat
[2020-06-06 23:01:19] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-06 23:01:19] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 4978 ms returned (error "Failed to check-sat")
[2020-06-06 23:01:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-06 23:01:19] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed") while checking expression at index 3
[2020-06-06 23:01:19] [INFO ] [Real]Absence check using 6 positive place invariants in 6 ms returned sat
[2020-06-06 23:01:19] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 7 ms returned sat
[2020-06-06 23:01:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-06 23:01:19] [INFO ] [Real]Absence check using state equation in 27 ms returned unsat
[2020-06-06 23:01:19] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2020-06-06 23:01:19] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 5 ms returned sat
[2020-06-06 23:01:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-06 23:01:19] [INFO ] [Real]Absence check using state equation in 21 ms returned unsat
FORMULA GPPP-PT-C0100N0000100000-ReachabilityFireability-15 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA GPPP-PT-C0100N0000100000-ReachabilityFireability-13 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA GPPP-PT-C0100N0000100000-ReachabilityFireability-09 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA GPPP-PT-C0100N0000100000-ReachabilityFireability-08 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA GPPP-PT-C0100N0000100000-ReachabilityFireability-00 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Support contains 9 out of 33 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 33/33 places, 22/22 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 33 transition count 21
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 32 transition count 21
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 32 transition count 20
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 31 transition count 20
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 7 place count 29 transition count 19
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 10 place count 27 transition count 18
Applied a total of 10 rules in 34 ms. Remains 27 /33 variables (removed 6) and now considering 18/22 (removed 4) transitions.
// Phase 1: matrix 18 rows 27 cols
[2020-06-06 23:01:19] [INFO ] Computed 10 place invariants in 4 ms
[2020-06-06 23:01:19] [INFO ] Dead Transitions using invariants and state equation in 78 ms returned []
Finished structural reductions, in 1 iterations. Remains : 27/33 places, 18/22 transitions.
Incomplete random walk after 1000063 steps, including 761 resets, run finished after 628 ms. (steps per millisecond=1592 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 1134 ms. (steps per millisecond=881 ) properties seen :[0]
Interrupted probabilistic random walk after 25650243 steps, run timeout after 30001 ms. (steps per millisecond=854 ) properties seen :[0]
Probabilistic random walk after 25650243 steps, saw 3599375 distinct states, run finished after 30001 ms. (steps per millisecond=854 ) properties seen :[0]
// Phase 1: matrix 18 rows 27 cols
[2020-06-06 23:01:51] [INFO ] Computed 10 place invariants in 2 ms
[2020-06-06 23:01:51] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2020-06-06 23:01:51] [INFO ] [Real]Absence check using 4 positive and 6 generalized place invariants in 4 ms returned sat
[2020-06-06 23:01:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-06 23:01:51] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2020-06-06 23:01:51] [INFO ] Solution in real domain found non-integer solution.
[2020-06-06 23:01:51] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2020-06-06 23:01:51] [INFO ] [Nat]Absence check using 4 positive and 6 generalized place invariants in 111 ms returned sat
[2020-06-06 23:01:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-06 23:01:57] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-06 23:02:00] [INFO ] [Nat]Absence check using state equation in 9035 ms returned unknown
Support contains 9 out of 27 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 27/27 places, 18/18 transitions.
Applied a total of 0 rules in 4 ms. Remains 27 /27 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 27/27 places, 18/18 transitions.
Starting structural reductions, iteration 0 : 27/27 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 27 /27 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 27 cols
[2020-06-06 23:02:00] [INFO ] Computed 10 place invariants in 2 ms
[2020-06-06 23:02:00] [INFO ] Implicit Places using invariants in 37 ms returned [2, 3]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 40 ms to find 2 implicit places.
[2020-06-06 23:02:00] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 18 rows 25 cols
[2020-06-06 23:02:00] [INFO ] Computed 8 place invariants in 2 ms
[2020-06-06 23:02:00] [INFO ] Dead Transitions using invariants and state equation in 36 ms returned []
Starting structural reductions, iteration 1 : 25/27 places, 18/18 transitions.
Applied a total of 0 rules in 2 ms. Remains 25 /25 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2020-06-06 23:02:00] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 18 rows 25 cols
[2020-06-06 23:02:00] [INFO ] Computed 8 place invariants in 1 ms
[2020-06-06 23:02:00] [INFO ] Dead Transitions using invariants and state equation in 40 ms returned []
Finished structural reductions, in 2 iterations. Remains : 25/27 places, 18/18 transitions.
Incomplete random walk after 1000092 steps, including 761 resets, run finished after 377 ms. (steps per millisecond=2652 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 1261 ms. (steps per millisecond=793 ) properties seen :[0]
Interrupted probabilistic random walk after 30842222 steps, run timeout after 30001 ms. (steps per millisecond=1028 ) properties seen :[0]
Probabilistic random walk after 30842222 steps, saw 4306889 distinct states, run finished after 30001 ms. (steps per millisecond=1028 ) properties seen :[0]
// Phase 1: matrix 18 rows 25 cols
[2020-06-06 23:02:32] [INFO ] Computed 8 place invariants in 1 ms
[2020-06-06 23:02:32] [INFO ] [Real]Absence check using 3 positive place invariants in 11 ms returned sat
[2020-06-06 23:02:32] [INFO ] [Real]Absence check using 3 positive and 5 generalized place invariants in 4 ms returned sat
[2020-06-06 23:02:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-06 23:02:32] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2020-06-06 23:02:32] [INFO ] Solution in real domain found non-integer solution.
[2020-06-06 23:02:32] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2020-06-06 23:02:38] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-06 23:02:41] [INFO ] [Nat]Absence check using 3 positive and 5 generalized place invariants in 9058 ms returned unknown
Support contains 9 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 18/18 transitions.
Applied a total of 0 rules in 3 ms. Remains 25 /25 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 25/25 places, 18/18 transitions.
Starting structural reductions, iteration 0 : 25/25 places, 18/18 transitions.
Applied a total of 0 rules in 2 ms. Remains 25 /25 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 25 cols
[2020-06-06 23:02:41] [INFO ] Computed 8 place invariants in 0 ms
[2020-06-06 23:02:41] [INFO ] Implicit Places using invariants in 39 ms returned []
// Phase 1: matrix 18 rows 25 cols
[2020-06-06 23:02:41] [INFO ] Computed 8 place invariants in 2 ms
[2020-06-06 23:02:41] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
[2020-06-06 23:02:41] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 18 rows 25 cols
[2020-06-06 23:02:41] [INFO ] Computed 8 place invariants in 1 ms
[2020-06-06 23:02:41] [INFO ] Dead Transitions using invariants and state equation in 38 ms returned []
Finished structural reductions, in 1 iterations. Remains : 25/25 places, 18/18 transitions.
Incomplete random walk after 100028 steps, including 76 resets, run finished after 37 ms. (steps per millisecond=2703 ) properties seen :[0]
// Phase 1: matrix 18 rows 25 cols
[2020-06-06 23:02:41] [INFO ] Computed 8 place invariants in 0 ms
[2020-06-06 23:02:41] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2020-06-06 23:02:41] [INFO ] [Real]Absence check using 3 positive and 5 generalized place invariants in 5 ms returned sat
[2020-06-06 23:02:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-06 23:02:41] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2020-06-06 23:02:41] [INFO ] Solution in real domain found non-integer solution.
[2020-06-06 23:02:41] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2020-06-06 23:02:47] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-06 23:02:50] [INFO ] [Nat]Absence check using 3 positive and 5 generalized place invariants in 9225 ms returned unknown
Applied a total of 0 rules in 2 ms. Remains 25 /25 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 25 cols
[2020-06-06 23:02:50] [INFO ] Computed 8 place invariants in 0 ms
[2020-06-06 23:02:50] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2020-06-06 23:02:50] [INFO ] [Real]Absence check using 3 positive and 5 generalized place invariants in 3 ms returned sat
[2020-06-06 23:02:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-06 23:02:50] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2020-06-06 23:02:50] [INFO ] Solution in real domain found non-integer solution.
[2020-06-06 23:02:50] [INFO ] [Nat]Absence check using 3 positive place invariants in 17 ms returned sat
[2020-06-06 23:02:56] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-06 23:02:59] [INFO ] [Nat]Absence check using 3 positive and 5 generalized place invariants in 9050 ms returned unknown
[2020-06-06 23:02:59] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 3 ms.
[2020-06-06 23:02:59] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 1 ms.
[2020-06-06 23:03:00] [INFO ] Flatten gal took : 29 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityFireability @ GPPP-PT-C0100N0000100000 @ 3570 seconds
vrfy: finished
info: timeLeft: 3541
rslt: Output for ReachabilityFireability @ GPPP-PT-C0100N0000100000

{
"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",
"localtimelimit": 0,
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=ReachabilityFireability.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--json=ReachabilityFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Sat Jun 6 23:03:01 2020
",
"timelimit": 3570
},
"child": null,
"exit":
{
"error": null,
"localtimelimitreached": true,
"memory": 18216,
"runtime": 29.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityFireability.xml",
"net": "model.pnml"
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 1,
"aneg": 0,
"comp": 10,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "E (F (((1 <= p8) AND (1 <= p5) AND (1 <= p6) AND (700 <= p23) AND (((1 <= p11) AND (1 <= p12) AND (1 <= p13)) OR ((1 <= p12) AND (1 <= p13) AND (700 <= p17))))))",
"processed_size": 162,
"rewrites": 1,
"skeleton": "E(F(**))"
},
"net":
{
"arcs": 67,
"conflict_clusters": 10,
"places": 25,
"places_significant": 17,
"singleton_clusters": 0,
"transitions": 18
},
"task":
{
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 14,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
lola: LoLA will run for 3570 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: 43/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 800
lola: finding significant places
lola: 25 places, 18 transitions, 17 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 ReachabilityFireability.xml
lola: LP says that atomic proposition is always true: (1 <= p1)
lola: LP says that atomic proposition is always true: (700 <= p1)
lola: E (F (((1 <= p8) AND (1 <= p5) AND (1 <= p6) AND (700 <= p23) AND (((1 <= p11) AND (1 <= p12) AND (1 <= p13)) OR ((1 <= p12) AND (1 <= p13) AND (700 <= p17))))))
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((1 <= p8) AND (1 <= p5) AND (1 <= p6) AND (700 <= p23) AND (((1 <= p11) AND (1 <= p12) AND (1 <= p13)) OR ((1 <= p12) AND (1 <= p13) AND (700 <= p17))))))
lola: processed formula length: 162
lola: 1 rewrites
lola: closed formula file ReachabilityFireability.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: built state equation task
lola: RUNNING
lola: subprocess will run for 0 seconds at most (--localtimelimit)
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: local time limit reached - aborting
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p8) AND (1 <= p5) AND (1 <= p6) AND (700 <= p23) AND (((1 <= p11) AND (1 <= p12) AND (1 <= p13)) OR ((1 <= p12) AND (1 <= p13) AND (700 <= p17))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 14 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityFireability-0.sara
lola: state equation: calling and running sara
lola: memory consumption: 18216 KB
lola: time consumption: 29 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityFireability.json
lola: closed JSON file ReachabilityFireability.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="GPPP-PT-C0100N0000100000"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="itslola"
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-4028"
echo " Executing tool itslola"
echo " Input is GPPP-PT-C0100N0000100000, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r170-smll-158987816000527"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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