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.r305-smll-165463878500128.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 StigmergyElection-PT-07b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r305-smll-165463878500128
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.9M
-rw-r--r-- 1 mcc users 7.4K May 30 14:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K May 30 14:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 30 14:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K May 30 14:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 25 13:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 25 13:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 25 13:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 25 13:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 29 12:20 NewModel
-rw-r--r-- 1 mcc users 14K May 30 14:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 149K May 30 14:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 30 14:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 42K May 30 14:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 25 13:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 25 13:04 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 12:20 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 12:20 instance
-rw-r--r-- 1 mcc users 6 May 29 12:20 iscolored
-rw-r--r-- 1 mcc users 3.4M May 29 12:20 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 StigmergyElection-PT-07b-ReachabilityCardinality-00
FORMULA_NAME StigmergyElection-PT-07b-ReachabilityCardinality-01
FORMULA_NAME StigmergyElection-PT-07b-ReachabilityCardinality-02
FORMULA_NAME StigmergyElection-PT-07b-ReachabilityCardinality-03
FORMULA_NAME StigmergyElection-PT-07b-ReachabilityCardinality-04
FORMULA_NAME StigmergyElection-PT-07b-ReachabilityCardinality-05
FORMULA_NAME StigmergyElection-PT-07b-ReachabilityCardinality-06
FORMULA_NAME StigmergyElection-PT-07b-ReachabilityCardinality-07
FORMULA_NAME StigmergyElection-PT-07b-ReachabilityCardinality-08
FORMULA_NAME StigmergyElection-PT-07b-ReachabilityCardinality-09
FORMULA_NAME StigmergyElection-PT-07b-ReachabilityCardinality-10
FORMULA_NAME StigmergyElection-PT-07b-ReachabilityCardinality-11
FORMULA_NAME StigmergyElection-PT-07b-ReachabilityCardinality-12
FORMULA_NAME StigmergyElection-PT-07b-ReachabilityCardinality-13
FORMULA_NAME StigmergyElection-PT-07b-ReachabilityCardinality-14
FORMULA_NAME StigmergyElection-PT-07b-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1654731824984

