fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r161-smll-165277002800129
Last Updated
Jun 22, 2022

About the Execution of 2021-gold for Parking-PT-864

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
552.407 115203.00 143268.00 772.50 FTTTTFTTFFTFFTTF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r161-smll-165277002800129.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2021
Input is Parking-PT-864, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r161-smll-165277002800129
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 944K
-rw-r--r-- 1 mcc users 6.6K Apr 30 07:24 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K Apr 30 07:24 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Apr 30 06:35 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Apr 30 06:35 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.1K May 9 08:23 LTLCardinality.txt
-rw-r--r-- 1 mcc users 32K May 9 08:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 08:23 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 08:23 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 30 08:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 159K Apr 30 08:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Apr 30 07:42 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 83K Apr 30 07:42 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:23 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 9 08:23 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 427K May 10 09:34 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-864-ReachabilityFireability-00
FORMULA_NAME Parking-PT-864-ReachabilityFireability-01
FORMULA_NAME Parking-PT-864-ReachabilityFireability-02
FORMULA_NAME Parking-PT-864-ReachabilityFireability-03
FORMULA_NAME Parking-PT-864-ReachabilityFireability-04
FORMULA_NAME Parking-PT-864-ReachabilityFireability-05
FORMULA_NAME Parking-PT-864-ReachabilityFireability-06
FORMULA_NAME Parking-PT-864-ReachabilityFireability-07
FORMULA_NAME Parking-PT-864-ReachabilityFireability-08
FORMULA_NAME Parking-PT-864-ReachabilityFireability-09
FORMULA_NAME Parking-PT-864-ReachabilityFireability-10
FORMULA_NAME Parking-PT-864-ReachabilityFireability-11
FORMULA_NAME Parking-PT-864-ReachabilityFireability-12
FORMULA_NAME Parking-PT-864-ReachabilityFireability-13
FORMULA_NAME Parking-PT-864-ReachabilityFireability-14
FORMULA_NAME Parking-PT-864-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1655077840924

