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.r179-tall-165277026700026.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 Peterson-PT-4, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r179-tall-165277026700026
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.9M
-rw-r--r-- 1 mcc users 47K Apr 30 09:26 CTLCardinality.txt
-rw-r--r-- 1 mcc users 209K Apr 30 09:26 CTLCardinality.xml
-rw-r--r-- 1 mcc users 83K Apr 30 09:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 388K Apr 30 09:22 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 26K May 9 08:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 84K May 9 08:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 17K May 9 08:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 68K May 9 08:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 193K Apr 30 09:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 836K Apr 30 09:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 103K Apr 30 09:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 480K Apr 30 09:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 9 08:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 8.5K May 9 08:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 2 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 298K 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 Peterson-PT-4-ReachabilityCardinality-00
FORMULA_NAME Peterson-PT-4-ReachabilityCardinality-01
FORMULA_NAME Peterson-PT-4-ReachabilityCardinality-02
FORMULA_NAME Peterson-PT-4-ReachabilityCardinality-03
FORMULA_NAME Peterson-PT-4-ReachabilityCardinality-04
FORMULA_NAME Peterson-PT-4-ReachabilityCardinality-05
FORMULA_NAME Peterson-PT-4-ReachabilityCardinality-06
FORMULA_NAME Peterson-PT-4-ReachabilityCardinality-07
FORMULA_NAME Peterson-PT-4-ReachabilityCardinality-08
FORMULA_NAME Peterson-PT-4-ReachabilityCardinality-09
FORMULA_NAME Peterson-PT-4-ReachabilityCardinality-10
FORMULA_NAME Peterson-PT-4-ReachabilityCardinality-11
FORMULA_NAME Peterson-PT-4-ReachabilityCardinality-12
FORMULA_NAME Peterson-PT-4-ReachabilityCardinality-13
FORMULA_NAME Peterson-PT-4-ReachabilityCardinality-14
FORMULA_NAME Peterson-PT-4-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1655068614008

