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

About the Execution of 2021-gold for NoC3x3-PT-2B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
625.355 80075.00 108168.00 786.80 TFTTFTFTFFTFTFFT 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-165277002700054.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-2B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r161-smll-165277002700054
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 932K
-rw-r--r-- 1 mcc users 7.6K Apr 29 13:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K Apr 29 13:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Apr 29 13:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 29 13:03 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.4K May 9 08:21 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 9 08:21 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 08:21 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 9 08:21 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.2K Apr 29 13:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 70K Apr 29 13:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Apr 29 13:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 47K Apr 29 13:04 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 548K 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-2B-ReachabilityFireability-00
FORMULA_NAME NoC3x3-PT-2B-ReachabilityFireability-01
FORMULA_NAME NoC3x3-PT-2B-ReachabilityFireability-02
FORMULA_NAME NoC3x3-PT-2B-ReachabilityFireability-03
FORMULA_NAME NoC3x3-PT-2B-ReachabilityFireability-04
FORMULA_NAME NoC3x3-PT-2B-ReachabilityFireability-05
FORMULA_NAME NoC3x3-PT-2B-ReachabilityFireability-06
FORMULA_NAME NoC3x3-PT-2B-ReachabilityFireability-07
FORMULA_NAME NoC3x3-PT-2B-ReachabilityFireability-08
FORMULA_NAME NoC3x3-PT-2B-ReachabilityFireability-09
FORMULA_NAME NoC3x3-PT-2B-ReachabilityFireability-10
FORMULA_NAME NoC3x3-PT-2B-ReachabilityFireability-11
FORMULA_NAME NoC3x3-PT-2B-ReachabilityFireability-12
FORMULA_NAME NoC3x3-PT-2B-ReachabilityFireability-13
FORMULA_NAME NoC3x3-PT-2B-ReachabilityFireability-14
FORMULA_NAME NoC3x3-PT-2B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1655068898192

