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-165463878400083.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 StigmergyCommit-PT-10a, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r305-smll-165463878400083
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 155M
-rw-r--r-- 1 mcc users 7.8K May 30 15:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K May 30 15:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 30 15:00 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K May 30 15:00 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 25 13:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 25 13:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 25 13:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 25 13:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 29 12:20 NewModel
-rw-r--r-- 1 mcc users 13K May 30 15:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 136K May 30 15:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K May 30 15:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K May 30 15:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 25 13:02 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 25 13:02 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 155M 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 StigmergyCommit-PT-10a-ReachabilityCardinality-00
FORMULA_NAME StigmergyCommit-PT-10a-ReachabilityCardinality-01
FORMULA_NAME StigmergyCommit-PT-10a-ReachabilityCardinality-02
FORMULA_NAME StigmergyCommit-PT-10a-ReachabilityCardinality-03
FORMULA_NAME StigmergyCommit-PT-10a-ReachabilityCardinality-04
FORMULA_NAME StigmergyCommit-PT-10a-ReachabilityCardinality-05
FORMULA_NAME StigmergyCommit-PT-10a-ReachabilityCardinality-06
FORMULA_NAME StigmergyCommit-PT-10a-ReachabilityCardinality-07
FORMULA_NAME StigmergyCommit-PT-10a-ReachabilityCardinality-08
FORMULA_NAME StigmergyCommit-PT-10a-ReachabilityCardinality-09
FORMULA_NAME StigmergyCommit-PT-10a-ReachabilityCardinality-10
FORMULA_NAME StigmergyCommit-PT-10a-ReachabilityCardinality-11
FORMULA_NAME StigmergyCommit-PT-10a-ReachabilityCardinality-12
FORMULA_NAME StigmergyCommit-PT-10a-ReachabilityCardinality-13
FORMULA_NAME StigmergyCommit-PT-10a-ReachabilityCardinality-14
FORMULA_NAME StigmergyCommit-PT-10a-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1654722785310

