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.r233-tall-165286037000048.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 ShieldIIPs-PT-030B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r233-tall-165286037000048
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 8.5K Apr 29 15:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 99K Apr 29 15:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Apr 29 15:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Apr 29 15:01 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K May 9 08:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 08:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 9 08:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 14K May 9 08:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 29 15:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 151K Apr 29 15:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 29 15:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 92K Apr 29 15:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 503K May 10 09:34 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME ShieldIIPs-PT-030B-ReachabilityFireability-00
FORMULA_NAME ShieldIIPs-PT-030B-ReachabilityFireability-01
FORMULA_NAME ShieldIIPs-PT-030B-ReachabilityFireability-02
FORMULA_NAME ShieldIIPs-PT-030B-ReachabilityFireability-03
FORMULA_NAME ShieldIIPs-PT-030B-ReachabilityFireability-04
FORMULA_NAME ShieldIIPs-PT-030B-ReachabilityFireability-05
FORMULA_NAME ShieldIIPs-PT-030B-ReachabilityFireability-06
FORMULA_NAME ShieldIIPs-PT-030B-ReachabilityFireability-07
FORMULA_NAME ShieldIIPs-PT-030B-ReachabilityFireability-08
FORMULA_NAME ShieldIIPs-PT-030B-ReachabilityFireability-09
FORMULA_NAME ShieldIIPs-PT-030B-ReachabilityFireability-10
FORMULA_NAME ShieldIIPs-PT-030B-ReachabilityFireability-11
FORMULA_NAME ShieldIIPs-PT-030B-ReachabilityFireability-12
FORMULA_NAME ShieldIIPs-PT-030B-ReachabilityFireability-13
FORMULA_NAME ShieldIIPs-PT-030B-ReachabilityFireability-14
FORMULA_NAME ShieldIIPs-PT-030B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1655068577950

