Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2021-input.r189-tajo-162089433000404.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2021-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 gold2020
Input is ResAllocation-PT-R020C002, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r189-tajo-162089433000404
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 18K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 157K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 82K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.7K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Mar 28 16:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 16:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 28 16:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 28 16:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Mar 27 10:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K Mar 27 10:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Mar 25 14:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 25 14:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 22 08:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 08:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 9 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 85K May 5 16:51 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 ResAllocation-PT-R020C002-ReachabilityFireability-00
FORMULA_NAME ResAllocation-PT-R020C002-ReachabilityFireability-01
FORMULA_NAME ResAllocation-PT-R020C002-ReachabilityFireability-02
FORMULA_NAME ResAllocation-PT-R020C002-ReachabilityFireability-03
FORMULA_NAME ResAllocation-PT-R020C002-ReachabilityFireability-04
FORMULA_NAME ResAllocation-PT-R020C002-ReachabilityFireability-05
FORMULA_NAME ResAllocation-PT-R020C002-ReachabilityFireability-06
FORMULA_NAME ResAllocation-PT-R020C002-ReachabilityFireability-07
FORMULA_NAME ResAllocation-PT-R020C002-ReachabilityFireability-08
FORMULA_NAME ResAllocation-PT-R020C002-ReachabilityFireability-09
FORMULA_NAME ResAllocation-PT-R020C002-ReachabilityFireability-10
FORMULA_NAME ResAllocation-PT-R020C002-ReachabilityFireability-11
FORMULA_NAME ResAllocation-PT-R020C002-ReachabilityFireability-12
FORMULA_NAME ResAllocation-PT-R020C002-ReachabilityFireability-13
FORMULA_NAME ResAllocation-PT-R020C002-ReachabilityFireability-14
FORMULA_NAME ResAllocation-PT-R020C002-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1621430354827

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-19 13:19:16] [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]
[2021-05-19 13:19:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-19 13:19:16] [INFO ] Load time of PNML (sax parser for PT used): 39 ms
[2021-05-19 13:19:16] [INFO ] Transformed 80 places.
[2021-05-19 13:19:16] [INFO ] Transformed 42 transitions.
[2021-05-19 13:19:16] [INFO ] Parsed PT model containing 80 places and 42 transitions in 71 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
FORMULA ResAllocation-PT-R020C002-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 86 resets, run finished after 52 ms. (steps per millisecond=192 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0]
FORMULA ResAllocation-PT-R020C002-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 26 ms. (steps per millisecond=384 ) properties seen :[0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
FORMULA ResAllocation-PT-R020C002-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 24 ms. (steps per millisecond=416 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 14 ms. (steps per millisecond=714 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 21 ms. (steps per millisecond=476 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 12 ms. (steps per millisecond=833 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 17 ms. (steps per millisecond=588 ) properties seen :[0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0]
FORMULA ResAllocation-PT-R020C002-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties seen :[0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0]
FORMULA ResAllocation-PT-R020C002-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 16 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 52 ms. (steps per millisecond=192 ) properties seen :[0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0]
FORMULA ResAllocation-PT-R020C002-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 16 ms. (steps per millisecond=625 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 12 ms. (steps per millisecond=833 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 28 ms. (steps per millisecond=357 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 42 rows 80 cols
[2021-05-19 13:19:16] [INFO ] Computed 40 place invariants in 3 ms
[2021-05-19 13:19:16] [INFO ] [Real]Absence check using 40 positive place invariants in 23 ms returned sat
[2021-05-19 13:19:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:19:16] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2021-05-19 13:19:16] [INFO ] Deduced a trap composed of 4 places in 36 ms
[2021-05-19 13:19:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 52 ms
[2021-05-19 13:19:16] [INFO ] [Real]Absence check using 40 positive place invariants in 10 ms returned sat
[2021-05-19 13:19:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:19:16] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2021-05-19 13:19:16] [INFO ] Deduced a trap composed of 4 places in 17 ms
[2021-05-19 13:19:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 25 ms
[2021-05-19 13:19:17] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 13:19:17] [INFO ] [Nat]Absence check using 40 positive place invariants in 12 ms returned sat
[2021-05-19 13:19:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 13:19:17] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2021-05-19 13:19:17] [INFO ] Deduced a trap composed of 4 places in 13 ms
[2021-05-19 13:19:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 19 ms
[2021-05-19 13:19:17] [INFO ] Computed and/alt/rep : 40/40/40 causal constraints in 2 ms.
[2021-05-19 13:19:17] [INFO ] Added : 32 causal constraints over 7 iterations in 38 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 2 ms.
[2021-05-19 13:19:17] [INFO ] [Real]Absence check using 40 positive place invariants in 7 ms returned sat
[2021-05-19 13:19:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:19:17] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2021-05-19 13:19:17] [INFO ] Computed and/alt/rep : 40/40/40 causal constraints in 3 ms.
[2021-05-19 13:19:17] [INFO ] Added : 30 causal constraints over 6 iterations in 32 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 5 ms.
[2021-05-19 13:19:17] [INFO ] [Real]Absence check using 40 positive place invariants in 7 ms returned unsat
[2021-05-19 13:19:17] [INFO ] [Real]Absence check using 40 positive place invariants in 3 ms returned unsat
[2021-05-19 13:19:17] [INFO ] [Real]Absence check using 40 positive place invariants in 7 ms returned sat
[2021-05-19 13:19:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:19:17] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2021-05-19 13:19:17] [INFO ] Computed and/alt/rep : 40/40/40 causal constraints in 3 ms.
[2021-05-19 13:19:17] [INFO ] Added : 19 causal constraints over 4 iterations in 30 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 2 ms.
[2021-05-19 13:19:17] [INFO ] [Real]Absence check using 40 positive place invariants in 4 ms returned unsat
[2021-05-19 13:19:17] [INFO ] [Real]Absence check using 40 positive place invariants in 9 ms returned sat
[2021-05-19 13:19:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:19:17] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2021-05-19 13:19:17] [INFO ] Deduced a trap composed of 4 places in 9 ms
[2021-05-19 13:19:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 16 ms
[2021-05-19 13:19:17] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 13:19:17] [INFO ] [Nat]Absence check using 40 positive place invariants in 10 ms returned sat
[2021-05-19 13:19:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 13:19:17] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2021-05-19 13:19:17] [INFO ] Deduced a trap composed of 4 places in 10 ms
[2021-05-19 13:19:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 15 ms
[2021-05-19 13:19:17] [INFO ] Computed and/alt/rep : 40/40/40 causal constraints in 4 ms.
[2021-05-19 13:19:17] [INFO ] Added : 25 causal constraints over 5 iterations in 27 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 3 ms.
[2021-05-19 13:19:17] [INFO ] [Real]Absence check using 40 positive place invariants in 9 ms returned sat
[2021-05-19 13:19:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:19:17] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2021-05-19 13:19:17] [INFO ] Computed and/alt/rep : 40/40/40 causal constraints in 3 ms.
[2021-05-19 13:19:17] [INFO ] Added : 24 causal constraints over 5 iterations in 24 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 2 ms.
[2021-05-19 13:19:17] [INFO ] [Real]Absence check using 40 positive place invariants in 8 ms returned sat
[2021-05-19 13:19:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:19:17] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2021-05-19 13:19:17] [INFO ] Deduced a trap composed of 4 places in 9 ms
[2021-05-19 13:19:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 13 ms
[2021-05-19 13:19:17] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 13:19:17] [INFO ] [Nat]Absence check using 40 positive place invariants in 8 ms returned sat
[2021-05-19 13:19:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 13:19:17] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2021-05-19 13:19:17] [INFO ] Computed and/alt/rep : 40/40/40 causal constraints in 2 ms.
[2021-05-19 13:19:17] [INFO ] Added : 34 causal constraints over 7 iterations in 24 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 3 ms.
FORMULA ResAllocation-PT-R020C002-ReachabilityFireability-12 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ResAllocation-PT-R020C002-ReachabilityFireability-05 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ResAllocation-PT-R020C002-ReachabilityFireability-04 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ResAllocation-PT-R020C002-ReachabilityFireability-00 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 12200 steps, including 150 resets, run finished after 28 ms. (steps per millisecond=435 ) properties seen :[0, 0, 1, 0, 0, 0] could not realise parikh vector
FORMULA ResAllocation-PT-R020C002-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 4200 steps, including 113 resets, run finished after 9 ms. (steps per millisecond=466 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 5000 steps, including 118 resets, run finished after 12 ms. (steps per millisecond=416 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 9700 steps, including 98 resets, run finished after 19 ms. (steps per millisecond=510 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 9400 steps, including 138 resets, run finished after 15 ms. (steps per millisecond=626 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 8400 steps, including 142 resets, run finished after 13 ms. (steps per millisecond=646 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Support contains 35 out of 80 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 80/80 places, 42/42 transitions.
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 80 transition count 41
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 79 transition count 41
Applied a total of 2 rules in 14 ms. Remains 79 /80 variables (removed 1) and now considering 41/42 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 79/80 places, 41/42 transitions.
Incomplete random walk after 1000000 steps, including 9475 resets, run finished after 1749 ms. (steps per millisecond=571 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 1481 resets, run finished after 1217 ms. (steps per millisecond=821 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 2211 resets, run finished after 868 ms. (steps per millisecond=1152 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 2302 resets, run finished after 808 ms. (steps per millisecond=1237 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 1723 resets, run finished after 1055 ms. (steps per millisecond=947 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 2400 resets, run finished after 996 ms. (steps per millisecond=1004 ) properties seen :[0, 0, 0, 0, 0]
Interrupted probabilistic random walk after 28491700 steps, run timeout after 30001 ms. (steps per millisecond=949 ) properties seen :[0, 0, 0, 0, 0]
Probabilistic random walk after 28491700 steps, saw 4401539 distinct states, run finished after 30001 ms. (steps per millisecond=949 ) properties seen :[0, 0, 0, 0, 0]
// Phase 1: matrix 41 rows 79 cols
[2021-05-19 13:19:54] [INFO ] Computed 40 place invariants in 2 ms
[2021-05-19 13:19:54] [INFO ] [Real]Absence check using 40 positive place invariants in 17 ms returned sat
[2021-05-19 13:19:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:19:54] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2021-05-19 13:19:54] [INFO ] Computed and/alt/rep : 39/39/39 causal constraints in 3 ms.
[2021-05-19 13:19:54] [INFO ] Added : 35 causal constraints over 7 iterations in 38 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 2 ms.
[2021-05-19 13:19:54] [INFO ] [Real]Absence check using 40 positive place invariants in 7 ms returned sat
[2021-05-19 13:19:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:19:54] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2021-05-19 13:19:54] [INFO ] Deduced a trap composed of 4 places in 10 ms
[2021-05-19 13:19:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 14 ms
[2021-05-19 13:19:54] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 13:19:54] [INFO ] [Nat]Absence check using 40 positive place invariants in 9 ms returned sat
[2021-05-19 13:19:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 13:19:54] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2021-05-19 13:19:54] [INFO ] Deduced a trap composed of 4 places in 9 ms
[2021-05-19 13:19:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 13 ms
[2021-05-19 13:19:54] [INFO ] Computed and/alt/rep : 39/39/39 causal constraints in 2 ms.
[2021-05-19 13:19:54] [INFO ] Added : 32 causal constraints over 7 iterations in 29 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 1 ms.
[2021-05-19 13:19:54] [INFO ] [Real]Absence check using 40 positive place invariants in 8 ms returned sat
[2021-05-19 13:19:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:19:54] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2021-05-19 13:19:54] [INFO ] Deduced a trap composed of 3 places in 5 ms
[2021-05-19 13:19:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 9 ms
[2021-05-19 13:19:54] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 13:19:54] [INFO ] [Nat]Absence check using 40 positive place invariants in 7 ms returned sat
[2021-05-19 13:19:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 13:19:54] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2021-05-19 13:19:54] [INFO ] Deduced a trap composed of 3 places in 6 ms
[2021-05-19 13:19:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 11 ms
[2021-05-19 13:19:54] [INFO ] Computed and/alt/rep : 39/39/39 causal constraints in 2 ms.
[2021-05-19 13:19:54] [INFO ] Added : 29 causal constraints over 6 iterations in 24 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 2 ms.
[2021-05-19 13:19:54] [INFO ] [Real]Absence check using 40 positive place invariants in 10 ms returned sat
[2021-05-19 13:19:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:19:55] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2021-05-19 13:19:55] [INFO ] Deduced a trap composed of 4 places in 9 ms
[2021-05-19 13:19:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 13 ms
[2021-05-19 13:19:55] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 13:19:55] [INFO ] [Nat]Absence check using 40 positive place invariants in 10 ms returned sat
[2021-05-19 13:19:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 13:19:55] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2021-05-19 13:19:55] [INFO ] Deduced a trap composed of 4 places in 7 ms
[2021-05-19 13:19:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 14 ms
[2021-05-19 13:19:55] [INFO ] Computed and/alt/rep : 39/39/39 causal constraints in 2 ms.
[2021-05-19 13:19:55] [INFO ] Added : 23 causal constraints over 5 iterations in 17 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 1 ms.
[2021-05-19 13:19:55] [INFO ] [Real]Absence check using 40 positive place invariants in 7 ms returned sat
[2021-05-19 13:19:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:19:55] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2021-05-19 13:19:55] [INFO ] Computed and/alt/rep : 39/39/39 causal constraints in 2 ms.
[2021-05-19 13:19:55] [INFO ] Added : 33 causal constraints over 7 iterations in 31 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 2 ms.
Incomplete Parikh walk after 9700 steps, including 218 resets, run finished after 16 ms. (steps per millisecond=606 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 8700 steps, including 125 resets, run finished after 13 ms. (steps per millisecond=669 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 9400 steps, including 173 resets, run finished after 14 ms. (steps per millisecond=671 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 9000 steps, including 212 resets, run finished after 14 ms. (steps per millisecond=642 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 8900 steps, including 181 resets, run finished after 15 ms. (steps per millisecond=593 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Support contains 35 out of 79 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 79/79 places, 41/41 transitions.
Applied a total of 0 rules in 2 ms. Remains 79 /79 variables (removed 0) and now considering 41/41 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 79/79 places, 41/41 transitions.
Starting structural reductions, iteration 0 : 79/79 places, 41/41 transitions.
Applied a total of 0 rules in 1 ms. Remains 79 /79 variables (removed 0) and now considering 41/41 (removed 0) transitions.
// Phase 1: matrix 41 rows 79 cols
[2021-05-19 13:19:55] [INFO ] Computed 40 place invariants in 0 ms
[2021-05-19 13:19:55] [INFO ] Implicit Places using invariants in 60 ms returned [40, 44, 50, 52, 54, 56, 60, 62, 66, 68, 72, 74, 76, 78]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 63 ms to find 14 implicit places.
[2021-05-19 13:19:55] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 41 rows 65 cols
[2021-05-19 13:19:55] [INFO ] Computed 26 place invariants in 1 ms
[2021-05-19 13:19:55] [INFO ] Dead Transitions using invariants and state equation in 41 ms returned []
Starting structural reductions, iteration 1 : 65/79 places, 41/41 transitions.
Applied a total of 0 rules in 2 ms. Remains 65 /65 variables (removed 0) and now considering 41/41 (removed 0) transitions.
[2021-05-19 13:19:55] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 41 rows 65 cols
[2021-05-19 13:19:55] [INFO ] Computed 26 place invariants in 2 ms
[2021-05-19 13:19:55] [INFO ] Dead Transitions using invariants and state equation in 56 ms returned []
Finished structural reductions, in 2 iterations. Remains : 65/79 places, 41/41 transitions.
Incomplete random walk after 1000000 steps, including 9473 resets, run finished after 1285 ms. (steps per millisecond=778 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 1484 resets, run finished after 873 ms. (steps per millisecond=1145 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 2215 resets, run finished after 629 ms. (steps per millisecond=1589 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 2300 resets, run finished after 599 ms. (steps per millisecond=1669 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 1721 resets, run finished after 703 ms. (steps per millisecond=1422 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 2389 resets, run finished after 742 ms. (steps per millisecond=1347 ) properties seen :[0, 0, 0, 0, 0]
Interrupted probabilistic random walk after 35434851 steps, run timeout after 30001 ms. (steps per millisecond=1181 ) properties seen :[0, 0, 0, 0, 0]
Probabilistic random walk after 35434851 steps, saw 5426019 distinct states, run finished after 30001 ms. (steps per millisecond=1181 ) properties seen :[0, 0, 0, 0, 0]
// Phase 1: matrix 41 rows 65 cols
[2021-05-19 13:20:30] [INFO ] Computed 26 place invariants in 1 ms
[2021-05-19 13:20:30] [INFO ] [Real]Absence check using 26 positive place invariants in 14 ms returned sat
[2021-05-19 13:20:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:20:30] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2021-05-19 13:20:30] [INFO ] Deduced a trap composed of 4 places in 17 ms
[2021-05-19 13:20:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 22 ms
[2021-05-19 13:20:30] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 13:20:30] [INFO ] [Nat]Absence check using 26 positive place invariants in 9 ms returned sat
[2021-05-19 13:20:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 13:20:30] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2021-05-19 13:20:30] [INFO ] Deduced a trap composed of 4 places in 18 ms
[2021-05-19 13:20:30] [INFO ] Deduced a trap composed of 4 places in 13 ms
[2021-05-19 13:20:30] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 36 ms
[2021-05-19 13:20:30] [INFO ] Computed and/alt/rep : 39/39/39 causal constraints in 2 ms.
[2021-05-19 13:20:30] [INFO ] Added : 32 causal constraints over 7 iterations in 28 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 2 ms.
[2021-05-19 13:20:30] [INFO ] [Real]Absence check using 26 positive place invariants in 6 ms returned sat
[2021-05-19 13:20:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:20:30] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2021-05-19 13:20:30] [INFO ] Computed and/alt/rep : 39/39/39 causal constraints in 2 ms.
[2021-05-19 13:20:30] [INFO ] Added : 34 causal constraints over 7 iterations in 29 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 1 ms.
[2021-05-19 13:20:30] [INFO ] [Real]Absence check using 26 positive place invariants in 7 ms returned sat
[2021-05-19 13:20:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:20:30] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2021-05-19 13:20:30] [INFO ] Deduced a trap composed of 4 places in 8 ms
[2021-05-19 13:20:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 13 ms
[2021-05-19 13:20:30] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 13:20:30] [INFO ] [Nat]Absence check using 26 positive place invariants in 6 ms returned sat
[2021-05-19 13:20:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 13:20:30] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2021-05-19 13:20:30] [INFO ] Deduced a trap composed of 4 places in 12 ms
[2021-05-19 13:20:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 16 ms
[2021-05-19 13:20:30] [INFO ] Computed and/alt/rep : 39/39/39 causal constraints in 3 ms.
[2021-05-19 13:20:30] [INFO ] Added : 28 causal constraints over 6 iterations in 23 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 1 ms.
[2021-05-19 13:20:30] [INFO ] [Real]Absence check using 26 positive place invariants in 7 ms returned sat
[2021-05-19 13:20:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:20:30] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2021-05-19 13:20:30] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 13:20:30] [INFO ] [Nat]Absence check using 26 positive place invariants in 7 ms returned sat
[2021-05-19 13:20:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 13:20:30] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2021-05-19 13:20:30] [INFO ] Deduced a trap composed of 4 places in 11 ms
[2021-05-19 13:20:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 20 ms
[2021-05-19 13:20:30] [INFO ] Computed and/alt/rep : 39/39/39 causal constraints in 3 ms.
[2021-05-19 13:20:30] [INFO ] Added : 23 causal constraints over 5 iterations in 28 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 6 ms.
[2021-05-19 13:20:30] [INFO ] [Real]Absence check using 26 positive place invariants in 7 ms returned sat
[2021-05-19 13:20:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:20:30] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2021-05-19 13:20:30] [INFO ] Computed and/alt/rep : 39/39/39 causal constraints in 2 ms.
[2021-05-19 13:20:30] [INFO ] Added : 33 causal constraints over 7 iterations in 34 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 2 ms.
Incomplete Parikh walk after 15800 steps, including 312 resets, run finished after 32 ms. (steps per millisecond=493 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 9400 steps, including 128 resets, run finished after 19 ms. (steps per millisecond=494 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 11000 steps, including 194 resets, run finished after 22 ms. (steps per millisecond=500 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 12700 steps, including 253 resets, run finished after 24 ms. (steps per millisecond=529 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 7000 steps, including 150 resets, run finished after 13 ms. (steps per millisecond=538 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Support contains 35 out of 65 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 65/65 places, 41/41 transitions.
Applied a total of 0 rules in 1 ms. Remains 65 /65 variables (removed 0) and now considering 41/41 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 65/65 places, 41/41 transitions.
Starting structural reductions, iteration 0 : 65/65 places, 41/41 transitions.
Applied a total of 0 rules in 2 ms. Remains 65 /65 variables (removed 0) and now considering 41/41 (removed 0) transitions.
// Phase 1: matrix 41 rows 65 cols
[2021-05-19 13:20:31] [INFO ] Computed 26 place invariants in 0 ms
[2021-05-19 13:20:31] [INFO ] Implicit Places using invariants in 51 ms returned []
// Phase 1: matrix 41 rows 65 cols
[2021-05-19 13:20:31] [INFO ] Computed 26 place invariants in 1 ms
[2021-05-19 13:20:31] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
[2021-05-19 13:20:31] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 41 rows 65 cols
[2021-05-19 13:20:31] [INFO ] Computed 26 place invariants in 0 ms
[2021-05-19 13:20:31] [INFO ] Dead Transitions using invariants and state equation in 50 ms returned []
Finished structural reductions, in 1 iterations. Remains : 65/65 places, 41/41 transitions.
Incomplete random walk after 100000 steps, including 949 resets, run finished after 140 ms. (steps per millisecond=714 ) properties seen :[0, 0, 0, 0, 0]
// Phase 1: matrix 41 rows 65 cols
[2021-05-19 13:20:31] [INFO ] Computed 26 place invariants in 1 ms
[2021-05-19 13:20:31] [INFO ] [Real]Absence check using 26 positive place invariants in 14 ms returned sat
[2021-05-19 13:20:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:20:31] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2021-05-19 13:20:31] [INFO ] Deduced a trap composed of 4 places in 13 ms
[2021-05-19 13:20:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 19 ms
[2021-05-19 13:20:31] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 13:20:31] [INFO ] [Nat]Absence check using 26 positive place invariants in 12 ms returned sat
[2021-05-19 13:20:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 13:20:31] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2021-05-19 13:20:31] [INFO ] Deduced a trap composed of 4 places in 10 ms
[2021-05-19 13:20:31] [INFO ] Deduced a trap composed of 4 places in 7 ms
[2021-05-19 13:20:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 26 ms
[2021-05-19 13:20:31] [INFO ] Computed and/alt/rep : 39/39/39 causal constraints in 2 ms.
[2021-05-19 13:20:31] [INFO ] Added : 32 causal constraints over 7 iterations in 30 ms. Result :sat
[2021-05-19 13:20:31] [INFO ] [Real]Absence check using 26 positive place invariants in 6 ms returned sat
[2021-05-19 13:20:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:20:31] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2021-05-19 13:20:31] [INFO ] Computed and/alt/rep : 39/39/39 causal constraints in 2 ms.
[2021-05-19 13:20:31] [INFO ] Added : 34 causal constraints over 7 iterations in 30 ms. Result :sat
[2021-05-19 13:20:31] [INFO ] [Real]Absence check using 26 positive place invariants in 7 ms returned sat
[2021-05-19 13:20:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:20:31] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2021-05-19 13:20:31] [INFO ] Deduced a trap composed of 4 places in 8 ms
[2021-05-19 13:20:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 12 ms
[2021-05-19 13:20:31] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 13:20:31] [INFO ] [Nat]Absence check using 26 positive place invariants in 7 ms returned sat
[2021-05-19 13:20:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 13:20:31] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2021-05-19 13:20:31] [INFO ] Deduced a trap composed of 4 places in 8 ms
[2021-05-19 13:20:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 11 ms
[2021-05-19 13:20:31] [INFO ] Computed and/alt/rep : 39/39/39 causal constraints in 2 ms.
[2021-05-19 13:20:31] [INFO ] Added : 28 causal constraints over 6 iterations in 23 ms. Result :sat
[2021-05-19 13:20:31] [INFO ] [Real]Absence check using 26 positive place invariants in 7 ms returned sat
[2021-05-19 13:20:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:20:31] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2021-05-19 13:20:31] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 13:20:31] [INFO ] [Nat]Absence check using 26 positive place invariants in 9 ms returned sat
[2021-05-19 13:20:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 13:20:31] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2021-05-19 13:20:31] [INFO ] Deduced a trap composed of 4 places in 7 ms
[2021-05-19 13:20:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 11 ms
[2021-05-19 13:20:31] [INFO ] Computed and/alt/rep : 39/39/39 causal constraints in 2 ms.
[2021-05-19 13:20:31] [INFO ] Added : 23 causal constraints over 5 iterations in 19 ms. Result :sat
[2021-05-19 13:20:31] [INFO ] [Real]Absence check using 26 positive place invariants in 7 ms returned sat
[2021-05-19 13:20:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:20:31] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2021-05-19 13:20:31] [INFO ] Computed and/alt/rep : 39/39/39 causal constraints in 2 ms.
[2021-05-19 13:20:32] [INFO ] Added : 33 causal constraints over 7 iterations in 30 ms. Result :sat
Applied a total of 0 rules in 2 ms. Remains 65 /65 variables (removed 0) and now considering 41/41 (removed 0) transitions.
// Phase 1: matrix 41 rows 65 cols
[2021-05-19 13:20:32] [INFO ] Computed 26 place invariants in 1 ms
[2021-05-19 13:20:32] [INFO ] [Real]Absence check using 26 positive place invariants in 13 ms returned sat
[2021-05-19 13:20:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:20:32] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2021-05-19 13:20:32] [INFO ] Deduced a trap composed of 4 places in 12 ms
[2021-05-19 13:20:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 17 ms
[2021-05-19 13:20:32] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 13:20:32] [INFO ] [Nat]Absence check using 26 positive place invariants in 8 ms returned sat
[2021-05-19 13:20:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 13:20:32] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2021-05-19 13:20:32] [INFO ] Deduced a trap composed of 4 places in 8 ms
[2021-05-19 13:20:32] [INFO ] Deduced a trap composed of 4 places in 6 ms
[2021-05-19 13:20:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 20 ms
[2021-05-19 13:20:32] [INFO ] Computed and/alt/rep : 39/39/39 causal constraints in 2 ms.
[2021-05-19 13:20:32] [INFO ] Added : 32 causal constraints over 7 iterations in 27 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 2 ms.
[2021-05-19 13:20:32] [INFO ] [Real]Absence check using 26 positive place invariants in 6 ms returned sat
[2021-05-19 13:20:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:20:32] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2021-05-19 13:20:32] [INFO ] Computed and/alt/rep : 39/39/39 causal constraints in 1 ms.
[2021-05-19 13:20:32] [INFO ] Added : 34 causal constraints over 7 iterations in 28 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 2 ms.
[2021-05-19 13:20:32] [INFO ] [Real]Absence check using 26 positive place invariants in 10 ms returned sat
[2021-05-19 13:20:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:20:32] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2021-05-19 13:20:32] [INFO ] Deduced a trap composed of 4 places in 16 ms
[2021-05-19 13:20:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 21 ms
[2021-05-19 13:20:32] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 13:20:32] [INFO ] [Nat]Absence check using 26 positive place invariants in 9 ms returned sat
[2021-05-19 13:20:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 13:20:32] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2021-05-19 13:20:32] [INFO ] Deduced a trap composed of 4 places in 11 ms
[2021-05-19 13:20:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 15 ms
[2021-05-19 13:20:32] [INFO ] Computed and/alt/rep : 39/39/39 causal constraints in 3 ms.
[2021-05-19 13:20:32] [INFO ] Added : 28 causal constraints over 6 iterations in 25 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 2 ms.
[2021-05-19 13:20:32] [INFO ] [Real]Absence check using 26 positive place invariants in 8 ms returned sat
[2021-05-19 13:20:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:20:32] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2021-05-19 13:20:32] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 13:20:32] [INFO ] [Nat]Absence check using 26 positive place invariants in 12 ms returned sat
[2021-05-19 13:20:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 13:20:32] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2021-05-19 13:20:32] [INFO ] Deduced a trap composed of 4 places in 12 ms
[2021-05-19 13:20:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 16 ms
[2021-05-19 13:20:32] [INFO ] Computed and/alt/rep : 39/39/39 causal constraints in 2 ms.
[2021-05-19 13:20:32] [INFO ] Added : 23 causal constraints over 5 iterations in 23 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 1 ms.
[2021-05-19 13:20:32] [INFO ] [Real]Absence check using 26 positive place invariants in 12 ms returned sat
[2021-05-19 13:20:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:20:32] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2021-05-19 13:20:32] [INFO ] Computed and/alt/rep : 39/39/39 causal constraints in 2 ms.
[2021-05-19 13:20:32] [INFO ] Added : 33 causal constraints over 7 iterations in 38 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 2 ms.
[2021-05-19 13:20:32] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 8 ms.
[2021-05-19 13:20:32] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 1 ms.
[2021-05-19 13:20:32] [INFO ] Flatten gal took : 41 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityFireability @ ResAllocation-PT-R020C002 @ 3570 seconds

FORMULA ResAllocation-PT-R020C002-ReachabilityFireability-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ResAllocation-PT-R020C002-ReachabilityFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ResAllocation-PT-R020C002-ReachabilityFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ResAllocation-PT-R020C002-ReachabilityFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ResAllocation-PT-R020C002-ReachabilityFireability-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3566
rslt: Output for ReachabilityFireability @ ResAllocation-PT-R020C002

{
"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=ReachabilityFireability.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--safe",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--json=ReachabilityFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Wed May 19 13:20:33 2021
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "A (G (((p31 <= 0) OR (p34 <= 0) OR (p8 <= 0) OR (p46 <= 0) OR (p47 <= 0))))",
"processed_size": 79,
"rewrites": 2
},
"result":
{
"edges": 2125,
"markings": 920,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 5,
"problems": 5
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 892
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "E (F (((1 <= p21) AND (1 <= p24) AND (1 <= p8) AND (1 <= p46) AND (1 <= p47))))",
"processed_size": 79,
"rewrites": 1
},
"result":
{
"edges": 2810,
"markings": 1180,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 5,
"problems": 5
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1189
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "A (G (((p2 <= 0) OR (p41 <= 0) OR (p42 <= 0) OR (p13 <= 0) OR (p16 <= 0) OR ((1 <= p33) AND (1 <= p36)))))",
"processed_size": 111,
"rewrites": 2
},
"result":
{
"edges": 1718,
"markings": 728,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 12,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1784
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 3,
"aneg": 0,
"comp": 13,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 13,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 13,
"visible_transitions": 0
},
"processed": "E (F (((1 <= p29) AND (1 <= p32) AND ((p1 <= 0) OR (p4 <= 0)) AND ((p11 <= 0) OR (p14 <= 0)) AND (((1 <= p24) AND (1 <= p56) AND (1 <= p57)) OR ((1 <= p39) AND (1 <= p8) AND (1 <= p46) AND (1 <= p47))))))",
"processed_size": 207,
"rewrites": 1
},
"result":
{
"edges": 388990,
"markings": 98360,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 60,
"problems": 8
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3568
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 7,
"adisj": 3,
"aneg": 0,
"comp": 20,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 20,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 19,
"visible_transitions": 0
},
"processed": "E (F ((((1 <= p30) AND (1 <= p60) AND (1 <= p61) AND (1 <= p35) AND (1 <= p38)) OR ((1 <= p27) AND (1 <= p30) AND (((1 <= p13) AND (1 <= p16)) OR ((1 <= p6) AND (1 <= p44) AND (1 <= p45)) OR ((1 <= p1) AND (1 <= p4))) AND (((1 <= p8) AND (1 <= p46) AND (1 <= p47)) OR ((1 <= p18) AND (1 <= p52) AND (1 <= p53)))))))",
"processed_size": 319,
"rewrites": 1
},
"result":
{
"edges": 2527645,
"markings": 532658,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 49,
"problems": 7
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"error": null,
"memory": 24600,
"runtime": 4.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "E(F(**)) : A(G(**)) : E(F(**)) : A(G(**)) : E(F(**))"
},
"net":
{
"arcs": 170,
"conflict_clusters": 21,
"places": 65,
"places_significant": 39,
"singleton_clusters": 0,
"transitions": 41
},
"result":
{
"preliminary_value": "no yes no yes no ",
"value": "no yes no yes no "
},
"task":
{
"type": "compound"
}
}
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: 106/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 65
lola: finding significant places
lola: 65 places, 41 transitions, 39 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: E (F ((((1 <= p30) AND (1 <= p60) AND (1 <= p61) AND (1 <= p35) AND (1 <= p38)) OR ((1 <= p27) AND (1 <= p30) AND (((1 <= p13) AND (1 <= p16)) OR ((1 <= p6) AND (1 <= p44) AND (1 <= p45)) OR ((1 <= p1) AND (1 <= p4))) AND (((1 <= p8) AND (1 <= p46) AND (1 <= p47)) OR ((1 <= p18) AND (1 <= p52) AND (1 <= p53))))))) : A (G (((p31 <= 0) OR (p34 <= 0) OR (p8 <= 0) OR (p46 <= 0) OR (p47 <= 0)))) : E (F (((1 <= p21) AND (1 <= p24) AND (1 <= p8) AND (1 <= p46) AND (1 <= p47)))) : A (G (((p2 <= 0) OR (p41 <= 0) OR (p42 <= 0) OR (p13 <= 0) OR (p16 <= 0) OR ((1 <= p33) AND (1 <= p36))))) : E (F (((1 <= p29) AND (1 <= p32) AND ((p1 <= 0) OR (p4 <= 0)) AND ((p11 <= 0) OR (p14 <= 0)) AND (((1 <= p24) AND (1 <= p56) AND (1 <= p57)) OR ((1 <= p39) AND (1 <= p8) AND (1 <= p46) AND (1 <= p47))))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p31 <= 0) OR (p34 <= 0) OR (p8 <= 0) OR (p46 <= 0) OR (p47 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G (((p31 <= 0) OR (p34 <= 0) OR (p8 <= 0) OR (p46 <= 0) OR (p47 <= 0))))
lola: processed formula length: 79
lola: 2 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: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p31) AND (1 <= p34) AND (1 <= p8) AND (1 <= p46) AND (1 <= p47))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 5 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityFireability-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 920 markings, 2125 edges
lola: ========================================
lola: subprocess 1 will run for 892 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p21) AND (1 <= p24) AND (1 <= p8) AND (1 <= p46) AND (1 <= p47))))
lola: ========================================
lola: SUBTASK
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 <= p21) AND (1 <= p24) AND (1 <= p8) AND (1 <= p46) AND (1 <= p47))))
lola: processed formula length: 79
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: 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: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p21) AND (1 <= p24) AND (1 <= p8) AND (1 <= p46) AND (1 <= p47))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 5 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityFireability-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 1180 markings, 2810 edges
lola: ========================================
lola: subprocess 2 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p2 <= 0) OR (p41 <= 0) OR (p42 <= 0) OR (p13 <= 0) OR (p16 <= 0) OR ((1 <= p33) AND (1 <= p36)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G (((p2 <= 0) OR (p41 <= 0) OR (p42 <= 0) OR (p13 <= 0) OR (p16 <= 0) OR ((1 <= p33) AND (1 <= p36)))))
lola: processed formula length: 111
lola: 2 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: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p2) AND (1 <= p41) AND (1 <= p42) AND (1 <= p13) AND (1 <= p16) AND ((p33 <= 0) OR (p36 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 12 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityFireability-2-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 728 markings, 1718 edges
lola: ========================================
lola: subprocess 3 will run for 1784 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p29) AND (1 <= p32) AND ((p1 <= 0) OR (p4 <= 0)) AND ((p11 <= 0) OR (p14 <= 0)) AND (((1 <= p24) AND (1 <= p56) AND (1 <= p57)) OR ((1 <= p39) AND (1 <= p8) AND (1 <= p46) AND (1 <= p47))))))
lola: ========================================
lola: SUBTASK
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 <= p29) AND (1 <= p32) AND ((p1 <= 0) OR (p4 <= 0)) AND ((p11 <= 0) OR (p14 <= 0)) AND (((1 <= p24) AND (1 <= p56) AND (1 <= p57)) OR ((1 <= p39) AND (1 <= p8) AND (1 <= p46) AND (1 <= p47))))))
lola: processed formula length: 207
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: 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: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p29) AND (1 <= p32) AND ((p1 <= 0) OR (p4 <= 0)) AND ((p11 <= 0) OR (p14 <= 0)) AND (((1 <= p24) AND (1 <= p56) AND (1 <= p57)) OR ((1 <= p39) AND (1 <= p8) AND (1 <= p46) AND (1 <= p47))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 60 literals and 8 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityFireability-3-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityFireability-3-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 98360 markings, 388990 edges
lola: ========================================
lola: subprocess 4 will run for 3568 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((1 <= p30) AND (1 <= p60) AND (1 <= p61) AND (1 <= p35) AND (1 <= p38)) OR ((1 <= p27) AND (1 <= p30) AND (((1 <= p13) AND (1 <= p16)) OR ((1 <= p6) AND (1 <= p44) AND (1 <= p45)) OR ((1 <= p1) AND (1 <= p4))) AND (((1 <= p8) AND (1 <= p46) AND (1 <= p47)) OR ((1 <= p18) AND (1 <= p52) AND (1 <= p53)))))))
lola: ========================================
lola: SUBTASK
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 <= p30) AND (1 <= p60) AND (1 <= p61) AND (1 <= p35) AND (1 <= p38)) OR ((1 <= p27) AND (1 <= p30) AND (((1 <= p13) AND (1 <= p16)) OR ((1 <= p6) AND (1 <= p44) AND (1 <= p45)) OR ((1 <= p1) AND (1 <= p4))) AND (((1 <= p8) AND (1 <= p46) AND (1 <= p47)) OR ((1 <= p18) AND (1 <= p52) AND (1 <= p53)))))))
lola: processed formula length: 319
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: 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: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p30) AND (1 <= p60) AND (1 <= p61) AND (1 <= p35) AND (1 <= p38)) OR ((1 <= p27) AND (1 <= p30) AND (((1 <= p13) AND (1 <= p16)) OR ((1 <= p6) AND (1 <= p44) AND (1 <= p45)) OR ((1 <= p1) AND (1 <= p4))) AND (((1 <= p8) AND (1 <= p46) AND (1 <= p47)) OR ((1 <= p18) AND (1 <= p52) AND (1 <= p53)))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 49 literals and 7 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityFireability-4-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityFireability-4-0.sara.
sara: place or transition ordering is non-deterministic
sara: warning, failure of lp_solve (at job 81)
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 532658 markings, 2527645 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes no yes no
lola:
preliminary result: no yes no yes no
lola: memory consumption: 24600 KB
lola: time consumption: 4 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="ResAllocation-PT-R020C002"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="gold2020"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# 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 gold2020"
echo " Input is ResAllocation-PT-R020C002, 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 r189-tajo-162089433000404"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ResAllocation-PT-R020C002.tgz
mv ResAllocation-PT-R020C002 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 ;