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-165277002700065.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 NoC3x3-PT-4B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r161-smll-165277002700065
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 7.9K Apr 29 13:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K Apr 29 13:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Apr 29 13:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Apr 29 13:01 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 9 08:21 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 08:21 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 9 08:21 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 08:21 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.7K Apr 29 13:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 104K Apr 29 13:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Apr 29 13:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K Apr 29 13:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:21 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 9 08:21 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 608K 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 NoC3x3-PT-4B-ReachabilityCardinality-00
FORMULA_NAME NoC3x3-PT-4B-ReachabilityCardinality-01
FORMULA_NAME NoC3x3-PT-4B-ReachabilityCardinality-02
FORMULA_NAME NoC3x3-PT-4B-ReachabilityCardinality-03
FORMULA_NAME NoC3x3-PT-4B-ReachabilityCardinality-04
FORMULA_NAME NoC3x3-PT-4B-ReachabilityCardinality-05
FORMULA_NAME NoC3x3-PT-4B-ReachabilityCardinality-06
FORMULA_NAME NoC3x3-PT-4B-ReachabilityCardinality-07
FORMULA_NAME NoC3x3-PT-4B-ReachabilityCardinality-08
FORMULA_NAME NoC3x3-PT-4B-ReachabilityCardinality-09
FORMULA_NAME NoC3x3-PT-4B-ReachabilityCardinality-10
FORMULA_NAME NoC3x3-PT-4B-ReachabilityCardinality-11
FORMULA_NAME NoC3x3-PT-4B-ReachabilityCardinality-12
FORMULA_NAME NoC3x3-PT-4B-ReachabilityCardinality-13
FORMULA_NAME NoC3x3-PT-4B-ReachabilityCardinality-14
FORMULA_NAME NoC3x3-PT-4B-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1655069433540