Running Version 0
[2022-06-08 21:13:07] [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 21:13:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-08 21:13:16] [INFO ] Load time of PNML (sax parser for PT used): 8600 ms
[2022-06-08 21:13:16] [INFO ] Transformed 400 places.
[2022-06-08 21:13:17] [INFO ] Transformed 136960 transitions.
[2022-06-08 21:13:17] [INFO ] Found NUPN structural information;
[2022-06-08 21:13:17] [INFO ] Parsed PT model containing 400 places and 136960 transitions in 9583 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 29 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 132345 transitions
Reduce redundant transitions removed 132345 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 3557 ms. (steps per millisecond=2 ) properties (out of 16) seen :2
FORMULA StigmergyCommit-PT-10a-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-10a-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 14) seen :0
Running SMT prover for 14 properties.
[2022-06-08 21:13:22] [INFO ] Flow matrix only has 4582 transitions (discarded 33 similar events)
// Phase 1: matrix 4582 rows 400 cols
[2022-06-08 21:13:22] [INFO ] Computed 12 place invariants in 119 ms
[2022-06-08 21:13:23] [INFO ] [Real]Absence check using 12 positive place invariants in 18 ms returned sat
[2022-06-08 21:13:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 21:13:24] [INFO ] [Real]Absence check using state equation in 1489 ms returned sat
[2022-06-08 21:13:25] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 21:13:25] [INFO ] [Real]Absence check using 12 positive place invariants in 14 ms returned sat
[2022-06-08 21:13:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 21:13:27] [INFO ] [Real]Absence check using state equation in 1833 ms returned sat
[2022-06-08 21:13:27] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 21:13:27] [INFO ] [Nat]Absence check using 12 positive place invariants in 15 ms returned sat
[2022-06-08 21:13:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 21:13:28] [INFO ] [Nat]Absence check using state equation in 1333 ms returned sat
[2022-06-08 21:13:30] [INFO ] State equation strengthened by 4247 read => feed constraints.
[2022-06-08 21:13:32] [INFO ] [Nat]Added 4247 Read/Feed constraints in 1925 ms returned sat
[2022-06-08 21:13:35] [INFO ] Deduced a trap composed of 17 places in 3056 ms of which 6 ms to minimize.
[2022-06-08 21:13:35] [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 21:13:35] [INFO ] [Real]Absence check using 12 positive place invariants in 14 ms returned sat
[2022-06-08 21:13:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 21:13:36] [INFO ] [Real]Absence check using state equation in 1341 ms returned sat
[2022-06-08 21:13:36] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 21:13:37] [INFO ] [Real]Absence check using 12 positive place invariants in 19 ms returned sat
[2022-06-08 21:13:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 21:13:38] [INFO ] [Real]Absence check using state equation in 1345 ms returned sat
[2022-06-08 21:13:38] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 21:13:38] [INFO ] [Real]Absence check using 12 positive place invariants in 18 ms returned sat
[2022-06-08 21:13:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 21:13:40] [INFO ] [Real]Absence check using state equation in 1522 ms returned sat
[2022-06-08 21:13:40] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 21:13:40] [INFO ] [Real]Absence check using 12 positive place invariants in 12 ms returned sat
[2022-06-08 21:13:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 21:13:42] [INFO ] [Real]Absence check using state equation in 1242 ms returned sat
[2022-06-08 21:13:42] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 21:13:42] [INFO ] [Nat]Absence check using 12 positive place invariants in 22 ms returned sat
[2022-06-08 21:13:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 21:13:44] [INFO ] [Nat]Absence check using state equation in 1730 ms returned sat
[2022-06-08 21:13:45] [INFO ] [Nat]Added 4247 Read/Feed constraints in 1769 ms returned sat
[2022-06-08 21:13:48] [INFO ] Deduced a trap composed of 17 places in 2861 ms of which 3 ms to minimize.
[2022-06-08 21:13: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 5
[2022-06-08 21:13:48] [INFO ] [Real]Absence check using 12 positive place invariants in 17 ms returned sat
[2022-06-08 21:13:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 21:13:50] [INFO ] [Real]Absence check using state equation in 1319 ms returned sat
[2022-06-08 21:13:51] [INFO ] [Real]Added 4247 Read/Feed constraints in 1413 ms returned sat
[2022-06-08 21:13:52] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 21:13:52] [INFO ] [Nat]Absence check using 12 positive place invariants in 15 ms returned sat
[2022-06-08 21:13:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 21:13:53] [INFO ] [Nat]Absence check using state equation in 1238 ms returned sat
[2022-06-08 21:13:54] [INFO ] [Nat]Added 4247 Read/Feed constraints in 1460 ms returned sat
[2022-06-08 21:13:57] [INFO ] Deduced a trap composed of 17 places in 2574 ms of which 2 ms to minimize.
[2022-06-08 21:13:57] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 6
[2022-06-08 21:13:57] [INFO ] [Real]Absence check using 12 positive place invariants in 15 ms returned sat
[2022-06-08 21:13:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 21:13:58] [INFO ] [Real]Absence check using state equation in 1312 ms returned sat
[2022-06-08 21:13:59] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 21:13:59] [INFO ] [Real]Absence check using 12 positive place invariants in 14 ms returned sat
[2022-06-08 21:13:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 21:14:00] [INFO ] [Real]Absence check using state equation in 1203 ms returned sat
[2022-06-08 21:14:02] [INFO ] [Real]Added 4247 Read/Feed constraints in 1566 ms returned sat
[2022-06-08 21:14:02] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 21:14:02] [INFO ] [Nat]Absence check using 12 positive place invariants in 14 ms returned sat
[2022-06-08 21:14:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 21:14:04] [INFO ] [Nat]Absence check using state equation in 1420 ms returned sat
[2022-06-08 21:14:05] [INFO ] [Nat]Added 4247 Read/Feed constraints in 1625 ms returned sat
[2022-06-08 21:14:08] [INFO ] Deduced a trap composed of 16 places in 2648 ms of which 3 ms to minimize.
[2022-06-08 21:14:08] [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 21:14:08] [INFO ] [Real]Absence check using 12 positive place invariants in 21 ms returned sat
[2022-06-08 21:14:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 21:14:10] [INFO ] [Real]Absence check using state equation in 1774 ms returned sat
[2022-06-08 21:14:10] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 21:14:10] [INFO ] [Nat]Absence check using 12 positive place invariants in 24 ms returned sat
[2022-06-08 21:14:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 21:14:12] [INFO ] [Nat]Absence check using state equation in 1947 ms returned sat
[2022-06-08 21:14:15] [INFO ] [Nat]Added 4247 Read/Feed constraints in 2408 ms returned sat
[2022-06-08 21:14:18] [INFO ] Deduced a trap composed of 17 places in 2951 ms of which 13 ms to minimize.
[2022-06-08 21:14:18] [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 21:14:18] [INFO ] [Real]Absence check using 12 positive place invariants in 17 ms returned sat
[2022-06-08 21:14:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 21:14:19] [INFO ] [Real]Absence check using state equation in 1354 ms returned sat
[2022-06-08 21:14:21] [INFO ] [Real]Added 4247 Read/Feed constraints in 2113 ms returned sat
[2022-06-08 21:14:22] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 21:14:22] [INFO ] [Nat]Absence check using 12 positive place invariants in 22 ms returned sat
[2022-06-08 21:14:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 21:14:23] [INFO ] [Nat]Absence check using state equation in 1350 ms returned sat
[2022-06-08 21:14:25] [INFO ] [Nat]Added 4247 Read/Feed constraints in 2049 ms returned sat
[2022-06-08 21:14:29] [INFO ] Deduced a trap composed of 16 places in 3011 ms of which 3 ms to minimize.
[2022-06-08 21:14: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 10
[2022-06-08 21:14:29] [INFO ] [Real]Absence check using 12 positive place invariants in 13 ms returned sat
[2022-06-08 21:14:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 21:14:30] [INFO ] [Real]Absence check using state equation in 1541 ms returned sat
[2022-06-08 21:14:31] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 21:14:31] [INFO ] [Real]Absence check using 12 positive place invariants in 19 ms returned sat
[2022-06-08 21:14:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 21:14:33] [INFO ] [Real]Absence check using state equation in 1715 ms returned sat
[2022-06-08 21:14:34] [INFO ] [Real]Added 4247 Read/Feed constraints in 1366 ms returned sat
[2022-06-08 21:14:34] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 21:14:35] [INFO ] [Nat]Absence check using 12 positive place invariants in 21 ms returned sat
[2022-06-08 21:14:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 21:14:36] [INFO ] [Nat]Absence check using state equation in 1333 ms returned sat
[2022-06-08 21:14:38] [INFO ] [Nat]Added 4247 Read/Feed constraints in 1768 ms returned sat
[2022-06-08 21:14:41] [INFO ] Deduced a trap composed of 17 places in 3086 ms of which 1 ms to minimize.
[2022-06-08 21:14:41] [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 12
[2022-06-08 21:14:41] [INFO ] [Real]Absence check using 12 positive place invariants in 14 ms returned sat
[2022-06-08 21:14:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 21:14:42] [INFO ] [Real]Absence check using state equation in 1350 ms returned sat
[2022-06-08 21:14:43] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 21:14:43] [INFO ] [Nat]Absence check using 12 positive place invariants in 13 ms returned sat
[2022-06-08 21:14:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 21:14:44] [INFO ] [Nat]Absence check using state equation in 1455 ms returned sat
[2022-06-08 21:14:46] [INFO ] [Nat]Added 4247 Read/Feed constraints in 1479 ms returned sat
[2022-06-08 21:14:48] [INFO ] Deduced a trap composed of 16 places in 2192 ms of which 2 ms to minimize.
[2022-06-08 21:14: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 13
FORMULA StigmergyCommit-PT-10a-ReachabilityCardinality-12 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyCommit-PT-10a-ReachabilityCardinality-08 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyCommit-PT-10a-ReachabilityCardinality-04 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyCommit-PT-10a-ReachabilityCardinality-03 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyCommit-PT-10a-ReachabilityCardinality-02 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyCommit-PT-10a-ReachabilityCardinality-00 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 14 Parikh solutions to 1 different solutions.
Support contains 76 out of 400 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 400/400 places, 4615/4615 transitions.
Graph (complete) has 993 edges and 400 vertex of which 389 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.75 ms
Discarding 11 places :
Also discarding 11 output transitions
Drop transitions removed 11 transitions
Drop transitions removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Drop transitions removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 0 with 73 rules applied. Total rules applied 74 place count 389 transition count 4531
Reduce places removed 41 places and 0 transitions.
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 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 71 rules applied. Total rules applied 145 place count 348 transition count 4501
Reduce places removed 5 places and 0 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 2 with 14 rules applied. Total rules applied 159 place count 343 transition count 4492
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 14 rules applied. Total rules applied 173 place count 334 transition count 4487
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 46 Pre rules applied. Total rules applied 173 place count 334 transition count 4441
Deduced a syphon composed of 46 places in 3 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 4 with 92 rules applied. Total rules applied 265 place count 288 transition count 4441
Discarding 42 places :
Symmetric choice reduction at 4 with 42 rule applications. Total rules 307 place count 246 transition count 4399
Iterating global reduction 4 with 42 rules applied. Total rules applied 349 place count 246 transition count 4399
Discarding 35 places :
Symmetric choice reduction at 4 with 35 rule applications. Total rules 384 place count 211 transition count 4364
Iterating global reduction 4 with 35 rules applied. Total rules applied 419 place count 211 transition count 4364
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 428 place count 211 transition count 4355
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 431 place count 208 transition count 4352
Iterating global reduction 5 with 3 rules applied. Total rules applied 434 place count 208 transition count 4352
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 2 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 5 with 28 rules applied. Total rules applied 462 place count 194 transition count 4338
Drop transitions removed 3 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 468 place count 194 transition count 4332
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 475 place count 187 transition count 4325
Iterating global reduction 6 with 7 rules applied. Total rules applied 482 place count 187 transition count 4325
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 486 place count 183 transition count 4321
Iterating global reduction 6 with 4 rules applied. Total rules applied 490 place count 183 transition count 4321
Drop transitions removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 6 with 14 rules applied. Total rules applied 504 place count 183 transition count 4307
Free-agglomeration rule applied 9 times.
Iterating global reduction 6 with 9 rules applied. Total rules applied 513 place count 183 transition count 4298
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 6 with 9 rules applied. Total rules applied 522 place count 174 transition count 4298
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 524 place count 174 transition count 4296
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 7 with 6 rules applied. Total rules applied 530 place count 174 transition count 4296
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 7 with 6 rules applied. Total rules applied 536 place count 174 transition count 4290
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 537 place count 174 transition count 4290
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 538 place count 174 transition count 4289
Applied a total of 538 rules in 28072 ms. Remains 174 /400 variables (removed 226) and now considering 4289/4615 (removed 326) transitions.
Finished structural reductions, in 1 iterations. Remains : 174/400 places, 4289/4615 transitions.
[2022-06-08 21:15:17] [INFO ] Flatten gal took : 1051 ms
[2022-06-08 21:15:18] [INFO ] Flatten gal took : 629 ms
[2022-06-08 21:15:18] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4073667741146271526.gal : 149 ms
[2022-06-08 21:15:18] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4023783458372577034.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/ReachabilityCardinality4073667741146271526.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality4023783458372577034.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/ReachabilityCardinality4073667741146271526.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality4023783458372577034.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality4023783458372577034.prop.
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,8 properties remain. new max is 8
SDD size :3 after 9
SDD proceeding with computation,8 properties remain. new max is 16
SDD size :9 after 17
SDD proceeding with computation,8 properties remain. new max is 32
SDD size :17 after 57
SDD proceeding with computation,8 properties remain. new max is 64
SDD size :57 after 65
SDD proceeding with computation,8 properties remain. new max is 128
SDD size :65 after 165
SDD proceeding with computation,8 properties remain. new max is 256
SDD size :165 after 545
SDD proceeding with computation,8 properties remain. new max is 512
SDD size :545 after 466561
Detected timeout of ITS tools.
[2022-06-08 21:15:34] [INFO ] Flatten gal took : 623 ms
[2022-06-08 21:15:34] [INFO ] Applying decomposition
[2022-06-08 21:15:35] [INFO ] Flatten gal took : 769 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/graph11416384620413938318.txt, -o, /tmp/graph11416384620413938318.bin, -w, /tmp/graph11416384620413938318.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/graph11416384620413938318.bin, -l, -1, -v, -w, /tmp/graph11416384620413938318.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-08 21:15:37] [INFO ] Decomposing Gal with order
[2022-06-08 21:15:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-08 21:15:39] [INFO ] Removed a total of 45182 redundant transitions.
[2022-06-08 21:15:40] [INFO ] Flatten gal took : 1987 ms
[2022-06-08 21:15:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 60 labels/synchronizations in 772 ms.
[2022-06-08 21:15:41] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14048990166446635915.gal : 60 ms
[2022-06-08 21:15:41] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10412692024833901471.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/ReachabilityCardinality14048990166446635915.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality10412692024833901471.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/ReachabilityCardinality14048990166446635915.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality10412692024833901471.prop --nowitness
Loading property file /tmp/ReachabilityCardinality10412692024833901471.prop.
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :1 after 65
SDD proceeding with computation,8 properties remain. new max is 8
SDD size :65 after 14401
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12717427884275899680
[2022-06-08 21:15:56] [INFO ] Built C files in 176ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12717427884275899680
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/ltsmin12717427884275899680]
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/ltsmin12717427884275899680] 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/ltsmin12717427884275899680] 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)
Interrupted random walk after 58203 steps, including 0 resets, run timeout after 30004 ms. (steps per millisecond=1 ) properties seen :{1=1, 2=1, 6=1}
FORMULA StigmergyCommit-PT-10a-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-10a-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-10a-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3372 ms. (steps per millisecond=296 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1969 ms. (steps per millisecond=507 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 4275 ms. (steps per millisecond=233 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1948 ms. (steps per millisecond=513 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1843 ms. (steps per millisecond=542 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 4289 rows 174 cols
[2022-06-08 21:16:40] [INFO ] Computed 10 place invariants in 26 ms
[2022-06-08 21:16:40] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2022-06-08 21:16:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 21:16:42] [INFO ] [Real]Absence check using state equation in 1225 ms returned sat
[2022-06-08 21:16:42] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 21:16:42] [INFO ] [Nat]Absence check using 10 positive place invariants in 11 ms returned sat
[2022-06-08 21:16:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 21:16:43] [INFO ] [Nat]Absence check using state equation in 1329 ms returned sat
[2022-06-08 21:16:45] [INFO ] State equation strengthened by 4193 read => feed constraints.
[2022-06-08 21:16:46] [INFO ] [Nat]Added 4193 Read/Feed constraints in 797 ms returned sat
[2022-06-08 21:16:48] [INFO ] Deduced a trap composed of 7 places in 2247 ms of which 2 ms to minimize.
[2022-06-08 21:16:50] [INFO ] Deduced a trap composed of 10 places in 2002 ms of which 1 ms to minimize.
[2022-06-08 21:16:52] [INFO ] Deduced a trap composed of 12 places in 1485 ms of which 0 ms to minimize.
[2022-06-08 21:16:54] [INFO ] Deduced a trap composed of 8 places in 1675 ms of which 3 ms to minimize.
[2022-06-08 21:16:56] [INFO ] Deduced a trap composed of 9 places in 1606 ms of which 1 ms to minimize.
[2022-06-08 21:16:57] [INFO ] Deduced a trap composed of 6 places in 1476 ms of which 3 ms to minimize.
[2022-06-08 21:16:59] [INFO ] Deduced a trap composed of 11 places in 1143 ms of which 1 ms to minimize.
[2022-06-08 21:17:00] [INFO ] Deduced a trap composed of 12 places in 1104 ms of which 1 ms to minimize.
[2022-06-08 21:17:01] [INFO ] Deduced a trap composed of 9 places in 951 ms of which 1 ms to minimize.
[2022-06-08 21:17:02] [INFO ] Deduced a trap composed of 12 places in 766 ms of which 1 ms to minimize.
[2022-06-08 21:17:03] [INFO ] Deduced a trap composed of 9 places in 796 ms of which 2 ms to minimize.
[2022-06-08 21:17:04] [INFO ] Deduced a trap composed of 11 places in 1329 ms of which 1 ms to minimize.
[2022-06-08 21:17:05] [INFO ] Deduced a trap composed of 11 places in 818 ms of which 0 ms to minimize.
[2022-06-08 21:17:06] [INFO ] Deduced a trap composed of 13 places in 548 ms of which 0 ms to minimize.
[2022-06-08 21:17:06] [INFO ] Deduced a trap composed of 12 places in 353 ms of which 0 ms to minimize.
[2022-06-08 21:17:07] [INFO ] Deduced a trap composed of 8 places in 810 ms of which 1 ms to minimize.
[2022-06-08 21:17:08] [INFO ] Deduced a trap composed of 8 places in 561 ms of which 1 ms to minimize.
[2022-06-08 21:17:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 17 trap constraints in 22254 ms
[2022-06-08 21:17:08] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2022-06-08 21:17:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 21:17:10] [INFO ] [Real]Absence check using state equation in 1354 ms returned sat
[2022-06-08 21:17:11] [INFO ] [Real]Added 4193 Read/Feed constraints in 1051 ms returned sat
[2022-06-08 21:17:11] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 21:17:11] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2022-06-08 21:17:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 21:17:12] [INFO ] [Nat]Absence check using state equation in 1034 ms returned sat
[2022-06-08 21:17:13] [INFO ] [Nat]Added 4193 Read/Feed constraints in 1038 ms returned sat
[2022-06-08 21:17:15] [INFO ] Deduced a trap composed of 12 places in 1527 ms of which 0 ms to minimize.
[2022-06-08 21:17:16] [INFO ] Deduced a trap composed of 7 places in 1369 ms of which 1 ms to minimize.
[2022-06-08 21:17:18] [INFO ] Deduced a trap composed of 8 places in 1142 ms of which 1 ms to minimize.
[2022-06-08 21:17:19] [INFO ] Deduced a trap composed of 10 places in 959 ms of which 1 ms to minimize.
[2022-06-08 21:17:20] [INFO ] Deduced a trap composed of 11 places in 705 ms of which 0 ms to minimize.
[2022-06-08 21:17:21] [INFO ] Deduced a trap composed of 11 places in 945 ms of which 1 ms to minimize.
[2022-06-08 21:17:22] [INFO ] Deduced a trap composed of 10 places in 869 ms of which 1 ms to minimize.
[2022-06-08 21:17:23] [INFO ] Deduced a trap composed of 13 places in 563 ms of which 1 ms to minimize.
[2022-06-08 21:17:23] [INFO ] Deduced a trap composed of 15 places in 585 ms of which 4 ms to minimize.
[2022-06-08 21:17:24] [INFO ] Deduced a trap composed of 12 places in 376 ms of which 1 ms to minimize.
[2022-06-08 21:17:25] [INFO ] Deduced a trap composed of 12 places in 568 ms of which 0 ms to minimize.
[2022-06-08 21:17:25] [INFO ] Deduced a trap composed of 11 places in 461 ms of which 1 ms to minimize.
[2022-06-08 21:17:26] [INFO ] Deduced a trap composed of 10 places in 624 ms of which 1 ms to minimize.
[2022-06-08 21:17:27] [INFO ] Deduced a trap composed of 11 places in 294 ms of which 2 ms to minimize.
[2022-06-08 21:17:27] [INFO ] Deduced a trap composed of 11 places in 285 ms of which 1 ms to minimize.
[2022-06-08 21:17:27] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 13951 ms
[2022-06-08 21:17:29] [INFO ] Computed and/alt/rep : 166/250/166 causal constraints (skipped 4122 transitions) in 1493 ms.
[2022-06-08 21:17:38] [INFO ] Deduced a trap composed of 11 places in 453 ms of which 0 ms to minimize.
[2022-06-08 21:17:38] [INFO ] Deduced a trap composed of 9 places in 298 ms of which 1 ms to minimize.
[2022-06-08 21:17:38] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1301 ms
[2022-06-08 21:17:39] [INFO ] Added : 162 causal constraints over 33 iterations in 11557 ms. Result :sat
[2022-06-08 21:17:39] [INFO ] [Real]Absence check using 10 positive place invariants in 8 ms returned sat
[2022-06-08 21:17:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 21:17:40] [INFO ] [Real]Absence check using state equation in 1275 ms returned sat
[2022-06-08 21:17:40] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 21:17:40] [INFO ] [Nat]Absence check using 10 positive place invariants in 7 ms returned sat
[2022-06-08 21:17:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 21:17:41] [INFO ] [Nat]Absence check using state equation in 1090 ms returned sat
[2022-06-08 21:17:42] [INFO ] [Nat]Added 4193 Read/Feed constraints in 748 ms returned sat
[2022-06-08 21:17:44] [INFO ] Deduced a trap composed of 9 places in 2070 ms of which 1 ms to minimize.
[2022-06-08 21:17:47] [INFO ] Deduced a trap composed of 9 places in 2236 ms of which 1 ms to minimize.
[2022-06-08 21:17:49] [INFO ] Deduced a trap composed of 10 places in 2120 ms of which 1 ms to minimize.
[2022-06-08 21:17:51] [INFO ] Deduced a trap composed of 6 places in 1560 ms of which 0 ms to minimize.
[2022-06-08 21:17:52] [INFO ] Deduced a trap composed of 6 places in 1197 ms of which 1 ms to minimize.
[2022-06-08 21:17:53] [INFO ] Deduced a trap composed of 6 places in 1196 ms of which 0 ms to minimize.
[2022-06-08 21:17:55] [INFO ] Deduced a trap composed of 7 places in 1155 ms of which 0 ms to minimize.
[2022-06-08 21:17:56] [INFO ] Deduced a trap composed of 14 places in 1196 ms of which 2 ms to minimize.
[2022-06-08 21:17:57] [INFO ] Deduced a trap composed of 6 places in 815 ms of which 1 ms to minimize.
[2022-06-08 21:17:58] [INFO ] Deduced a trap composed of 6 places in 921 ms of which 1 ms to minimize.
[2022-06-08 21:17:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 10 trap constraints in 15922 ms
[2022-06-08 21:17:58] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2022-06-08 21:17:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 21:17:59] [INFO ] [Real]Absence check using state equation in 977 ms returned sat
[2022-06-08 21:18:00] [INFO ] [Real]Added 4193 Read/Feed constraints in 887 ms returned sat
[2022-06-08 21:18:00] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 21:18:00] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2022-06-08 21:18:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 21:18:02] [INFO ] [Nat]Absence check using state equation in 1355 ms returned sat
[2022-06-08 21:18:03] [INFO ] [Nat]Added 4193 Read/Feed constraints in 829 ms returned sat
[2022-06-08 21:18:04] [INFO ] Deduced a trap composed of 12 places in 1612 ms of which 1 ms to minimize.
[2022-06-08 21:18:06] [INFO ] Deduced a trap composed of 13 places in 1791 ms of which 1 ms to minimize.
[2022-06-08 21:18:08] [INFO ] Deduced a trap composed of 10 places in 1410 ms of which 1 ms to minimize.
[2022-06-08 21:18:09] [INFO ] Deduced a trap composed of 9 places in 1349 ms of which 0 ms to minimize.
[2022-06-08 21:18:11] [INFO ] Deduced a trap composed of 9 places in 1191 ms of which 0 ms to minimize.
[2022-06-08 21:18:12] [INFO ] Deduced a trap composed of 8 places in 994 ms of which 1 ms to minimize.
[2022-06-08 21:18:13] [INFO ] Deduced a trap composed of 13 places in 766 ms of which 1 ms to minimize.
[2022-06-08 21:18:13] [INFO ] Deduced a trap composed of 10 places in 744 ms of which 1 ms to minimize.
[2022-06-08 21:18:14] [INFO ] Deduced a trap composed of 11 places in 637 ms of which 1 ms to minimize.
[2022-06-08 21:18:15] [INFO ] Deduced a trap composed of 11 places in 864 ms of which 0 ms to minimize.
[2022-06-08 21:18:16] [INFO ] Deduced a trap composed of 11 places in 639 ms of which 1 ms to minimize.
[2022-06-08 21:18:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 11 trap constraints in 13524 ms
[2022-06-08 21:18:16] [INFO ] [Real]Absence check using 10 positive place invariants in 8 ms returned sat
[2022-06-08 21:18:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 21:18:18] [INFO ] [Real]Absence check using state equation in 1414 ms returned sat
[2022-06-08 21:18:18] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 21:18:18] [INFO ] [Nat]Absence check using 10 positive place invariants in 7 ms returned sat
[2022-06-08 21:18:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 21:18:19] [INFO ] [Nat]Absence check using state equation in 1044 ms returned sat
[2022-06-08 21:18:20] [INFO ] [Nat]Added 4193 Read/Feed constraints in 760 ms returned sat
[2022-06-08 21:18:22] [INFO ] Deduced a trap composed of 8 places in 2161 ms of which 9 ms to minimize.
[2022-06-08 21:18:24] [INFO ] Deduced a trap composed of 10 places in 1766 ms of which 0 ms to minimize.
[2022-06-08 21:18:25] [INFO ] Deduced a trap composed of 8 places in 1414 ms of which 1 ms to minimize.
[2022-06-08 21:18:27] [INFO ] Deduced a trap composed of 11 places in 1223 ms of which 16 ms to minimize.
[2022-06-08 21:18:28] [INFO ] Deduced a trap composed of 7 places in 1042 ms of which 1 ms to minimize.
[2022-06-08 21:18:29] [INFO ] Deduced a trap composed of 6 places in 1239 ms of which 2 ms to minimize.
[2022-06-08 21:18:30] [INFO ] Deduced a trap composed of 11 places in 1053 ms of which 1 ms to minimize.
[2022-06-08 21:18:32] [INFO ] Deduced a trap composed of 7 places in 1040 ms of which 0 ms to minimize.
[2022-06-08 21:18:33] [INFO ] Deduced a trap composed of 11 places in 892 ms of which 1 ms to minimize.
[2022-06-08 21:18:33] [INFO ] Deduced a trap composed of 8 places in 786 ms of which 0 ms to minimize.
[2022-06-08 21:18:34] [INFO ] Deduced a trap composed of 8 places in 567 ms of which 0 ms to minimize.
[2022-06-08 21:18:35] [INFO ] Deduced a trap composed of 8 places in 429 ms of which 1 ms to minimize.
[2022-06-08 21:18:35] [INFO ] Deduced a trap composed of 10 places in 423 ms of which 1 ms to minimize.
[2022-06-08 21:18:36] [INFO ] Deduced a trap composed of 8 places in 418 ms of which 0 ms to minimize.
[2022-06-08 21:18:36] [INFO ] Deduced a trap composed of 8 places in 375 ms of which 1 ms to minimize.
[2022-06-08 21:18:37] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 17061 ms
[2022-06-08 21:18:38] [INFO ] Computed and/alt/rep : 166/250/166 causal constraints (skipped 4122 transitions) in 1578 ms.
[2022-06-08 21:18:49] [INFO ] Deduced a trap composed of 8 places in 381 ms of which 1 ms to minimize.
[2022-06-08 21:18:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 842 ms
[2022-06-08 21:18:49] [INFO ] Added : 163 causal constraints over 33 iterations in 12641 ms. Result :sat
FORMULA StigmergyCommit-PT-10a-ReachabilityCardinality-11 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyCommit-PT-10a-ReachabilityCardinality-10 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyCommit-PT-10a-ReachabilityCardinality-01 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 5 Parikh solutions to 2 different solutions.
Finished Parikh walk after 104 steps, including 0 resets, run visited all 2 properties in 76 ms. (steps per millisecond=1 )
FORMULA StigmergyCommit-PT-10a-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA StigmergyCommit-PT-10a-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.

BK_STOP 1654723131270

--------------------
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="StigmergyCommit-PT-10a"
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 StigmergyCommit-PT-10a, 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-165463878400083"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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