Running Version 0
[2022-06-12 23:50:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-12 23:50:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-12 23:50:44] [INFO ] Load time of PNML (sax parser for PT used): 344 ms
[2022-06-12 23:50:44] [INFO ] Transformed 1185 places.
[2022-06-12 23:50:44] [INFO ] Transformed 1697 transitions.
[2022-06-12 23:50:44] [INFO ] Found NUPN structural information;
[2022-06-12 23:50:44] [INFO ] Parsed PT model containing 1185 places and 1697 transitions in 463 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 31 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 688 transitions
Reduce redundant transitions removed 688 transitions.
Incomplete random walk after 10000 steps, including 38 resets, run finished after 427 ms. (steps per millisecond=23 ) properties (out of 16) seen :4
FORMULA Parking-PT-864-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-864-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-864-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-864-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
// Phase 1: matrix 1009 rows 1185 cols
[2022-06-12 23:50:46] [INFO ] Computed 280 place invariants in 55 ms
[2022-06-12 23:50:47] [INFO ] [Real]Absence check using 272 positive place invariants in 626 ms returned sat
[2022-06-12 23:50:47] [INFO ] [Real]Absence check using 272 positive and 8 generalized place invariants in 52 ms returned sat
[2022-06-12 23:50:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:50:51] [INFO ] [Real]Absence check using state equation in 3705 ms returned unknown
[2022-06-12 23:50:52] [INFO ] [Real]Absence check using 272 positive place invariants in 169 ms returned sat
[2022-06-12 23:50:52] [INFO ] [Real]Absence check using 272 positive and 8 generalized place invariants in 5 ms returned sat
[2022-06-12 23:50:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:50:52] [INFO ] [Real]Absence check using state equation in 744 ms returned sat
[2022-06-12 23:50:53] [INFO ] State equation strengthened by 248 read => feed constraints.
[2022-06-12 23:50:53] [INFO ] [Real]Added 248 Read/Feed constraints in 46 ms returned sat
[2022-06-12 23:50:53] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:50:53] [INFO ] [Nat]Absence check using 272 positive place invariants in 155 ms returned sat
[2022-06-12 23:50:53] [INFO ] [Nat]Absence check using 272 positive and 8 generalized place invariants in 5 ms returned sat
[2022-06-12 23:50:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 23:50:54] [INFO ] [Nat]Absence check using state equation in 554 ms returned sat
[2022-06-12 23:50:54] [INFO ] [Nat]Added 248 Read/Feed constraints in 67 ms returned sat
[2022-06-12 23:50:54] [INFO ] Deduced a trap composed of 68 places in 256 ms of which 10 ms to minimize.
[2022-06-12 23:50:55] [INFO ] Deduced a trap composed of 60 places in 128 ms of which 2 ms to minimize.
[2022-06-12 23:50:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 705 ms
[2022-06-12 23:50:55] [INFO ] Computed and/alt/rep : 864/2496/864 causal constraints (skipped 144 transitions) in 154 ms.
[2022-06-12 23:50:58] [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 close... while checking expression at index 1
[2022-06-12 23:50:58] [INFO ] [Real]Absence check using 272 positive place invariants in 159 ms returned sat
[2022-06-12 23:50:58] [INFO ] [Real]Absence check using 272 positive and 8 generalized place invariants in 5 ms returned sat
[2022-06-12 23:50:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:50:59] [INFO ] [Real]Absence check using state equation in 852 ms returned sat
[2022-06-12 23:50:59] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:51:00] [INFO ] [Nat]Absence check using 272 positive place invariants in 143 ms returned sat
[2022-06-12 23:51:00] [INFO ] [Nat]Absence check using 272 positive and 8 generalized place invariants in 6 ms returned sat
[2022-06-12 23:51:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 23:51:01] [INFO ] [Nat]Absence check using state equation in 814 ms returned sat
[2022-06-12 23:51:01] [INFO ] [Nat]Added 248 Read/Feed constraints in 38 ms returned sat
[2022-06-12 23:51:01] [INFO ] Computed and/alt/rep : 864/2496/864 causal constraints (skipped 144 transitions) in 84 ms.
[2022-06-12 23:51:05] [INFO ] Deduced a trap composed of 3 places in 1142 ms of which 3 ms to minimize.
[2022-06-12 23:51:05] [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 close... while checking expression at index 2
[2022-06-12 23:51:06] [INFO ] [Real]Absence check using 272 positive place invariants in 142 ms returned sat
[2022-06-12 23:51:06] [INFO ] [Real]Absence check using 272 positive and 8 generalized place invariants in 7 ms returned sat
[2022-06-12 23:51:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:51:07] [INFO ] [Real]Absence check using state equation in 1002 ms returned sat
[2022-06-12 23:51:07] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:51:08] [INFO ] [Nat]Absence check using 272 positive place invariants in 458 ms returned sat
[2022-06-12 23:51:08] [INFO ] [Nat]Absence check using 272 positive and 8 generalized place invariants in 35 ms returned sat
[2022-06-12 23:51:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 23:51:12] [INFO ] [Nat]Absence check using state equation in 4278 ms returned unknown
[2022-06-12 23:51:12] [INFO ] [Real]Absence check using 272 positive place invariants in 107 ms returned sat
[2022-06-12 23:51:12] [INFO ] [Real]Absence check using 272 positive and 8 generalized place invariants in 25 ms returned sat
[2022-06-12 23:51:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:51:17] [INFO ] [Real]Absence check using state equation in 4642 ms returned unknown
[2022-06-12 23:51:17] [INFO ] [Real]Absence check using 272 positive place invariants in 94 ms returned sat
[2022-06-12 23:51:17] [INFO ] [Real]Absence check using 272 positive and 8 generalized place invariants in 4 ms returned sat
[2022-06-12 23:51:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:51:18] [INFO ] [Real]Absence check using state equation in 534 ms returned sat
[2022-06-12 23:51:18] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:51:18] [INFO ] [Nat]Absence check using 272 positive place invariants in 112 ms returned sat
[2022-06-12 23:51:18] [INFO ] [Nat]Absence check using 272 positive and 8 generalized place invariants in 4 ms returned sat
[2022-06-12 23:51:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 23:51:19] [INFO ] [Nat]Absence check using state equation in 655 ms returned sat
[2022-06-12 23:51:19] [INFO ] [Nat]Added 248 Read/Feed constraints in 36 ms returned sat
[2022-06-12 23:51:19] [INFO ] Deduced a trap composed of 68 places in 66 ms of which 1 ms to minimize.
[2022-06-12 23:51:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 164 ms
[2022-06-12 23:51:19] [INFO ] Computed and/alt/rep : 864/2496/864 causal constraints (skipped 144 transitions) in 80 ms.
[2022-06-12 23:51:24] [INFO ] Deduced a trap composed of 3 places in 1173 ms of which 3 ms to minimize.
[2022-06-12 23:51: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 close... while checking expression at index 5
[2022-06-12 23:51:24] [INFO ] [Real]Absence check using 272 positive place invariants in 163 ms returned sat
[2022-06-12 23:51:24] [INFO ] [Real]Absence check using 272 positive and 8 generalized place invariants in 7 ms returned sat
[2022-06-12 23:51:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:51:25] [INFO ] [Real]Absence check using state equation in 982 ms returned sat
[2022-06-12 23:51:25] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:51:26] [INFO ] [Nat]Absence check using 272 positive place invariants in 585 ms returned sat
[2022-06-12 23:51:26] [INFO ] [Nat]Absence check using 272 positive and 8 generalized place invariants in 34 ms returned sat
[2022-06-12 23:51:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 23:51:31] [INFO ] [Nat]Absence check using state equation in 4168 ms returned unknown
[2022-06-12 23:51:31] [INFO ] [Real]Absence check using 272 positive place invariants in 98 ms returned sat
[2022-06-12 23:51:31] [INFO ] [Real]Absence check using 272 positive and 8 generalized place invariants in 5 ms returned sat
[2022-06-12 23:51:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:51:31] [INFO ] [Real]Absence check using state equation in 578 ms returned sat
[2022-06-12 23:51:31] [INFO ] [Real]Added 248 Read/Feed constraints in 38 ms returned sat
[2022-06-12 23:51:32] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:51:32] [INFO ] [Nat]Absence check using 272 positive place invariants in 158 ms returned sat
[2022-06-12 23:51:32] [INFO ] [Nat]Absence check using 272 positive and 8 generalized place invariants in 5 ms returned sat
[2022-06-12 23:51:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 23:51:33] [INFO ] [Nat]Absence check using state equation in 794 ms returned sat
[2022-06-12 23:51:33] [INFO ] [Nat]Added 248 Read/Feed constraints in 54 ms returned sat
[2022-06-12 23:51:33] [INFO ] Computed and/alt/rep : 864/2496/864 causal constraints (skipped 144 transitions) in 121 ms.
[2022-06-12 23:51:38] [INFO ] Deduced a trap composed of 3 places in 989 ms of which 1 ms to minimize.
[2022-06-12 23:51:38] [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 close... while checking expression at index 7
[2022-06-12 23:51:38] [INFO ] [Real]Absence check using 272 positive place invariants in 164 ms returned sat
[2022-06-12 23:51:38] [INFO ] [Real]Absence check using 272 positive and 8 generalized place invariants in 6 ms returned sat
[2022-06-12 23:51:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:51:39] [INFO ] [Real]Absence check using state equation in 932 ms returned sat
[2022-06-12 23:51:39] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:51:39] [INFO ] [Nat]Absence check using 272 positive place invariants in 116 ms returned sat
[2022-06-12 23:51:39] [INFO ] [Nat]Absence check using 272 positive and 8 generalized place invariants in 5 ms returned sat
[2022-06-12 23:51:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 23:51:40] [INFO ] [Nat]Absence check using state equation in 1136 ms returned sat
[2022-06-12 23:51:40] [INFO ] [Nat]Added 248 Read/Feed constraints in 61 ms returned sat
[2022-06-12 23:51:41] [INFO ] Deduced a trap composed of 68 places in 76 ms of which 1 ms to minimize.
[2022-06-12 23:51:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 249 ms
[2022-06-12 23:51:41] [INFO ] Computed and/alt/rep : 864/2496/864 causal constraints (skipped 144 transitions) in 144 ms.
[2022-06-12 23:51:45] [INFO ] Deduced a trap composed of 3 places in 1352 ms of which 3 ms to minimize.
[2022-06-12 23:51:45] [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 close... while checking expression at index 8
[2022-06-12 23:51:46] [INFO ] [Real]Absence check using 272 positive place invariants in 437 ms returned sat
[2022-06-12 23:51:46] [INFO ] [Real]Absence check using 272 positive and 8 generalized place invariants in 11 ms returned sat
[2022-06-12 23:51:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:51:48] [INFO ] [Real]Absence check using state equation in 1778 ms returned sat
[2022-06-12 23:51:48] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:51:49] [INFO ] [Nat]Absence check using 272 positive place invariants in 822 ms returned sat
[2022-06-12 23:51:49] [INFO ] [Nat]Absence check using 272 positive and 8 generalized place invariants in 77 ms returned sat
[2022-06-12 23:51:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 23:51:53] [INFO ] [Nat]Absence check using state equation in 3859 ms returned unknown
[2022-06-12 23:51:53] [INFO ] [Real]Absence check using 272 positive place invariants in 117 ms returned sat
[2022-06-12 23:51:53] [INFO ] [Real]Absence check using 272 positive and 8 generalized place invariants in 6 ms returned sat
[2022-06-12 23:51:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:51:55] [INFO ] [Real]Absence check using state equation in 1364 ms returned sat
[2022-06-12 23:51:55] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:51:55] [INFO ] [Nat]Absence check using 272 positive place invariants in 292 ms returned unsat
[2022-06-12 23:51:56] [INFO ] [Real]Absence check using 272 positive place invariants in 121 ms returned sat
[2022-06-12 23:51:56] [INFO ] [Real]Absence check using 272 positive and 8 generalized place invariants in 5 ms returned sat
[2022-06-12 23:51:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:51:56] [INFO ] [Real]Absence check using state equation in 714 ms returned sat
[2022-06-12 23:51:56] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:51:57] [INFO ] [Nat]Absence check using 272 positive place invariants in 103 ms returned sat
[2022-06-12 23:51:57] [INFO ] [Nat]Absence check using 272 positive and 8 generalized place invariants in 5 ms returned sat
[2022-06-12 23:51:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 23:51:57] [INFO ] [Nat]Absence check using state equation in 792 ms returned sat
[2022-06-12 23:51:58] [INFO ] [Nat]Added 248 Read/Feed constraints in 38 ms returned sat
[2022-06-12 23:51:58] [INFO ] Computed and/alt/rep : 864/2496/864 causal constraints (skipped 144 transitions) in 73 ms.
[2022-06-12 23:52:01] [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 close... while checking expression at index 11
FORMULA Parking-PT-864-ReachabilityFireability-14 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 12 Parikh solutions to 1 different solutions.
Support contains 181 out of 1185 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1185/1185 places, 1009/1009 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 1185 transition count 1000
Reduce places removed 9 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 13 rules applied. Total rules applied 22 place count 1176 transition count 996
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 26 place count 1172 transition count 996
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 26 place count 1172 transition count 987
Deduced a syphon composed of 9 places in 4 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 44 place count 1163 transition count 987
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 50 place count 1157 transition count 981
Iterating global reduction 3 with 6 rules applied. Total rules applied 56 place count 1157 transition count 981
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 6 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 96 place count 1137 transition count 961
Free-agglomeration rule applied 134 times.
Iterating global reduction 3 with 134 rules applied. Total rules applied 230 place count 1137 transition count 827
Reduce places removed 134 places and 0 transitions.
Iterating post reduction 3 with 134 rules applied. Total rules applied 364 place count 1003 transition count 827
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 365 place count 1003 transition count 826
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 368 place count 1003 transition count 826
Applied a total of 368 rules in 1026 ms. Remains 1003 /1185 variables (removed 182) and now considering 826/1009 (removed 183) transitions.
Finished structural reductions, in 1 iterations. Remains : 1003/1185 places, 826/1009 transitions.
[2022-06-12 23:52:03] [INFO ] Flatten gal took : 313 ms
[2022-06-12 23:52:03] [INFO ] Flatten gal took : 172 ms
[2022-06-12 23:52:03] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11825778786168536618.gal : 54 ms
[2022-06-12 23:52:03] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8236893313879989251.prop : 3 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality11825778786168536618.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality8236893313879989251.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality11825778786168536618.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality8236893313879989251.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality8236893313879989251.prop.
SDD proceeding with computation,11 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,11 properties remain. new max is 8
SDD size :3 after 9
SDD proceeding with computation,11 properties remain. new max is 16
SDD size :9 after 33
SDD proceeding with computation,11 properties remain. new max is 32
SDD size :33 after 3298
SDD proceeding with computation,11 properties remain. new max is 64
SDD size :3298 after 3393
SDD proceeding with computation,11 properties remain. new max is 128
SDD size :3393 after 4225
SDD proceeding with computation,11 properties remain. new max is 256
SDD size :4225 after 5105
SDD proceeding with computation,11 properties remain. new max is 512
SDD size :5105 after 6721
SDD proceeding with computation,11 properties remain. new max is 1024
SDD size :6721 after 14257
SDD proceeding with computation,11 properties remain. new max is 2048
SDD size :14257 after 24193
SDD proceeding with computation,11 properties remain. new max is 4096
SDD size :24193 after 37377
Detected timeout of ITS tools.
[2022-06-12 23:52:18] [INFO ] Flatten gal took : 70 ms
[2022-06-12 23:52:18] [INFO ] Applying decomposition
[2022-06-12 23:52:19] [INFO ] Flatten gal took : 68 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph9058332787357361369.txt, -o, /tmp/graph9058332787357361369.bin, -w, /tmp/graph9058332787357361369.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph9058332787357361369.bin, -l, -1, -v, -w, /tmp/graph9058332787357361369.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-12 23:52:19] [INFO ] Decomposing Gal with order
[2022-06-12 23:52:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-12 23:52:19] [INFO ] Removed a total of 66 redundant transitions.
[2022-06-12 23:52:19] [INFO ] Flatten gal took : 163 ms
[2022-06-12 23:52:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 38 labels/synchronizations in 68 ms.
[2022-06-12 23:52:19] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7799053875572341063.gal : 23 ms
[2022-06-12 23:52:19] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13696430272477098210.prop : 2 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality7799053875572341063.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality13696430272477098210.prop, --nowitness], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality7799053875572341063.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality13696430272477098210.prop --nowitness
Loading property file /tmp/ReachabilityCardinality13696430272477098210.prop.
SDD proceeding with computation,11 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,11 properties remain. new max is 8
SDD size :1 after 73
SDD proceeding with computation,11 properties remain. new max is 16
SDD size :73 after 1.76947e+07
Reachability property Parking-PT-864-ReachabilityFireability-02 is true.
FORMULA Parking-PT-864-ReachabilityFireability-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,10 properties remain. new max is 16
SDD size :1.76947e+07 after 5.78028e+07
SDD proceeding with computation,10 properties remain. new max is 32
SDD size :5.78028e+07 after 7.19585e+07
SDD proceeding with computation,10 properties remain. new max is 64
SDD size :7.19585e+07 after 1.14426e+08
SDD proceeding with computation,10 properties remain. new max is 128
SDD size :1.14426e+08 after 3.98536e+12
SDD proceeding with computation,10 properties remain. new max is 256
SDD size :3.98536e+12 after 7.87046e+12
SDD proceeding with computation,10 properties remain. new max is 512
SDD size :7.87046e+12 after 4.44524e+16
Invariant property Parking-PT-864-ReachabilityFireability-15 does not hold.
FORMULA Parking-PT-864-ReachabilityFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Reachability property Parking-PT-864-ReachabilityFireability-10 is true.
FORMULA Parking-PT-864-ReachabilityFireability-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Invariant property Parking-PT-864-ReachabilityFireability-09 does not hold.
FORMULA Parking-PT-864-ReachabilityFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Invariant property Parking-PT-864-ReachabilityFireability-08 does not hold.
FORMULA Parking-PT-864-ReachabilityFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,6 properties remain. new max is 512
SDD size :4.44524e+16 after 1.89848e+29
Invariant property Parking-PT-864-ReachabilityFireability-11 does not hold.
FORMULA Parking-PT-864-ReachabilityFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Invariant property Parking-PT-864-ReachabilityFireability-05 does not hold.
FORMULA Parking-PT-864-ReachabilityFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Invariant property Parking-PT-864-ReachabilityFireability-00 does not hold.
FORMULA Parking-PT-864-ReachabilityFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :1.89848e+29 after 2.98333e+30
Reachability property Parking-PT-864-ReachabilityFireability-13 is true.
FORMULA Parking-PT-864-ReachabilityFireability-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Reachability property Parking-PT-864-ReachabilityFireability-07 is true.
FORMULA Parking-PT-864-ReachabilityFireability-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Reachability property Parking-PT-864-ReachabilityFireability-06 is true.
FORMULA Parking-PT-864-ReachabilityFireability-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 513 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,2.02469e+34,14.1785,91416,4033,767,158756,32424,2381,288587,307,189057,0
Total reachable state count : 20246907008834176060177118134272000

Verifying 11 reachability properties.
ITS tools runner thread asked to quit. Dying gracefully.
All properties solved without resorting to model-checking.

BK_STOP 1655077956127

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination ReachabilityFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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-864"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="gold2021"
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 gold2021"
echo " Input is Parking-PT-864, 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 r161-smll-165277002800129"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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