Running Version 0
[2022-06-08 23:43:47] [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-08 23:43:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-08 23:43:48] [INFO ] Load time of PNML (sax parser for PT used): 803 ms
[2022-06-08 23:43:48] [INFO ] Transformed 971 places.
[2022-06-08 23:43:48] [INFO ] Transformed 5542 transitions.
[2022-06-08 23:43:48] [INFO ] Found NUPN structural information;
[2022-06-08 23:43:48] [INFO ] Parsed PT model containing 971 places and 5542 transitions in 942 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 32 ms.
Working with output stream class java.io.PrintStream
FORMULA StigmergyElection-PT-07b-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-07b-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 82 resets, run finished after 148 ms. (steps per millisecond=67 ) properties (out of 14) seen :2
FORMULA StigmergyElection-PT-07b-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-07b-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 11 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
// Phase 1: matrix 5542 rows 971 cols
[2022-06-08 23:43:49] [INFO ] Computed 8 place invariants in 281 ms
[2022-06-08 23:43:50] [INFO ] [Real]Absence check using 8 positive place invariants in 32 ms returned sat
[2022-06-08 23:43:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 23:43:53] [INFO ] [Real]Absence check using state equation in 2889 ms returned sat
[2022-06-08 23:43:53] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 23:43:53] [INFO ] [Nat]Absence check using 8 positive place invariants in 48 ms returned sat
[2022-06-08 23:43:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 23:43:56] [INFO ] [Nat]Absence check using state equation in 2698 ms returned sat
[2022-06-08 23:44:01] [INFO ] Deduced a trap composed of 191 places in 4334 ms of which 7 ms to minimize.
[2022-06-08 23:44:01] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
[2022-06-08 23:44:01] [INFO ] [Real]Absence check using 8 positive place invariants in 33 ms returned sat
[2022-06-08 23:44:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 23:44:03] [INFO ] [Real]Absence check using state equation in 2309 ms returned sat
[2022-06-08 23:44:04] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 23:44:04] [INFO ] [Nat]Absence check using 8 positive place invariants in 43 ms returned sat
[2022-06-08 23:44:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 23:44:06] [INFO ] [Nat]Absence check using state equation in 2294 ms returned sat
[2022-06-08 23:44:09] [INFO ] Deduced a trap composed of 241 places in 2925 ms of which 2 ms to minimize.
[2022-06-08 23:44:09] [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-08 23:44:10] [INFO ] [Real]Absence check using 8 positive place invariants in 41 ms returned sat
[2022-06-08 23:44:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 23:44:12] [INFO ] [Real]Absence check using state equation in 2618 ms returned sat
[2022-06-08 23:44:12] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 23:44:13] [INFO ] [Real]Absence check using 8 positive place invariants in 43 ms returned sat
[2022-06-08 23:44:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 23:44:15] [INFO ] [Real]Absence check using state equation in 2497 ms returned sat
[2022-06-08 23:44:16] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 23:44:16] [INFO ] [Nat]Absence check using 8 positive place invariants in 27 ms returned sat
[2022-06-08 23:44:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 23:44:18] [INFO ] [Nat]Absence check using state equation in 2452 ms returned sat
[2022-06-08 23:44:22] [INFO ] Deduced a trap composed of 241 places in 3791 ms of which 3 ms to minimize.
[2022-06-08 23:44:22] [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-08 23:44:22] [INFO ] [Real]Absence check using 8 positive place invariants in 25 ms returned sat
[2022-06-08 23:44:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 23:44:25] [INFO ] [Real]Absence check using state equation in 2571 ms returned sat
[2022-06-08 23:44:29] [INFO ] Deduced a trap composed of 160 places in 3416 ms of which 3 ms to minimize.
[2022-06-08 23:44:29] [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
[2022-06-08 23:44:29] [INFO ] [Real]Absence check using 8 positive place invariants in 44 ms returned sat
[2022-06-08 23:44:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 23:44:32] [INFO ] [Real]Absence check using state equation in 3405 ms returned sat
[2022-06-08 23:44:36] [INFO ] Deduced a trap composed of 196 places in 3063 ms of which 2 ms to minimize.
[2022-06-08 23:44:36] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 5
[2022-06-08 23:44:36] [INFO ] [Real]Absence check using 8 positive place invariants in 25 ms returned sat
[2022-06-08 23:44:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 23:44:39] [INFO ] [Real]Absence check using state equation in 2389 ms returned sat
[2022-06-08 23:44:39] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 23:44:39] [INFO ] [Real]Absence check using 8 positive place invariants in 42 ms returned sat
[2022-06-08 23:44:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 23:44:42] [INFO ] [Real]Absence check using state equation in 2758 ms returned sat
[2022-06-08 23:44:42] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 23:44:42] [INFO ] [Nat]Absence check using 8 positive place invariants in 35 ms returned sat
[2022-06-08 23:44:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 23:44:45] [INFO ] [Nat]Absence check using state equation in 2655 ms returned sat
[2022-06-08 23:44:48] [INFO ] Deduced a trap composed of 191 places in 2999 ms of which 2 ms to minimize.
[2022-06-08 23:44:48] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 7
[2022-06-08 23:44:48] [INFO ] [Real]Absence check using 8 positive place invariants in 39 ms returned sat
[2022-06-08 23:44:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 23:44:51] [INFO ] [Real]Absence check using state equation in 2432 ms returned sat
[2022-06-08 23:44:55] [INFO ] Deduced a trap composed of 191 places in 3918 ms of which 1 ms to minimize.
[2022-06-08 23:44:55] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 8
[2022-06-08 23:44:55] [INFO ] [Real]Absence check using 8 positive place invariants in 35 ms returned sat
[2022-06-08 23:44:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 23:44:58] [INFO ] [Real]Absence check using state equation in 2337 ms returned sat
[2022-06-08 23:44:58] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 23:44:58] [INFO ] [Nat]Absence check using 8 positive place invariants in 43 ms returned sat
[2022-06-08 23:44:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 23:45:00] [INFO ] [Nat]Absence check using state equation in 2319 ms returned sat
[2022-06-08 23:45:04] [INFO ] Deduced a trap composed of 189 places in 3744 ms of which 23 ms to minimize.
[2022-06-08 23:45:04] [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 9
[2022-06-08 23:45:05] [INFO ] [Real]Absence check using 8 positive place invariants in 27 ms returned sat
[2022-06-08 23:45:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 23:45:07] [INFO ] [Real]Absence check using state equation in 2178 ms returned sat
[2022-06-08 23:45:07] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 23:45:07] [INFO ] [Nat]Absence check using 8 positive place invariants in 25 ms returned sat
[2022-06-08 23:45:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 23:45:09] [INFO ] [Nat]Absence check using state equation in 2087 ms returned sat
[2022-06-08 23:45:13] [INFO ] Deduced a trap composed of 194 places in 3282 ms of which 1 ms to minimize.
[2022-06-08 23:45:13] [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 10
[2022-06-08 23:45:13] [INFO ] [Real]Absence check using 8 positive place invariants in 28 ms returned sat
[2022-06-08 23:45:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 23:45:15] [INFO ] [Real]Absence check using state equation in 2195 ms returned sat
[2022-06-08 23:45:19] [INFO ] Deduced a trap composed of 189 places in 3342 ms of which 2 ms to minimize.
[2022-06-08 23:45:19] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 11
FORMULA StigmergyElection-PT-07b-ReachabilityCardinality-07 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyElection-PT-07b-ReachabilityCardinality-02 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 12 Parikh solutions to 1 different solutions.
Support contains 156 out of 971 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 971/971 places, 5542/5542 transitions.
Graph (trivial) has 714 edges and 971 vertex of which 30 / 971 are part of one of the 7 SCC in 16 ms
Free SCC test removed 23 places
Drop transitions removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Graph (complete) has 2069 edges and 948 vertex of which 938 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.85 ms
Discarding 10 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 404 transitions
Trivial Post-agglo rules discarded 404 transitions
Performed 404 trivial Post agglomeration. Transition count delta: 404
Iterating post reduction 0 with 409 rules applied. Total rules applied 411 place count 938 transition count 5097
Reduce places removed 404 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 414 rules applied. Total rules applied 825 place count 534 transition count 5087
Reduce places removed 5 places and 0 transitions.
Performed 81 Post agglomeration using F-continuation condition.Transition count delta: 81
Iterating post reduction 2 with 86 rules applied. Total rules applied 911 place count 529 transition count 5006
Reduce places removed 81 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 83 rules applied. Total rules applied 994 place count 448 transition count 5004
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 995 place count 447 transition count 5004
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 25 Pre rules applied. Total rules applied 995 place count 447 transition count 4979
Deduced a syphon composed of 25 places in 6 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 5 with 50 rules applied. Total rules applied 1045 place count 422 transition count 4979
Discarding 41 places :
Symmetric choice reduction at 5 with 41 rule applications. Total rules 1086 place count 381 transition count 4938
Iterating global reduction 5 with 41 rules applied. Total rules applied 1127 place count 381 transition count 4938
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
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 3 rules applied. Total rules applied 1130 place count 381 transition count 4935
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1131 place count 380 transition count 4935
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 1131 place count 380 transition count 4934
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1133 place count 379 transition count 4934
Discarding 9 places :
Symmetric choice reduction at 7 with 9 rule applications. Total rules 1142 place count 370 transition count 1410
Iterating global reduction 7 with 9 rules applied. Total rules applied 1151 place count 370 transition count 1410
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1152 place count 370 transition count 1409
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Deduced a syphon composed of 34 places in 2 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 8 with 68 rules applied. Total rules applied 1220 place count 336 transition count 1375
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1221 place count 335 transition count 1374
Iterating global reduction 8 with 1 rules applied. Total rules applied 1222 place count 335 transition count 1374
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 8 with 10 rules applied. Total rules applied 1232 place count 330 transition count 1375
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1233 place count 330 transition count 1374
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 9 with 8 rules applied. Total rules applied 1241 place count 330 transition count 1366
Free-agglomeration rule applied 43 times.
Iterating global reduction 9 with 43 rules applied. Total rules applied 1284 place count 330 transition count 1323
Reduce places removed 43 places and 0 transitions.
Iterating post reduction 9 with 43 rules applied. Total rules applied 1327 place count 287 transition count 1323
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 10 with 5 rules applied. Total rules applied 1332 place count 287 transition count 1318
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 1334 place count 287 transition count 1318
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 1336 place count 287 transition count 1318
Applied a total of 1336 rules in 2495 ms. Remains 287 /971 variables (removed 684) and now considering 1318/5542 (removed 4224) transitions.
Finished structural reductions, in 1 iterations. Remains : 287/971 places, 1318/5542 transitions.
[2022-06-08 23:45:22] [INFO ] Flatten gal took : 591 ms
[2022-06-08 23:45:22] [INFO ] Flatten gal took : 169 ms
[2022-06-08 23:45:22] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3408013120268185812.gal : 73 ms
[2022-06-08 23:45:22] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9343605201377197620.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/ReachabilityCardinality3408013120268185812.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality9343605201377197620.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/ReachabilityCardinality3408013120268185812.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality9343605201377197620.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality9343605201377197620.prop.
SDD proceeding with computation,10 properties remain. new max is 4
SDD size :1 after 6
SDD proceeding with computation,10 properties remain. new max is 8
SDD size :6 after 9
SDD proceeding with computation,10 properties remain. new max is 16
SDD size :9 after 10
SDD proceeding with computation,10 properties remain. new max is 32
SDD size :10 after 38
SDD proceeding with computation,10 properties remain. new max is 64
SDD size :38 after 163
SDD proceeding with computation,10 properties remain. new max is 128
SDD size :163 after 229
SDD proceeding with computation,10 properties remain. new max is 256
SDD size :229 after 2114
SDD proceeding with computation,10 properties remain. new max is 512
SDD size :2114 after 8978
SDD proceeding with computation,10 properties remain. new max is 1024
SDD size :8978 after 419666
Detected timeout of ITS tools.
[2022-06-08 23:45:38] [INFO ] Flatten gal took : 177 ms
[2022-06-08 23:45:38] [INFO ] Applying decomposition
[2022-06-08 23:45:38] [INFO ] Flatten gal took : 232 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/graph1339621261429391136.txt, -o, /tmp/graph1339621261429391136.bin, -w, /tmp/graph1339621261429391136.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/graph1339621261429391136.bin, -l, -1, -v, -w, /tmp/graph1339621261429391136.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-08 23:45:39] [INFO ] Decomposing Gal with order
[2022-06-08 23:45:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-08 23:45:39] [INFO ] Removed a total of 1362 redundant transitions.
[2022-06-08 23:45:39] [INFO ] Flatten gal took : 661 ms
[2022-06-08 23:45:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 1705 labels/synchronizations in 154 ms.
[2022-06-08 23:45:40] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6000207540242272077.gal : 30 ms
[2022-06-08 23:45:40] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4508634556098159869.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/ReachabilityCardinality6000207540242272077.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality4508634556098159869.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/ReachabilityCardinality6000207540242272077.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality4508634556098159869.prop --nowitness
Loading property file /tmp/ReachabilityCardinality4508634556098159869.prop.
SDD proceeding with computation,10 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,10 properties remain. new max is 8
SDD size :1 after 6
SDD proceeding with computation,10 properties remain. new max is 16
SDD size :6 after 6
SDD proceeding with computation,10 properties remain. new max is 32
SDD size :6 after 6
SDD proceeding with computation,10 properties remain. new max is 64
SDD size :6 after 6
SDD proceeding with computation,10 properties remain. new max is 128
SDD size :6 after 7514
SDD proceeding with computation,10 properties remain. new max is 256
SDD size :7514 after 11690
SDD proceeding with computation,10 properties remain. new max is 512
SDD size :11690 after 473670
SDD proceeding with computation,10 properties remain. new max is 1024
SDD size :473670 after 3.48261e+07
SDD proceeding with computation,10 properties remain. new max is 2048
SDD size :3.48261e+07 after 1.04894e+09
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9364487623783195956
[2022-06-08 23:45:55] [INFO ] Built C files in 78ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9364487623783195956
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/ltsmin9364487623783195956]
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/ltsmin9364487623783195956] 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/ltsmin9364487623783195956] 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)
Incomplete random walk after 1000000 steps, including 24468 resets, run finished after 3550 ms. (steps per millisecond=281 ) properties (out of 10) seen :2
FORMULA StigmergyElection-PT-07b-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-07b-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 3489 resets, run finished after 3074 ms. (steps per millisecond=325 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3479 resets, run finished after 707 ms. (steps per millisecond=1414 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 1000000 steps, including 3487 resets, run finished after 1867 ms. (steps per millisecond=535 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3495 resets, run finished after 1933 ms. (steps per millisecond=517 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3851 resets, run finished after 1947 ms. (steps per millisecond=513 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3457 resets, run finished after 1346 ms. (steps per millisecond=742 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3483 resets, run finished after 680 ms. (steps per millisecond=1470 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3459 resets, run finished after 673 ms. (steps per millisecond=1485 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 1318 rows 287 cols
[2022-06-08 23:46:12] [INFO ] Computed 8 place invariants in 19 ms
[2022-06-08 23:46:12] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned sat
[2022-06-08 23:46:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 23:46:12] [INFO ] [Real]Absence check using state equation in 408 ms returned sat
[2022-06-08 23:46:12] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 23:46:12] [INFO ] [Nat]Absence check using 8 positive place invariants in 7 ms returned sat
[2022-06-08 23:46:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 23:46:13] [INFO ] [Nat]Absence check using state equation in 510 ms returned sat
[2022-06-08 23:46:13] [INFO ] State equation strengthened by 558 read => feed constraints.
[2022-06-08 23:46:15] [INFO ] [Nat]Added 558 Read/Feed constraints in 1487 ms returned sat
[2022-06-08 23:46:15] [INFO ] Deduced a trap composed of 51 places in 558 ms of which 2 ms to minimize.
[2022-06-08 23:46:16] [INFO ] Deduced a trap composed of 67 places in 566 ms of which 1 ms to minimize.
[2022-06-08 23:46:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1700 ms
[2022-06-08 23:46:17] [INFO ] Computed and/alt/rep : 486/2092/486 causal constraints (skipped 831 transitions) in 847 ms.
[2022-06-08 23:46:35] [INFO ] Added : 354 causal constraints over 71 iterations in 18627 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 181 ms.
[2022-06-08 23:46:35] [INFO ] [Real]Absence check using 8 positive place invariants in 10 ms returned sat
[2022-06-08 23:46:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 23:46:36] [INFO ] [Real]Absence check using state equation in 405 ms returned sat
[2022-06-08 23:46:36] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 23:46:36] [INFO ] [Nat]Absence check using 8 positive place invariants in 7 ms returned sat
[2022-06-08 23:46:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 23:46:36] [INFO ] [Nat]Absence check using state equation in 333 ms returned sat
[2022-06-08 23:46:37] [INFO ] [Nat]Added 558 Read/Feed constraints in 1076 ms returned sat
[2022-06-08 23:46:38] [INFO ] Deduced a trap composed of 59 places in 753 ms of which 1 ms to minimize.
[2022-06-08 23:46:39] [INFO ] Deduced a trap composed of 49 places in 663 ms of which 1 ms to minimize.
[2022-06-08 23:46:40] [INFO ] Deduced a trap composed of 50 places in 671 ms of which 0 ms to minimize.
[2022-06-08 23:46:40] [INFO ] Deduced a trap composed of 48 places in 685 ms of which 1 ms to minimize.
[2022-06-08 23:46:41] [INFO ] Deduced a trap composed of 42 places in 698 ms of which 1 ms to minimize.
[2022-06-08 23:46:42] [INFO ] Deduced a trap composed of 44 places in 550 ms of which 1 ms to minimize.
[2022-06-08 23:46:43] [INFO ] Deduced a trap composed of 53 places in 546 ms of which 1 ms to minimize.
[2022-06-08 23:46:43] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 6076 ms
[2022-06-08 23:46:44] [INFO ] Computed and/alt/rep : 486/2092/486 causal constraints (skipped 831 transitions) in 374 ms.
[2022-06-08 23:46:58] [INFO ] Deduced a trap composed of 55 places in 693 ms of which 2 ms to minimize.
[2022-06-08 23:46:59] [INFO ] Deduced a trap composed of 59 places in 540 ms of which 1 ms to minimize.
[2022-06-08 23:46:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1719 ms
[2022-06-08 23:46:59] [INFO ] Added : 336 causal constraints over 68 iterations in 16162 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 73 ms.
[2022-06-08 23:47:00] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2022-06-08 23:47:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 23:47:00] [INFO ] [Real]Absence check using state equation in 460 ms returned sat
[2022-06-08 23:47:00] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 23:47:00] [INFO ] [Nat]Absence check using 8 positive place invariants in 11 ms returned sat
[2022-06-08 23:47:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 23:47:01] [INFO ] [Nat]Absence check using state equation in 577 ms returned sat
[2022-06-08 23:47:02] [INFO ] [Nat]Added 558 Read/Feed constraints in 1540 ms returned sat
[2022-06-08 23:47:03] [INFO ] Deduced a trap composed of 56 places in 855 ms of which 1 ms to minimize.
[2022-06-08 23:47:04] [INFO ] Deduced a trap composed of 69 places in 766 ms of which 1 ms to minimize.
[2022-06-08 23:47:05] [INFO ] Deduced a trap composed of 53 places in 791 ms of which 1 ms to minimize.
[2022-06-08 23:47:06] [INFO ] Deduced a trap composed of 51 places in 857 ms of which 2 ms to minimize.
[2022-06-08 23:47:08] [INFO ] Deduced a trap composed of 58 places in 799 ms of which 1 ms to minimize.
[2022-06-08 23:47:09] [INFO ] Deduced a trap composed of 72 places in 721 ms of which 0 ms to minimize.
[2022-06-08 23:47:10] [INFO ] Deduced a trap composed of 61 places in 736 ms of which 1 ms to minimize.
[2022-06-08 23:47:11] [INFO ] Deduced a trap composed of 62 places in 739 ms of which 1 ms to minimize.
[2022-06-08 23:47:12] [INFO ] Deduced a trap composed of 45 places in 738 ms of which 1 ms to minimize.
[2022-06-08 23:47:13] [INFO ] Deduced a trap composed of 54 places in 684 ms of which 1 ms to minimize.
[2022-06-08 23:47:13] [INFO ] Deduced a trap composed of 54 places in 678 ms of which 2 ms to minimize.
[2022-06-08 23:47:14] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 11516 ms
[2022-06-08 23:47:15] [INFO ] Computed and/alt/rep : 486/2092/486 causal constraints (skipped 831 transitions) in 806 ms.
[2022-06-08 23:47:34] [INFO ] Added : 300 causal constraints over 60 iterations in 20183 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 128 ms.
[2022-06-08 23:47:34] [INFO ] [Real]Absence check using 8 positive place invariants in 12 ms returned sat
[2022-06-08 23:47:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 23:47:35] [INFO ] [Real]Absence check using state equation in 601 ms returned sat
[2022-06-08 23:47:35] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 23:47:35] [INFO ] [Nat]Absence check using 8 positive place invariants in 11 ms returned sat
[2022-06-08 23:47:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 23:47:36] [INFO ] [Nat]Absence check using state equation in 530 ms returned sat
[2022-06-08 23:47:37] [INFO ] [Nat]Added 558 Read/Feed constraints in 1475 ms returned sat
[2022-06-08 23:47:38] [INFO ] Deduced a trap composed of 39 places in 688 ms of which 1 ms to minimize.
[2022-06-08 23:47:39] [INFO ] Deduced a trap composed of 53 places in 611 ms of which 2 ms to minimize.
[2022-06-08 23:47:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1975 ms
[2022-06-08 23:47:40] [INFO ] Computed and/alt/rep : 486/2092/486 causal constraints (skipped 831 transitions) in 515 ms.
[2022-06-08 23:47:59] [INFO ] Added : 285 causal constraints over 57 iterations in 20501 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 200 ms.
[2022-06-08 23:48:00] [INFO ] [Real]Absence check using 8 positive place invariants in 12 ms returned sat
[2022-06-08 23:48:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 23:48:00] [INFO ] [Real]Absence check using state equation in 568 ms returned sat
[2022-06-08 23:48:00] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 23:48:01] [INFO ] [Nat]Absence check using 8 positive place invariants in 9 ms returned sat
[2022-06-08 23:48:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 23:48:01] [INFO ] [Nat]Absence check using state equation in 366 ms returned sat
[2022-06-08 23:48:03] [INFO ] [Nat]Added 558 Read/Feed constraints in 1681 ms returned sat
[2022-06-08 23:48:03] [INFO ] Deduced a trap composed of 53 places in 628 ms of which 1 ms to minimize.
[2022-06-08 23:48:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 989 ms
[2022-06-08 23:48:04] [INFO ] Computed and/alt/rep : 486/2092/486 causal constraints (skipped 831 transitions) in 518 ms.
[2022-06-08 23:48:24] [INFO ] Added : 280 causal constraints over 56 iterations in 20231 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 145 ms.
[2022-06-08 23:48:24] [INFO ] [Real]Absence check using 8 positive place invariants in 11 ms returned sat
[2022-06-08 23:48:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 23:48:25] [INFO ] [Real]Absence check using state equation in 593 ms returned sat
[2022-06-08 23:48:25] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 23:48:25] [INFO ] [Nat]Absence check using 8 positive place invariants in 11 ms returned sat
[2022-06-08 23:48:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 23:48:25] [INFO ] [Nat]Absence check using state equation in 531 ms returned sat
[2022-06-08 23:48:27] [INFO ] [Nat]Added 558 Read/Feed constraints in 1459 ms returned sat
[2022-06-08 23:48:28] [INFO ] Deduced a trap composed of 59 places in 757 ms of which 1 ms to minimize.
[2022-06-08 23:48:29] [INFO ] Deduced a trap composed of 44 places in 624 ms of which 0 ms to minimize.
[2022-06-08 23:48:29] [INFO ] Deduced a trap composed of 66 places in 603 ms of which 1 ms to minimize.
[2022-06-08 23:48:30] [INFO ] Deduced a trap composed of 44 places in 646 ms of which 1 ms to minimize.
[2022-06-08 23:48:31] [INFO ] Deduced a trap composed of 60 places in 697 ms of which 1 ms to minimize.
[2022-06-08 23:48:32] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 4766 ms
[2022-06-08 23:48:32] [INFO ] Computed and/alt/rep : 486/2092/486 causal constraints (skipped 831 transitions) in 489 ms.
[2022-06-08 23:48:51] [INFO ] Deduced a trap composed of 53 places in 652 ms of which 2 ms to minimize.
[2022-06-08 23:48:52] [INFO ] Deduced a trap composed of 50 places in 702 ms of which 1 ms to minimize.
[2022-06-08 23:48:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 2007 ms
[2022-06-08 23:48:53] [INFO ] Added : 336 causal constraints over 68 iterations in 21386 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 167 ms.
[2022-06-08 23:48:53] [INFO ] [Real]Absence check using 8 positive place invariants in 9 ms returned sat
[2022-06-08 23:48:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 23:48:54] [INFO ] [Real]Absence check using state equation in 543 ms returned sat
[2022-06-08 23:48:54] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 23:48:54] [INFO ] [Nat]Absence check using 8 positive place invariants in 7 ms returned sat
[2022-06-08 23:48:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 23:48:54] [INFO ] [Nat]Absence check using state equation in 335 ms returned sat
[2022-06-08 23:48:55] [INFO ] [Nat]Added 558 Read/Feed constraints in 1174 ms returned sat
[2022-06-08 23:48:56] [INFO ] Deduced a trap composed of 54 places in 750 ms of which 1 ms to minimize.
[2022-06-08 23:48:57] [INFO ] Deduced a trap composed of 47 places in 752 ms of which 0 ms to minimize.
[2022-06-08 23:48:58] [INFO ] Deduced a trap composed of 52 places in 668 ms of which 0 ms to minimize.
[2022-06-08 23:48:59] [INFO ] Deduced a trap composed of 50 places in 644 ms of which 1 ms to minimize.
[2022-06-08 23:49:00] [INFO ] Deduced a trap composed of 53 places in 626 ms of which 0 ms to minimize.
[2022-06-08 23:49:01] [INFO ] Deduced a trap composed of 63 places in 627 ms of which 1 ms to minimize.
[2022-06-08 23:49:01] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 5806 ms
[2022-06-08 23:49:02] [INFO ] Computed and/alt/rep : 486/2092/486 causal constraints (skipped 831 transitions) in 587 ms.
[2022-06-08 23:49:19] [INFO ] Added : 325 causal constraints over 65 iterations in 17468 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 118 ms.
[2022-06-08 23:49:19] [INFO ] [Real]Absence check using 8 positive place invariants in 10 ms returned sat
[2022-06-08 23:49:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 23:49:20] [INFO ] [Real]Absence check using state equation in 539 ms returned sat
[2022-06-08 23:49:21] [INFO ] [Real]Added 558 Read/Feed constraints in 1546 ms returned sat
[2022-06-08 23:49:21] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 23:49:21] [INFO ] [Nat]Absence check using 8 positive place invariants in 12 ms returned sat
[2022-06-08 23:49:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 23:49:22] [INFO ] [Nat]Absence check using state equation in 515 ms returned sat
[2022-06-08 23:49:23] [INFO ] [Nat]Added 558 Read/Feed constraints in 1454 ms returned sat
[2022-06-08 23:49:24] [INFO ] Deduced a trap composed of 56 places in 847 ms of which 1 ms to minimize.
[2022-06-08 23:49:25] [INFO ] Deduced a trap composed of 49 places in 772 ms of which 1 ms to minimize.
[2022-06-08 23:49:26] [INFO ] Deduced a trap composed of 48 places in 715 ms of which 1 ms to minimize.
[2022-06-08 23:49:27] [INFO ] Deduced a trap composed of 65 places in 736 ms of which 0 ms to minimize.
[2022-06-08 23:49:28] [INFO ] Deduced a trap composed of 54 places in 683 ms of which 0 ms to minimize.
[2022-06-08 23:49:29] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 5285 ms
[2022-06-08 23:49:29] [INFO ] Computed and/alt/rep : 486/2092/486 causal constraints (skipped 831 transitions) in 511 ms.
[2022-06-08 23:49:49] [INFO ] Added : 305 causal constraints over 61 iterations in 20138 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 131 ms.
Incomplete Parikh walk after 2318100 steps, including 56068 resets, run finished after 10009 ms. (steps per millisecond=231 ) properties (out of 8) seen :0 could not realise parikh vector
Incomplete Parikh walk after 1748100 steps, including 42572 resets, run finished after 6583 ms. (steps per millisecond=265 ) properties (out of 8) seen :1 could not realise parikh vector
FORMULA StigmergyElection-PT-07b-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 1818600 steps, including 44924 resets, run finished after 6587 ms. (steps per millisecond=276 ) properties (out of 7) seen :2 could not realise parikh vector
FORMULA StigmergyElection-PT-07b-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA StigmergyElection-PT-07b-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 2230700 steps, including 53933 resets, run finished after 8460 ms. (steps per millisecond=263 ) properties (out of 5) seen :0 could not realise parikh vector
Incomplete Parikh walk after 1783700 steps, including 40900 resets, run finished after 6061 ms. (steps per millisecond=294 ) properties (out of 5) seen :0 could not realise parikh vector
Incomplete Parikh walk after 1728600 steps, including 42329 resets, run finished after 5828 ms. (steps per millisecond=296 ) properties (out of 5) seen :0 could not realise parikh vector
Incomplete Parikh walk after 1731400 steps, including 41906 resets, run finished after 5811 ms. (steps per millisecond=297 ) properties (out of 5) seen :0 could not realise parikh vector
Incomplete Parikh walk after 2240300 steps, including 52709 resets, run finished after 7487 ms. (steps per millisecond=299 ) properties (out of 5) seen :0 could not realise parikh vector
Support contains 94 out of 287 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 287/287 places, 1318/1318 transitions.
Graph (trivial) has 118 edges and 287 vertex of which 9 / 287 are part of one of the 3 SCC in 1 ms
Free SCC test removed 6 places
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 41 place count 281 transition count 1268
Reduce places removed 40 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 1 with 51 rules applied. Total rules applied 92 place count 241 transition count 1257
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 101 place count 232 transition count 1257
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 101 place count 232 transition count 1247
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 121 place count 222 transition count 1247
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 124 place count 219 transition count 1244
Iterating global reduction 3 with 3 rules applied. Total rules applied 127 place count 219 transition count 1244
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 128 place count 218 transition count 1243
Iterating global reduction 3 with 1 rules applied. Total rules applied 129 place count 218 transition count 1243
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 153 place count 206 transition count 1231
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 154 place count 206 transition count 1230
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 155 place count 205 transition count 1229
Iterating global reduction 4 with 1 rules applied. Total rules applied 156 place count 205 transition count 1229
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 162 place count 202 transition count 1231
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 165 place count 202 transition count 1228
Free-agglomeration rule applied 15 times.
Iterating global reduction 4 with 15 rules applied. Total rules applied 180 place count 202 transition count 1213
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 4 with 15 rules applied. Total rules applied 195 place count 187 transition count 1213
Drop transitions removed 145 transitions
Redundant transition composition rules discarded 145 transitions
Iterating global reduction 5 with 145 rules applied. Total rules applied 340 place count 187 transition count 1068
Applied a total of 340 rules in 598 ms. Remains 187 /287 variables (removed 100) and now considering 1068/1318 (removed 250) transitions.
Finished structural reductions, in 1 iterations. Remains : 187/287 places, 1068/1318 transitions.
[2022-06-08 23:50:47] [INFO ] Flatten gal took : 93 ms
[2022-06-08 23:50:47] [INFO ] Flatten gal took : 86 ms
[2022-06-08 23:50:47] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17609259261358560857.gal : 17 ms
[2022-06-08 23:50:47] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16680142879597354741.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/ReachabilityCardinality17609259261358560857.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality16680142879597354741.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/ReachabilityCardinality17609259261358560857.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality16680142879597354741.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality16680142879597354741.prop.
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :4 after 9
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :9 after 12
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :12 after 32
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :32 after 84
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :84 after 246
SDD proceeding with computation,5 properties remain. new max is 256
SDD size :246 after 772
SDD proceeding with computation,5 properties remain. new max is 512
SDD size :772 after 12628
SDD proceeding with computation,5 properties remain. new max is 1024
SDD size :12628 after 16184
SDD proceeding with computation,5 properties remain. new max is 2048
SDD size :16184 after 1.34951e+06
SDD proceeding with computation,5 properties remain. new max is 4096
SDD size :1.34951e+06 after 1.57193e+06
Reachability property StigmergyElection-PT-07b-ReachabilityCardinality-13 is true.
FORMULA StigmergyElection-PT-07b-ReachabilityCardinality-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :1.57193e+06 after 4.38259e+06
SDD proceeding with computation,4 properties remain. new max is 8192
SDD size :4.38259e+06 after 4.79131e+06
Detected timeout of ITS tools.
[2022-06-08 23:51:02] [INFO ] Flatten gal took : 85 ms
[2022-06-08 23:51:02] [INFO ] Applying decomposition
[2022-06-08 23:51:02] [INFO ] Flatten gal took : 102 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/graph2197739352124526792.txt, -o, /tmp/graph2197739352124526792.bin, -w, /tmp/graph2197739352124526792.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/graph2197739352124526792.bin, -l, -1, -v, -w, /tmp/graph2197739352124526792.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-08 23:51:02] [INFO ] Decomposing Gal with order
[2022-06-08 23:51:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-08 23:51:03] [INFO ] Removed a total of 1170 redundant transitions.
[2022-06-08 23:51:03] [INFO ] Flatten gal took : 266 ms
[2022-06-08 23:51:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 1089 labels/synchronizations in 74 ms.
[2022-06-08 23:51:03] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6738167782214311937.gal : 16 ms
[2022-06-08 23:51:03] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality18296254715640491553.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/ReachabilityCardinality6738167782214311937.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality18296254715640491553.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/ReachabilityCardinality6738167782214311937.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality18296254715640491553.prop --nowitness
Loading property file /tmp/ReachabilityCardinality18296254715640491553.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 1
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :1 after 68270
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :68270 after 81238
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :81238 after 995358
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :995358 after 1.69117e+06
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :1.69117e+06 after 1.91797e+06
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :1.91797e+06 after 4.61807e+06
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6011948097397213444
[2022-06-08 23:51:18] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6011948097397213444
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/ltsmin6011948097397213444]
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/ltsmin6011948097397213444] 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/ltsmin6011948097397213444] 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)
Incomplete random walk after 1000000 steps, including 35101 resets, run finished after 3432 ms. (steps per millisecond=291 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2553 resets, run finished after 2528 ms. (steps per millisecond=395 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 4585 resets, run finished after 662 ms. (steps per millisecond=1510 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000000 steps, including 4788 resets, run finished after 1815 ms. (steps per millisecond=550 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 4544 resets, run finished after 1380 ms. (steps per millisecond=724 ) properties (out of 4) seen :2
FORMULA StigmergyElection-PT-07b-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA StigmergyElection-PT-07b-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 2 properties.
// Phase 1: matrix 1068 rows 187 cols
[2022-06-08 23:51:29] [INFO ] Computed 8 place invariants in 9 ms
[2022-06-08 23:51:29] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned sat
[2022-06-08 23:51:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 23:51:29] [INFO ] [Real]Absence check using state equation in 308 ms returned sat
[2022-06-08 23:51:29] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 23:51:29] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2022-06-08 23:51:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 23:51:29] [INFO ] [Nat]Absence check using state equation in 280 ms returned sat
[2022-06-08 23:51:29] [INFO ] State equation strengthened by 670 read => feed constraints.
[2022-06-08 23:51:30] [INFO ] [Nat]Added 670 Read/Feed constraints in 823 ms returned sat
[2022-06-08 23:51:31] [INFO ] Deduced a trap composed of 23 places in 478 ms of which 0 ms to minimize.
[2022-06-08 23:51:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 665 ms
[2022-06-08 23:51:31] [INFO ] Computed and/alt/rep : 165/343/165 causal constraints (skipped 902 transitions) in 431 ms.
[2022-06-08 23:51:35] [INFO ] Added : 143 causal constraints over 29 iterations in 3918 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 63 ms.
[2022-06-08 23:51:35] [INFO ] [Real]Absence check using 8 positive place invariants in 9 ms returned sat
[2022-06-08 23:51:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 23:51:35] [INFO ] [Real]Absence check using state equation in 444 ms returned sat
[2022-06-08 23:51:37] [INFO ] [Real]Added 670 Read/Feed constraints in 1377 ms returned sat
[2022-06-08 23:51:37] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 23:51:37] [INFO ] [Nat]Absence check using 8 positive place invariants in 10 ms returned sat
[2022-06-08 23:51:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 23:51:37] [INFO ] [Nat]Absence check using state equation in 418 ms returned sat
[2022-06-08 23:51:39] [INFO ] [Nat]Added 670 Read/Feed constraints in 1395 ms returned sat
[2022-06-08 23:51:39] [INFO ] Deduced a trap composed of 31 places in 483 ms of which 1 ms to minimize.
[2022-06-08 23:51:40] [INFO ] Deduced a trap composed of 28 places in 449 ms of which 1 ms to minimize.
[2022-06-08 23:51:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1268 ms
[2022-06-08 23:51:41] [INFO ] Computed and/alt/rep : 165/343/165 causal constraints (skipped 902 transitions) in 442 ms.
[2022-06-08 23:51:46] [INFO ] Added : 137 causal constraints over 28 iterations in 5942 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 82 ms.
Incomplete Parikh walk after 1837500 steps, including 1032 resets, run finished after 11635 ms. (steps per millisecond=157 ) properties (out of 2) seen :0 could not realise parikh vector
Incomplete Parikh walk after 1439600 steps, including 54415 resets, run finished after 5338 ms. (steps per millisecond=269 ) properties (out of 2) seen :0 could not realise parikh vector
Support contains 75 out of 187 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 187/187 places, 1068/1068 transitions.
Graph (trivial) has 37 edges and 187 vertex of which 2 / 187 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 186 transition count 1057
Reduce places removed 9 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 11 rules applied. Total rules applied 21 place count 177 transition count 1055
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 23 place count 175 transition count 1055
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 23 place count 175 transition count 1052
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 29 place count 172 transition count 1052
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 30 place count 171 transition count 1051
Iterating global reduction 3 with 1 rules applied. Total rules applied 31 place count 171 transition count 1051
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 41 place count 166 transition count 1046
Drop transitions removed 1 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 44 place count 166 transition count 1043
Free-agglomeration rule applied 7 times.
Iterating global reduction 4 with 7 rules applied. Total rules applied 51 place count 166 transition count 1036
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 96 transitions.
Iterating post reduction 4 with 103 rules applied. Total rules applied 154 place count 159 transition count 940
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 156 place count 159 transition count 938
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 157 place count 159 transition count 938
Applied a total of 157 rules in 384 ms. Remains 159 /187 variables (removed 28) and now considering 938/1068 (removed 130) transitions.
Finished structural reductions, in 1 iterations. Remains : 159/187 places, 938/1068 transitions.
[2022-06-08 23:52:04] [INFO ] Flatten gal took : 78 ms
[2022-06-08 23:52:04] [INFO ] Flatten gal took : 77 ms
[2022-06-08 23:52:04] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4908504922325628030.gal : 11 ms
[2022-06-08 23:52:04] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality18179609283618803163.prop : 0 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/ReachabilityCardinality4908504922325628030.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality18179609283618803163.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/ReachabilityCardinality4908504922325628030.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality18179609283618803163.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality18179609283618803163.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :4 after 8
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :8 after 10
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :10 after 26
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :26 after 70
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :70 after 214
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :214 after 2327
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :2327 after 3457
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :3457 after 11702
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :11702 after 319925
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :319925 after 3.05478e+06
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :3.05478e+06 after 5.03688e+06
Detected timeout of ITS tools.
[2022-06-08 23:52:19] [INFO ] Flatten gal took : 75 ms
[2022-06-08 23:52:19] [INFO ] Applying decomposition
[2022-06-08 23:52:19] [INFO ] Flatten gal took : 74 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/graph10950148281146946362.txt, -o, /tmp/graph10950148281146946362.bin, -w, /tmp/graph10950148281146946362.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/graph10950148281146946362.bin, -l, -1, -v, -w, /tmp/graph10950148281146946362.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-08 23:52:19] [INFO ] Decomposing Gal with order
[2022-06-08 23:52:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-08 23:52:19] [INFO ] Removed a total of 943 redundant transitions.
[2022-06-08 23:52:19] [INFO ] Flatten gal took : 216 ms
[2022-06-08 23:52:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 859 labels/synchronizations in 30 ms.
[2022-06-08 23:52:19] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6427924999148204967.gal : 13 ms
[2022-06-08 23:52:19] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16304972805834111084.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/ReachabilityCardinality6427924999148204967.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality16304972805834111084.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/ReachabilityCardinality6427924999148204967.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality16304972805834111084.prop --nowitness
Loading property file /tmp/ReachabilityCardinality16304972805834111084.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :1 after 26
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :26 after 2402
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :2402 after 11762
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :11762 after 295004
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :295004 after 410842
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :410842 after 5.99784e+06
Reachability property StigmergyElection-PT-07b-ReachabilityCardinality-00 is true.
FORMULA StigmergyElection-PT-07b-ReachabilityCardinality-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :5.99784e+06 after 7.57626e+06
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :7.57626e+06 after 8.64526e+06
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16516102014906524787
[2022-06-08 23:52:35] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16516102014906524787
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/ltsmin16516102014906524787]
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/ltsmin16516102014906524787] 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/ltsmin16516102014906524787] 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)
Incomplete random walk after 1000000 steps, including 17072 resets, run finished after 2850 ms. (steps per millisecond=350 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 4051 resets, run finished after 1973 ms. (steps per millisecond=506 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 10417936 steps, run timeout after 30001 ms. (steps per millisecond=347 ) properties seen :{}
Probabilistic random walk after 10417936 steps, saw 1515199 distinct states, run finished after 30023 ms. (steps per millisecond=346 ) properties seen :{}
Running SMT prover for 1 properties.
// Phase 1: matrix 938 rows 159 cols
[2022-06-08 23:53:10] [INFO ] Computed 8 place invariants in 5 ms
[2022-06-08 23:53:10] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2022-06-08 23:53:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 23:53:11] [INFO ] [Real]Absence check using state equation in 231 ms returned sat
[2022-06-08 23:53:11] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 23:53:11] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2022-06-08 23:53:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 23:53:11] [INFO ] [Nat]Absence check using state equation in 260 ms returned sat
[2022-06-08 23:53:11] [INFO ] State equation strengthened by 685 read => feed constraints.
[2022-06-08 23:53:12] [INFO ] [Nat]Added 685 Read/Feed constraints in 1304 ms returned sat
[2022-06-08 23:53:13] [INFO ] Deduced a trap composed of 20 places in 391 ms of which 0 ms to minimize.
[2022-06-08 23:53:13] [INFO ] Deduced a trap composed of 29 places in 374 ms of which 1 ms to minimize.
[2022-06-08 23:53:14] [INFO ] Deduced a trap composed of 26 places in 419 ms of which 1 ms to minimize.
[2022-06-08 23:53:14] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1575 ms
[2022-06-08 23:53:14] [INFO ] Computed and/alt/rep : 130/214/130 causal constraints (skipped 807 transitions) in 424 ms.
[2022-06-08 23:53:18] [INFO ] Deduced a trap composed of 38 places in 406 ms of which 1 ms to minimize.
[2022-06-08 23:53:18] [INFO ] Deduced a trap composed of 29 places in 368 ms of which 1 ms to minimize.
[2022-06-08 23:53:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1109 ms
[2022-06-08 23:53:19] [INFO ] Added : 102 causal constraints over 21 iterations in 5028 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 79 ms.
Incomplete Parikh walk after 1043600 steps, including 1002 resets, run finished after 6335 ms. (steps per millisecond=164 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 30 out of 159 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 159/159 places, 938/938 transitions.
Graph (trivial) has 87 edges and 159 vertex of which 16 / 159 are part of one of the 6 SCC in 1 ms
Free SCC test removed 10 places
Drop transitions removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Graph (complete) has 569 edges and 149 vertex of which 147 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 29 rules applied. Total rules applied 31 place count 147 transition count 892
Reduce places removed 28 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 30 rules applied. Total rules applied 61 place count 119 transition count 890
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 63 place count 117 transition count 890
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 63 place count 117 transition count 886
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 71 place count 113 transition count 886
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 74 place count 110 transition count 820
Iterating global reduction 3 with 3 rules applied. Total rules applied 77 place count 110 transition count 820
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 79 place count 110 transition count 818
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 95 place count 102 transition count 810
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 97 place count 102 transition count 808
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 99 place count 100 transition count 806
Iterating global reduction 5 with 2 rules applied. Total rules applied 101 place count 100 transition count 806
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 103 place count 99 transition count 812
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 105 place count 99 transition count 810
Free-agglomeration rule applied 15 times with reduction of 216 identical transitions.
Iterating global reduction 5 with 15 rules applied. Total rules applied 120 place count 99 transition count 579
Reduce places removed 15 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 5 with 39 rules applied. Total rules applied 159 place count 84 transition count 555
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 160 place count 84 transition count 554
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 161 place count 84 transition count 554
Applied a total of 161 rules in 315 ms. Remains 84 /159 variables (removed 75) and now considering 554/938 (removed 384) transitions.
Finished structural reductions, in 1 iterations. Remains : 84/159 places, 554/938 transitions.
[2022-06-08 23:53:26] [INFO ] Flatten gal took : 33 ms
[2022-06-08 23:53:26] [INFO ] Flatten gal took : 32 ms
[2022-06-08 23:53:26] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality89529816599642930.gal : 5 ms
[2022-06-08 23:53:26] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3682608537011540546.prop : 0 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/ReachabilityCardinality89529816599642930.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality3682608537011540546.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/ReachabilityCardinality89529816599642930.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality3682608537011540546.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality3682608537011540546.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 18
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :18 after 38
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :38 after 246
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :246 after 602
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :602 after 1602
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1602 after 2114
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :2114 after 5254
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :5254 after 6665
Reachability property StigmergyElection-PT-07b-ReachabilityCardinality-05 is true.
FORMULA StigmergyElection-PT-07b-ReachabilityCardinality-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 2049 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,29638,2.23724,42496,2,7125,16,90366,6,0,891,43354,0
Total reachable state count : 29638

Verifying 1 reachability properties.
Reachability property StigmergyElection-PT-07b-ReachabilityCardinality-05 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
StigmergyElection-PT-07b-ReachabilityCardinality-05,72,2.34435,42496,2,225,16,90366,7,0,969,43354,0
All properties solved without resorting to model-checking.

BK_STOP 1654732409817

--------------------
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="StigmergyElection-PT-07b"
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 StigmergyElection-PT-07b, 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 r305-smll-165463878500128"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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