Running Version 0
[2022-06-12 21:30:35] [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:30:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-12 21:30:36] [INFO ] Load time of PNML (sax parser for PT used): 314 ms
[2022-06-12 21:30:36] [INFO ] Transformed 2328 places.
[2022-06-12 21:30:36] [INFO ] Transformed 2701 transitions.
[2022-06-12 21:30:36] [INFO ] Found NUPN structural information;
[2022-06-12 21:30:36] [INFO ] Parsed PT model containing 2328 places and 2701 transitions in 422 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 26 ms.
Working with output stream class java.io.PrintStream
FORMULA NoC3x3-PT-4B-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 6 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 15) seen :7
FORMULA NoC3x3-PT-4B-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-4B-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-4B-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-4B-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-4B-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-4B-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-4B-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 2701 rows 2328 cols
[2022-06-12 21:30:37] [INFO ] Computed 66 place invariants in 51 ms
[2022-06-12 21:30:37] [INFO ] [Real]Absence check using 66 positive place invariants in 112 ms returned sat
[2022-06-12 21:30:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:30:39] [INFO ] [Real]Absence check using state equation in 1477 ms returned sat
[2022-06-12 21:30:39] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:30:40] [INFO ] [Real]Absence check using 66 positive place invariants in 99 ms returned sat
[2022-06-12 21:30:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:30:42] [INFO ] [Real]Absence check using state equation in 1373 ms returned sat
[2022-06-12 21:30:42] [INFO ] Deduced a trap composed of 68 places in 393 ms of which 5 ms to minimize.
[2022-06-12 21:30:43] [INFO ] Deduced a trap composed of 120 places in 309 ms of which 2 ms to minimize.
[2022-06-12 21:30:43] [INFO ] Deduced a trap composed of 69 places in 210 ms of which 2 ms to minimize.
[2022-06-12 21:30:43] [INFO ] Deduced a trap composed of 106 places in 195 ms of which 3 ms to minimize.
[2022-06-12 21:30:44] [INFO ] Deduced a trap composed of 75 places in 124 ms of which 0 ms to minimize.
[2022-06-12 21:30:44] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1935 ms
[2022-06-12 21:30:44] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:30:44] [INFO ] [Nat]Absence check using 66 positive place invariants in 99 ms returned sat
[2022-06-12 21:30:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:30:46] [INFO ] [Nat]Absence check using state equation in 1434 ms returned sat
[2022-06-12 21:30:46] [INFO ] Deduced a trap composed of 68 places in 331 ms of which 2 ms to minimize.
[2022-06-12 21:30:47] [INFO ] Deduced a trap composed of 120 places in 211 ms of which 2 ms to minimize.
[2022-06-12 21:30:47] [INFO ] Deduced a trap composed of 69 places in 200 ms of which 1 ms to minimize.
[2022-06-12 21:30:47] [INFO ] Deduced a trap composed of 106 places in 194 ms of which 0 ms to minimize.
[2022-06-12 21:30:47] [INFO ] Deduced a trap composed of 75 places in 121 ms of which 1 ms to minimize.
[2022-06-12 21:30:48] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1804 ms
[2022-06-12 21:30:48] [INFO ] Computed and/alt/rep : 2700/4269/2700 causal constraints (skipped 0 transitions) in 192 ms.
[2022-06-12 21:30:51] [INFO ] Deduced a trap composed of 7 places in 2152 ms of which 5 ms to minimize.
[2022-06-12 21:30:51] [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 21:30:52] [INFO ] [Real]Absence check using 66 positive place invariants in 108 ms returned sat
[2022-06-12 21:30:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:30:54] [INFO ] [Real]Absence check using state equation in 2050 ms returned sat
[2022-06-12 21:30:54] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:30:54] [INFO ] [Nat]Absence check using 66 positive place invariants in 108 ms returned sat
[2022-06-12 21:30:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:30:56] [INFO ] [Nat]Absence check using state equation in 2068 ms returned sat
[2022-06-12 21:30:57] [INFO ] Deduced a trap composed of 107 places in 128 ms of which 1 ms to minimize.
[2022-06-12 21:30:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 386 ms
[2022-06-12 21:30:57] [INFO ] Computed and/alt/rep : 2700/4269/2700 causal constraints (skipped 0 transitions) in 165 ms.
[2022-06-12 21:31:00] [INFO ] Deduced a trap composed of 7 places in 1582 ms of which 6 ms to minimize.
[2022-06-12 21:31:00] [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 21:31:01] [INFO ] [Real]Absence check using 66 positive place invariants in 101 ms returned sat
[2022-06-12 21:31:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:31:03] [INFO ] [Real]Absence check using state equation in 1767 ms returned sat
[2022-06-12 21:31:03] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:31:03] [INFO ] [Nat]Absence check using 66 positive place invariants in 104 ms returned sat
[2022-06-12 21:31:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:31:05] [INFO ] [Nat]Absence check using state equation in 1907 ms returned sat
[2022-06-12 21:31:06] [INFO ] Deduced a trap composed of 93 places in 160 ms of which 0 ms to minimize.
[2022-06-12 21:31:06] [INFO ] Deduced a trap composed of 121 places in 127 ms of which 1 ms to minimize.
[2022-06-12 21:31:06] [INFO ] Deduced a trap composed of 77 places in 90 ms of which 0 ms to minimize.
[2022-06-12 21:31:06] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 836 ms
[2022-06-12 21:31:06] [INFO ] Computed and/alt/rep : 2700/4269/2700 causal constraints (skipped 0 transitions) in 170 ms.
[2022-06-12 21:31:10] [INFO ] Deduced a trap composed of 7 places in 2106 ms of which 6 ms to minimize.
[2022-06-12 21:31: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 3
[2022-06-12 21:31:10] [INFO ] [Real]Absence check using 66 positive place invariants in 100 ms returned sat
[2022-06-12 21:31:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:31:12] [INFO ] [Real]Absence check using state equation in 1536 ms returned sat
[2022-06-12 21:31:12] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:31:13] [INFO ] [Real]Absence check using 66 positive place invariants in 75 ms returned unsat
[2022-06-12 21:31:14] [INFO ] [Real]Absence check using 66 positive place invariants in 116 ms returned sat
[2022-06-12 21:31:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:31:18] [INFO ] [Real]Absence check using state equation in 4128 ms returned sat
[2022-06-12 21:31:18] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:31:18] [INFO ] [Nat]Absence check using 66 positive place invariants in 134 ms returned sat
[2022-06-12 21:31:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:31:21] [INFO ] [Nat]Absence check using state equation in 2079 ms returned sat
[2022-06-12 21:31:21] [INFO ] Deduced a trap composed of 117 places in 123 ms of which 1 ms to minimize.
[2022-06-12 21:31:21] [INFO ] Deduced a trap composed of 121 places in 93 ms of which 3 ms to minimize.
[2022-06-12 21:31:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 545 ms
[2022-06-12 21:31:21] [INFO ] Computed and/alt/rep : 2700/4269/2700 causal constraints (skipped 0 transitions) in 179 ms.
[2022-06-12 21:31:23] [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 6
[2022-06-12 21:31:23] [INFO ] [Real]Absence check using 66 positive place invariants in 106 ms returned sat
[2022-06-12 21:31:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:31:26] [INFO ] [Real]Absence check using state equation in 2249 ms returned sat
[2022-06-12 21:31:26] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:31:26] [INFO ] [Nat]Absence check using 66 positive place invariants in 121 ms returned sat
[2022-06-12 21:31:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:31:29] [INFO ] [Nat]Absence check using state equation in 2108 ms returned sat
[2022-06-12 21:31:29] [INFO ] Deduced a trap composed of 93 places in 348 ms of which 1 ms to minimize.
[2022-06-12 21:31:29] [INFO ] Deduced a trap composed of 120 places in 397 ms of which 1 ms to minimize.
[2022-06-12 21:31:30] [INFO ] Deduced a trap composed of 87 places in 228 ms of which 1 ms to minimize.
[2022-06-12 21:31:30] [INFO ] Deduced a trap composed of 100 places in 177 ms of which 1 ms to minimize.
[2022-06-12 21:31:30] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1778 ms
[2022-06-12 21:31:30] [INFO ] Computed and/alt/rep : 2700/4269/2700 causal constraints (skipped 0 transitions) in 175 ms.
[2022-06-12 21:31:33] [INFO ] Deduced a trap composed of 7 places in 2290 ms of which 3 ms to minimize.
[2022-06-12 21:31:33] [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
FORMULA NoC3x3-PT-4B-ReachabilityCardinality-12 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA NoC3x3-PT-4B-ReachabilityCardinality-11 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA NoC3x3-PT-4B-ReachabilityCardinality-00 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 8 Parikh solutions to 1 different solutions.
Support contains 95 out of 2328 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2328/2328 places, 2701/2701 transitions.
Graph (trivial) has 2111 edges and 2328 vertex of which 806 / 2328 are part of one of the 26 SCC in 14 ms
Free SCC test removed 780 places
Drop transitions removed 932 transitions
Reduce isomorphic transitions removed 932 transitions.
Drop transitions removed 346 transitions
Trivial Post-agglo rules discarded 346 transitions
Performed 346 trivial Post agglomeration. Transition count delta: 346
Iterating post reduction 0 with 346 rules applied. Total rules applied 347 place count 1548 transition count 1423
Reduce places removed 346 places and 0 transitions.
Ensure Unique test removed 45 transitions
Reduce isomorphic transitions removed 45 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 1 with 406 rules applied. Total rules applied 753 place count 1202 transition count 1363
Reduce places removed 15 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: 58
Iterating post reduction 2 with 74 rules applied. Total rules applied 827 place count 1187 transition count 1304
Reduce places removed 58 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 3 with 64 rules applied. Total rules applied 891 place count 1129 transition count 1298
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 893 place count 1127 transition count 1298
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 11 Pre rules applied. Total rules applied 893 place count 1127 transition count 1287
Deduced a syphon composed of 11 places in 7 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 5 with 22 rules applied. Total rules applied 915 place count 1116 transition count 1287
Discarding 300 places :
Symmetric choice reduction at 5 with 300 rule applications. Total rules 1215 place count 816 transition count 987
Iterating global reduction 5 with 300 rules applied. Total rules applied 1515 place count 816 transition count 987
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 1519 place count 816 transition count 983
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 43 Pre rules applied. Total rules applied 1519 place count 816 transition count 940
Deduced a syphon composed of 43 places in 7 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 6 with 86 rules applied. Total rules applied 1605 place count 773 transition count 940
Discarding 45 places :
Symmetric choice reduction at 6 with 45 rule applications. Total rules 1650 place count 728 transition count 870
Iterating global reduction 6 with 45 rules applied. Total rules applied 1695 place count 728 transition count 870
Performed 182 Post agglomeration using F-continuation condition.Transition count delta: 182
Deduced a syphon composed of 182 places in 1 ms
Reduce places removed 182 places and 0 transitions.
Iterating global reduction 6 with 364 rules applied. Total rules applied 2059 place count 546 transition count 688
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 2065 place count 546 transition count 682
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2066 place count 545 transition count 680
Iterating global reduction 7 with 1 rules applied. Total rules applied 2067 place count 545 transition count 680
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -103
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 7 with 36 rules applied. Total rules applied 2103 place count 527 transition count 783
Drop transitions removed 1 transitions
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 7 with 10 rules applied. Total rules applied 2113 place count 527 transition count 773
Drop transitions removed 31 transitions
Redundant transition composition rules discarded 31 transitions
Iterating global reduction 8 with 31 rules applied. Total rules applied 2144 place count 527 transition count 742
Free-agglomeration rule applied 152 times.
Iterating global reduction 8 with 152 rules applied. Total rules applied 2296 place count 527 transition count 590
Reduce places removed 152 places and 0 transitions.
Drop transitions removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Graph (complete) has 1037 edges and 375 vertex of which 368 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.3 ms
Discarding 7 places :
Also discarding 0 output transitions
Iterating post reduction 8 with 175 rules applied. Total rules applied 2471 place count 368 transition count 568
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 9 with 5 rules applied. Total rules applied 2476 place count 368 transition count 563
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 10 with 10 rules applied. Total rules applied 2486 place count 368 transition count 553
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 2487 place count 367 transition count 553
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 11 with 8 rules applied. Total rules applied 2495 place count 367 transition count 553
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 2496 place count 366 transition count 552
Applied a total of 2496 rules in 737 ms. Remains 366 /2328 variables (removed 1962) and now considering 552/2701 (removed 2149) transitions.
Finished structural reductions, in 1 iterations. Remains : 366/2328 places, 552/2701 transitions.
[2022-06-12 21:31:34] [INFO ] Flatten gal took : 135 ms
[2022-06-12 21:31:34] [INFO ] Flatten gal took : 67 ms
[2022-06-12 21:31:34] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9278610909625697190.gal : 27 ms
[2022-06-12 21:31:34] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13174564143706901881.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/ReachabilityCardinality9278610909625697190.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality13174564143706901881.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/ReachabilityCardinality9278610909625697190.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality13174564143706901881.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality13174564143706901881.prop.
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 23
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :23 after 24
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :24 after 36
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :36 after 155
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :155 after 51881
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :51881 after 1.4661e+07
SDD proceeding with computation,5 properties remain. new max is 256
SDD size :1.4661e+07 after 2.17729e+09
Detected timeout of ITS tools.
[2022-06-12 21:31:50] [INFO ] Flatten gal took : 56 ms
[2022-06-12 21:31:50] [INFO ] Applying decomposition
[2022-06-12 21:31:50] [INFO ] Flatten gal took : 55 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/graph4051946933438497970.txt, -o, /tmp/graph4051946933438497970.bin, -w, /tmp/graph4051946933438497970.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/graph4051946933438497970.bin, -l, -1, -v, -w, /tmp/graph4051946933438497970.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-12 21:31:50] [INFO ] Decomposing Gal with order
[2022-06-12 21:31:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-12 21:31:50] [INFO ] Removed a total of 653 redundant transitions.
[2022-06-12 21:31:50] [INFO ] Flatten gal took : 139 ms
[2022-06-12 21:31:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 158 labels/synchronizations in 60 ms.
[2022-06-12 21:31:50] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1428267445712120339.gal : 17 ms
[2022-06-12 21:31:50] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4601557889356160752.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/ReachabilityCardinality1428267445712120339.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality4601557889356160752.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/ReachabilityCardinality1428267445712120339.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality4601557889356160752.prop --nowitness
Loading property file /tmp/ReachabilityCardinality4601557889356160752.prop.
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :1 after 36
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :10224 after 71280
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :71280 after 5.06992e+10
Invariant property NoC3x3-PT-4B-ReachabilityCardinality-13 does not hold.
FORMULA NoC3x3-PT-4B-ReachabilityCardinality-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :5.06992e+10 after 3.15502e+14
Invariant property NoC3x3-PT-4B-ReachabilityCardinality-05 does not hold.
FORMULA NoC3x3-PT-4B-ReachabilityCardinality-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :3.15502e+14 after 3.78973e+25
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :3.78973e+25 after 4.3216e+25
Invariant property NoC3x3-PT-4B-ReachabilityCardinality-10 does not hold.
FORMULA NoC3x3-PT-4B-ReachabilityCardinality-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Reachability property NoC3x3-PT-4B-ReachabilityCardinality-03 is true.
FORMULA NoC3x3-PT-4B-ReachabilityCardinality-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :4.3216e+25 after 4.09188e+38
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.46498e+40,1.83756,42752,468,358,64546,10610,1281,188856,362,26761,0
Total reachable state count : 2.464976822299310505915573551193353774694e+40

Verifying 5 reachability properties.
Reachability property NoC3x3-PT-4B-ReachabilityCardinality-03 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
NoC3x3-PT-4B-ReachabilityCardinality-03,2.45069e+36,1.84196,42752,337,326,64546,10610,1285,188856,365,26761,0
Invariant property NoC3x3-PT-4B-ReachabilityCardinality-05 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
NoC3x3-PT-4B-ReachabilityCardinality-05,9.01035e+38,1.8518,42752,479,346,64546,10610,1380,188856,384,26761,666
Invariant property NoC3x3-PT-4B-ReachabilityCardinality-10 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
NoC3x3-PT-4B-ReachabilityCardinality-10,9.7399e+38,1.85875,42752,617,374,64546,10610,1437,188856,388,26761,1013
Invariant property NoC3x3-PT-4B-ReachabilityCardinality-13 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
NoC3x3-PT-4B-ReachabilityCardinality-13,3.24964e+37,1.87473,42752,550,353,64546,10610,1608,188856,398,26761,2380
Invariant property NoC3x3-PT-4B-ReachabilityCardinality-14 does not hold.
FORMULA NoC3x3-PT-4B-ReachabilityCardinality-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
NoC3x3-PT-4B-ReachabilityCardinality-14,2.88224e+37,1.89044,42752,744,479,64546,10610,1664,188856,401,26761,3219
All properties solved without resorting to model-checking.

BK_STOP 1655069513580

--------------------
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="NoC3x3-PT-4B"
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 NoC3x3-PT-4B, 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 r161-smll-165277002700065"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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