Running Version 0
[2022-06-12 21:16:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -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 21:16:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-12 21:16:55] [INFO ] Load time of PNML (sax parser for PT used): 76 ms
[2022-06-12 21:16:55] [INFO ] Transformed 480 places.
[2022-06-12 21:16:55] [INFO ] Transformed 690 transitions.
[2022-06-12 21:16:55] [INFO ] Found NUPN structural information;
[2022-06-12 21:16:55] [INFO ] Completing missing partition info from NUPN : creating a component with [IsEndLoop_0_3_4, IsEndLoop_1_3_4, TestAlone_3_1_4, TestAlone_2_2_4, TestIdentity_2_3_4, TestIdentity_4_0_4, AskForSection_0_3, AskForSection_0_2]
[2022-06-12 21:16:55] [INFO ] Parsed PT model containing 480 places and 690 transitions in 124 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 48 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 147 ms. (steps per millisecond=68 ) properties (out of 16) seen :2
FORMULA Peterson-PT-4-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-4-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 163 ms. (steps per millisecond=61 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 14) 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 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 154 ms. (steps per millisecond=64 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 153 ms. (steps per millisecond=65 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 322 ms. (steps per millisecond=31 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 14) seen :0
Running SMT prover for 14 properties.
[2022-06-12 21:16:57] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 480 cols
[2022-06-12 21:16:57] [INFO ] Computed 19 place invariants in 25 ms
[2022-06-12 21:16:57] [INFO ] [Real]Absence check using 14 positive place invariants in 12 ms returned unsat
[2022-06-12 21:16:57] [INFO ] [Real]Absence check using 14 positive place invariants in 15 ms returned unsat
[2022-06-12 21:16:57] [INFO ] [Real]Absence check using 14 positive place invariants in 9 ms returned unsat
[2022-06-12 21:16:57] [INFO ] [Real]Absence check using 14 positive place invariants in 9 ms returned unsat
[2022-06-12 21:16:58] [INFO ] [Real]Absence check using 14 positive place invariants in 9 ms returned unsat
[2022-06-12 21:16:58] [INFO ] [Real]Absence check using 14 positive place invariants in 10 ms returned sat
[2022-06-12 21:16:58] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 1 ms returned sat
[2022-06-12 21:16:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:16:58] [INFO ] [Real]Absence check using state equation in 177 ms returned sat
[2022-06-12 21:16:58] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:16:58] [INFO ] [Nat]Absence check using 14 positive place invariants in 11 ms returned sat
[2022-06-12 21:16:58] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 3 ms returned sat
[2022-06-12 21:16:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:16:58] [INFO ] [Nat]Absence check using state equation in 183 ms returned sat
[2022-06-12 21:16:58] [INFO ] State equation strengthened by 132 read => feed constraints.
[2022-06-12 21:16:58] [INFO ] [Nat]Added 132 Read/Feed constraints in 28 ms returned sat
[2022-06-12 21:16:58] [INFO ] Deduced a trap composed of 31 places in 183 ms of which 3 ms to minimize.
[2022-06-12 21:16:59] [INFO ] Deduced a trap composed of 10 places in 172 ms of which 1 ms to minimize.
[2022-06-12 21:16:59] [INFO ] Deduced a trap composed of 91 places in 140 ms of which 1 ms to minimize.
[2022-06-12 21:16:59] [INFO ] Deduced a trap composed of 10 places in 131 ms of which 2 ms to minimize.
[2022-06-12 21:16:59] [INFO ] Deduced a trap composed of 10 places in 148 ms of which 1 ms to minimize.
[2022-06-12 21:16:59] [INFO ] Deduced a trap composed of 10 places in 117 ms of which 0 ms to minimize.
[2022-06-12 21:17:00] [INFO ] Deduced a trap composed of 13 places in 123 ms of which 1 ms to minimize.
[2022-06-12 21:17:00] [INFO ] Deduced a trap composed of 27 places in 117 ms of which 0 ms to minimize.
[2022-06-12 21:17:00] [INFO ] Deduced a trap composed of 62 places in 109 ms of which 0 ms to minimize.
[2022-06-12 21:17:00] [INFO ] Deduced a trap composed of 62 places in 123 ms of which 1 ms to minimize.
[2022-06-12 21:17:00] [INFO ] Deduced a trap composed of 27 places in 108 ms of which 0 ms to minimize.
[2022-06-12 21:17:00] [INFO ] Deduced a trap composed of 54 places in 106 ms of which 1 ms to minimize.
[2022-06-12 21:17:00] [INFO ] Deduced a trap composed of 54 places in 108 ms of which 0 ms to minimize.
[2022-06-12 21:17:01] [INFO ] Deduced a trap composed of 30 places in 94 ms of which 0 ms to minimize.
[2022-06-12 21:17:01] [INFO ] Deduced a trap composed of 32 places in 105 ms of which 1 ms to minimize.
[2022-06-12 21:17:01] [INFO ] Deduced a trap composed of 45 places in 104 ms of which 0 ms to minimize.
[2022-06-12 21:17:01] [INFO ] Deduced a trap composed of 32 places in 99 ms of which 0 ms to minimize.
[2022-06-12 21:17:01] [INFO ] Deduced a trap composed of 42 places in 79 ms of which 0 ms to minimize.
[2022-06-12 21:17:01] [INFO ] Deduced a trap composed of 42 places in 87 ms of which 0 ms to minimize.
[2022-06-12 21:17:01] [INFO ] Deduced a trap composed of 38 places in 106 ms of which 1 ms to minimize.
[2022-06-12 21:17:01] [INFO ] Deduced a trap composed of 32 places in 91 ms of which 1 ms to minimize.
[2022-06-12 21:17:02] [INFO ] Deduced a trap composed of 54 places in 85 ms of which 1 ms to minimize.
[2022-06-12 21:17:02] [INFO ] Deduced a trap composed of 57 places in 86 ms of which 1 ms to minimize.
[2022-06-12 21:17:02] [INFO ] Deduced a trap composed of 54 places in 80 ms of which 0 ms to minimize.
[2022-06-12 21:17:02] [INFO ] Deduced a trap composed of 32 places in 91 ms of which 0 ms to minimize.
[2022-06-12 21:17:02] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 3619 ms
[2022-06-12 21:17:02] [INFO ] Computed and/alt/rep : 589/1046/589 causal constraints (skipped 36 transitions) in 36 ms.
[2022-06-12 21:17:03] [INFO ] Added : 120 causal constraints over 24 iterations in 1073 ms. Result :unknown
[2022-06-12 21:17:03] [INFO ] [Real]Absence check using 14 positive place invariants in 9 ms returned sat
[2022-06-12 21:17:03] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 0 ms returned sat
[2022-06-12 21:17:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:17:03] [INFO ] [Real]Absence check using state equation in 136 ms returned sat
[2022-06-12 21:17:03] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:17:03] [INFO ] [Real]Absence check using 14 positive place invariants in 12 ms returned sat
[2022-06-12 21:17:03] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 2 ms returned sat
[2022-06-12 21:17:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:17:04] [INFO ] [Real]Absence check using state equation in 202 ms returned sat
[2022-06-12 21:17:04] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:17:04] [INFO ] [Real]Absence check using 14 positive place invariants in 12 ms returned sat
[2022-06-12 21:17:04] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 2 ms returned sat
[2022-06-12 21:17:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:17:04] [INFO ] [Real]Absence check using state equation in 318 ms returned sat
[2022-06-12 21:17:04] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:17:04] [INFO ] [Real]Absence check using 14 positive place invariants in 8 ms returned sat
[2022-06-12 21:17:04] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 0 ms returned sat
[2022-06-12 21:17:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:17:04] [INFO ] [Real]Absence check using state equation in 139 ms returned sat
[2022-06-12 21:17:04] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:17:05] [INFO ] [Real]Absence check using 14 positive place invariants in 8 ms returned sat
[2022-06-12 21:17:05] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 1 ms returned sat
[2022-06-12 21:17:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:17:05] [INFO ] [Real]Absence check using state equation in 144 ms returned sat
[2022-06-12 21:17:05] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:17:05] [INFO ] [Nat]Absence check using 14 positive place invariants in 17 ms returned sat
[2022-06-12 21:17:05] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 1 ms returned sat
[2022-06-12 21:17:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:17:05] [INFO ] [Nat]Absence check using state equation in 138 ms returned sat
[2022-06-12 21:17:05] [INFO ] [Nat]Added 132 Read/Feed constraints in 25 ms returned sat
[2022-06-12 21:17:05] [INFO ] Deduced a trap composed of 10 places in 146 ms of which 1 ms to minimize.
[2022-06-12 21:17:05] [INFO ] Deduced a trap composed of 23 places in 113 ms of which 1 ms to minimize.
[2022-06-12 21:17:05] [INFO ] Deduced a trap composed of 12 places in 113 ms of which 1 ms to minimize.
[2022-06-12 21:17:06] [INFO ] Deduced a trap composed of 10 places in 128 ms of which 1 ms to minimize.
[2022-06-12 21:17:06] [INFO ] Deduced a trap composed of 32 places in 99 ms of which 0 ms to minimize.
[2022-06-12 21:17:06] [INFO ] Deduced a trap composed of 32 places in 131 ms of which 1 ms to minimize.
[2022-06-12 21:17:06] [INFO ] Deduced a trap composed of 32 places in 105 ms of which 1 ms to minimize.
[2022-06-12 21:17:06] [INFO ] Deduced a trap composed of 55 places in 117 ms of which 0 ms to minimize.
[2022-06-12 21:17:06] [INFO ] Deduced a trap composed of 53 places in 111 ms of which 1 ms to minimize.
[2022-06-12 21:17:06] [INFO ] Deduced a trap composed of 32 places in 112 ms of which 5 ms to minimize.
[2022-06-12 21:17:07] [INFO ] Deduced a trap composed of 10 places in 119 ms of which 1 ms to minimize.
[2022-06-12 21:17:07] [INFO ] Deduced a trap composed of 10 places in 112 ms of which 0 ms to minimize.
[2022-06-12 21:17:07] [INFO ] Deduced a trap composed of 76 places in 83 ms of which 1 ms to minimize.
[2022-06-12 21:17:07] [INFO ] Deduced a trap composed of 54 places in 81 ms of which 0 ms to minimize.
[2022-06-12 21:17:07] [INFO ] Deduced a trap composed of 54 places in 71 ms of which 1 ms to minimize.
[2022-06-12 21:17:07] [INFO ] Deduced a trap composed of 50 places in 59 ms of which 0 ms to minimize.
[2022-06-12 21:17:07] [INFO ] Deduced a trap composed of 65 places in 58 ms of which 0 ms to minimize.
[2022-06-12 21:17:07] [INFO ] Deduced a trap composed of 50 places in 84 ms of which 1 ms to minimize.
[2022-06-12 21:17:08] [INFO ] Deduced a trap composed of 39 places in 126 ms of which 0 ms to minimize.
[2022-06-12 21:17:08] [INFO ] Deduced a trap composed of 65 places in 111 ms of which 0 ms to minimize.
[2022-06-12 21:17:08] [INFO ] Deduced a trap composed of 13 places in 128 ms of which 0 ms to minimize.
[2022-06-12 21:17:08] [INFO ] Deduced a trap composed of 61 places in 83 ms of which 0 ms to minimize.
[2022-06-12 21:17:08] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 2936 ms
[2022-06-12 21:17:08] [INFO ] Computed and/alt/rep : 589/1046/589 causal constraints (skipped 36 transitions) in 34 ms.
[2022-06-12 21:17:10] [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 13
FORMULA Peterson-PT-4-ReachabilityCardinality-12 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Peterson-PT-4-ReachabilityCardinality-11 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Peterson-PT-4-ReachabilityCardinality-10 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Peterson-PT-4-ReachabilityCardinality-09 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Peterson-PT-4-ReachabilityCardinality-07 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Peterson-PT-4-ReachabilityCardinality-06 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Peterson-PT-4-ReachabilityCardinality-05 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Peterson-PT-4-ReachabilityCardinality-04 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Peterson-PT-4-ReachabilityCardinality-03 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Peterson-PT-4-ReachabilityCardinality-02 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Peterson-PT-4-ReachabilityCardinality-01 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Peterson-PT-4-ReachabilityCardinality-00 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 14 Parikh solutions to 2 different solutions.
Incomplete Parikh walk after 235800 steps, including 1000 resets, run finished after 328 ms. (steps per millisecond=718 ) properties (out of 2) seen :1 could not realise parikh vector
FORMULA Peterson-PT-4-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 2 out of 480 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 480/480 places, 690/690 transitions.
Drop transitions removed 196 transitions
Trivial Post-agglo rules discarded 196 transitions
Performed 196 trivial Post agglomeration. Transition count delta: 196
Iterating post reduction 0 with 196 rules applied. Total rules applied 196 place count 480 transition count 494
Reduce places removed 196 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 197 rules applied. Total rules applied 393 place count 284 transition count 493
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 394 place count 283 transition count 493
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 100 Pre rules applied. Total rules applied 394 place count 283 transition count 393
Deduced a syphon composed of 100 places in 1 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 3 with 200 rules applied. Total rules applied 594 place count 183 transition count 393
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 634 place count 163 transition count 373
Applied a total of 634 rules in 64 ms. Remains 163 /480 variables (removed 317) and now considering 373/690 (removed 317) transitions.
Finished structural reductions, in 1 iterations. Remains : 163/480 places, 373/690 transitions.
[2022-06-12 21:17:10] [INFO ] Flatten gal took : 91 ms
[2022-06-12 21:17:10] [INFO ] Flatten gal took : 22 ms
[2022-06-12 21:17:10] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality679352729017741211.gal : 13 ms
[2022-06-12 21:17:10] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13322988901462323778.prop : 1 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/ReachabilityCardinality679352729017741211.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality13322988901462323778.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/ReachabilityCardinality679352729017741211.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality13322988901462323778.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality13322988901462323778.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :4 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 16
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :16 after 25
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :25 after 32
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :32 after 121
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :121 after 269
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :269 after 542
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :542 after 2320
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :2320 after 5849
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :5849 after 12428
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :12428 after 87682
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :87682 after 178416
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :178416 after 414756
Detected timeout of ITS tools.
[2022-06-12 21:17:26] [INFO ] Flatten gal took : 20 ms
[2022-06-12 21:17:26] [INFO ] Applying decomposition
[2022-06-12 21:17:26] [INFO ] Flatten gal took : 25 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/graph6054989601034645414.txt, -o, /tmp/graph6054989601034645414.bin, -w, /tmp/graph6054989601034645414.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/graph6054989601034645414.bin, -l, -1, -v, -w, /tmp/graph6054989601034645414.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-12 21:17:26] [INFO ] Decomposing Gal with order
[2022-06-12 21:17:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-12 21:17:26] [INFO ] Removed a total of 398 redundant transitions.
[2022-06-12 21:17:26] [INFO ] Flatten gal took : 100 ms
[2022-06-12 21:17:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 277 labels/synchronizations in 50 ms.
[2022-06-12 21:17:26] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15721736250291802044.gal : 16 ms
[2022-06-12 21:17:26] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13267593948506048897.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/ReachabilityCardinality15721736250291802044.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality13267593948506048897.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/ReachabilityCardinality15721736250291802044.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality13267593948506048897.prop --nowitness
Loading property file /tmp/ReachabilityCardinality13267593948506048897.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 172
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :172 after 482
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :482 after 619
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :619 after 677
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :677 after 9251
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :9251 after 54132
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :54132 after 133750
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :133750 after 401866
Invariant property Peterson-PT-4-ReachabilityCardinality-15 does not hold.
FORMULA Peterson-PT-4-ReachabilityCardinality-15 FALSE 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,817999,6.68538,191128,9161,1201,200816,9072,819,1.30631e+06,192,111876,0
Total reachable state count : 817999

Verifying 1 reachability properties.
Invariant property Peterson-PT-4-ReachabilityCardinality-15 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
Peterson-PT-4-ReachabilityCardinality-15,18,6.69595,191128,48,45,200816,9072,831,1.30631e+06,196,111876,0
All properties solved without resorting to model-checking.

BK_STOP 1655068654149

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -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 ReachabilityCardinality -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="Peterson-PT-4"
export BK_EXAMINATION="ReachabilityCardinality"
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 Peterson-PT-4, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r179-tall-165277026700026"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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