Running Version 0
[2022-06-12 21:21:40] [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 21:21:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-12 21:21:41] [INFO ] Load time of PNML (sax parser for PT used): 280 ms
[2022-06-12 21:21:41] [INFO ] Transformed 2003 places.
[2022-06-12 21:21:41] [INFO ] Transformed 2292 transitions.
[2022-06-12 21:21:41] [INFO ] Found NUPN structural information;
[2022-06-12 21:21:41] [INFO ] Parsed PT model containing 2003 places and 2292 transitions in 388 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 18 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 16 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 16) seen :10
FORMULA NoC3x3-PT-2B-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-2B-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-2B-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-2B-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-2B-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-2B-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-2B-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-2B-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-2B-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-2B-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 6) seen :1
FORMULA NoC3x3-PT-2B-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 5) 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 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 2292 rows 2003 cols
[2022-06-12 21:21:41] [INFO ] Computed 66 place invariants in 59 ms
[2022-06-12 21:21:42] [INFO ] [Real]Absence check using 66 positive place invariants in 97 ms returned sat
[2022-06-12 21:21:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:21:44] [INFO ] [Real]Absence check using state equation in 1887 ms returned sat
[2022-06-12 21:21:44] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:21:45] [INFO ] [Nat]Absence check using 66 positive place invariants in 152 ms returned sat
[2022-06-12 21:21:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:21:47] [INFO ] [Nat]Absence check using state equation in 2049 ms returned sat
[2022-06-12 21:21:48] [INFO ] Deduced a trap composed of 32 places in 808 ms of which 8 ms to minimize.
[2022-06-12 21:21:49] [INFO ] Deduced a trap composed of 70 places in 571 ms of which 3 ms to minimize.
[2022-06-12 21:21:49] [INFO ] Deduced a trap composed of 105 places in 407 ms of which 3 ms to minimize.
[2022-06-12 21:21:51] [INFO ] Deduced a trap composed of 7 places in 1726 ms of which 4 ms to minimize.
[2022-06-12 21:21: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 0
[2022-06-12 21:21:52] [INFO ] [Real]Absence check using 66 positive place invariants in 87 ms returned sat
[2022-06-12 21:21:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:21:53] [INFO ] [Real]Absence check using state equation in 1332 ms returned sat
[2022-06-12 21:21:54] [INFO ] Deduced a trap composed of 80 places in 668 ms of which 2 ms to minimize.
[2022-06-12 21:21:55] [INFO ] Deduced a trap composed of 56 places in 539 ms of which 2 ms to minimize.
[2022-06-12 21:21:55] [INFO ] Deduced a trap composed of 129 places in 602 ms of which 2 ms to minimize.
[2022-06-12 21:21:56] [INFO ] Deduced a trap composed of 92 places in 566 ms of which 1 ms to minimize.
[2022-06-12 21:21:58] [INFO ] Deduced a trap composed of 7 places in 1887 ms of which 6 ms to minimize.
[2022-06-12 21:21: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 21:21:59] [INFO ] [Real]Absence check using 66 positive place invariants in 112 ms returned sat
[2022-06-12 21:21:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:22:00] [INFO ] [Real]Absence check using state equation in 1081 ms returned sat
[2022-06-12 21:22:00] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:22:00] [INFO ] [Nat]Absence check using 66 positive place invariants in 134 ms returned sat
[2022-06-12 21:22:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:22:02] [INFO ] [Nat]Absence check using state equation in 1387 ms returned sat
[2022-06-12 21:22:03] [INFO ] Deduced a trap composed of 28 places in 797 ms of which 2 ms to minimize.
[2022-06-12 21:22:04] [INFO ] Deduced a trap composed of 115 places in 681 ms of which 2 ms to minimize.
[2022-06-12 21:22:04] [INFO ] Deduced a trap composed of 195 places in 508 ms of which 1 ms to minimize.
[2022-06-12 21:22:05] [INFO ] Deduced a trap composed of 82 places in 761 ms of which 2 ms to minimize.
[2022-06-12 21:22: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 21:22:06] [INFO ] [Real]Absence check using 66 positive place invariants in 107 ms returned sat
[2022-06-12 21:22:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:22:08] [INFO ] [Real]Absence check using state equation in 2492 ms returned sat
[2022-06-12 21:22:08] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:22:09] [INFO ] [Nat]Absence check using 66 positive place invariants in 111 ms returned sat
[2022-06-12 21:22:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:22:11] [INFO ] [Nat]Absence check using state equation in 2398 ms returned sat
[2022-06-12 21:22:12] [INFO ] Deduced a trap composed of 25 places in 520 ms of which 1 ms to minimize.
[2022-06-12 21:22:13] [INFO ] Deduced a trap composed of 93 places in 625 ms of which 1 ms to minimize.
[2022-06-12 21:22:13] [INFO ] Deduced a trap composed of 64 places in 528 ms of which 1 ms to minimize.
0Int
^^^^
(error "Invalid token: 0Int")
[2022-06-12 21:22:15] [INFO ] Deduced a trap composed of 7 places in 1704 ms of which 19 ms to minimize.
[2022-06-12 21:22:15] [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:22:16] [INFO ] [Real]Absence check using 66 positive place invariants in 95 ms returned sat
[2022-06-12 21:22:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:22:17] [INFO ] [Real]Absence check using state equation in 1328 ms returned sat
[2022-06-12 21:22:18] [INFO ] Deduced a trap composed of 43 places in 916 ms of which 1 ms to minimize.
[2022-06-12 21:22:19] [INFO ] Deduced a trap composed of 28 places in 594 ms of which 1 ms to minimize.
[2022-06-12 21:22:20] [INFO ] Deduced a trap composed of 88 places in 736 ms of which 1 ms to minimize.
[2022-06-12 21:22:20] [INFO ] Deduced a trap composed of 62 places in 611 ms of which 1 ms to minimize.
[2022-06-12 21:22:20] [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 4
Fused 5 Parikh solutions to 1 different solutions.
Support contains 55 out of 2003 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2003/2003 places, 2292/2292 transitions.
Graph (trivial) has 1508 edges and 2003 vertex of which 48 / 2003 are part of one of the 6 SCC in 19 ms
Free SCC test removed 42 places
Drop transitions removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Discarding 9 places :
Implicit places reduction removed 9 places
Drop transitions removed 364 transitions
Trivial Post-agglo rules discarded 364 transitions
Performed 364 trivial Post agglomeration. Transition count delta: 364
Iterating post reduction 0 with 373 rules applied. Total rules applied 374 place count 1952 transition count 1880
Reduce places removed 364 places and 0 transitions.
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Iterating post reduction 1 with 400 rules applied. Total rules applied 774 place count 1588 transition count 1844
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 2 with 36 rules applied. Total rules applied 810 place count 1552 transition count 1844
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 22 Pre rules applied. Total rules applied 810 place count 1552 transition count 1822
Deduced a syphon composed of 22 places in 12 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 854 place count 1530 transition count 1822
Discarding 346 places :
Symmetric choice reduction at 3 with 346 rule applications. Total rules 1200 place count 1184 transition count 1476
Iterating global reduction 3 with 346 rules applied. Total rules applied 1546 place count 1184 transition count 1476
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 33 Pre rules applied. Total rules applied 1546 place count 1184 transition count 1443
Deduced a syphon composed of 33 places in 25 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 1612 place count 1151 transition count 1443
Discarding 123 places :
Symmetric choice reduction at 3 with 123 rule applications. Total rules 1735 place count 1028 transition count 1291
Iterating global reduction 3 with 123 rules applied. Total rules applied 1858 place count 1028 transition count 1291
Discarding 114 places :
Symmetric choice reduction at 3 with 114 rule applications. Total rules 1972 place count 914 transition count 1165
Iterating global reduction 3 with 114 rules applied. Total rules applied 2086 place count 914 transition count 1165
Discarding 36 places :
Symmetric choice reduction at 3 with 36 rule applications. Total rules 2122 place count 878 transition count 1102
Iterating global reduction 3 with 36 rules applied. Total rules applied 2158 place count 878 transition count 1102
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 13 rules applied. Total rules applied 2171 place count 877 transition count 1090
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2172 place count 876 transition count 1090
Discarding 24 places :
Symmetric choice reduction at 5 with 24 rule applications. Total rules 2196 place count 852 transition count 1066
Iterating global reduction 5 with 24 rules applied. Total rules applied 2220 place count 852 transition count 1066
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 2 rules applied. Total rules applied 2222 place count 851 transition count 1065
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 2223 place count 850 transition count 1065
Discarding 12 places :
Symmetric choice reduction at 7 with 12 rule applications. Total rules 2235 place count 838 transition count 1041
Iterating global reduction 7 with 12 rules applied. Total rules applied 2247 place count 838 transition count 1041
Discarding 12 places :
Symmetric choice reduction at 7 with 12 rule applications. Total rules 2259 place count 826 transition count 1029
Iterating global reduction 7 with 12 rules applied. Total rules applied 2271 place count 826 transition count 1029
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 14 rules applied. Total rules applied 2285 place count 825 transition count 1016
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 2286 place count 824 transition count 1016
Performed 294 Post agglomeration using F-continuation condition.Transition count delta: 294
Deduced a syphon composed of 294 places in 0 ms
Reduce places removed 294 places and 0 transitions.
Iterating global reduction 9 with 588 rules applied. Total rules applied 2874 place count 530 transition count 722
Discarding 13 places :
Symmetric choice reduction at 9 with 13 rule applications. Total rules 2887 place count 517 transition count 706
Iterating global reduction 9 with 13 rules applied. Total rules applied 2900 place count 517 transition count 706
Discarding 7 places :
Symmetric choice reduction at 9 with 7 rule applications. Total rules 2907 place count 510 transition count 692
Iterating global reduction 9 with 7 rules applied. Total rules applied 2914 place count 510 transition count 692
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 2915 place count 509 transition count 690
Iterating global reduction 9 with 1 rules applied. Total rules applied 2916 place count 509 transition count 690
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 2918 place count 508 transition count 689
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: -34
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 9 with 40 rules applied. Total rules applied 2958 place count 488 transition count 723
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 2959 place count 487 transition count 721
Iterating global reduction 9 with 1 rules applied. Total rules applied 2960 place count 487 transition count 721
Free-agglomeration rule applied 23 times.
Iterating global reduction 9 with 23 rules applied. Total rules applied 2983 place count 487 transition count 698
Reduce places removed 23 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 9 with 27 rules applied. Total rules applied 3010 place count 464 transition count 694
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 10 with 4 rules applied. Total rules applied 3014 place count 464 transition count 690
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 10 with 1 rules applied. Total rules applied 3015 place count 464 transition count 689
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 3016 place count 463 transition count 689
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 11 with 10 rules applied. Total rules applied 3026 place count 463 transition count 689
Partial Post-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 11 with 7 rules applied. Total rules applied 3033 place count 463 transition count 689
Applied a total of 3033 rules in 1545 ms. Remains 463 /2003 variables (removed 1540) and now considering 689/2292 (removed 1603) transitions.
Finished structural reductions, in 1 iterations. Remains : 463/2003 places, 689/2292 transitions.
[2022-06-12 21:22:23] [INFO ] Flatten gal took : 226 ms
[2022-06-12 21:22:23] [INFO ] Flatten gal took : 122 ms
[2022-06-12 21:22:23] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15750794849743745488.gal : 27 ms
[2022-06-12 21:22:23] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8583289600219547080.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/ReachabilityCardinality15750794849743745488.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality8583289600219547080.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/ReachabilityCardinality15750794849743745488.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality8583289600219547080.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality8583289600219547080.prop.
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :7 after 19
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :19 after 63
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :63 after 83
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :83 after 175
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :175 after 329
SDD proceeding with computation,5 properties remain. new max is 256
SDD size :329 after 15433
SDD proceeding with computation,5 properties remain. new max is 512
SDD size :15433 after 127005
Reachability property NoC3x3-PT-2B-ReachabilityFireability-05 is true.
FORMULA NoC3x3-PT-2B-ReachabilityFireability-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :127005 after 2.98576e+07
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :2.98576e+07 after 1.07753e+08
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :1.07753e+08 after 5.43555e+09
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :5.43555e+09 after 7.10865e+09
SDD proceeding with computation,4 properties remain. new max is 8192
SDD size :7.10865e+09 after 1.94793e+10
SDD proceeding with computation,4 properties remain. new max is 16384
SDD size :1.94793e+10 after 1.91825e+11
SDD proceeding with computation,4 properties remain. new max is 32768
SDD size :1.91825e+11 after 1.15677e+13
Detected timeout of ITS tools.
[2022-06-12 21:22:38] [INFO ] Flatten gal took : 77 ms
[2022-06-12 21:22:38] [INFO ] Applying decomposition
[2022-06-12 21:22:38] [INFO ] Flatten gal took : 56 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/graph14492941081730380335.txt, -o, /tmp/graph14492941081730380335.bin, -w, /tmp/graph14492941081730380335.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/graph14492941081730380335.bin, -l, -1, -v, -w, /tmp/graph14492941081730380335.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-12 21:22:38] [INFO ] Decomposing Gal with order
[2022-06-12 21:22:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-12 21:22:38] [INFO ] Removed a total of 410 redundant transitions.
[2022-06-12 21:22:39] [INFO ] Flatten gal took : 267 ms
[2022-06-12 21:22:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 364 labels/synchronizations in 53 ms.
[2022-06-12 21:22:39] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11567176188390111958.gal : 37 ms
[2022-06-12 21:22:39] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7802996874862701417.prop : 21 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/ReachabilityCardinality11567176188390111958.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality7802996874862701417.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/ReachabilityCardinality11567176188390111958.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality7802996874862701417.prop --nowitness
Loading property file /tmp/ReachabilityCardinality7802996874862701417.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :1 after 43
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :43 after 8779
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :8779 after 191017
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :191017 after 1.5673e+11
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :1.5673e+11 after 6.27245e+12
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :6.27245e+12 after 3.60553e+13
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :3.60553e+13 after 2.37542e+14
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :2.37542e+14 after 6.38317e+22
SDD proceeding with computation,4 properties remain. new max is 8192
SDD size :6.38317e+22 after 8.84484e+23
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4479896482408538992
[2022-06-12 21:22:54] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4479896482408538992
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin4479896482408538992]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin4479896482408538992] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin4479896482408538992] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Finished random walk after 386825 steps, including 3462 resets, run visited all 4 properties in 1687 ms. (steps per millisecond=229 )
FORMULA NoC3x3-PT-2B-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-2B-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-2B-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-2B-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.

BK_STOP 1655068978267

--------------------
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="NoC3x3-PT-2B"
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 NoC3x3-PT-2B, 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-165277002700054"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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