Running Version 0
[2022-06-12 21:16:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-12 21:16:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-12 21:16:19] [INFO ] Load time of PNML (sax parser for PT used): 133 ms
[2022-06-12 21:16:19] [INFO ] Transformed 1803 places.
[2022-06-12 21:16:19] [INFO ] Transformed 1773 transitions.
[2022-06-12 21:16:19] [INFO ] Found NUPN structural information;
[2022-06-12 21:16:19] [INFO ] Parsed PT model containing 1803 places and 1773 transitions in 232 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 16) seen :8
FORMULA ShieldIIPs-PT-030B-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030B-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030B-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030B-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030B-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030B-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030B-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030B-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 1773 rows 1803 cols
[2022-06-12 21:16:20] [INFO ] Computed 271 place invariants in 44 ms
[2022-06-12 21:16:20] [INFO ] [Real]Absence check using 271 positive place invariants in 188 ms returned sat
[2022-06-12 21:16:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:16:23] [INFO ] [Real]Absence check using state equation in 2383 ms returned sat
[2022-06-12 21:16:23] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:16:23] [INFO ] [Nat]Absence check using 271 positive place invariants in 185 ms returned sat
[2022-06-12 21:16:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:16:28] [INFO ] [Nat]Absence check using state equation in 4529 ms returned unknown
[2022-06-12 21:16:28] [INFO ] [Real]Absence check using 271 positive place invariants in 117 ms returned sat
[2022-06-12 21:16:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:16:30] [INFO ] [Real]Absence check using state equation in 1463 ms returned sat
[2022-06-12 21:16:30] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:16:30] [INFO ] [Nat]Absence check using 271 positive place invariants in 115 ms returned sat
[2022-06-12 21:16:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:16:32] [INFO ] [Nat]Absence check using state equation in 1553 ms returned sat
[2022-06-12 21:16:32] [INFO ] Deduced a trap composed of 26 places in 379 ms of which 3 ms to minimize.
[2022-06-12 21:16:33] [INFO ] Deduced a trap composed of 18 places in 354 ms of which 2 ms to minimize.
[2022-06-12 21:16:33] [INFO ] Deduced a trap composed of 15 places in 311 ms of which 1 ms to minimize.
[2022-06-12 21:16:33] [INFO ] Deduced a trap composed of 23 places in 302 ms of which 2 ms to minimize.
[2022-06-12 21:16:34] [INFO ] Deduced a trap composed of 27 places in 291 ms of which 1 ms to minimize.
[2022-06-12 21:16:34] [INFO ] Deduced a trap composed of 24 places in 287 ms of which 1 ms to minimize.
[2022-06-12 21:16:35] [INFO ] Deduced a trap composed of 21 places in 310 ms of which 1 ms to minimize.
[2022-06-12 21:16:35] [INFO ] Deduced a trap composed of 30 places in 309 ms of which 1 ms to minimize.
[2022-06-12 21:16: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-12 21:16:35] [INFO ] [Real]Absence check using 271 positive place invariants in 105 ms returned sat
[2022-06-12 21:16:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:16:36] [INFO ] [Real]Absence check using state equation in 738 ms returned sat
[2022-06-12 21:16:36] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:16:36] [INFO ] [Nat]Absence check using 271 positive place invariants in 99 ms returned sat
[2022-06-12 21:16:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:16:37] [INFO ] [Nat]Absence check using state equation in 737 ms returned sat
[2022-06-12 21:16:38] [INFO ] Deduced a trap composed of 24 places in 437 ms of which 1 ms to minimize.
[2022-06-12 21:16:38] [INFO ] Deduced a trap composed of 19 places in 458 ms of which 1 ms to minimize.
[2022-06-12 21:16:39] [INFO ] Deduced a trap composed of 17 places in 436 ms of which 1 ms to minimize.
[2022-06-12 21:16:39] [INFO ] Deduced a trap composed of 33 places in 421 ms of which 2 ms to minimize.
[2022-06-12 21:16:40] [INFO ] Deduced a trap composed of 18 places in 434 ms of which 1 ms to minimize.
[2022-06-12 21:16:40] [INFO ] Deduced a trap composed of 34 places in 442 ms of which 1 ms to minimize.
[2022-06-12 21:16:41] [INFO ] Deduced a trap composed of 19 places in 451 ms of which 1 ms to minimize.
[2022-06-12 21:16:41] [INFO ] Deduced a trap composed of 22 places in 441 ms of which 1 ms to minimize.
[2022-06-12 21:16: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 2
[2022-06-12 21:16:42] [INFO ] [Real]Absence check using 271 positive place invariants in 106 ms returned sat
[2022-06-12 21:16:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:16:43] [INFO ] [Real]Absence check using state equation in 1045 ms returned sat
[2022-06-12 21:16:43] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:16:43] [INFO ] [Nat]Absence check using 271 positive place invariants in 107 ms returned sat
[2022-06-12 21:16:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:16:44] [INFO ] [Nat]Absence check using state equation in 1120 ms returned sat
[2022-06-12 21:16:45] [INFO ] Deduced a trap composed of 22 places in 349 ms of which 1 ms to minimize.
[2022-06-12 21:16:45] [INFO ] Deduced a trap composed of 14 places in 321 ms of which 1 ms to minimize.
[2022-06-12 21:16:45] [INFO ] Deduced a trap composed of 20 places in 365 ms of which 1 ms to minimize.
[2022-06-12 21:16:46] [INFO ] Deduced a trap composed of 30 places in 333 ms of which 1 ms to minimize.
[2022-06-12 21:16:46] [INFO ] Deduced a trap composed of 22 places in 337 ms of which 1 ms to minimize.
[2022-06-12 21:16:47] [INFO ] Deduced a trap composed of 23 places in 333 ms of which 1 ms to minimize.
[2022-06-12 21:16:47] [INFO ] Deduced a trap composed of 21 places in 326 ms of which 1 ms to minimize.
[2022-06-12 21:16:47] [INFO ] Deduced a trap composed of 39 places in 310 ms of which 1 ms to minimize.
[2022-06-12 21:16:48] [INFO ] Deduced a trap composed of 37 places in 343 ms of which 1 ms to minimize.
[2022-06-12 21:16: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 3
[2022-06-12 21:16:48] [INFO ] [Real]Absence check using 271 positive place invariants in 107 ms returned sat
[2022-06-12 21:16:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:16:49] [INFO ] [Real]Absence check using state equation in 1006 ms returned sat
[2022-06-12 21:16:49] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:16:50] [INFO ] [Nat]Absence check using 271 positive place invariants in 107 ms returned sat
[2022-06-12 21:16:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:16:52] [INFO ] [Nat]Absence check using state equation in 2616 ms returned sat
[2022-06-12 21:16:53] [INFO ] Deduced a trap composed of 19 places in 494 ms of which 1 ms to minimize.
[2022-06-12 21:16:53] [INFO ] Deduced a trap composed of 16 places in 486 ms of which 1 ms to minimize.
[2022-06-12 21:16:54] [INFO ] Deduced a trap composed of 25 places in 480 ms of which 1 ms to minimize.
[2022-06-12 21:16:54] [INFO ] Deduced a trap composed of 31 places in 490 ms of which 4 ms to minimize.
[2022-06-12 21:16:54] [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-12 21:16:55] [INFO ] [Real]Absence check using 271 positive place invariants in 114 ms returned sat
[2022-06-12 21:16:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:16:56] [INFO ] [Real]Absence check using state equation in 1240 ms returned sat
[2022-06-12 21:16:56] [INFO ] Deduced a trap composed of 17 places in 302 ms of which 2 ms to minimize.
[2022-06-12 21:16:57] [INFO ] Deduced a trap composed of 21 places in 318 ms of which 1 ms to minimize.
[2022-06-12 21:16:57] [INFO ] Deduced a trap composed of 22 places in 343 ms of which 1 ms to minimize.
[2022-06-12 21:16:58] [INFO ] Deduced a trap composed of 20 places in 301 ms of which 1 ms to minimize.
[2022-06-12 21:16:58] [INFO ] Deduced a trap composed of 28 places in 296 ms of which 5 ms to minimize.
[2022-06-12 21:16:58] [INFO ] Deduced a trap composed of 50 places in 299 ms of which 1 ms to minimize.
[2022-06-12 21:16:59] [INFO ] Deduced a trap composed of 37 places in 293 ms of which 1 ms to minimize.
[2022-06-12 21:16:59] [INFO ] Deduced a trap composed of 22 places in 287 ms of which 0 ms to minimize.
[2022-06-12 21:16:59] [INFO ] Deduced a trap composed of 23 places in 283 ms of which 1 ms to minimize.
[2022-06-12 21:17:00] [INFO ] Deduced a trap composed of 17 places in 766 ms of which 12 ms to minimize.
[2022-06-12 21:17:00] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 5
[2022-06-12 21:17:01] [INFO ] [Real]Absence check using 271 positive place invariants in 115 ms returned sat
[2022-06-12 21:17:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:17:02] [INFO ] [Real]Absence check using state equation in 1096 ms returned sat
[2022-06-12 21:17:02] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:17:02] [INFO ] [Nat]Absence check using 271 positive place invariants in 114 ms returned sat
[2022-06-12 21:17:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:17:03] [INFO ] [Nat]Absence check using state equation in 1147 ms returned sat
[2022-06-12 21:17:04] [INFO ] Deduced a trap composed of 31 places in 390 ms of which 2 ms to minimize.
[2022-06-12 21:17:04] [INFO ] Deduced a trap composed of 20 places in 357 ms of which 1 ms to minimize.
[2022-06-12 21:17:05] [INFO ] Deduced a trap composed of 20 places in 364 ms of which 4 ms to minimize.
[2022-06-12 21:17:05] [INFO ] Deduced a trap composed of 29 places in 356 ms of which 2 ms to minimize.
[2022-06-12 21:17:05] [INFO ] Deduced a trap composed of 11 places in 343 ms of which 1 ms to minimize.
[2022-06-12 21:17:06] [INFO ] Deduced a trap composed of 18 places in 371 ms of which 1 ms to minimize.
[2022-06-12 21:17:06] [INFO ] Deduced a trap composed of 35 places in 367 ms of which 1 ms to minimize.
[2022-06-12 21:17:07] [INFO ] Deduced a trap composed of 27 places in 364 ms of which 2 ms to minimize.
[2022-06-12 21:17:07] [INFO ] Deduced a trap composed of 24 places in 358 ms of which 1 ms to minimize.
[2022-06-12 21:17:07] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 6
[2022-06-12 21:17:07] [INFO ] [Real]Absence check using 271 positive place invariants in 110 ms returned sat
[2022-06-12 21:17:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:17:09] [INFO ] [Real]Absence check using state equation in 1140 ms returned sat
[2022-06-12 21:17:09] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:17:09] [INFO ] [Nat]Absence check using 271 positive place invariants in 126 ms returned sat
[2022-06-12 21:17:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:17:10] [INFO ] [Nat]Absence check using state equation in 1092 ms returned sat
[2022-06-12 21:17:11] [INFO ] Deduced a trap composed of 26 places in 393 ms of which 1 ms to minimize.
[2022-06-12 21:17:11] [INFO ] Deduced a trap composed of 21 places in 349 ms of which 1 ms to minimize.
[2022-06-12 21:17:11] [INFO ] Deduced a trap composed of 22 places in 331 ms of which 1 ms to minimize.
[2022-06-12 21:17:12] [INFO ] Deduced a trap composed of 33 places in 319 ms of which 1 ms to minimize.
[2022-06-12 21:17:12] [INFO ] Deduced a trap composed of 28 places in 319 ms of which 1 ms to minimize.
[2022-06-12 21:17:13] [INFO ] Deduced a trap composed of 34 places in 295 ms of which 1 ms to minimize.
[2022-06-12 21:17:13] [INFO ] Deduced a trap composed of 17 places in 328 ms of which 0 ms to minimize.
[2022-06-12 21:17:13] [INFO ] Deduced a trap composed of 28 places in 290 ms of which 1 ms to minimize.
[2022-06-12 21:17:14] [INFO ] Deduced a trap composed of 35 places in 306 ms of which 0 ms to minimize.
[2022-06-12 21:17:14] [INFO ] Deduced a trap composed of 17 places in 744 ms of which 5 ms to minimize.
[2022-06-12 21:17:14] [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
Fused 8 Parikh solutions to 1 different solutions.
Support contains 323 out of 1803 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1803/1803 places, 1773/1773 transitions.
Drop transitions removed 99 transitions
Trivial Post-agglo rules discarded 99 transitions
Performed 99 trivial Post agglomeration. Transition count delta: 99
Iterating post reduction 0 with 99 rules applied. Total rules applied 99 place count 1803 transition count 1674
Reduce places removed 99 places and 0 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 1 with 108 rules applied. Total rules applied 207 place count 1704 transition count 1665
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 216 place count 1695 transition count 1665
Performed 124 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 124 Pre rules applied. Total rules applied 216 place count 1695 transition count 1541
Deduced a syphon composed of 124 places in 3 ms
Reduce places removed 124 places and 0 transitions.
Iterating global reduction 3 with 248 rules applied. Total rules applied 464 place count 1571 transition count 1541
Discarding 158 places :
Symmetric choice reduction at 3 with 158 rule applications. Total rules 622 place count 1413 transition count 1383
Iterating global reduction 3 with 158 rules applied. Total rules applied 780 place count 1413 transition count 1383
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 35 Pre rules applied. Total rules applied 780 place count 1413 transition count 1348
Deduced a syphon composed of 35 places in 7 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 850 place count 1378 transition count 1348
Performed 340 Post agglomeration using F-continuation condition.Transition count delta: 340
Deduced a syphon composed of 340 places in 2 ms
Reduce places removed 340 places and 0 transitions.
Iterating global reduction 3 with 680 rules applied. Total rules applied 1530 place count 1038 transition count 1008
Partial Free-agglomeration rule applied 115 times.
Drop transitions removed 115 transitions
Iterating global reduction 3 with 115 rules applied. Total rules applied 1645 place count 1038 transition count 1008
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1646 place count 1037 transition count 1007
Applied a total of 1646 rules in 600 ms. Remains 1037 /1803 variables (removed 766) and now considering 1007/1773 (removed 766) transitions.
Finished structural reductions, in 1 iterations. Remains : 1037/1803 places, 1007/1773 transitions.
[2022-06-12 21:17:15] [INFO ] Flatten gal took : 128 ms
[2022-06-12 21:17:15] [INFO ] Flatten gal took : 72 ms
[2022-06-12 21:17:15] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13530198793012379619.gal : 29 ms
[2022-06-12 21:17:15] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3863319681028405043.prop : 3 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/ReachabilityCardinality13530198793012379619.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality3863319681028405043.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/ReachabilityCardinality13530198793012379619.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality3863319681028405043.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality3863319681028405043.prop.
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,8 properties remain. new max is 8
SDD size :5 after 8
SDD proceeding with computation,8 properties remain. new max is 16
SDD size :8 after 10
SDD proceeding with computation,8 properties remain. new max is 32
SDD size :10 after 62
SDD proceeding with computation,8 properties remain. new max is 64
SDD size :62 after 1307
SDD proceeding with computation,8 properties remain. new max is 128
SDD size :1307 after 312574
SDD proceeding with computation,8 properties remain. new max is 256
SDD size :312574 after 7.99379e+10
SDD proceeding with computation,8 properties remain. new max is 512
SDD size :7.99379e+10 after 4.97781e+22
SDD proceeding with computation,8 properties remain. new max is 1024
SDD size :3.7812e+35 after 5.79042e+35
SDD proceeding with computation,8 properties remain. new max is 2048
SDD size :5.79042e+35 after 5.79042e+35
SDD proceeding with computation,8 properties remain. new max is 4096
SDD size :5.79042e+35 after 5.79042e+35
SDD proceeding with computation,8 properties remain. new max is 8192
SDD size :5.79042e+35 after 5.79042e+35
SDD proceeding with computation,8 properties remain. new max is 16384
SDD size :5.79042e+35 after 5.79042e+35
SDD proceeding with computation,8 properties remain. new max is 32768
SDD size :5.79042e+35 after 5.79042e+35
SDD proceeding with computation,8 properties remain. new max is 65536
SDD size :5.79042e+35 after 5.79042e+35
Detected timeout of ITS tools.
[2022-06-12 21:17:31] [INFO ] Flatten gal took : 78 ms
[2022-06-12 21:17:31] [INFO ] Applying decomposition
[2022-06-12 21:17:31] [INFO ] Flatten gal took : 56 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph9638535063804787447.txt, -o, /tmp/graph9638535063804787447.bin, -w, /tmp/graph9638535063804787447.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/graph9638535063804787447.bin, -l, -1, -v, -w, /tmp/graph9638535063804787447.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-12 21:17:31] [INFO ] Decomposing Gal with order
[2022-06-12 21:17:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-12 21:17:31] [INFO ] Removed a total of 692 redundant transitions.
[2022-06-12 21:17:31] [INFO ] Flatten gal took : 159 ms
[2022-06-12 21:17:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 290 labels/synchronizations in 63 ms.
[2022-06-12 21:17:31] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6609880338736539139.gal : 19 ms
[2022-06-12 21:17:31] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4164689276733159183.prop : 11 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/ReachabilityCardinality6609880338736539139.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality4164689276733159183.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/ReachabilityCardinality6609880338736539139.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality4164689276733159183.prop --nowitness
Loading property file /tmp/ReachabilityCardinality4164689276733159183.prop.
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,8 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,8 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,8 properties remain. new max is 32
SDD size :1 after 58615
SDD proceeding with computation,8 properties remain. new max is 64
SDD size :58615 after 3.28394e+11
SDD proceeding with computation,8 properties remain. new max is 128
SDD size :3.28394e+11 after 3.78313e+24
SDD proceeding with computation,8 properties remain. new max is 256
SDD size :6.4616e+36 after 3.72123e+51
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12372873836103900601
[2022-06-12 21:17:46] [INFO ] Built C files in 38ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12372873836103900601
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/ltsmin12372873836103900601]
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/ltsmin12372873836103900601] 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/ltsmin12372873836103900601] 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 392 resets, run finished after 7091 ms. (steps per millisecond=141 ) properties (out of 8) seen :3
FORMULA ShieldIIPs-PT-030B-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030B-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030B-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Interrupted Best-First random walk after 816582 steps, including 18 resets, run timeout after 5001 ms. (steps per millisecond=163 ) properties seen :{}
Interrupted Best-First random walk after 925165 steps, including 22 resets, run timeout after 5001 ms. (steps per millisecond=184 ) properties seen :{}
Incomplete Best-First random walk after 1000001 steps, including 20 resets, run finished after 3728 ms. (steps per millisecond=268 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 20 resets, run finished after 4483 ms. (steps per millisecond=223 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 20 resets, run finished after 4662 ms. (steps per millisecond=214 ) properties (out of 5) seen :1
FORMULA ShieldIIPs-PT-030B-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 4 properties.
// Phase 1: matrix 1007 rows 1037 cols
[2022-06-12 21:18:17] [INFO ] Computed 271 place invariants in 18 ms
[2022-06-12 21:18:18] [INFO ] [Real]Absence check using 271 positive place invariants in 104 ms returned sat
[2022-06-12 21:18:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:18:18] [INFO ] [Real]Absence check using state equation in 679 ms returned sat
[2022-06-12 21:18:18] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:18:19] [INFO ] [Nat]Absence check using 271 positive place invariants in 76 ms returned sat
[2022-06-12 21:18:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:18:19] [INFO ] [Nat]Absence check using state equation in 675 ms returned sat
[2022-06-12 21:18:20] [INFO ] Deduced a trap composed of 7 places in 251 ms of which 1 ms to minimize.
[2022-06-12 21:18:20] [INFO ] Deduced a trap composed of 8 places in 231 ms of which 0 ms to minimize.
[2022-06-12 21:18:20] [INFO ] Deduced a trap composed of 7 places in 100 ms of which 0 ms to minimize.
[2022-06-12 21:18:20] [INFO ] Deduced a trap composed of 8 places in 134 ms of which 1 ms to minimize.
[2022-06-12 21:18:20] [INFO ] Deduced a trap composed of 11 places in 93 ms of which 1 ms to minimize.
[2022-06-12 21:18:20] [INFO ] Deduced a trap composed of 7 places in 86 ms of which 0 ms to minimize.
[2022-06-12 21:18:20] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 0 ms to minimize.
[2022-06-12 21:18:21] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 1 ms to minimize.
[2022-06-12 21:18:21] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 0 ms to minimize.
[2022-06-12 21:18:21] [INFO ] Deduced a trap composed of 7 places in 66 ms of which 0 ms to minimize.
[2022-06-12 21:18:21] [INFO ] Deduced a trap composed of 12 places in 77 ms of which 0 ms to minimize.
[2022-06-12 21:18:21] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 1 ms to minimize.
[2022-06-12 21:18:21] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 0 ms to minimize.
[2022-06-12 21:18:21] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 0 ms to minimize.
[2022-06-12 21:18:21] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 0 ms to minimize.
[2022-06-12 21:18:21] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 0 ms to minimize.
[2022-06-12 21:18:21] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 0 ms to minimize.
[2022-06-12 21:18:22] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 0 ms to minimize.
[2022-06-12 21:18:22] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 2387 ms
[2022-06-12 21:18:22] [INFO ] Computed and/alt/rep : 996/3835/996 causal constraints (skipped 6 transitions) in 56 ms.
[2022-06-12 21:18:42] [INFO ] Added : 910 causal constraints over 182 iterations in 20242 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 72 ms.
[2022-06-12 21:18:42] [INFO ] [Real]Absence check using 271 positive place invariants in 61 ms returned sat
[2022-06-12 21:18:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:18:43] [INFO ] [Real]Absence check using state equation in 512 ms returned sat
[2022-06-12 21:18:43] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:18:43] [INFO ] [Nat]Absence check using 271 positive place invariants in 62 ms returned sat
[2022-06-12 21:18:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:18:43] [INFO ] [Nat]Absence check using state equation in 530 ms returned sat
[2022-06-12 21:18:44] [INFO ] Deduced a trap composed of 14 places in 142 ms of which 11 ms to minimize.
[2022-06-12 21:18:44] [INFO ] Deduced a trap composed of 6 places in 129 ms of which 1 ms to minimize.
[2022-06-12 21:18:44] [INFO ] Deduced a trap composed of 20 places in 126 ms of which 1 ms to minimize.
[2022-06-12 21:18:44] [INFO ] Deduced a trap composed of 24 places in 117 ms of which 1 ms to minimize.
[2022-06-12 21:18:44] [INFO ] Deduced a trap composed of 17 places in 131 ms of which 1 ms to minimize.
[2022-06-12 21:18:44] [INFO ] Deduced a trap composed of 11 places in 115 ms of which 1 ms to minimize.
[2022-06-12 21:18:45] [INFO ] Deduced a trap composed of 19 places in 98 ms of which 1 ms to minimize.
[2022-06-12 21:18:45] [INFO ] Deduced a trap composed of 9 places in 95 ms of which 0 ms to minimize.
[2022-06-12 21:18:45] [INFO ] Deduced a trap composed of 17 places in 86 ms of which 0 ms to minimize.
[2022-06-12 21:18:45] [INFO ] Deduced a trap composed of 9 places in 95 ms of which 0 ms to minimize.
[2022-06-12 21:18:45] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 0 ms to minimize.
[2022-06-12 21:18:45] [INFO ] Deduced a trap composed of 14 places in 87 ms of which 0 ms to minimize.
[2022-06-12 21:18:45] [INFO ] Deduced a trap composed of 11 places in 85 ms of which 0 ms to minimize.
[2022-06-12 21:18:45] [INFO ] Deduced a trap composed of 13 places in 85 ms of which 0 ms to minimize.
[2022-06-12 21:18:46] [INFO ] Deduced a trap composed of 19 places in 80 ms of which 1 ms to minimize.
[2022-06-12 21:18:46] [INFO ] Deduced a trap composed of 12 places in 62 ms of which 0 ms to minimize.
[2022-06-12 21:18:46] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 0 ms to minimize.
[2022-06-12 21:18:46] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 1 ms to minimize.
[2022-06-12 21:18:46] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 1 ms to minimize.
[2022-06-12 21:18:46] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 0 ms to minimize.
[2022-06-12 21:18:46] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 1 ms to minimize.
[2022-06-12 21:18:46] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 0 ms to minimize.
[2022-06-12 21:18:46] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 0 ms to minimize.
[2022-06-12 21:18:46] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 2984 ms
[2022-06-12 21:18:46] [INFO ] Computed and/alt/rep : 996/3835/996 causal constraints (skipped 6 transitions) in 50 ms.
[2022-06-12 21:19:07] [INFO ] Added : 875 causal constraints over 175 iterations in 20188 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 59 ms.
[2022-06-12 21:19:07] [INFO ] [Real]Absence check using 271 positive place invariants in 49 ms returned sat
[2022-06-12 21:19:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:19:07] [INFO ] [Real]Absence check using state equation in 351 ms returned sat
[2022-06-12 21:19:07] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:19:07] [INFO ] [Nat]Absence check using 271 positive place invariants in 51 ms returned sat
[2022-06-12 21:19:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:19:08] [INFO ] [Nat]Absence check using state equation in 342 ms returned sat
[2022-06-12 21:19:08] [INFO ] Deduced a trap composed of 7 places in 158 ms of which 0 ms to minimize.
[2022-06-12 21:19:08] [INFO ] Deduced a trap composed of 10 places in 156 ms of which 1 ms to minimize.
[2022-06-12 21:19:08] [INFO ] Deduced a trap composed of 6 places in 156 ms of which 1 ms to minimize.
[2022-06-12 21:19:09] [INFO ] Deduced a trap composed of 14 places in 163 ms of which 0 ms to minimize.
[2022-06-12 21:19:09] [INFO ] Deduced a trap composed of 14 places in 188 ms of which 0 ms to minimize.
[2022-06-12 21:19:09] [INFO ] Deduced a trap composed of 7 places in 175 ms of which 0 ms to minimize.
[2022-06-12 21:19:09] [INFO ] Deduced a trap composed of 23 places in 166 ms of which 0 ms to minimize.
[2022-06-12 21:19:09] [INFO ] Deduced a trap composed of 9 places in 147 ms of which 0 ms to minimize.
[2022-06-12 21:19:10] [INFO ] Deduced a trap composed of 18 places in 144 ms of which 0 ms to minimize.
[2022-06-12 21:19:10] [INFO ] Deduced a trap composed of 8 places in 121 ms of which 1 ms to minimize.
[2022-06-12 21:19:10] [INFO ] Deduced a trap composed of 7 places in 137 ms of which 1 ms to minimize.
[2022-06-12 21:19:10] [INFO ] Deduced a trap composed of 23 places in 137 ms of which 0 ms to minimize.
[2022-06-12 21:19:10] [INFO ] Deduced a trap composed of 8 places in 133 ms of which 0 ms to minimize.
[2022-06-12 21:19:10] [INFO ] Deduced a trap composed of 13 places in 109 ms of which 1 ms to minimize.
[2022-06-12 21:19:11] [INFO ] Deduced a trap composed of 10 places in 129 ms of which 1 ms to minimize.
[2022-06-12 21:19:11] [INFO ] Deduced a trap composed of 8 places in 131 ms of which 0 ms to minimize.
[2022-06-12 21:19:11] [INFO ] Deduced a trap composed of 8 places in 128 ms of which 0 ms to minimize.
[2022-06-12 21:19:11] [INFO ] Deduced a trap composed of 14 places in 117 ms of which 0 ms to minimize.
[2022-06-12 21:19:11] [INFO ] Deduced a trap composed of 19 places in 118 ms of which 1 ms to minimize.
[2022-06-12 21:19:11] [INFO ] Deduced a trap composed of 8 places in 117 ms of which 0 ms to minimize.
[2022-06-12 21:19:12] [INFO ] Deduced a trap composed of 11 places in 99 ms of which 0 ms to minimize.
[2022-06-12 21:19:12] [INFO ] Deduced a trap composed of 19 places in 90 ms of which 1 ms to minimize.
[2022-06-12 21:19:12] [INFO ] Deduced a trap composed of 17 places in 102 ms of which 1 ms to minimize.
[2022-06-12 21:19:12] [INFO ] Deduced a trap composed of 15 places in 93 ms of which 0 ms to minimize.
[2022-06-12 21:19:12] [INFO ] Deduced a trap composed of 22 places in 103 ms of which 0 ms to minimize.
[2022-06-12 21:19:12] [INFO ] Deduced a trap composed of 19 places in 99 ms of which 1 ms to minimize.
[2022-06-12 21:19:12] [INFO ] Deduced a trap composed of 12 places in 85 ms of which 0 ms to minimize.
[2022-06-12 21:19:12] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 1 ms to minimize.
[2022-06-12 21:19:13] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 1 ms to minimize.
[2022-06-12 21:19:13] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 0 ms to minimize.
[2022-06-12 21:19:13] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 0 ms to minimize.
[2022-06-12 21:19:13] [INFO ] Trap strengthening (SAT) tested/added 32/31 trap constraints in 5129 ms
[2022-06-12 21:19:13] [INFO ] Computed and/alt/rep : 996/3835/996 causal constraints (skipped 6 transitions) in 52 ms.
[2022-06-12 21:19:22] [INFO ] Added : 600 causal constraints over 120 iterations in 8809 ms. Result :unsat
[2022-06-12 21:19:22] [INFO ] [Real]Absence check using 271 positive place invariants in 59 ms returned sat
[2022-06-12 21:19:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:19:22] [INFO ] [Real]Absence check using state equation in 429 ms returned sat
[2022-06-12 21:19:22] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:19:22] [INFO ] [Nat]Absence check using 271 positive place invariants in 54 ms returned sat
[2022-06-12 21:19:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:19:23] [INFO ] [Nat]Absence check using state equation in 412 ms returned sat
[2022-06-12 21:19:23] [INFO ] Deduced a trap composed of 7 places in 196 ms of which 0 ms to minimize.
[2022-06-12 21:19:23] [INFO ] Deduced a trap composed of 7 places in 165 ms of which 0 ms to minimize.
[2022-06-12 21:19:24] [INFO ] Deduced a trap composed of 12 places in 171 ms of which 0 ms to minimize.
[2022-06-12 21:19:24] [INFO ] Deduced a trap composed of 12 places in 163 ms of which 1 ms to minimize.
[2022-06-12 21:19:24] [INFO ] Deduced a trap composed of 8 places in 200 ms of which 0 ms to minimize.
[2022-06-12 21:19:24] [INFO ] Deduced a trap composed of 15 places in 156 ms of which 1 ms to minimize.
[2022-06-12 21:19:24] [INFO ] Deduced a trap composed of 16 places in 158 ms of which 0 ms to minimize.
[2022-06-12 21:19:25] [INFO ] Deduced a trap composed of 12 places in 155 ms of which 0 ms to minimize.
[2022-06-12 21:19:25] [INFO ] Deduced a trap composed of 9 places in 152 ms of which 1 ms to minimize.
[2022-06-12 21:19:25] [INFO ] Deduced a trap composed of 9 places in 185 ms of which 0 ms to minimize.
[2022-06-12 21:19:25] [INFO ] Deduced a trap composed of 13 places in 177 ms of which 0 ms to minimize.
[2022-06-12 21:19:25] [INFO ] Deduced a trap composed of 12 places in 161 ms of which 1 ms to minimize.
[2022-06-12 21:19:26] [INFO ] Deduced a trap composed of 12 places in 155 ms of which 0 ms to minimize.
[2022-06-12 21:19:26] [INFO ] Deduced a trap composed of 12 places in 149 ms of which 0 ms to minimize.
[2022-06-12 21:19:26] [INFO ] Deduced a trap composed of 14 places in 172 ms of which 0 ms to minimize.
[2022-06-12 21:19:26] [INFO ] Deduced a trap composed of 16 places in 167 ms of which 1 ms to minimize.
[2022-06-12 21:19:26] [INFO ] Deduced a trap composed of 13 places in 155 ms of which 1 ms to minimize.
[2022-06-12 21:19:27] [INFO ] Deduced a trap composed of 10 places in 162 ms of which 1 ms to minimize.
[2022-06-12 21:19:27] [INFO ] Deduced a trap composed of 15 places in 165 ms of which 0 ms to minimize.
[2022-06-12 21:19:27] [INFO ] Deduced a trap composed of 17 places in 175 ms of which 1 ms to minimize.
[2022-06-12 21:19:27] [INFO ] Deduced a trap composed of 15 places in 165 ms of which 1 ms to minimize.
[2022-06-12 21:19:28] [INFO ] Deduced a trap composed of 16 places in 154 ms of which 1 ms to minimize.
[2022-06-12 21:19:28] [INFO ] Deduced a trap composed of 13 places in 163 ms of which 1 ms to minimize.
[2022-06-12 21:19:28] [INFO ] Deduced a trap composed of 15 places in 169 ms of which 0 ms to minimize.
[2022-06-12 21:19:28] [INFO ] Deduced a trap composed of 15 places in 157 ms of which 0 ms to minimize.
[2022-06-12 21:19:28] [INFO ] Deduced a trap composed of 22 places in 183 ms of which 1 ms to minimize.
[2022-06-12 21:19:29] [INFO ] Deduced a trap composed of 20 places in 130 ms of which 0 ms to minimize.
[2022-06-12 21:19:29] [INFO ] Deduced a trap composed of 15 places in 135 ms of which 0 ms to minimize.
[2022-06-12 21:19:29] [INFO ] Deduced a trap composed of 19 places in 121 ms of which 0 ms to minimize.
[2022-06-12 21:19:29] [INFO ] Deduced a trap composed of 17 places in 137 ms of which 1 ms to minimize.
[2022-06-12 21:19:29] [INFO ] Deduced a trap composed of 20 places in 129 ms of which 0 ms to minimize.
[2022-06-12 21:19:29] [INFO ] Deduced a trap composed of 15 places in 117 ms of which 0 ms to minimize.
[2022-06-12 21:19:29] [INFO ] Deduced a trap composed of 21 places in 123 ms of which 0 ms to minimize.
[2022-06-12 21:19:30] [INFO ] Deduced a trap composed of 25 places in 115 ms of which 0 ms to minimize.
[2022-06-12 21:19:30] [INFO ] Deduced a trap composed of 18 places in 113 ms of which 1 ms to minimize.
[2022-06-12 21:19:30] [INFO ] Trap strengthening (SAT) tested/added 36/35 trap constraints in 6917 ms
[2022-06-12 21:19:30] [INFO ] Computed and/alt/rep : 996/3835/996 causal constraints (skipped 6 transitions) in 52 ms.
[2022-06-12 21:19:48] [INFO ] Added : 875 causal constraints over 175 iterations in 18638 ms. Result :unsat
FORMULA ShieldIIPs-PT-030B-ReachabilityFireability-04 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ShieldIIPs-PT-030B-ReachabilityFireability-03 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 4 Parikh solutions to 2 different solutions.
Incomplete Parikh walk after 149800 steps, including 448 resets, run finished after 805 ms. (steps per millisecond=186 ) properties (out of 2) seen :0 could not realise parikh vector
Incomplete Parikh walk after 177300 steps, including 884 resets, run finished after 955 ms. (steps per millisecond=185 ) properties (out of 2) seen :0 could not realise parikh vector
Support contains 157 out of 1037 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1037/1037 places, 1007/1007 transitions.
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 1037 transition count 994
Reduce places removed 13 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 16 rules applied. Total rules applied 29 place count 1024 transition count 991
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 32 place count 1021 transition count 991
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 27 Pre rules applied. Total rules applied 32 place count 1021 transition count 964
Deduced a syphon composed of 27 places in 2 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 54 rules applied. Total rules applied 86 place count 994 transition count 964
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 92 place count 988 transition count 958
Iterating global reduction 3 with 6 rules applied. Total rules applied 98 place count 988 transition count 958
Performed 92 Post agglomeration using F-continuation condition.Transition count delta: 92
Deduced a syphon composed of 92 places in 2 ms
Reduce places removed 92 places and 0 transitions.
Iterating global reduction 3 with 184 rules applied. Total rules applied 282 place count 896 transition count 866
Partial Free-agglomeration rule applied 57 times.
Drop transitions removed 57 transitions
Iterating global reduction 3 with 57 rules applied. Total rules applied 339 place count 896 transition count 866
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 340 place count 895 transition count 865
Applied a total of 340 rules in 247 ms. Remains 895 /1037 variables (removed 142) and now considering 865/1007 (removed 142) transitions.
Finished structural reductions, in 1 iterations. Remains : 895/1037 places, 865/1007 transitions.
[2022-06-12 21:19:51] [INFO ] Flatten gal took : 38 ms
[2022-06-12 21:19:51] [INFO ] Flatten gal took : 37 ms
[2022-06-12 21:19:51] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4229181858788800569.gal : 5 ms
[2022-06-12 21:19:51] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14538188354484859166.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/ReachabilityCardinality4229181858788800569.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality14538188354484859166.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/ReachabilityCardinality4229181858788800569.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality14538188354484859166.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality14538188354484859166.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :5 after 8
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :8 after 16
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :16 after 36
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :36 after 60
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :60 after 1116
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :1116 after 11062
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :11062 after 119452
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :119452 after 7.16688e+06
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :7.16688e+06 after 4.10217e+19
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :4.10217e+19 after 4.10217e+19
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :4.10217e+19 after 4.10217e+19
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :4.10217e+19 after 4.10217e+19
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :4.10217e+19 after 4.10217e+19
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :4.10217e+19 after 4.10217e+19
SDD proceeding with computation,2 properties remain. new max is 131072
SDD size :4.10217e+19 after 4.10217e+19
Detected timeout of ITS tools.
[2022-06-12 21:20:06] [INFO ] Flatten gal took : 37 ms
[2022-06-12 21:20:06] [INFO ] Applying decomposition
[2022-06-12 21:20:06] [INFO ] Flatten gal took : 36 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/graph15650205740170556587.txt, -o, /tmp/graph15650205740170556587.bin, -w, /tmp/graph15650205740170556587.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/graph15650205740170556587.bin, -l, -1, -v, -w, /tmp/graph15650205740170556587.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-12 21:20:06] [INFO ] Decomposing Gal with order
[2022-06-12 21:20:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-12 21:20:06] [INFO ] Removed a total of 652 redundant transitions.
[2022-06-12 21:20:06] [INFO ] Flatten gal took : 68 ms
[2022-06-12 21:20:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 547 labels/synchronizations in 69 ms.
[2022-06-12 21:20:06] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6927877821233678984.gal : 12 ms
[2022-06-12 21:20:06] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7756085803843800314.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/ReachabilityCardinality6927877821233678984.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality7756085803843800314.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/ReachabilityCardinality6927877821233678984.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality7756085803843800314.prop --nowitness
Loading property file /tmp/ReachabilityCardinality7756085803843800314.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 1
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :1 after 13
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :13 after 553
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :553 after 8.60029e+07
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :8.60029e+07 after 1.72005e+09
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :1.72005e+09 after 1.36486e+15
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2501234035413114533
[2022-06-12 21:20:21] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2501234035413114533
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/ltsmin2501234035413114533]
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/ltsmin2501234035413114533] 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/ltsmin2501234035413114533] 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 414 resets, run finished after 7206 ms. (steps per millisecond=138 ) properties (out of 2) seen :0
Interrupted Best-First random walk after 814588 steps, including 23 resets, run timeout after 5001 ms. (steps per millisecond=162 ) properties seen :{}
Interrupted Best-First random walk after 939547 steps, including 27 resets, run timeout after 5001 ms. (steps per millisecond=187 ) properties seen :{}
Interrupted probabilistic random walk after 2196690 steps, run timeout after 30001 ms. (steps per millisecond=73 ) properties seen :{}
Probabilistic random walk after 2196690 steps, saw 425938 distinct states, run finished after 30001 ms. (steps per millisecond=73 ) properties seen :{}
Running SMT prover for 2 properties.
// Phase 1: matrix 865 rows 895 cols
[2022-06-12 21:21:09] [INFO ] Computed 271 place invariants in 37 ms
[2022-06-12 21:21:10] [INFO ] [Real]Absence check using 263 positive place invariants in 61 ms returned sat
[2022-06-12 21:21:10] [INFO ] [Real]Absence check using 263 positive and 8 generalized place invariants in 2 ms returned sat
[2022-06-12 21:21:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:21:10] [INFO ] [Real]Absence check using state equation in 552 ms returned sat
[2022-06-12 21:21:10] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:21:10] [INFO ] [Nat]Absence check using 263 positive place invariants in 68 ms returned sat
[2022-06-12 21:21:10] [INFO ] [Nat]Absence check using 263 positive and 8 generalized place invariants in 2 ms returned sat
[2022-06-12 21:21:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:21:11] [INFO ] [Nat]Absence check using state equation in 549 ms returned sat
[2022-06-12 21:21:11] [INFO ] Deduced a trap composed of 8 places in 98 ms of which 0 ms to minimize.
[2022-06-12 21:21:11] [INFO ] Deduced a trap composed of 13 places in 98 ms of which 1 ms to minimize.
[2022-06-12 21:21:11] [INFO ] Deduced a trap composed of 6 places in 95 ms of which 0 ms to minimize.
[2022-06-12 21:21:11] [INFO ] Deduced a trap composed of 9 places in 98 ms of which 0 ms to minimize.
[2022-06-12 21:21:11] [INFO ] Deduced a trap composed of 12 places in 96 ms of which 0 ms to minimize.
[2022-06-12 21:21:12] [INFO ] Deduced a trap composed of 7 places in 91 ms of which 1 ms to minimize.
[2022-06-12 21:21:12] [INFO ] Deduced a trap composed of 8 places in 85 ms of which 0 ms to minimize.
[2022-06-12 21:21:12] [INFO ] Deduced a trap composed of 10 places in 79 ms of which 0 ms to minimize.
[2022-06-12 21:21:12] [INFO ] Deduced a trap composed of 21 places in 75 ms of which 0 ms to minimize.
[2022-06-12 21:21:12] [INFO ] Deduced a trap composed of 10 places in 76 ms of which 0 ms to minimize.
[2022-06-12 21:21:12] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 1 ms to minimize.
[2022-06-12 21:21:12] [INFO ] Deduced a trap composed of 14 places in 79 ms of which 1 ms to minimize.
[2022-06-12 21:21:12] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 0 ms to minimize.
[2022-06-12 21:21:13] [INFO ] Deduced a trap composed of 6 places in 75 ms of which 1 ms to minimize.
[2022-06-12 21:21:13] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 0 ms to minimize.
[2022-06-12 21:21:13] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 0 ms to minimize.
[2022-06-12 21:21:13] [INFO ] Deduced a trap composed of 11 places in 71 ms of which 0 ms to minimize.
[2022-06-12 21:21:13] [INFO ] Deduced a trap composed of 20 places in 71 ms of which 0 ms to minimize.
[2022-06-12 21:21:13] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 1 ms to minimize.
[2022-06-12 21:21:13] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 0 ms to minimize.
[2022-06-12 21:21:13] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 1 ms to minimize.
[2022-06-12 21:21:13] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 2420 ms
[2022-06-12 21:21:13] [INFO ] Computed and/alt/rep : 843/4041/843 causal constraints (skipped 17 transitions) in 42 ms.
[2022-06-12 21:21:30] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 1 ms to minimize.
[2022-06-12 21:21:30] [INFO ] Deduced a trap composed of 6 places in 71 ms of which 0 ms to minimize.
[2022-06-12 21:21:31] [INFO ] Deduced a trap composed of 7 places in 66 ms of which 0 ms to minimize.
[2022-06-12 21:21:31] [INFO ] Deduced a trap composed of 7 places in 63 ms of which 1 ms to minimize.
[2022-06-12 21:21:31] [INFO ] Deduced a trap composed of 10 places in 71 ms of which 1 ms to minimize.
[2022-06-12 21:21:31] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 1 ms to minimize.
[2022-06-12 21:21:31] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 1 ms to minimize.
[2022-06-12 21:21:32] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 1 ms to minimize.
[2022-06-12 21:21:32] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 0 ms to minimize.
[2022-06-12 21:21:32] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 0 ms to minimize.
[2022-06-12 21:21:32] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 0 ms to minimize.
[2022-06-12 21:21:32] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 2390 ms
[2022-06-12 21:21:33] [INFO ] Added : 747 causal constraints over 150 iterations in 19333 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 86 ms.
[2022-06-12 21:21:33] [INFO ] [Real]Absence check using 263 positive place invariants in 55 ms returned sat
[2022-06-12 21:21:33] [INFO ] [Real]Absence check using 263 positive and 8 generalized place invariants in 2 ms returned sat
[2022-06-12 21:21:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:21:33] [INFO ] [Real]Absence check using state equation in 454 ms returned sat
[2022-06-12 21:21:33] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:21:33] [INFO ] [Nat]Absence check using 263 positive place invariants in 57 ms returned sat
[2022-06-12 21:21:34] [INFO ] [Nat]Absence check using 263 positive and 8 generalized place invariants in 2 ms returned sat
[2022-06-12 21:21:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:21:34] [INFO ] [Nat]Absence check using state equation in 484 ms returned sat
[2022-06-12 21:21:34] [INFO ] Deduced a trap composed of 12 places in 111 ms of which 0 ms to minimize.
[2022-06-12 21:21:34] [INFO ] Deduced a trap composed of 6 places in 107 ms of which 0 ms to minimize.
[2022-06-12 21:21:34] [INFO ] Deduced a trap composed of 10 places in 98 ms of which 0 ms to minimize.
[2022-06-12 21:21:35] [INFO ] Deduced a trap composed of 12 places in 101 ms of which 0 ms to minimize.
[2022-06-12 21:21:35] [INFO ] Deduced a trap composed of 6 places in 87 ms of which 0 ms to minimize.
[2022-06-12 21:21:35] [INFO ] Deduced a trap composed of 11 places in 89 ms of which 0 ms to minimize.
[2022-06-12 21:21:35] [INFO ] Deduced a trap composed of 8 places in 77 ms of which 0 ms to minimize.
[2022-06-12 21:21:35] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 1 ms to minimize.
[2022-06-12 21:21:35] [INFO ] Deduced a trap composed of 10 places in 75 ms of which 0 ms to minimize.
[2022-06-12 21:21:35] [INFO ] Deduced a trap composed of 11 places in 69 ms of which 0 ms to minimize.
[2022-06-12 21:21:35] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 0 ms to minimize.
[2022-06-12 21:21:35] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 1 ms to minimize.
[2022-06-12 21:21:36] [INFO ] Deduced a trap composed of 11 places in 68 ms of which 0 ms to minimize.
[2022-06-12 21:21:36] [INFO ] Deduced a trap composed of 8 places in 68 ms of which 0 ms to minimize.
[2022-06-12 21:21:36] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 0 ms to minimize.
[2022-06-12 21:21:36] [INFO ] Deduced a trap composed of 7 places in 70 ms of which 0 ms to minimize.
[2022-06-12 21:21:36] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 0 ms to minimize.
[2022-06-12 21:21:36] [INFO ] Deduced a trap composed of 11 places in 64 ms of which 0 ms to minimize.
[2022-06-12 21:21:36] [INFO ] Deduced a trap composed of 10 places in 67 ms of which 1 ms to minimize.
[2022-06-12 21:21:36] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 0 ms to minimize.
[2022-06-12 21:21:36] [INFO ] Deduced a trap composed of 8 places in 68 ms of which 0 ms to minimize.
[2022-06-12 21:21:36] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 0 ms to minimize.
[2022-06-12 21:21:37] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 0 ms to minimize.
[2022-06-12 21:21:37] [INFO ] Deduced a trap composed of 11 places in 67 ms of which 1 ms to minimize.
[2022-06-12 21:21:37] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 0 ms to minimize.
[2022-06-12 21:21:37] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 0 ms to minimize.
[2022-06-12 21:21:37] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 1 ms to minimize.
[2022-06-12 21:21:37] [INFO ] Trap strengthening (SAT) tested/added 28/27 trap constraints in 3016 ms
[2022-06-12 21:21:37] [INFO ] Computed and/alt/rep : 843/4041/843 causal constraints (skipped 17 transitions) in 44 ms.
[2022-06-12 21:21:57] [INFO ] Deduced a trap composed of 8 places in 74 ms of which 0 ms to minimize.
[2022-06-12 21:21:57] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 0 ms to minimize.
[2022-06-12 21:21:57] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 2 ms to minimize.
[2022-06-12 21:21:58] [INFO ] Deduced a trap composed of 11 places in 69 ms of which 1 ms to minimize.
[2022-06-12 21:21:58] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 0 ms to minimize.
[2022-06-12 21:21:58] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 0 ms to minimize.
[2022-06-12 21:21:58] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1331 ms
[2022-06-12 21:21:58] [INFO ] Added : 812 causal constraints over 164 iterations in 21291 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 83 ms.
Incomplete Parikh walk after 115500 steps, including 688 resets, run finished after 519 ms. (steps per millisecond=222 ) properties (out of 2) seen :0 could not realise parikh vector
Incomplete Parikh walk after 118300 steps, including 598 resets, run finished after 602 ms. (steps per millisecond=196 ) properties (out of 2) seen :0 could not realise parikh vector
Support contains 157 out of 895 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 895/895 places, 865/865 transitions.
Applied a total of 0 rules in 38 ms. Remains 895 /895 variables (removed 0) and now considering 865/865 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 895/895 places, 865/865 transitions.
Starting structural reductions, iteration 0 : 895/895 places, 865/865 transitions.
Applied a total of 0 rules in 17 ms. Remains 895 /895 variables (removed 0) and now considering 865/865 (removed 0) transitions.
// Phase 1: matrix 865 rows 895 cols
[2022-06-12 21:22:00] [INFO ] Computed 271 place invariants in 14 ms
[2022-06-12 21:22:00] [INFO ] Implicit Places using invariants in 448 ms returned []
// Phase 1: matrix 865 rows 895 cols
[2022-06-12 21:22:00] [INFO ] Computed 271 place invariants in 10 ms
[2022-06-12 21:22:01] [INFO ] Implicit Places using invariants and state equation in 869 ms returned []
Implicit Place search using SMT with State Equation took 1319 ms to find 0 implicit places.
[2022-06-12 21:22:01] [INFO ] Redundant transitions in 68 ms returned []
// Phase 1: matrix 865 rows 895 cols
[2022-06-12 21:22:01] [INFO ] Computed 271 place invariants in 13 ms
[2022-06-12 21:22:01] [INFO ] Dead Transitions using invariants and state equation in 419 ms returned []
Finished structural reductions, in 1 iterations. Remains : 895/895 places, 865/865 transitions.
Incomplete random walk after 100000 steps, including 42 resets, run finished after 844 ms. (steps per millisecond=118 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 865 rows 895 cols
[2022-06-12 21:22:02] [INFO ] Computed 271 place invariants in 12 ms
[2022-06-12 21:22:02] [INFO ] [Real]Absence check using 263 positive place invariants in 64 ms returned sat
[2022-06-12 21:22:02] [INFO ] [Real]Absence check using 263 positive and 8 generalized place invariants in 2 ms returned sat
[2022-06-12 21:22:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:22:03] [INFO ] [Real]Absence check using state equation in 580 ms returned sat
[2022-06-12 21:22:03] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:22:03] [INFO ] [Nat]Absence check using 263 positive place invariants in 69 ms returned sat
[2022-06-12 21:22:03] [INFO ] [Nat]Absence check using 263 positive and 8 generalized place invariants in 2 ms returned sat
[2022-06-12 21:22:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:22:04] [INFO ] [Nat]Absence check using state equation in 567 ms returned sat
[2022-06-12 21:22:04] [INFO ] Deduced a trap composed of 8 places in 103 ms of which 0 ms to minimize.
[2022-06-12 21:22:04] [INFO ] Deduced a trap composed of 13 places in 94 ms of which 0 ms to minimize.
[2022-06-12 21:22:04] [INFO ] Deduced a trap composed of 6 places in 90 ms of which 0 ms to minimize.
[2022-06-12 21:22:04] [INFO ] Deduced a trap composed of 9 places in 96 ms of which 0 ms to minimize.
[2022-06-12 21:22:04] [INFO ] Deduced a trap composed of 12 places in 98 ms of which 1 ms to minimize.
[2022-06-12 21:22:05] [INFO ] Deduced a trap composed of 7 places in 96 ms of which 1 ms to minimize.
[2022-06-12 21:22:05] [INFO ] Deduced a trap composed of 8 places in 92 ms of which 0 ms to minimize.
[2022-06-12 21:22:05] [INFO ] Deduced a trap composed of 10 places in 87 ms of which 0 ms to minimize.
[2022-06-12 21:22:05] [INFO ] Deduced a trap composed of 21 places in 85 ms of which 1 ms to minimize.
[2022-06-12 21:22:05] [INFO ] Deduced a trap composed of 10 places in 83 ms of which 0 ms to minimize.
[2022-06-12 21:22:05] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 1 ms to minimize.
[2022-06-12 21:22:05] [INFO ] Deduced a trap composed of 14 places in 78 ms of which 1 ms to minimize.
[2022-06-12 21:22:05] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 1 ms to minimize.
[2022-06-12 21:22:06] [INFO ] Deduced a trap composed of 6 places in 75 ms of which 1 ms to minimize.
[2022-06-12 21:22:06] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 0 ms to minimize.
[2022-06-12 21:22:06] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 0 ms to minimize.
[2022-06-12 21:22:06] [INFO ] Deduced a trap composed of 11 places in 68 ms of which 0 ms to minimize.
[2022-06-12 21:22:06] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 1 ms to minimize.
[2022-06-12 21:22:06] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 1 ms to minimize.
[2022-06-12 21:22:06] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 0 ms to minimize.
[2022-06-12 21:22:06] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 1 ms to minimize.
[2022-06-12 21:22:06] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 2479 ms
[2022-06-12 21:22:06] [INFO ] Computed and/alt/rep : 843/4041/843 causal constraints (skipped 17 transitions) in 47 ms.
[2022-06-12 21:22:23] [INFO ] Added : 740 causal constraints over 148 iterations in 16787 ms. Result :unknown
[2022-06-12 21:22:23] [INFO ] [Real]Absence check using 263 positive place invariants in 54 ms returned sat
[2022-06-12 21:22:23] [INFO ] [Real]Absence check using 263 positive and 8 generalized place invariants in 1 ms returned sat
[2022-06-12 21:22:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:22:24] [INFO ] [Real]Absence check using state equation in 452 ms returned sat
[2022-06-12 21:22:24] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:22:24] [INFO ] [Nat]Absence check using 263 positive place invariants in 57 ms returned sat
[2022-06-12 21:22:24] [INFO ] [Nat]Absence check using 263 positive and 8 generalized place invariants in 2 ms returned sat
[2022-06-12 21:22:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:22:24] [INFO ] [Nat]Absence check using state equation in 486 ms returned sat
[2022-06-12 21:22:24] [INFO ] Deduced a trap composed of 12 places in 107 ms of which 4 ms to minimize.
[2022-06-12 21:22:25] [INFO ] Deduced a trap composed of 6 places in 98 ms of which 1 ms to minimize.
[2022-06-12 21:22:25] [INFO ] Deduced a trap composed of 10 places in 95 ms of which 0 ms to minimize.
[2022-06-12 21:22:25] [INFO ] Deduced a trap composed of 12 places in 89 ms of which 1 ms to minimize.
[2022-06-12 21:22:25] [INFO ] Deduced a trap composed of 6 places in 83 ms of which 1 ms to minimize.
[2022-06-12 21:22:25] [INFO ] Deduced a trap composed of 11 places in 78 ms of which 0 ms to minimize.
[2022-06-12 21:22:25] [INFO ] Deduced a trap composed of 8 places in 73 ms of which 0 ms to minimize.
[2022-06-12 21:22:25] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 0 ms to minimize.
[2022-06-12 21:22:25] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 0 ms to minimize.
[2022-06-12 21:22:26] [INFO ] Deduced a trap composed of 11 places in 64 ms of which 0 ms to minimize.
[2022-06-12 21:22:26] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 0 ms to minimize.
[2022-06-12 21:22:26] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 1 ms to minimize.
[2022-06-12 21:22:26] [INFO ] Deduced a trap composed of 11 places in 75 ms of which 1 ms to minimize.
[2022-06-12 21:22:26] [INFO ] Deduced a trap composed of 8 places in 69 ms of which 0 ms to minimize.
[2022-06-12 21:22:26] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 1 ms to minimize.
[2022-06-12 21:22:26] [INFO ] Deduced a trap composed of 7 places in 68 ms of which 0 ms to minimize.
[2022-06-12 21:22:26] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 0 ms to minimize.
[2022-06-12 21:22:26] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 0 ms to minimize.
[2022-06-12 21:22:26] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 0 ms to minimize.
[2022-06-12 21:22:27] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 0 ms to minimize.
[2022-06-12 21:22:27] [INFO ] Deduced a trap composed of 8 places in 66 ms of which 1 ms to minimize.
[2022-06-12 21:22:27] [INFO ] Deduced a trap composed of 10 places in 68 ms of which 0 ms to minimize.
[2022-06-12 21:22:27] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 0 ms to minimize.
[2022-06-12 21:22:27] [INFO ] Deduced a trap composed of 11 places in 62 ms of which 0 ms to minimize.
[2022-06-12 21:22:27] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 0 ms to minimize.
[2022-06-12 21:22:27] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 1 ms to minimize.
[2022-06-12 21:22:27] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 0 ms to minimize.
[2022-06-12 21:22:27] [INFO ] Trap strengthening (SAT) tested/added 28/27 trap constraints in 2949 ms
[2022-06-12 21:22:27] [INFO ] Computed and/alt/rep : 843/4041/843 causal constraints (skipped 17 transitions) in 39 ms.
[2022-06-12 21:22:44] [INFO ] Deduced a trap composed of 3 places in 328 ms of which 1 ms to minimize.
[2022-06-12 21:22:44] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
[2022-06-12 21:22:44] [INFO ] Flatten gal took : 44 ms
[2022-06-12 21:22:44] [INFO ] Flatten gal took : 36 ms
[2022-06-12 21:22:44] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7163455080312681477.gal : 6 ms
[2022-06-12 21:22:44] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10908384984474762750.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/ReachabilityCardinality7163455080312681477.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality10908384984474762750.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/ReachabilityCardinality7163455080312681477.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality10908384984474762750.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality10908384984474762750.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :5 after 8
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :8 after 16
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :16 after 36
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :36 after 60
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :60 after 1116
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :1116 after 11062
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :11062 after 119452
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :119452 after 7.16688e+06
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :7.16688e+06 after 4.10217e+19
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :4.10217e+19 after 4.10217e+19
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :4.10217e+19 after 4.10217e+19
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :4.10217e+19 after 4.10217e+19
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :4.10217e+19 after 4.10217e+19
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :4.10217e+19 after 4.10217e+19
SDD proceeding with computation,2 properties remain. new max is 131072
SDD size :4.10217e+19 after 4.10217e+19
Detected timeout of ITS tools.
[2022-06-12 21:22:59] [INFO ] Flatten gal took : 71 ms
[2022-06-12 21:22:59] [INFO ] Applying decomposition
[2022-06-12 21:22:59] [INFO ] Flatten gal took : 35 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/graph8397085640326256109.txt, -o, /tmp/graph8397085640326256109.bin, -w, /tmp/graph8397085640326256109.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/graph8397085640326256109.bin, -l, -1, -v, -w, /tmp/graph8397085640326256109.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-12 21:22:59] [INFO ] Decomposing Gal with order
[2022-06-12 21:22:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-12 21:23:00] [INFO ] Removed a total of 650 redundant transitions.
[2022-06-12 21:23:00] [INFO ] Flatten gal took : 60 ms
[2022-06-12 21:23:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 579 labels/synchronizations in 66 ms.
[2022-06-12 21:23:00] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16218049693556827387.gal : 31 ms
[2022-06-12 21:23:00] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16113119271532598356.prop : 104 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/ReachabilityCardinality16218049693556827387.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality16113119271532598356.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/ReachabilityCardinality16218049693556827387.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality16113119271532598356.prop --nowitness
Loading property file /tmp/ReachabilityCardinality16113119271532598356.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 1
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :1 after 19
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :19 after 139
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :139 after 100879
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :100879 after 2.02232e+16
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :2.67079e+21 after 8.28783e+24
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin18136887359726472187
[2022-06-12 21:23:15] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18136887359726472187
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/ltsmin18136887359726472187]
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/ltsmin18136887359726472187] 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/ltsmin18136887359726472187] 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)
Applied a total of 0 rules in 19 ms. Remains 895 /895 variables (removed 0) and now considering 865/865 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 865 rows 895 cols
[2022-06-12 21:23:16] [INFO ] Computed 271 place invariants in 5 ms
[2022-06-12 21:23:16] [INFO ] [Real]Absence check using 263 positive place invariants in 58 ms returned sat
[2022-06-12 21:23:16] [INFO ] [Real]Absence check using 263 positive and 8 generalized place invariants in 2 ms returned sat
[2022-06-12 21:23:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:23:17] [INFO ] [Real]Absence check using state equation in 539 ms returned sat
[2022-06-12 21:23:17] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:23:17] [INFO ] [Nat]Absence check using 263 positive place invariants in 68 ms returned sat
[2022-06-12 21:23:17] [INFO ] [Nat]Absence check using 263 positive and 8 generalized place invariants in 2 ms returned sat
[2022-06-12 21:23:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:23:17] [INFO ] [Nat]Absence check using state equation in 558 ms returned sat
[2022-06-12 21:23:17] [INFO ] Deduced a trap composed of 8 places in 100 ms of which 1 ms to minimize.
[2022-06-12 21:23:18] [INFO ] Deduced a trap composed of 13 places in 95 ms of which 1 ms to minimize.
[2022-06-12 21:23:18] [INFO ] Deduced a trap composed of 6 places in 93 ms of which 1 ms to minimize.
[2022-06-12 21:23:18] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 1 ms to minimize.
[2022-06-12 21:23:18] [INFO ] Deduced a trap composed of 12 places in 96 ms of which 1 ms to minimize.
[2022-06-12 21:23:18] [INFO ] Deduced a trap composed of 7 places in 89 ms of which 0 ms to minimize.
[2022-06-12 21:23:18] [INFO ] Deduced a trap composed of 8 places in 92 ms of which 0 ms to minimize.
[2022-06-12 21:23:18] [INFO ] Deduced a trap composed of 10 places in 89 ms of which 0 ms to minimize.
[2022-06-12 21:23:18] [INFO ] Deduced a trap composed of 21 places in 87 ms of which 1 ms to minimize.
[2022-06-12 21:23:19] [INFO ] Deduced a trap composed of 10 places in 80 ms of which 0 ms to minimize.
[2022-06-12 21:23:19] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 0 ms to minimize.
[2022-06-12 21:23:19] [INFO ] Deduced a trap composed of 14 places in 91 ms of which 0 ms to minimize.
[2022-06-12 21:23:19] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 0 ms to minimize.
[2022-06-12 21:23:19] [INFO ] Deduced a trap composed of 6 places in 73 ms of which 0 ms to minimize.
[2022-06-12 21:23:19] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 0 ms to minimize.
[2022-06-12 21:23:19] [INFO ] Deduced a trap composed of 13 places in 98 ms of which 1 ms to minimize.
[2022-06-12 21:23:19] [INFO ] Deduced a trap composed of 11 places in 70 ms of which 0 ms to minimize.
[2022-06-12 21:23:19] [INFO ] Deduced a trap composed of 20 places in 90 ms of which 1 ms to minimize.
[2022-06-12 21:23:20] [INFO ] Deduced a trap composed of 13 places in 85 ms of which 1 ms to minimize.
[2022-06-12 21:23:20] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 1 ms to minimize.
[2022-06-12 21:23:20] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 1 ms to minimize.
[2022-06-12 21:23:20] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 2525 ms
[2022-06-12 21:23:20] [INFO ] Computed and/alt/rep : 843/4041/843 causal constraints (skipped 17 transitions) in 40 ms.
[2022-06-12 21:23:37] [INFO ] Deduced a trap composed of 9 places in 108 ms of which 1 ms to minimize.
[2022-06-12 21:23:37] [INFO ] Deduced a trap composed of 6 places in 77 ms of which 0 ms to minimize.
[2022-06-12 21:23:37] [INFO ] Deduced a trap composed of 7 places in 90 ms of which 0 ms to minimize.
[2022-06-12 21:23:37] [INFO ] Deduced a trap composed of 7 places in 66 ms of which 1 ms to minimize.
[2022-06-12 21:23:38] [INFO ] Deduced a trap composed of 10 places in 63 ms of which 1 ms to minimize.
[2022-06-12 21:23:38] [INFO ] Deduced a trap composed of 19 places in 78 ms of which 0 ms to minimize.
[2022-06-12 21:23:38] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 0 ms to minimize.
[2022-06-12 21:23:38] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 1 ms to minimize.
[2022-06-12 21:23:38] [INFO ] Deduced a trap composed of 20 places in 79 ms of which 1 ms to minimize.
[2022-06-12 21:23:39] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 1 ms to minimize.
[2022-06-12 21:23:39] [INFO ] Deduced a trap composed of 25 places in 61 ms of which 1 ms to minimize.
[2022-06-12 21:23:39] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 2372 ms
[2022-06-12 21:23:39] [INFO ] Added : 747 causal constraints over 150 iterations in 19219 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 79 ms.
[2022-06-12 21:23:39] [INFO ] [Real]Absence check using 263 positive place invariants in 53 ms returned sat
[2022-06-12 21:23:39] [INFO ] [Real]Absence check using 263 positive and 8 generalized place invariants in 2 ms returned sat
[2022-06-12 21:23:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:23:40] [INFO ] [Real]Absence check using state equation in 436 ms returned sat
[2022-06-12 21:23:40] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:23:40] [INFO ] [Nat]Absence check using 263 positive place invariants in 67 ms returned sat
[2022-06-12 21:23:40] [INFO ] [Nat]Absence check using 263 positive and 8 generalized place invariants in 19 ms returned sat
[2022-06-12 21:23:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:23:41] [INFO ] [Nat]Absence check using state equation in 499 ms returned sat
[2022-06-12 21:23:41] [INFO ] Deduced a trap composed of 12 places in 108 ms of which 0 ms to minimize.
[2022-06-12 21:23:41] [INFO ] Deduced a trap composed of 6 places in 126 ms of which 1 ms to minimize.
[2022-06-12 21:23:41] [INFO ] Deduced a trap composed of 10 places in 114 ms of which 1 ms to minimize.
[2022-06-12 21:23:41] [INFO ] Deduced a trap composed of 12 places in 99 ms of which 0 ms to minimize.
[2022-06-12 21:23:41] [INFO ] Deduced a trap composed of 6 places in 106 ms of which 0 ms to minimize.
[2022-06-12 21:23:41] [INFO ] Deduced a trap composed of 11 places in 90 ms of which 0 ms to minimize.
[2022-06-12 21:23:42] [INFO ] Deduced a trap composed of 8 places in 103 ms of which 1 ms to minimize.
[2022-06-12 21:23:42] [INFO ] Deduced a trap composed of 9 places in 100 ms of which 0 ms to minimize.
[2022-06-12 21:23:42] [INFO ] Deduced a trap composed of 10 places in 82 ms of which 0 ms to minimize.
[2022-06-12 21:23:42] [INFO ] Deduced a trap composed of 11 places in 81 ms of which 0 ms to minimize.
[2022-06-12 21:23:42] [INFO ] Deduced a trap composed of 13 places in 102 ms of which 1 ms to minimize.
[2022-06-12 21:23:42] [INFO ] Deduced a trap composed of 15 places in 90 ms of which 0 ms to minimize.
[2022-06-12 21:23:42] [INFO ] Deduced a trap composed of 11 places in 85 ms of which 1 ms to minimize.
[2022-06-12 21:23:42] [INFO ] Deduced a trap composed of 8 places in 74 ms of which 0 ms to minimize.
[2022-06-12 21:23:42] [INFO ] Deduced a trap composed of 14 places in 78 ms of which 1 ms to minimize.
[2022-06-12 21:23:43] [INFO ] Deduced a trap composed of 7 places in 76 ms of which 1 ms to minimize.
[2022-06-12 21:23:43] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 0 ms to minimize.
[2022-06-12 21:23:43] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 0 ms to minimize.
[2022-06-12 21:23:43] [INFO ] Deduced a trap composed of 10 places in 71 ms of which 0 ms to minimize.
[2022-06-12 21:23:43] [INFO ] Deduced a trap composed of 12 places in 71 ms of which 1 ms to minimize.
[2022-06-12 21:23:43] [INFO ] Deduced a trap composed of 8 places in 73 ms of which 0 ms to minimize.
[2022-06-12 21:23:43] [INFO ] Deduced a trap composed of 10 places in 74 ms of which 0 ms to minimize.
[2022-06-12 21:23:43] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 0 ms to minimize.
[2022-06-12 21:23:43] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 0 ms to minimize.
[2022-06-12 21:23:44] [INFO ] Deduced a trap composed of 19 places in 89 ms of which 0 ms to minimize.
[2022-06-12 21:23:44] [INFO ] Deduced a trap composed of 12 places in 75 ms of which 0 ms to minimize.
[2022-06-12 21:23:44] [INFO ] Deduced a trap composed of 14 places in 82 ms of which 0 ms to minimize.
[2022-06-12 21:23:44] [INFO ] Trap strengthening (SAT) tested/added 28/27 trap constraints in 3303 ms
[2022-06-12 21:23:44] [INFO ] Computed and/alt/rep : 843/4041/843 causal constraints (skipped 17 transitions) in 45 ms.
[2022-06-12 21:24:05] [INFO ] Added : 809 causal constraints over 163 iterations in 20805 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 80 ms.
[2022-06-12 21:24:05] [INFO ] Flatten gal took : 33 ms
Using solver Z3 to compute partial order matrices.
[2022-06-12 21:24:05] [INFO ] Flatten gal took : 45 ms
Built C files in :
/tmp/ltsmin11219574862834631160
[2022-06-12 21:24:05] [INFO ] Applying decomposition
[2022-06-12 21:24:05] [INFO ] Computing symmetric may disable matrix : 865 transitions.
[2022-06-12 21:24:05] [INFO ] Computation of Complete disable matrix. took 20 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-12 21:24:05] [INFO ] Computing symmetric may enable matrix : 865 transitions.
[2022-06-12 21:24:05] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-12 21:24:05] [INFO ] Flatten gal took : 95 ms
[2022-06-12 21:24:05] [INFO ] Input system was already deterministic with 865 transitions.
[2022-06-12 21:24:05] [INFO ] Computing Do-Not-Accords matrix : 865 transitions.
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/graph8769660117975084114.txt, -o, /tmp/graph8769660117975084114.bin, -w, /tmp/graph8769660117975084114.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/graph8769660117975084114.bin, -l, -1, -v, -w, /tmp/graph8769660117975084114.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-12 21:24:05] [INFO ] Decomposing Gal with order
[2022-06-12 21:24:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-12 21:24:05] [INFO ] Computation of Completed DNA matrix. took 110 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-12 21:24:05] [INFO ] Built C files in 481ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11219574862834631160
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/ltsmin11219574862834631160]
[2022-06-12 21:24:06] [INFO ] Removed a total of 657 redundant transitions.
[2022-06-12 21:24:06] [INFO ] Flatten gal took : 153 ms
[2022-06-12 21:24:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 575 labels/synchronizations in 167 ms.
[2022-06-12 21:24:06] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability15755128781445357082.gal : 8 ms
[2022-06-12 21:24:06] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability2592962858462602022.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/ReachabilityFireability15755128781445357082.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityFireability2592962858462602022.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/ReachabilityFireability15755128781445357082.gal -t CGAL -reachable-file /tmp/ReachabilityFireability2592962858462602022.prop --nowitness
Loading property file /tmp/ReachabilityFireability2592962858462602022.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 1
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :1 after 10
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :10 after 47
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :47 after 7.16691e+06
[2022-06-12 21:24:07] [INFO ] Ran tautology test, simplified 0 / 2 in 1592 ms.
[2022-06-12 21:24:07] [INFO ] BMC solution for property ShieldIIPs-PT-030B-ReachabilityFireability-00(UNSAT) depth K=0 took 71 ms
[2022-06-12 21:24:07] [INFO ] BMC solution for property ShieldIIPs-PT-030B-ReachabilityFireability-01(UNSAT) depth K=0 took 1 ms
[2022-06-12 21:24:07] [INFO ] BMC solution for property ShieldIIPs-PT-030B-ReachabilityFireability-00(UNSAT) depth K=1 took 44 ms
[2022-06-12 21:24:07] [INFO ] BMC solution for property ShieldIIPs-PT-030B-ReachabilityFireability-01(UNSAT) depth K=1 took 51 ms
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 865 rows 895 cols
[2022-06-12 21:24:07] [INFO ] Computed 271 place invariants in 7 ms
inv : p3 + p9 + p10 + p12 + p27 + p28 + p95 + p96 + p97 + p98 + p100 + p102 = 1
inv : p3 + p9 + p10 + p1106 + p1111 + p1112 = 1
inv : p1168 + p1169 - p1170 - p1171 = 0
inv : p3 + p1394 + p1395 + p1401 + p1404 + p1405 = 1
inv : p1674 + p1677 + p1679 + p1681 = 1
inv : p3 + p1394 + p1395 + p1398 + p1400 = 1
inv : p1685 + p1719 + p1721 = 1
inv : p3 + p9 + p10 + p12 + p366 + p369 + p370 + p372 = 1
inv : p3 + p9 + p10 + p12 + p582 + p584 = 1
inv : p3 + p9 + p10 + p12 + p526 + p528 = 1
inv : p3 + p9 + p10 + p12 + p641 + p643 = 1
inv : p3 + p9 + p10 + p12 + p27 + p28 + p73 + p75 + p77 + p78 + p79 = 1
inv : p3 + p1367 + p1368 = 1
inv : p3 + p9 + p10 + p12 + p339 + p344 + p345 = 1
inv : p3 + p9 + p10 + p12 + p513 + p515 = 1
inv : p3 + p9 + p10 + p12 + p752 + p755 + p756 = 1
inv : p3 + p9 + p10 + p12 + p1036 + p1040 + p1060 + p1062 + p1063 + p1064 + p1066 = 1
inv : p3 + p1272 + p1273 + p1293 + p1295 = 1
inv : p3 + p9 + p10 + p12 + p821 + p823 = 1
inv : p3 + p9 + p10 + p12 + p408 + p410 = 1
inv : p3 + p9 + p10 + p12 + p27 + p151 + p172 + p174 = 1
inv : p3 + p9 + p10 + p12 + p27 + p28 + p57 + p59 + p60 + p61 + p63 = 1
inv : p3 + p1441 + p1443 + p1445 + p1447 = 1
inv : p3 + p1511 + p1519 + p1524 + p1525 = 1
inv : p3 + p1511 + p1532 + p1534 + p1536 + p1538 = 1
inv : p3 + p9 + p10 + p1172 + p1174 = 1
inv : p3 + p9 + p10 + p12 + p615 + p617 + p619 + p621 = 1
inv : p3 + p9 + p10 + p12 + p575 + p577 + p580 + p581 = 1
inv : p3 + p9 + p10 + p12 + p998 + p1000 = 1
inv : p3 + p1567 + p1615 + p1618 + p1620 + p1622 = 1
inv : p3 + p9 + p10 + p12 + p275 + p276 + p280 + p282 + p283 + p284 = 1
inv : p3 + p1567 + p1585 + p1587 = 1
inv : -p460 - p461 + p462 + p463 = 0
inv : p3 + p9 + p10 + p12 + p27 + p28 + p67 + p69 = 1
inv : p3 + p9 + p10 + p12 + p1036 + p1070 + p1072 = 1
inv : p3 + p9 + p10 + p12 + p765 + p767 + p769 + p771 + p772 + p773 = 1
inv : p1747 + p1768 + p1770 + p1771 + p1772 + p1774 + p1775 + p1776 = 1
inv : p3 + p9 + p10 + p12 + p336 + p338 = 1
inv : p3 + p1379 + p1382 + p1384 + p1386 + p1388 + p1389 = 1
inv : p3 + p9 + p10 + p12 + p988 + p991 + p992 = 1
inv : p3 + p9 + p10 + p12 + p405 + p407 = 1
inv : p3 + p9 + p10 + p12 + p27 + p28 + p95 + p96 + p97 + p98 + p103 + p105 + p106 + p107 = 1
inv : p3 + p1511 + p1519 + p1522 + p1523 = 1
inv : p3 + p9 + p10 + p12 + p212 + p213 + p218 + p220 = 1
inv : p3 + p1467 + p1469 = 1
inv : p3 + p9 + p10 + p1133 + p1135 + p1136 + p1137 + p1139 = 1
inv : p3 + p9 + p10 + p12 + p376 + p379 + p381 + p382 + p383 + p384 + p385 = 1
inv : p3 + p9 + p10 + p12 + p939 + p940 + p941 = 1
inv : p3 + p1342 + p1344 + p1345 + p1346 = 1
inv : p3 + p9 + p10 + p12 + p346 + p348 = 1
inv : p3 + p9 + p10 + p12 + p1001 + p1003 + p1005 + p1007 = 1
inv : p3 + p9 + p10 + p12 + p631 + p633 = 1
inv : -p283 - p284 + p285 + p286 = 0
inv : p3 + p9 + p10 + p1106 + p1109 + p1110 = 1
inv : p3 + p9 + p10 + p12 + p446 + p447 + p482 + p483 = 1
inv : p3 + p9 + p10 + p12 + p1015 + p1017 + p1019 + p1021 = 1
inv : p3 + p9 + p10 + p12 + p1036 + p1040 + p1041 + p1042 + p1043 + p1047 + p1050 + p1051 = 1
inv : p3 + p9 + p10 + p12 + p27 + p28 + p130 + p132 + p134 + p136 + p138 + p139 = 1
inv : p3 + p1567 + p1605 + p1607 + p1609 + p1611 = 1
inv : p1747 + p1751 + p1752 + p1753 + p1754 = 1
inv : p3 + p1511 + p1516 + p1518 = 1
inv : p3 + p9 + p1213 + p1217 + p1218 + p1231 + p1233 = 1
inv : p3 + p9 + p10 + p12 + p865 + p866 + p867 + p869 = 1
inv : p3 + p9 + p10 + p12 + p752 + p757 + p758 = 1
inv : p3 + p9 + p10 + p12 + p602 + p604 + p606 + p608 = 1
inv : p3 + p9 + p10 + p12 + p966 + p969 + p971 + p973 = 1
inv : p3 + p9 + p10 + p12 + p275 + p276 + p277 + p279 = 1
inv : p3 + p1424 + p1426 = 1
inv : p3 + p1394 + p1414 + p1415 + p1416 + p1418 + p1420 + p1421 + p1422 + p1423 = 1
inv : p3 + p9 + p10 + p12 + p212 + p248 + p250 + p252 + p254 + p256 = 1
inv : p1628 + p1637 + p1639 + p1640 + p1641 = 1
inv : p3 + p9 + p10 + p12 + p897 + p899 + p900 + p901 + p903 + p904 = 1
inv : p3 + p9 + p10 + p12 + p435 + p438 + p440 + p442 = 1
inv : p3 + p9 + p10 + p1116 + p1118 = 1
inv : p3 + p1272 + p1273 + p1320 + p1323 + p1325 + p1327 = 1
inv : p3 + p1567 + p1574 + p1575 + p1577 = 1
inv : p3 + p9 + p10 + p12 + p749 + p751 = 1
inv : p3 + p9 + p10 + p12 + p446 + p447 + p467 + p468 + p469 = 1
inv : p3 + p1567 + p1601 + p1603 = 1
inv : p3 + p9 + p10 + p12 + p446 + p447 + p464 + p466 = 1
inv : p3 + p9 + p10 + p12 + p352 + p354 + p356 + p358 = 1
inv : p3 + p9 + p10 + p12 + p824 + p826 + p828 + p830 = 1
inv : p3 + p1497 + p1500 + p1502 + p1504 + p1505 = 1
inv : p3 + p9 + p10 + p12 + p27 + p28 + p95 + p96 + p97 + p113 + p115 = 1
inv : p3 + p9 + p10 + p1202 + p1205 + p1207 + p1209 + p1210 = 1
inv : p3 + p9 + p10 + p12 + p543 + p545 + p547 + p549 = 1
inv : p3 + p1349 + p1351 = 1
inv : p3 + p9 + p10 + p12 + p212 + p213 + p228 + p230 = 1
inv : p3 + p9 + p10 + p12 + p27 + p28 + p41 + p43 = 1
inv : p3 + p9 + p10 + p12 + p307 + p309 + p310 + p311 + p312 + p313 + p314 = 1
inv : p3 + p9 + p10 + p12 + p275 + p287 + p289 = 1
inv : p3 + p9 + p10 + p12 + p339 + p342 + p343 = 1
inv : p3 + p9 + p10 + p12 + p682 + p683 + p685 + p689 + p693 + p698 + p699 = 1
inv : p3 + p1394 + p1395 + p1401 + p1406 + p1407 = 1
inv : p3 + p9 + p10 + p12 + p942 + p944 + p946 + p948 = 1
inv : p3 + p9 + p10 + p12 + p523 + p525 = 1
inv : p3 + p9 + p10 + p12 + p682 + p683 + p685 + p706 + p708 + p710 + p711 + p712 = 1
inv : p3 + p9 + p10 + p12 + p585 + p587 = 1
inv : p3 + p9 + p10 + p12 + p818 + p820 = 1
inv : p3 + p9 + p10 + p12 + p539 + p541 = 1
inv : p3 + p9 + p1213 + p1217 + p1218 + p1220 + p1221 + p1223 = 1
inv : p3 + p9 + p10 + p12 + p1025 + p1028 + p1030 + p1032 = 1
inv : p3 + p1272 + p1273 + p1306 + p1308 = 1
inv : p3 + p9 + p10 + p12 + p27 + p151 + p157 + p158 + p159 + p161 = 1
inv : p3 + p1342 + p1344 + p1347 + p1348 = 1
inv : p3 + p9 + p10 + p1188 + p1190 = 1
inv : p3 + p9 + p10 + p12 + p893 + p895 = 1
inv : p3 + p9 + p10 + p12 + p27 + p151 + p175 + p177 + p179 + p181 = 1
inv : p3 + p9 + p10 + p12 + p446 + p447 + p457 + p460 + p461 = 1
inv : p3 + p1487 + p1489 + p1491 + p1493 + p1495 + p1496 = 1
inv : p3 + p9 + p10 + p12 + p212 + p213 + p231 + p233 = 1
inv : p3 + p9 + p10 + p12 + p762 + p764 = 1
inv : p3 + p9 + p10 + p12 + p1036 + p1075 + p1076 + p1078 + p1080 + p1082 = 1
inv : p3 + p9 + p1213 + p1217 + p1218 + p1234 + p1236 = 1
inv : p1685 + p1696 + p1697 + p1698 + p1699 + p1700 = 1
inv : p3 + p1272 + p1273 + p1296 + p1298 + p1300 + p1302 + p1303 + p1304 = 1
inv : p932 + p933 - p934 - p935 = 0
inv : p3 + p9 + p10 + p12 + p661 + p663 + p665 + p667 = 1
inv : p1628 + p1664 + p1666 + p1668 + p1670 + p1672 = 1
inv : p3 + p9 + p10 + p12 + p682 + p683 + p685 + p716 + p718 + p719 = 1
inv : p3 + p9 + p10 + p12 + p657 + p659 = 1
inv : p3 + p9 + p10 + p12 + p926 + p928 = 1
inv : p3 + p9 + p10 + p12 + p1036 + p1040 + p1041 + p1042 + p1054 + p1056 = 1
inv : p3 + p9 + p10 + p12 + p212 + p213 + p221 + p222 + p224 + p225 = 1
inv : p1685 + p1706 + p1708 = 1
inv : p3 + p9 + p10 + p12 + p682 + p683 + p685 + p689 + p690 + p691 + p692 = 1
inv : -p1463 - p1464 + p1465 + p1466 = 0
inv : p3 + p9 + p1213 + p1217 + p1237 + p1239 + p1240 + p1241 + p1243 = 1
inv : p1628 + p1660 + p1662 = 1
inv : p3 + p9 + p10 + p12 + p27 + p28 + p44 + p46 + p47 + p48 = 1
inv : p3 + p1483 + p1485 = 1
inv : p3 + p1272 + p1273 + p1290 + p1292 = 1
inv : p3 + p1394 + p1395 + p1408 + p1410 = 1
inv : p3 + p9 + p10 + p12 + p647 + p649 + p651 + p653 = 1
inv : p3 + p9 + p10 + p12 + p849 + p851 + p853 + p855 + p857 = 1
inv : p1792 + p1794 + p1795 + p1797 + p1799 + p1800 = 1
inv : -p1050 - p1051 + p1052 + p1053 = 0
inv : p3 + p9 + p10 + p12 + p303 + p305 = 1
inv : p3 + p9 + p10 + p12 + p362 + p364 = 1
inv : p3 + p9 + p10 + p12 + p572 + p574 = 1
inv : p3 + p1548 + p1550 + p1552 + p1554 = 1
inv : p3 + p9 + p10 + p12 + p212 + p213 + p221 + p222 + p226 + p227 = 1
inv : p3 + p9 + p10 + p12 + p27 + p28 + p51 + p53 = 1
inv : p3 + p9 + p10 + p12 + p27 + p151 + p157 + p169 + p171 = 1
inv : p1783 + p1784 + p1786 + p1788 + p1790 = 1
inv : p1628 + p1644 + p1646 = 1
inv : p3 + p9 + p10 + p12 + p865 + p866 + p870 + p873 + p874 = 1
inv : p3 + p9 + p10 + p12 + p682 + p683 + p685 + p689 + p693 + p696 + p697 = 1
inv : p3 + p9 + p10 + p1119 + p1121 + p1123 + p1125 = 1
inv : p3 + p9 + p10 + p12 + p588 + p590 + p592 + p594 = 1
inv : p1685 + p1733 + p1736 + p1738 + p1739 + p1740 + p1742 = 1
inv : p3 + p9 + p10 + p12 + p398 + p403 + p404 = 1
inv : p3 + p1567 + p1591 + p1593 + p1595 + p1597 = 1
inv : p3 + p1355 + p1357 + p1359 + p1361 = 1
inv : p3 + p9 + p10 + p12 + p985 + p987 = 1
inv : p3 + p1272 + p1273 + p1280 + p1282 = 1
inv : p1685 + p1723 + p1725 + p1727 + p1729 = 1
inv : p3 + p9 + p10 + p1113 + p1115 = 1
inv : p3 + p1272 + p1273 + p1283 + p1288 + p1289 = 1
inv : p3 + p9 + p10 + p12 + p27 + p28 + p95 + p96 + p97 + p98 + p110 + p111 + p112 = 1
inv : p3 + p9 + p10 + p12 + p446 + p447 + p454 + p456 = 1
inv : p1685 + p1696 + p1697 + p1698 + p1701 + p1702 = 1
inv : p3 + p9 + p10 + p1143 + p1145 + p1146 + p1147 + p1148 + p1150 + p1151 = 1
inv : p3 + p9 + p10 + p12 + p811 + p814 + p815 = 1
inv : p3 + p9 + p10 + p12 + p865 + p877 + p879 = 1
inv : p3 + p9 + p10 + p12 + p27 + p151 + p157 + p158 + p162 + p167 + p168 = 1
inv : p3 + p9 + p10 + p12 + p759 + p761 = 1
inv : p1685 + p1709 + p1711 + p1713 + p1715 + p1716 = 1
inv : p1747 + p1762 + p1764 = 1
inv : p3 + p9 + p10 + p12 + p1036 + p1084 + p1087 + p1089 + p1091 + p1092 + p1093 = 1
inv : p1747 + p1751 + p1755 + p1760 + p1761 = 1
inv : p3 + p9 + p10 + p12 + p956 + p958 + p960 + p962 + p963 = 1
inv : p3 + p9 + p10 + p12 + p1011 + p1013 = 1
inv : p3 + p9 + p10 + p12 + p516 + p518 + p521 + p522 = 1
inv : p3 + p1567 + p1574 + p1578 + p1579 + p1583 + p1584 = 1
inv : p3 + p9 + p10 + p12 + p936 + p938 = 1
inv : p3 + p1394 + p1395 + p1411 + p1413 = 1
inv : p3 + p9 + p10 + p1129 + p1131 = 1
inv : p1685 + p1703 + p1705 = 1
inv : p3 + p9 + p10 + p12 + p27 + p28 + p95 + p126 + p128 = 1
inv : p3 + p9 + p10 + p12 + p422 + p423 + p424 = 1
inv : p3 + p9 + p10 + p12 + p27 + p28 + p140 + p143 + p145 + p147 = 1
inv : p3 + p1473 + p1475 + p1477 + p1479 = 1
inv : p3 + p9 + p10 + p12 + p811 + p816 + p817 = 1
inv : p3 + p1371 + p1373 + p1375 + p1377 = 1
inv : p3 + p9 + p10 + p12 + p838 + p840 + p842 + p844 = 1
inv : p3 + p9 + p10 + p12 + p907 + p910 + p912 + p914 = 1
inv : p3 + p9 + p10 + p12 + p27 + p151 + p185 + p187 = 1
inv : p3 + p9 + p10 + p12 + p808 + p810 = 1
inv : p3 + p9 + p10 + p1165 + p1170 + p1171 = 1
inv : p3 + p1556 + p1559 + p1561 + p1563 = 1
inv : p3 + p9 + p10 + p12 + p929 + p931 + p934 + p935 = 1
inv : p3 + p1352 + p1354 = 1
inv : p3 + p9 + p10 + p12 + p516 + p518 + p519 + p520 = 1
inv : p3 + p1567 + p1574 + p1578 + p1579 + p1581 + p1582 = 1
inv : p3 + p9 + p10 + p12 + p27 + p28 + p54 + p56 = 1
inv : p3 + p9 + p10 + p12 + p27 + p151 + p157 + p158 + p162 + p165 + p166 = 1
inv : p3 + p9 + p10 + p12 + p317 + p320 + p322 + p324 + p325 = 1
inv : p3 + p9 + p1213 + p1249 + p1250 = 1
inv : -p47 - p48 + p49 + p50 = 0
inv : p3 + p9 + p10 + p12 + p529 + p531 + p533 + p535 + p536 = 1
inv : p3 + p9 + p10 + p12 + p634 + p637 + p638 = 1
inv : p3 + p9 + p10 + p12 + p398 + p401 + p402 = 1
inv : p3 + p9 + p10 + p12 + p791 + p794 + p796 + p797 + p798 = 1
inv : p3 + p9 + p10 + p12 + p212 + p213 + p244 + p246 = 1
inv : p3 + p9 + p10 + p12 + p775 + p777 = 1
inv : p3 + p9 + p10 + p12 + p27 + p28 + p30 + p32 = 1
inv : p1628 + p1652 + p1654 + p1656 + p1658 = 1
inv : p3 + p9 + p10 + p12 + p212 + p213 + p234 + p236 + p238 + p240 + p242 + p243 = 1
inv : p3 + p9 + p10 + p12 + p779 + p781 + p783 + p785 + p786 = 1
inv : p3 + p9 + p10 + p12 + p293 + p295 + p297 + p299 = 1
inv : p3 + p9 + p10 + p12 + p27 + p151 + p199 + p202 + p204 + p206 + p207 = 1
inv : p1685 + p1693 + p1695 = 1
inv : p3 + p9 + p10 + p12 + p349 + p351 = 1
inv : p3 + p9 + p10 + p12 + p634 + p639 + p640 = 1
inv : p3 + p1460 + p1462 + p1463 + p1464 = 1
inv : p3 + p9 + p10 + p12 + p446 + p447 + p472 + p474 + p476 + p478 = 1
inv : p3 + p9 + p10 + p12 + p682 + p683 + p685 + p700 + p702 = 1
inv : p3 + p9 + p1213 + p1217 + p1218 + p1220 + p1224 + p1229 + p1230 = 1
inv : p3 + p9 + p10 + p12 + p880 + p882 = 1
inv : p3 + p9 + p10 + p1162 + p1164 = 1
inv : p3 + p9 + p10 + p12 + p865 + p866 + p870 + p875 + p876 = 1
inv : p3 + p9 + p10 + p12 + p682 + p683 + p730 + p732 + p733 + p735 + p737 = 1
inv : p3 + p9 + p10 + p12 + p885 + p887 + p889 + p891 = 1
inv : p3 + p9 + p10 + p12 + p446 + p447 + p494 + p497 + p499 + p501 + p502 = 1
inv : p3 + p1429 + p1430 + p1432 + p1434 + p1436 = 1
inv : p3 + p9 + p10 + p12 + p995 + p997 = 1
inv : p1628 + p1634 + p1636 = 1
inv : p3 + p1511 + p1526 + p1528 = 1
inv : p3 + p9 + p10 + p12 + p411 + p413 + p415 + p416 + p417 = 1
inv : p1747 + p1778 + p1780 + p1781 = 1
inv : p3 + p9 + p10 + p1175 + p1176 + p1177 = 1
inv : p3 + p9 + p10 + p12 + p395 + p397 = 1
inv : p3 + p9 + p10 + p12 + p598 + p600 = 1
inv : p3 + p9 + p10 + p1192 + p1194 + p1196 + p1198 = 1
inv : p3 + p9 + p10 + p12 + p290 + p292 = 1
inv : p3 + p1511 + p1529 + p1531 = 1
inv : p3 + p1457 + p1459 = 1
inv : p3 + p9 + p10 + p12 + p425 + p427 + p429 + p431 = 1
inv : p3 + p1567 + p1588 + p1590 = 1
inv : p3 + p9 + p10 + p12 + p1036 + p1040 + p1041 + p1057 + p1058 + p1059 = 1
inv : p3 + p1339 + p1341 = 1
inv : p3 + p9 + p10 + p12 + p27 + p151 + p189 + p191 + p193 + p195 + p196 = 1
inv : p3 + p9 + p10 + p12 + p682 + p683 + p721 + p722 + p724 + p726 + p728 = 1
inv : p3 + p1272 + p1273 + p1283 + p1286 + p1287 = 1
inv : p1747 + p1751 + p1755 + p1758 + p1759 = 1
inv : p3 + p1470 + p1472 = 1
inv : p3 + p9 + p1213 + p1251 + p1253 + p1254 + p1255 + p1256 + p1257 + p1258 = 1
inv : p3 + p9 + p10 + p12 + p836 + p837 = 1
inv : p3 + p9 + p10 + p12 + p446 + p447 + p484 + p486 + p488 + p490 + p491 + p492 + p493 = 1
inv : p3 + p9 + p10 + p1178 + p1180 + p1182 + p1184 = 1
inv : p3 + p1272 + p1273 + p1310 + p1312 + p1314 + p1316 = 1
inv : p3 + p9 + p10 + p12 + p674 + p676 + p678 + p680 = 1
inv : -p1640 - p1641 + p1642 + p1643 = 0
inv : p3 + p9 + p10 + p1103 + p1105 = 1
inv : p3 + p9 + p1213 + p1264 + p1266 + p1268 + p1270 = 1
inv : p3 + p9 + p10 + p12 + p988 + p993 + p994 = 1
inv : p3 + p9 + p10 + p12 + p1036 + p1040 + p1041 + p1042 + p1043 + p1044 + p1046 = 1
inv : p3 + p9 + p10 + p12 + p27 + p28 + p95 + p96 + p116 + p118 + p120 + p122 + p123 + p124 + p125 = 1
inv : p1628 + p1647 + p1649 = 1
inv : p3 + p9 + p10 + p12 + p27 + p28 + p95 + p96 + p97 + p98 + p103 + p105 + p108 + p109 = 1
inv : p3 + p9 + p10 + p12 + p553 + p556 + p558 + p560 = 1
inv : p3 + p9 + p10 + p12 + p575 + p577 + p578 + p579 = 1
inv : p3 + p9 + p10 + p12 + p258 + p261 + p263 + p265 = 1
inv : p3 + p1511 + p1542 + p1543 + p1544 + p1545 = 1
inv : p1747 + p1765 + p1766 = 1
inv : p3 + p9 + p10 + p12 + p644 + p646 = 1
inv : p3 + p9 + p1213 + p1217 + p1218 + p1220 + p1224 + p1227 + p1228 = 1
inv : p3 + p9 + p10 + p12 + p27 + p28 + p81 + p84 + p86 + p88 = 1
inv : p3 + p9 + p10 + p12 + p682 + p683 + p685 + p703 + p705 = 1
inv : p3 + p9 + p10 + p12 + p952 + p953 + p954 + p955 = 1
Total of 271 invariants.
[2022-06-12 21:24:07] [INFO ] Computed 271 place invariants in 11 ms
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :7.16691e+06 after 5.6869e+14
[2022-06-12 21:24:08] [INFO ] BMC solution for property ShieldIIPs-PT-030B-ReachabilityFireability-00(UNSAT) depth K=2 took 1340 ms
[2022-06-12 21:24:09] [INFO ] BMC solution for property ShieldIIPs-PT-030B-ReachabilityFireability-01(UNSAT) depth K=2 took 1321 ms
[2022-06-12 21:24:11] [INFO ] Proved 895 variables to be positive in 3920 ms
[2022-06-12 21:24:11] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldIIPs-PT-030B-ReachabilityFireability-00
[2022-06-12 21:24:11] [INFO ] KInduction solution for property ShieldIIPs-PT-030B-ReachabilityFireability-00(SAT) depth K=0 took 215 ms
[2022-06-12 21:24:12] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldIIPs-PT-030B-ReachabilityFireability-01
[2022-06-12 21:24:12] [INFO ] KInduction solution for property ShieldIIPs-PT-030B-ReachabilityFireability-01(SAT) depth K=0 took 169 ms
[2022-06-12 21:24:13] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldIIPs-PT-030B-ReachabilityFireability-00
[2022-06-12 21:24:13] [INFO ] KInduction solution for property ShieldIIPs-PT-030B-ReachabilityFireability-00(SAT) depth K=1 took 871 ms
[2022-06-12 21:24:13] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldIIPs-PT-030B-ReachabilityFireability-01
[2022-06-12 21:24:13] [INFO ] KInduction solution for property ShieldIIPs-PT-030B-ReachabilityFireability-01(SAT) depth K=1 took 492 ms
Compilation finished in 7718 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin11219574862834631160]
Link finished in 64 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, -i, ShieldIIPsPT030BReachabilityFireability00==true], workingDir=/tmp/ltsmin11219574862834631160]
[2022-06-12 21:24:44] [INFO ] BMC solution for property ShieldIIPs-PT-030B-ReachabilityFireability-00(UNSAT) depth K=3 took 34746 ms
[2022-06-12 21:25:26] [INFO ] BMC solution for property ShieldIIPs-PT-030B-ReachabilityFireability-01(UNSAT) depth K=3 took 41320 ms
[2022-06-12 21:26:17] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldIIPs-PT-030B-ReachabilityFireability-00
[2022-06-12 21:26:17] [INFO ] KInduction solution for property ShieldIIPs-PT-030B-ReachabilityFireability-00(SAT) depth K=2 took 123889 ms
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :2.67079e+21 after 4.05871e+53
[2022-06-12 21:29:12] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldIIPs-PT-030B-ReachabilityFireability-01
[2022-06-12 21:29:12] [INFO ] KInduction solution for property ShieldIIPs-PT-030B-ReachabilityFireability-01(SAT) depth K=2 took 174610 ms
Detected timeout of ITS tools.
[2022-06-12 21:46:42] [INFO ] Applying decomposition
[2022-06-12 21:46:42] [INFO ] Flatten gal took : 148 ms
[2022-06-12 21:46:42] [INFO ] Decomposing Gal with order
[2022-06-12 21:46:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-12 21:46:42] [INFO ] Removed a total of 650 redundant transitions.
[2022-06-12 21:46:42] [INFO ] Flatten gal took : 231 ms
[2022-06-12 21:46:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 579 labels/synchronizations in 173 ms.
[2022-06-12 21:46:43] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability12429045104287170674.gal : 51 ms
[2022-06-12 21:46:43] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability7325802548993892214.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/ReachabilityFireability12429045104287170674.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityFireability7325802548993892214.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/ReachabilityFireability12429045104287170674.gal -t CGAL -reachable-file /tmp/ReachabilityFireability7325802548993892214.prop --nowitness
Loading property file /tmp/ReachabilityFireability7325802548993892214.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 1
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :1 after 19
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :19 after 139
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :139 after 199159
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :199159 after 2.02232e+16
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :2.67079e+21 after 2.09993e+25
Invariant property ShieldIIPs-PT-030B-ReachabilityFireability-01 does not hold.
FORMULA ShieldIIPs-PT-030B-ReachabilityFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :2.09993e+25 after 3.90655e+57
WARNING : LTSmin timed out (>1800 s) on command CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, -i, ShieldIIPsPT030BReachabilityFireability00==true], workingDir=/tmp/ltsmin11219574862834631160]
Retrying LTSmin with larger timeout 14400 s
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, -i, ShieldIIPsPT030BReachabilityFireability00==true], workingDir=/tmp/ltsmin11219574862834631160]
[2022-06-12 21:59:06] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldIIPs-PT-030B-ReachabilityFireability-00
[2022-06-12 21:59:06] [INFO ] KInduction solution for property ShieldIIPs-PT-030B-ReachabilityFireability-00(SAT) depth K=3 took 1794843 ms
Detected timeout of ITS tools.
[2022-06-12 22:09:19] [INFO ] Flatten gal took : 141 ms
[2022-06-12 22:09:19] [INFO ] Input system was already deterministic with 865 transitions.
[2022-06-12 22:09:19] [INFO ] Transformed 895 places.
[2022-06-12 22:09:19] [INFO ] Transformed 865 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-06-12 22:09:19] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability15959711381604367414.gal : 21 ms
[2022-06-12 22:09:19] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability13865234614543151477.prop : 31 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/ReachabilityFireability15959711381604367414.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityFireability13865234614543151477.prop, --nowitness, --load-order, /home/mcc/execution/model.ord, --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/ReachabilityFireability15959711381604367414.gal -t CGAL -reachable-file /tmp/ReachabilityFireability13865234614543151477.prop --nowitness --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/ReachabilityFireability13865234614543151477.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 11
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :11 after 26
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :26 after 74
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :74 after 250
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :250 after 1698
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1698 after 11413
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :11413 after 58350
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :58350 after 64712
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :64712 after 1.81534e+06
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1.81534e+06 after 1.1024e+08
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :1.1024e+08 after 1.98041e+09
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :1.98041e+09 after 4.80355e+10
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :4.80355e+10 after 6.1718e+11
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :6.1718e+11 after 6.72381e+15
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :6.72381e+15 after 2.35075e+18
[2022-06-12 22:11:32] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldIIPs-PT-030B-ReachabilityFireability-00
[2022-06-12 22:11:32] [INFO ] KInduction solution for property ShieldIIPs-PT-030B-ReachabilityFireability-00(SAT) depth K=4 took 745384 ms
SDD proceeding with computation,1 properties remain. new max is 262144
SDD size :2.35075e+18 after 2.00942e+24

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination ReachabilityFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldIIPs-PT-030B"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="gold2021"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool gold2021"
echo " Input is ShieldIIPs-PT-030B, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r233-tall-165286037000048"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPs-PT-030B.tgz
mv ShieldIIPs-PT-030B execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;