fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r174-csrt-158987853400551
Last Updated
Jun 28, 2020

About the Execution of ITS-LoLa for Parking-PT-832

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15739.710 3600000.00 102355.00 47.60 TTTTTTTFFFFTTTTT normal

Execution Chart

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

Trace from the execution

Formatting '/local/x2003239/mcc2020-input.r174-csrt-158987853400551.qcow2', fmt=qcow2 size=4294967296 backing_file=/local/x2003239/mcc2020-input.qcow2 encryption=off cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is Parking-PT-832, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r174-csrt-158987853400551
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 420K
-rw-r--r-- 1 mcc users 3.6K Apr 12 00:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Apr 12 00:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 10 23:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 10 23:07 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.0K Apr 14 12:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Apr 14 12:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K Apr 10 07:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K Apr 10 07:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 9 12:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Apr 9 12:23 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 10 22:21 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 10 22:21 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 251K 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 Parking-PT-832-ReachabilityFireability-00
FORMULA_NAME Parking-PT-832-ReachabilityFireability-01
FORMULA_NAME Parking-PT-832-ReachabilityFireability-02
FORMULA_NAME Parking-PT-832-ReachabilityFireability-03
FORMULA_NAME Parking-PT-832-ReachabilityFireability-04
FORMULA_NAME Parking-PT-832-ReachabilityFireability-05
FORMULA_NAME Parking-PT-832-ReachabilityFireability-06
FORMULA_NAME Parking-PT-832-ReachabilityFireability-07
FORMULA_NAME Parking-PT-832-ReachabilityFireability-08
FORMULA_NAME Parking-PT-832-ReachabilityFireability-09
FORMULA_NAME Parking-PT-832-ReachabilityFireability-10
FORMULA_NAME Parking-PT-832-ReachabilityFireability-11
FORMULA_NAME Parking-PT-832-ReachabilityFireability-12
FORMULA_NAME Parking-PT-832-ReachabilityFireability-13
FORMULA_NAME Parking-PT-832-ReachabilityFireability-14
FORMULA_NAME Parking-PT-832-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1591154303703

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 03:18:25] [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-03 03:18:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 03:18:25] [INFO ] Load time of PNML (sax parser for PT used): 136 ms
[2020-06-03 03:18:25] [INFO ] Transformed 737 places.
[2020-06-03 03:18:25] [INFO ] Transformed 993 transitions.
[2020-06-03 03:18:25] [INFO ] Found NUPN structural information;
[2020-06-03 03:18:25] [INFO ] Parsed PT model containing 737 places and 993 transitions in 193 ms.
Ensure Unique test removed 384 transitions
Reduce redundant transitions removed 384 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 29 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 50 resets, run finished after 137 ms. (steps per millisecond=72 ) properties seen :[0, 1, 1, 0, 0, 1, 0, 0, 1, 0, 1, 0, 1, 0, 0, 0]
FORMULA Parking-PT-832-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-832-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-832-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-832-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-832-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-832-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_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, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 45 ms. (steps per millisecond=222 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 38 ms. (steps per millisecond=263 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 35 ms. (steps per millisecond=285 ) properties seen :[0, 0, 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, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 36 ms. (steps per millisecond=277 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 34 ms. (steps per millisecond=294 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 33 ms. (steps per millisecond=303 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 38 ms. (steps per millisecond=263 ) properties seen :[0, 0, 0, 0, 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, 0, 0, 0, 0]
// Phase 1: matrix 609 rows 737 cols
[2020-06-03 03:18:26] [INFO ] Computed 184 place invariants in 31 ms
[2020-06-03 03:18:27] [INFO ] [Real]Absence check using 176 positive place invariants in 164 ms returned sat
[2020-06-03 03:18:27] [INFO ] [Real]Absence check using 176 positive and 8 generalized place invariants in 6 ms returned sat
[2020-06-03 03:18:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:18:28] [INFO ] [Real]Absence check using state equation in 1463 ms returned sat
[2020-06-03 03:18:28] [INFO ] State equation strengthened by 152 read => feed constraints.
[2020-06-03 03:18:28] [INFO ] [Real]Added 152 Read/Feed constraints in 40 ms returned sat
[2020-06-03 03:18:28] [INFO ] Computed and/alt/rep : 608/1920/608 causal constraints in 71 ms.
[2020-06-03 03:18:29] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 03:18:29] [INFO ] [Nat]Absence check using 176 positive place invariants in 238 ms returned sat
[2020-06-03 03:18:29] [INFO ] [Nat]Absence check using 176 positive and 8 generalized place invariants in 13 ms returned sat
[2020-06-03 03:18:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 03:18:30] [INFO ] [Nat]Absence check using state equation in 1326 ms returned sat
[2020-06-03 03:18:30] [INFO ] [Nat]Added 152 Read/Feed constraints in 36 ms returned sat
[2020-06-03 03:18:31] [INFO ] Deduced a trap composed of 47 places in 137 ms
[2020-06-03 03:18:31] [INFO ] Deduced a trap composed of 40 places in 57 ms
[2020-06-03 03:18:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 360 ms
[2020-06-03 03:18:31] [INFO ] Computed and/alt/rep : 608/1920/608 causal constraints in 54 ms.
[2020-06-03 03:18:34] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe (=> (> t233 0) (and (and (> t237 0) (< o237 o233)) (or (and (> t0 0) (< o0 o233)) (and (> t116 0) (< o116 o233)) (and (> t117 0) (< o117 o233)) (and (> t237 0) (< o237 o233)) (and (> t238 0) (< o238 o233)))))") while checking expression at index 0
[2020-06-03 03:18:34] [INFO ] [Real]Absence check using 176 positive place invariants in 110 ms returned sat
[2020-06-03 03:18:34] [INFO ] [Real]Absence check using 176 positive and 8 generalized place invariants in 57 ms returned sat
[2020-06-03 03:18:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:18:35] [INFO ] [Real]Absence check using state equation in 1332 ms returned sat
[2020-06-03 03:18:35] [INFO ] [Real]Added 152 Read/Feed constraints in 60 ms returned sat
[2020-06-03 03:18:35] [INFO ] Deduced a trap composed of 40 places in 56 ms
[2020-06-03 03:18:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 86 ms
[2020-06-03 03:18:36] [INFO ] [Real]Absence check using 176 positive place invariants in 113 ms returned sat
[2020-06-03 03:18:36] [INFO ] [Real]Absence check using 176 positive and 8 generalized place invariants in 6 ms returned sat
[2020-06-03 03:18:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:18:37] [INFO ] [Real]Absence check using state equation in 1239 ms returned sat
[2020-06-03 03:18:37] [INFO ] [Real]Added 152 Read/Feed constraints in 23 ms returned sat
[2020-06-03 03:18:37] [INFO ] Computed and/alt/rep : 608/1920/608 causal constraints in 103 ms.
[2020-06-03 03:18:37] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 03:18:37] [INFO ] [Nat]Absence check using 176 positive place invariants in 111 ms returned sat
[2020-06-03 03:18:38] [INFO ] [Nat]Absence check using 176 positive and 8 generalized place invariants in 5 ms returned sat
[2020-06-03 03:18:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 03:18:39] [INFO ] [Nat]Absence check using state equation in 1223 ms returned sat
[2020-06-03 03:18:39] [INFO ] [Nat]Added 152 Read/Feed constraints in 38 ms returned sat
[2020-06-03 03:18:39] [INFO ] Deduced a trap composed of 40 places in 107 ms
[2020-06-03 03:18:39] [INFO ] Deduced a trap composed of 44 places in 100 ms
[2020-06-03 03:18:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 309 ms
[2020-06-03 03:18:39] [INFO ] Computed and/alt/rep : 608/1920/608 causal constraints in 36 ms.
[2020-06-03 03:18:42] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe (=> (> t289 0) (and (and (> t169 0) (< o169 o289)) (and (> t288 0) (< o288 o289))))") while checking expression at index 2
[2020-06-03 03:18:43] [INFO ] [Real]Absence check using 176 positive place invariants in 134 ms returned sat
[2020-06-03 03:18:43] [INFO ] [Real]Absence check using 176 positive and 8 generalized place invariants in 11 ms returned sat
[2020-06-03 03:18:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:18:44] [INFO ] [Real]Absence check using state equation in 1275 ms returned sat
[2020-06-03 03:18:44] [INFO ] [Real]Added 152 Read/Feed constraints in 30 ms returned sat
[2020-06-03 03:18:44] [INFO ] Computed and/alt/rep : 608/1920/608 causal constraints in 54 ms.
[2020-06-03 03:18:44] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 03:18:44] [INFO ] [Nat]Absence check using 176 positive place invariants in 123 ms returned sat
[2020-06-03 03:18:44] [INFO ] [Nat]Absence check using 176 positive and 8 generalized place invariants in 6 ms returned sat
[2020-06-03 03:18:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 03:18:46] [INFO ] [Nat]Absence check using state equation in 1255 ms returned sat
[2020-06-03 03:18:46] [INFO ] [Nat]Added 152 Read/Feed constraints in 39 ms returned sat
[2020-06-03 03:18:46] [INFO ] Deduced a trap composed of 47 places in 47 ms
[2020-06-03 03:18:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 136 ms
[2020-06-03 03:18:46] [INFO ] Computed and/alt/rep : 608/1920/608 causal constraints in 46 ms.
[2020-06-03 03:18:49] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (=> (> t307 0) (and (and (> t207 0) (< o207 o307)) (and (> t306 0) (< o306 o307))))") while checking expression at index 3
[2020-06-03 03:18:49] [INFO ] [Real]Absence check using 176 positive place invariants in 110 ms returned sat
[2020-06-03 03:18:49] [INFO ] [Real]Absence check using 176 positive and 8 generalized place invariants in 6 ms returned sat
[2020-06-03 03:18:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:18:51] [INFO ] [Real]Absence check using state equation in 1459 ms returned sat
[2020-06-03 03:18:51] [INFO ] [Real]Added 152 Read/Feed constraints in 21 ms returned sat
[2020-06-03 03:18:51] [INFO ] Computed and/alt/rep : 608/1920/608 causal constraints in 52 ms.
[2020-06-03 03:18:51] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 03:18:51] [INFO ] [Nat]Absence check using 176 positive place invariants in 130 ms returned sat
[2020-06-03 03:18:51] [INFO ] [Nat]Absence check using 176 positive and 8 generalized place invariants in 10 ms returned sat
[2020-06-03 03:18:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 03:18:53] [INFO ] [Nat]Absence check using state equation in 1239 ms returned sat
[2020-06-03 03:18:53] [INFO ] [Nat]Added 152 Read/Feed constraints in 45 ms returned sat
[2020-06-03 03:18:53] [INFO ] Deduced a trap composed of 44 places in 127 ms
[2020-06-03 03:18:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 197 ms
[2020-06-03 03:18:53] [INFO ] Computed and/alt/rep : 608/1920/608 causal constraints in 95 ms.
[2020-06-03 03:18:56] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe (=> (> t252 0) (and (and (> t530 0) (< o530 o252)) (and (> t96 0) (< o96 o252))))") while checking expression at index 4
[2020-06-03 03:18:56] [INFO ] [Real]Absence check using 176 positive place invariants in 113 ms returned sat
[2020-06-03 03:18:56] [INFO ] [Real]Absence check using 176 positive and 8 generalized place invariants in 5 ms returned sat
[2020-06-03 03:18:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:18:58] [INFO ] [Real]Absence check using state equation in 1197 ms returned sat
[2020-06-03 03:18:58] [INFO ] [Real]Added 152 Read/Feed constraints in 29 ms returned sat
[2020-06-03 03:18:58] [INFO ] Computed and/alt/rep : 608/1920/608 causal constraints in 75 ms.
[2020-06-03 03:18:58] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 03:18:58] [INFO ] [Nat]Absence check using 176 positive place invariants in 158 ms returned sat
[2020-06-03 03:18:58] [INFO ] [Nat]Absence check using 176 positive and 8 generalized place invariants in 6 ms returned sat
[2020-06-03 03:18:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 03:18:59] [INFO ] [Nat]Absence check using state equation in 1215 ms returned sat
[2020-06-03 03:18:59] [INFO ] [Nat]Added 152 Read/Feed constraints in 36 ms returned sat
[2020-06-03 03:19:00] [INFO ] Deduced a trap composed of 47 places in 146 ms
[2020-06-03 03:19:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 202 ms
[2020-06-03 03:19:00] [INFO ] Computed and/alt/rep : 608/1920/608 causal constraints in 90 ms.
[2020-06-03 03:19:03] [INFO ] Added : 245 causal constraints over 49 iterations in 3276 ms. Result :unknown
[2020-06-03 03:19:03] [INFO ] [Real]Absence check using 176 positive place invariants in 132 ms returned sat
[2020-06-03 03:19:03] [INFO ] [Real]Absence check using 176 positive and 8 generalized place invariants in 8 ms returned sat
[2020-06-03 03:19:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:19:05] [INFO ] [Real]Absence check using state equation in 1495 ms returned sat
[2020-06-03 03:19:05] [INFO ] [Real]Added 152 Read/Feed constraints in 23 ms returned sat
[2020-06-03 03:19:05] [INFO ] Computed and/alt/rep : 608/1920/608 causal constraints in 45 ms.
[2020-06-03 03:19:05] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 03:19:05] [INFO ] [Nat]Absence check using 176 positive place invariants in 231 ms returned sat
[2020-06-03 03:19:05] [INFO ] [Nat]Absence check using 176 positive and 8 generalized place invariants in 18 ms returned sat
[2020-06-03 03:19:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 03:19:08] [INFO ] [Nat]Absence check using state equation in 2352 ms returned sat
[2020-06-03 03:19:08] [INFO ] [Nat]Added 152 Read/Feed constraints in 76 ms returned sat
[2020-06-03 03:19:08] [INFO ] Deduced a trap composed of 40 places in 47 ms
[2020-06-03 03:19:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 156 ms
[2020-06-03 03:19:08] [INFO ] Computed and/alt/rep : 608/1920/608 causal constraints in 45 ms.
[2020-06-03 03:19:10] [INFO ] Added : 145 causal constraints over 29 iterations in 2100 ms. Result :(error "Solver has unexpectedly terminated")
[2020-06-03 03:19:10] [INFO ] [Real]Absence check using 176 positive place invariants in 118 ms returned sat
[2020-06-03 03:19:10] [INFO ] [Real]Absence check using 176 positive and 8 generalized place invariants in 9 ms returned sat
[2020-06-03 03:19:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:19:11] [INFO ] [Real]Absence check using state equation in 1165 ms returned sat
[2020-06-03 03:19:11] [INFO ] [Real]Added 152 Read/Feed constraints in 23 ms returned sat
[2020-06-03 03:19:12] [INFO ] Computed and/alt/rep : 608/1920/608 causal constraints in 52 ms.
[2020-06-03 03:19:12] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 03:19:12] [INFO ] [Nat]Absence check using 176 positive place invariants in 143 ms returned sat
[2020-06-03 03:19:12] [INFO ] [Nat]Absence check using 176 positive and 8 generalized place invariants in 7 ms returned sat
[2020-06-03 03:19:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 03:19:13] [INFO ] [Nat]Absence check using state equation in 1080 ms returned sat
[2020-06-03 03:19:13] [INFO ] [Nat]Added 152 Read/Feed constraints in 38 ms returned sat
[2020-06-03 03:19:13] [INFO ] Deduced a trap composed of 44 places in 44 ms
[2020-06-03 03:19:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 103 ms
[2020-06-03 03:19:13] [INFO ] Computed and/alt/rep : 608/1920/608 causal constraints in 34 ms.
[2020-06-03 03:19:17] [INFO ] Added : 335 causal constraints over 67 iterations in 3360 ms. Result :(error "Failed to check-sat")
[2020-06-03 03:19:17] [INFO ] [Real]Absence check using 176 positive place invariants in 178 ms returned sat
[2020-06-03 03:19:17] [INFO ] [Real]Absence check using 176 positive and 8 generalized place invariants in 21 ms returned sat
[2020-06-03 03:19:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:19:18] [INFO ] [Real]Absence check using state equation in 1330 ms returned sat
[2020-06-03 03:19:19] [INFO ] [Real]Added 152 Read/Feed constraints in 68 ms returned sat
[2020-06-03 03:19:19] [INFO ] Computed and/alt/rep : 608/1920/608 causal constraints in 44 ms.
[2020-06-03 03:19:19] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 03:19:19] [INFO ] [Nat]Absence check using 176 positive place invariants in 174 ms returned sat
[2020-06-03 03:19:19] [INFO ] [Nat]Absence check using 176 positive and 8 generalized place invariants in 10 ms returned sat
[2020-06-03 03:19:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 03:19:20] [INFO ] [Nat]Absence check using state equation in 1289 ms returned sat
[2020-06-03 03:19:20] [INFO ] [Nat]Added 152 Read/Feed constraints in 44 ms returned sat
[2020-06-03 03:19:21] [INFO ] Deduced a trap composed of 44 places in 126 ms
[2020-06-03 03:19:21] [INFO ] Deduced a trap composed of 40 places in 57 ms
[2020-06-03 03:19:21] [INFO ] Deduced a trap composed of 44 places in 35 ms
[2020-06-03 03:19:21] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 351 ms
[2020-06-03 03:19:21] [INFO ] Computed and/alt/rep : 608/1920/608 causal constraints in 40 ms.
[2020-06-03 03:19:24] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (=> (> t271 0) (and (and (> t267 0) (< o267 o271)) (or (and (> t0 0) (< o0 o271)) (and (> t21 0) (< o21 o271)) (and (> t22 0) (< o22 o271)) (and (> t267 0) (< o267 o271)) (and (> t268 0) (< o268 o271)))))") while checking expression at index 8
[2020-06-03 03:19:24] [INFO ] [Real]Absence check using 176 positive place invariants in 284 ms returned sat
[2020-06-03 03:19:24] [INFO ] [Real]Absence check using 176 positive and 8 generalized place invariants in 5 ms returned sat
[2020-06-03 03:19:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:19:25] [INFO ] [Real]Absence check using state equation in 1235 ms returned sat
[2020-06-03 03:19:25] [INFO ] [Real]Added 152 Read/Feed constraints in 25 ms returned sat
[2020-06-03 03:19:26] [INFO ] Computed and/alt/rep : 608/1920/608 causal constraints in 48 ms.
[2020-06-03 03:19:26] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 03:19:26] [INFO ] [Nat]Absence check using 176 positive place invariants in 105 ms returned sat
[2020-06-03 03:19:26] [INFO ] [Nat]Absence check using 176 positive and 8 generalized place invariants in 4 ms returned sat
[2020-06-03 03:19:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 03:19:27] [INFO ] [Nat]Absence check using state equation in 1210 ms returned sat
[2020-06-03 03:19:27] [INFO ] [Nat]Added 152 Read/Feed constraints in 29 ms returned sat
[2020-06-03 03:19:27] [INFO ] Computed and/alt/rep : 608/1920/608 causal constraints in 39 ms.
[2020-06-03 03:19:31] [INFO ] Added : 325 causal constraints over 65 iterations in 3535 ms. Result :(error "Failed to check-sat")
FORMULA Parking-PT-832-ReachabilityFireability-03 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 64600 steps, including 274 resets, run finished after 611 ms. (steps per millisecond=105 ) properties seen :[0, 1, 0, 0, 0, 0, 1, 1, 0] could not realise parikh vector
FORMULA Parking-PT-832-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Parking-PT-832-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Parking-PT-832-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 24 out of 737 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 737/737 places, 609/609 transitions.
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 737 transition count 595
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 28 place count 723 transition count 595
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 28 place count 723 transition count 582
Deduced a syphon composed of 13 places in 4 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 54 place count 710 transition count 582
Symmetric choice reduction at 2 with 8 rule applications. Total rules 62 place count 710 transition count 582
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 8 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 78 place count 702 transition count 574
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 120 place count 681 transition count 553
Free-agglomeration rule applied 119 times.
Iterating global reduction 2 with 119 rules applied. Total rules applied 239 place count 681 transition count 434
Reduce places removed 119 places and 0 transitions.
Discarding 61 places :
Also discarding 38 output transitions
Drop transitions removed 38 transitions
Graph (complete) has 1144 edges and 562 vertex of which 501 are kept as prefixes of interest. Removing 61 places using SCC suffix rule.11 ms
Iterating post reduction 2 with 120 rules applied. Total rules applied 359 place count 501 transition count 396
Drop transitions removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 3 with 14 rules applied. Total rules applied 373 place count 501 transition count 382
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 375 place count 501 transition count 382
Applied a total of 375 rules in 313 ms. Remains 501 /737 variables (removed 236) and now considering 382/609 (removed 227) transitions.
Finished structural reductions, in 1 iterations. Remains : 501/737 places, 382/609 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 3420 ms. (steps per millisecond=292 ) properties seen :[0, 1, 1, 0, 1, 0]
FORMULA Parking-PT-832-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-832-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-832-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 2265 ms. (steps per millisecond=441 ) properties seen :[1, 0, 0]
FORMULA Parking-PT-832-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000000 steps, including 0 resets, run finished after 2218 ms. (steps per millisecond=450 ) properties seen :[1, 0]
FORMULA Parking-PT-832-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Finished Best-First random walk after 1375 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=275 )
FORMULA Parking-PT-832-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
All properties solved without resorting to model-checking.

--------------------
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="Parking-PT-832"
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 Parking-PT-832, 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 r174-csrt-158987853400551"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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