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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 7.7K Apr 29 13:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Apr 29 13:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Apr 29 13:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Apr 29 13:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 9 08:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 9 08:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 08:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 08:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.6K Apr 29 13:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 84K Apr 29 13:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 29 13:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 94K Apr 29 13:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 08:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:56 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 955K 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 ShieldPPPt-PT-050B-ReachabilityFireability-00
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityFireability-01
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityFireability-02
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityFireability-03
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityFireability-04
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityFireability-05
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityFireability-06
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityFireability-07
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityFireability-08
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityFireability-09
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityFireability-10
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityFireability-11
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityFireability-12
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityFireability-13
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityFireability-14
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1655076787958

Running Version 0
[2022-06-12 23:33:09] [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 23:33:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-12 23:33:09] [INFO ] Load time of PNML (sax parser for PT used): 172 ms
[2022-06-12 23:33:09] [INFO ] Transformed 3903 places.
[2022-06-12 23:33:09] [INFO ] Transformed 3553 transitions.
[2022-06-12 23:33:09] [INFO ] Found NUPN structural information;
[2022-06-12 23:33:09] [INFO ] Parsed PT model containing 3903 places and 3553 transitions in 368 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 16) seen :3
FORMULA ShieldPPPt-PT-050B-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-050B-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-050B-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 13) 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 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 13) seen :0
Running SMT prover for 13 properties.
// Phase 1: matrix 3553 rows 3903 cols
[2022-06-12 23:33:10] [INFO ] Computed 551 place invariants in 48 ms
[2022-06-12 23:33:11] [INFO ] [Real]Absence check using 551 positive place invariants in 407 ms returned sat
[2022-06-12 23:33:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:33:15] [INFO ] [Real]Absence check using state equation in 3344 ms returned sat
[2022-06-12 23:33:15] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:33:16] [INFO ] [Nat]Absence check using 551 positive place invariants in 389 ms returned sat
[2022-06-12 23:33:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 23:33:19] [INFO ] [Nat]Absence check using state equation in 3370 ms returned sat
[2022-06-12 23:33:20] [INFO ] Deduced a trap composed of 18 places in 1239 ms of which 9 ms to minimize.
[2022-06-12 23:33:20] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
[2022-06-12 23:33:21] [INFO ] [Real]Absence check using 551 positive place invariants in 290 ms returned sat
[2022-06-12 23:33:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:33:23] [INFO ] [Real]Absence check using state equation in 1925 ms returned sat
[2022-06-12 23:33:23] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:33:24] [INFO ] [Nat]Absence check using 551 positive place invariants in 271 ms returned sat
[2022-06-12 23:33:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 23:33:26] [INFO ] [Nat]Absence check using state equation in 1862 ms returned sat
[2022-06-12 23:33:28] [INFO ] Deduced a trap composed of 21 places in 1918 ms of which 6 ms to minimize.
[2022-06-12 23:33:30] [INFO ] Deduced a trap composed of 13 places in 2012 ms of which 5 ms to minimize.
[2022-06-12 23:33:30] [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 23:33:31] [INFO ] [Real]Absence check using 551 positive place invariants in 328 ms returned sat
[2022-06-12 23:33:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:33:35] [INFO ] [Real]Absence check using state equation in 3821 ms returned sat
[2022-06-12 23:33:35] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:33:36] [INFO ] [Nat]Absence check using 551 positive place invariants in 278 ms returned sat
[2022-06-12 23:33:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 23:33:40] [INFO ] [Nat]Absence check using state equation in 4016 ms returned sat
[2022-06-12 23:33:41] [INFO ] Deduced a trap composed of 23 places in 1180 ms of which 4 ms to minimize.
[2022-06-12 23:33: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 23:33:42] [INFO ] [Real]Absence check using 551 positive place invariants in 460 ms returned sat
[2022-06-12 23:33:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:33:46] [INFO ] [Real]Absence check using state equation in 4036 ms returned unknown
[2022-06-12 23:33:47] [INFO ] [Real]Absence check using 551 positive place invariants in 290 ms returned sat
[2022-06-12 23:33:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:33:49] [INFO ] [Real]Absence check using state equation in 2414 ms returned sat
[2022-06-12 23:33:49] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:33:50] [INFO ] [Nat]Absence check using 551 positive place invariants in 283 ms returned sat
[2022-06-12 23:33:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 23:33:53] [INFO ] [Nat]Absence check using state equation in 2486 ms returned sat
[2022-06-12 23:33:54] [INFO ] Deduced a trap composed of 43 places in 1218 ms of which 5 ms to minimize.
[2022-06-12 23:33:55] [INFO ] Deduced a trap composed of 45 places in 1216 ms of which 3 ms to minimize.
[2022-06-12 23:33:55] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 4
[2022-06-12 23:33:56] [INFO ] [Real]Absence check using 551 positive place invariants in 326 ms returned sat
[2022-06-12 23:33:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:34:00] [INFO ] [Real]Absence check using state equation in 4216 ms returned unknown
[2022-06-12 23:34:01] [INFO ] [Real]Absence check using 551 positive place invariants in 279 ms returned sat
[2022-06-12 23:34:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:34:05] [INFO ] [Real]Absence check using state equation in 4062 ms returned sat
[2022-06-12 23:34:05] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:34:06] [INFO ] [Nat]Absence check using 551 positive place invariants in 299 ms returned sat
[2022-06-12 23:34:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 23:34:10] [INFO ] [Nat]Absence check using state equation in 4217 ms returned unknown
[2022-06-12 23:34:11] [INFO ] [Real]Absence check using 551 positive place invariants in 270 ms returned sat
[2022-06-12 23:34:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:34:13] [INFO ] [Real]Absence check using state equation in 2237 ms returned sat
[2022-06-12 23:34:15] [INFO ] Deduced a trap composed of 24 places in 1247 ms of which 3 ms to minimize.
[2022-06-12 23:34:16] [INFO ] Deduced a trap composed of 23 places in 1181 ms of which 2 ms to minimize.
[2022-06-12 23:34:16] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 7
[2022-06-12 23:34:17] [INFO ] [Real]Absence check using 551 positive place invariants in 251 ms returned sat
[2022-06-12 23:34:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:34:19] [INFO ] [Real]Absence check using state equation in 1908 ms returned sat
[2022-06-12 23:34:20] [INFO ] Deduced a trap composed of 20 places in 1261 ms of which 2 ms to minimize.
[2022-06-12 23:34:22] [INFO ] Deduced a trap composed of 31 places in 1285 ms of which 2 ms to minimize.
[2022-06-12 23:34:22] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 8
[2022-06-12 23:34:22] [INFO ] [Real]Absence check using 551 positive place invariants in 246 ms returned sat
[2022-06-12 23:34:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:34:24] [INFO ] [Real]Absence check using state equation in 1852 ms returned sat
[2022-06-12 23:34:26] [INFO ] Deduced a trap composed of 24 places in 1223 ms of which 2 ms to minimize.
[2022-06-12 23:34:27] [INFO ] Deduced a trap composed of 18 places in 1237 ms of which 2 ms to minimize.
[2022-06-12 23:34:27] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 9
[2022-06-12 23:34:28] [INFO ] [Real]Absence check using 551 positive place invariants in 263 ms returned sat
[2022-06-12 23:34:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:34:30] [INFO ] [Real]Absence check using state equation in 2670 ms returned sat
[2022-06-12 23:34:31] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:34:31] [INFO ] [Nat]Absence check using 551 positive place invariants in 90 ms returned unsat
[2022-06-12 23:34:32] [INFO ] [Real]Absence check using 551 positive place invariants in 268 ms returned sat
[2022-06-12 23:34:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:34:34] [INFO ] [Real]Absence check using state equation in 1843 ms returned sat
[2022-06-12 23:34:35] [INFO ] Deduced a trap composed of 20 places in 1334 ms of which 3 ms to minimize.
[2022-06-12 23:34:37] [INFO ] Deduced a trap composed of 18 places in 1318 ms of which 2 ms to minimize.
[2022-06-12 23:34:37] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 11
[2022-06-12 23:34:37] [INFO ] [Real]Absence check using 551 positive place invariants in 275 ms returned sat
[2022-06-12 23:34:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:34:41] [INFO ] [Real]Absence check using state equation in 3212 ms returned sat
[2022-06-12 23:34:41] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:34:41] [INFO ] [Nat]Absence check using 551 positive place invariants in 277 ms returned sat
[2022-06-12 23:34:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 23:34:45] [INFO ] [Nat]Absence check using state equation in 3381 ms returned sat
[2022-06-12 23:34:46] [INFO ] Deduced a trap composed of 21 places in 1236 ms of which 2 ms to minimize.
[2022-06-12 23:34:46] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 12
FORMULA ShieldPPPt-PT-050B-ReachabilityFireability-13 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 13 Parikh solutions to 1 different solutions.
Support contains 248 out of 3903 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3903/3903 places, 3553/3553 transitions.
Drop transitions removed 760 transitions
Trivial Post-agglo rules discarded 760 transitions
Performed 760 trivial Post agglomeration. Transition count delta: 760
Iterating post reduction 0 with 760 rules applied. Total rules applied 760 place count 3903 transition count 2793
Reduce places removed 760 places and 0 transitions.
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Iterating post reduction 1 with 836 rules applied. Total rules applied 1596 place count 3143 transition count 2717
Reduce places removed 76 places and 0 transitions.
Iterating post reduction 2 with 76 rules applied. Total rules applied 1672 place count 3067 transition count 2717
Performed 213 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 213 Pre rules applied. Total rules applied 1672 place count 3067 transition count 2504
Deduced a syphon composed of 213 places in 7 ms
Reduce places removed 213 places and 0 transitions.
Iterating global reduction 3 with 426 rules applied. Total rules applied 2098 place count 2854 transition count 2504
Discarding 297 places :
Symmetric choice reduction at 3 with 297 rule applications. Total rules 2395 place count 2557 transition count 2207
Iterating global reduction 3 with 297 rules applied. Total rules applied 2692 place count 2557 transition count 2207
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 101 Pre rules applied. Total rules applied 2692 place count 2557 transition count 2106
Deduced a syphon composed of 101 places in 6 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 2894 place count 2456 transition count 2106
Performed 759 Post agglomeration using F-continuation condition.Transition count delta: 759
Deduced a syphon composed of 759 places in 3 ms
Reduce places removed 759 places and 0 transitions.
Iterating global reduction 3 with 1518 rules applied. Total rules applied 4412 place count 1697 transition count 1347
Renaming transitions due to excessive name length > 1024 char.
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 3 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 4614 place count 1596 transition count 1347
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 3 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 4624 place count 1591 transition count 1347
Free-agglomeration rule applied 7 times.
Iterating global reduction 3 with 7 rules applied. Total rules applied 4631 place count 1591 transition count 1340
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 4638 place count 1584 transition count 1340
Partial Free-agglomeration rule applied 128 times.
Drop transitions removed 128 transitions
Iterating global reduction 4 with 128 rules applied. Total rules applied 4766 place count 1584 transition count 1340
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 4767 place count 1584 transition count 1340
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 4768 place count 1583 transition count 1339
Applied a total of 4768 rules in 2394 ms. Remains 1583 /3903 variables (removed 2320) and now considering 1339/3553 (removed 2214) transitions.
Finished structural reductions, in 1 iterations. Remains : 1583/3903 places, 1339/3553 transitions.
[2022-06-12 23:34:49] [INFO ] Flatten gal took : 154 ms
[2022-06-12 23:34:49] [INFO ] Flatten gal took : 105 ms
[2022-06-12 23:34:49] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8480377893097765803.gal : 34 ms
[2022-06-12 23:34:49] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12445382220563898258.prop : 2 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality8480377893097765803.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality12445382220563898258.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/ReachabilityCardinality8480377893097765803.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality12445382220563898258.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality12445382220563898258.prop.
SDD proceeding with computation,12 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,12 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,12 properties remain. new max is 16
SDD size :10 after 16
SDD proceeding with computation,12 properties remain. new max is 32
SDD size :16 after 37
SDD proceeding with computation,12 properties remain. new max is 64
SDD size :37 after 38
SDD proceeding with computation,12 properties remain. new max is 128
SDD size :38 after 170
SDD proceeding with computation,12 properties remain. new max is 256
SDD size :170 after 20795
SDD proceeding with computation,12 properties remain. new max is 512
SDD size :20795 after 5.18669e+09
SDD proceeding with computation,12 properties remain. new max is 1024
SDD size :5.18669e+09 after 1.80645e+21
Detected timeout of ITS tools.
[2022-06-12 23:35:04] [INFO ] Flatten gal took : 79 ms
[2022-06-12 23:35:04] [INFO ] Applying decomposition
[2022-06-12 23:35:04] [INFO ] Flatten gal took : 63 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/graph15636301343758170571.txt, -o, /tmp/graph15636301343758170571.bin, -w, /tmp/graph15636301343758170571.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/graph15636301343758170571.bin, -l, -1, -v, -w, /tmp/graph15636301343758170571.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-12 23:35:04] [INFO ] Decomposing Gal with order
[2022-06-12 23:35:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-12 23:35:05] [INFO ] Removed a total of 548 redundant transitions.
[2022-06-12 23:35:05] [INFO ] Flatten gal took : 153 ms
[2022-06-12 23:35:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 242 labels/synchronizations in 43 ms.
[2022-06-12 23:35:05] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13109184524317550081.gal : 19 ms
[2022-06-12 23:35:05] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14972134666581774367.prop : 2 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality13109184524317550081.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality14972134666581774367.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/ReachabilityCardinality13109184524317550081.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality14972134666581774367.prop --nowitness
Loading property file /tmp/ReachabilityCardinality14972134666581774367.prop.
SDD proceeding with computation,12 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,12 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,12 properties remain. new max is 16
SDD size :1 after 37
SDD proceeding with computation,12 properties remain. new max is 32
SDD size :37 after 18253
SDD proceeding with computation,12 properties remain. new max is 64
SDD size :18253 after 3.8596e+06
SDD proceeding with computation,12 properties remain. new max is 128
SDD size :3.8596e+06 after 1.92056e+12
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin18111281766252781374
[2022-06-12 23:35:20] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18111281766252781374
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/ltsmin18111281766252781374]
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/ltsmin18111281766252781374] 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/ltsmin18111281766252781374] 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 2 resets, run finished after 9446 ms. (steps per millisecond=105 ) properties (out of 12) seen :3
FORMULA ShieldPPPt-PT-050B-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-050B-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-050B-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Interrupted Best-First random walk after 750835 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=150 ) properties seen :{}
Interrupted Best-First random walk after 712863 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=142 ) properties seen :{}
Interrupted Best-First random walk after 792013 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=158 ) properties seen :{}
Interrupted Best-First random walk after 693655 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=138 ) properties seen :{}
Interrupted Best-First random walk after 739173 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=147 ) properties seen :{4=1}
FORMULA ShieldPPPt-PT-050B-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Interrupted Best-First random walk after 809455 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=161 ) properties seen :{}
Interrupted Best-First random walk after 832018 steps, including 3 resets, run timeout after 5001 ms. (steps per millisecond=166 ) properties seen :{5=1}
FORMULA ShieldPPPt-PT-050B-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Interrupted Best-First random walk after 837128 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=167 ) properties seen :{}
Interrupted Best-First random walk after 834707 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=166 ) properties seen :{}
Running SMT prover for 7 properties.
// Phase 1: matrix 1339 rows 1583 cols
[2022-06-12 23:36:16] [INFO ] Computed 551 place invariants in 18 ms
[2022-06-12 23:36:16] [INFO ] [Real]Absence check using 551 positive place invariants in 113 ms returned sat
[2022-06-12 23:36:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:36:17] [INFO ] [Real]Absence check using state equation in 611 ms returned sat
[2022-06-12 23:36:17] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:36:17] [INFO ] [Nat]Absence check using 551 positive place invariants in 115 ms returned sat
[2022-06-12 23:36:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 23:36:17] [INFO ] [Nat]Absence check using state equation in 604 ms returned sat
[2022-06-12 23:36:17] [INFO ] State equation strengthened by 162 read => feed constraints.
[2022-06-12 23:36:17] [INFO ] [Nat]Added 162 Read/Feed constraints in 40 ms returned sat
[2022-06-12 23:36:18] [INFO ] Deduced a trap composed of 6 places in 61 ms of which 1 ms to minimize.
[2022-06-12 23:36:18] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 0 ms to minimize.
[2022-06-12 23:36:18] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 1 ms to minimize.
[2022-06-12 23:36:18] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 0 ms to minimize.
[2022-06-12 23:36:18] [INFO ] Deduced a trap composed of 6 places in 49 ms of which 0 ms to minimize.
[2022-06-12 23:36:18] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 0 ms to minimize.
[2022-06-12 23:36:18] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 0 ms to minimize.
[2022-06-12 23:36:18] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 0 ms to minimize.
[2022-06-12 23:36:18] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 3 ms to minimize.
[2022-06-12 23:36:19] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 0 ms to minimize.
[2022-06-12 23:36:19] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2022-06-12 23:36:19] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 0 ms to minimize.
[2022-06-12 23:36:19] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 0 ms to minimize.
[2022-06-12 23:36:19] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1471 ms
[2022-06-12 23:36:19] [INFO ] Computed and/alt/rep : 1317/3815/1317 causal constraints (skipped 0 transitions) in 71 ms.
[2022-06-12 23:36:39] [INFO ] Added : 980 causal constraints over 196 iterations in 20062 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 39 ms.
[2022-06-12 23:36:39] [INFO ] [Real]Absence check using 551 positive place invariants in 116 ms returned sat
[2022-06-12 23:36:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:36:40] [INFO ] [Real]Absence check using state equation in 661 ms returned sat
[2022-06-12 23:36:40] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:36:40] [INFO ] [Nat]Absence check using 551 positive place invariants in 120 ms returned sat
[2022-06-12 23:36:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 23:36:41] [INFO ] [Nat]Absence check using state equation in 683 ms returned sat
[2022-06-12 23:36:41] [INFO ] [Nat]Added 162 Read/Feed constraints in 37 ms returned sat
[2022-06-12 23:36:41] [INFO ] Deduced a trap composed of 6 places in 57 ms of which 1 ms to minimize.
[2022-06-12 23:36:41] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 0 ms to minimize.
[2022-06-12 23:36:41] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 0 ms to minimize.
[2022-06-12 23:36:41] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 0 ms to minimize.
[2022-06-12 23:36:42] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 5 ms to minimize.
[2022-06-12 23:36:42] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 593 ms
[2022-06-12 23:36:42] [INFO ] Computed and/alt/rep : 1317/3815/1317 causal constraints (skipped 0 transitions) in 63 ms.
[2022-06-12 23:37:02] [INFO ] Added : 970 causal constraints over 194 iterations in 20218 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 51 ms.
[2022-06-12 23:37:02] [INFO ] [Real]Absence check using 551 positive place invariants in 104 ms returned sat
[2022-06-12 23:37:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:37:03] [INFO ] [Real]Absence check using state equation in 519 ms returned sat
[2022-06-12 23:37:03] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:37:03] [INFO ] [Nat]Absence check using 551 positive place invariants in 104 ms returned sat
[2022-06-12 23:37:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 23:37:04] [INFO ] [Nat]Absence check using state equation in 548 ms returned sat
[2022-06-12 23:37:04] [INFO ] [Nat]Added 162 Read/Feed constraints in 43 ms returned sat
[2022-06-12 23:37:04] [INFO ] Deduced a trap composed of 6 places in 44 ms of which 0 ms to minimize.
[2022-06-12 23:37:04] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 1 ms to minimize.
[2022-06-12 23:37:04] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
[2022-06-12 23:37:04] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 1 ms to minimize.
[2022-06-12 23:37:04] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 0 ms to minimize.
[2022-06-12 23:37:04] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 0 ms to minimize.
[2022-06-12 23:37:04] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 607 ms
[2022-06-12 23:37:04] [INFO ] Computed and/alt/rep : 1317/3815/1317 causal constraints (skipped 0 transitions) in 59 ms.
[2022-06-12 23:37:24] [INFO ] Added : 990 causal constraints over 198 iterations in 20093 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 37 ms.
[2022-06-12 23:37:25] [INFO ] [Real]Absence check using 551 positive place invariants in 120 ms returned sat
[2022-06-12 23:37:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:37:25] [INFO ] [Real]Absence check using state equation in 654 ms returned sat
[2022-06-12 23:37:25] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:37:26] [INFO ] [Nat]Absence check using 551 positive place invariants in 129 ms returned sat
[2022-06-12 23:37:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 23:37:26] [INFO ] [Nat]Absence check using state equation in 722 ms returned sat
[2022-06-12 23:37:26] [INFO ] [Nat]Added 162 Read/Feed constraints in 43 ms returned sat
[2022-06-12 23:37:27] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 0 ms to minimize.
[2022-06-12 23:37:27] [INFO ] Deduced a trap composed of 5 places in 47 ms of which 0 ms to minimize.
[2022-06-12 23:37:27] [INFO ] Deduced a trap composed of 7 places in 48 ms of which 0 ms to minimize.
[2022-06-12 23:37:27] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 0 ms to minimize.
[2022-06-12 23:37:27] [INFO ] Deduced a trap composed of 8 places in 45 ms of which 1 ms to minimize.
[2022-06-12 23:37:27] [INFO ] Deduced a trap composed of 6 places in 46 ms of which 0 ms to minimize.
[2022-06-12 23:37:27] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 0 ms to minimize.
[2022-06-12 23:37:27] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
[2022-06-12 23:37:27] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 1 ms to minimize.
[2022-06-12 23:37:27] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 0 ms to minimize.
[2022-06-12 23:37:28] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 1 ms to minimize.
[2022-06-12 23:37:28] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 0 ms to minimize.
[2022-06-12 23:37:28] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 8 ms to minimize.
[2022-06-12 23:37:28] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1404 ms
[2022-06-12 23:37:28] [INFO ] Computed and/alt/rep : 1317/3815/1317 causal constraints (skipped 0 transitions) in 62 ms.
[2022-06-12 23:37:48] [INFO ] Added : 970 causal constraints over 194 iterations in 20174 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 35 ms.
[2022-06-12 23:37:48] [INFO ] [Real]Absence check using 551 positive place invariants in 100 ms returned sat
[2022-06-12 23:37:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:37:49] [INFO ] [Real]Absence check using state equation in 509 ms returned sat
[2022-06-12 23:37:49] [INFO ] [Real]Added 162 Read/Feed constraints in 22 ms returned sat
[2022-06-12 23:37:49] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:37:49] [INFO ] [Nat]Absence check using 551 positive place invariants in 102 ms returned sat
[2022-06-12 23:37:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 23:37:50] [INFO ] [Nat]Absence check using state equation in 508 ms returned sat
[2022-06-12 23:37:50] [INFO ] [Nat]Added 162 Read/Feed constraints in 35 ms returned sat
[2022-06-12 23:37:50] [INFO ] Deduced a trap composed of 6 places in 45 ms of which 1 ms to minimize.
[2022-06-12 23:37:50] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 0 ms to minimize.
[2022-06-12 23:37:50] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 1 ms to minimize.
[2022-06-12 23:37:50] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 0 ms to minimize.
[2022-06-12 23:37:50] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
[2022-06-12 23:37:50] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
[2022-06-12 23:37:50] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 637 ms
[2022-06-12 23:37:50] [INFO ] Computed and/alt/rep : 1317/3815/1317 causal constraints (skipped 0 transitions) in 53 ms.
[2022-06-12 23:38:11] [INFO ] Added : 975 causal constraints over 195 iterations in 20150 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 39 ms.
[2022-06-12 23:38:11] [INFO ] [Real]Absence check using 551 positive place invariants in 102 ms returned sat
[2022-06-12 23:38:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:38:11] [INFO ] [Real]Absence check using state equation in 497 ms returned sat
[2022-06-12 23:38:11] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:38:12] [INFO ] [Nat]Absence check using 551 positive place invariants in 99 ms returned sat
[2022-06-12 23:38:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 23:38:12] [INFO ] [Nat]Absence check using state equation in 505 ms returned sat
[2022-06-12 23:38:12] [INFO ] [Nat]Added 162 Read/Feed constraints in 32 ms returned sat
[2022-06-12 23:38:12] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
[2022-06-12 23:38:12] [INFO ] Deduced a trap composed of 8 places in 47 ms of which 0 ms to minimize.
[2022-06-12 23:38:13] [INFO ] Deduced a trap composed of 6 places in 44 ms of which 2 ms to minimize.
[2022-06-12 23:38:13] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 1 ms to minimize.
[2022-06-12 23:38:13] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 1 ms to minimize.
[2022-06-12 23:38:13] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 545 ms
[2022-06-12 23:38:13] [INFO ] Computed and/alt/rep : 1317/3815/1317 causal constraints (skipped 0 transitions) in 57 ms.
[2022-06-12 23:38:33] [INFO ] Added : 1005 causal constraints over 201 iterations in 20040 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 38 ms.
[2022-06-12 23:38:33] [INFO ] [Real]Absence check using 551 positive place invariants in 101 ms returned sat
[2022-06-12 23:38:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:38:34] [INFO ] [Real]Absence check using state equation in 496 ms returned sat
[2022-06-12 23:38:34] [INFO ] [Real]Added 162 Read/Feed constraints in 25 ms returned sat
[2022-06-12 23:38:34] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:38:34] [INFO ] [Nat]Absence check using 551 positive place invariants in 112 ms returned sat
[2022-06-12 23:38:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 23:38:35] [INFO ] [Nat]Absence check using state equation in 499 ms returned sat
[2022-06-12 23:38:35] [INFO ] [Nat]Added 162 Read/Feed constraints in 49 ms returned sat
[2022-06-12 23:38:35] [INFO ] Deduced a trap composed of 6 places in 53 ms of which 1 ms to minimize.
[2022-06-12 23:38:35] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 1 ms to minimize.
[2022-06-12 23:38:35] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 0 ms to minimize.
[2022-06-12 23:38:35] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
[2022-06-12 23:38:35] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2022-06-12 23:38:35] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 570 ms
[2022-06-12 23:38:35] [INFO ] Computed and/alt/rep : 1317/3815/1317 causal constraints (skipped 0 transitions) in 63 ms.
[2022-06-12 23:38:55] [INFO ] Added : 915 causal constraints over 183 iterations in 20095 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 49 ms.
Incomplete Parikh walk after 221600 steps, including 1001 resets, run finished after 1853 ms. (steps per millisecond=119 ) properties (out of 7) seen :0 could not realise parikh vector
Incomplete Parikh walk after 152900 steps, including 1000 resets, run finished after 1178 ms. (steps per millisecond=129 ) properties (out of 7) seen :0 could not realise parikh vector
Incomplete Parikh walk after 238500 steps, including 1000 resets, run finished after 1835 ms. (steps per millisecond=129 ) properties (out of 7) seen :0 could not realise parikh vector
Incomplete Parikh walk after 209700 steps, including 1000 resets, run finished after 1616 ms. (steps per millisecond=129 ) properties (out of 7) seen :0 could not realise parikh vector
Incomplete Parikh walk after 233900 steps, including 1000 resets, run finished after 1809 ms. (steps per millisecond=129 ) properties (out of 7) seen :0 could not realise parikh vector
Incomplete Parikh walk after 177200 steps, including 1000 resets, run finished after 1321 ms. (steps per millisecond=134 ) properties (out of 7) seen :0 could not realise parikh vector
Incomplete Parikh walk after 154900 steps, including 1000 resets, run finished after 1161 ms. (steps per millisecond=133 ) properties (out of 7) seen :0 could not realise parikh vector
Support contains 151 out of 1583 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1583/1583 places, 1339/1339 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 1583 transition count 1315
Reduce places removed 24 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 25 rules applied. Total rules applied 49 place count 1559 transition count 1314
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 50 place count 1558 transition count 1314
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 18 Pre rules applied. Total rules applied 50 place count 1558 transition count 1296
Deduced a syphon composed of 18 places in 2 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 86 place count 1540 transition count 1296
Performed 68 Post agglomeration using F-continuation condition.Transition count delta: 68
Deduced a syphon composed of 68 places in 2 ms
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 3 with 136 rules applied. Total rules applied 222 place count 1472 transition count 1228
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 16 places in 2 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 254 place count 1456 transition count 1227
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 257 place count 1456 transition count 1224
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 260 place count 1453 transition count 1224
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 269 place count 1453 transition count 1224
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 270 place count 1452 transition count 1223
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 271 place count 1451 transition count 1222
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 272 place count 1450 transition count 1221
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 273 place count 1449 transition count 1220
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 274 place count 1448 transition count 1219
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 275 place count 1447 transition count 1218
Applied a total of 275 rules in 561 ms. Remains 1447 /1583 variables (removed 136) and now considering 1218/1339 (removed 121) transitions.
Finished structural reductions, in 1 iterations. Remains : 1447/1583 places, 1218/1339 transitions.
[2022-06-12 23:39:07] [INFO ] Flatten gal took : 65 ms
[2022-06-12 23:39:07] [INFO ] Flatten gal took : 54 ms
[2022-06-12 23:39:07] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5331933460893490276.gal : 6 ms
[2022-06-12 23:39:07] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4362247677657380737.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/ReachabilityCardinality5331933460893490276.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality4362247677657380737.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/ReachabilityCardinality5331933460893490276.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality4362247677657380737.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality4362247677657380737.prop.
SDD proceeding with computation,7 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,7 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,7 properties remain. new max is 16
SDD size :10 after 11
SDD proceeding with computation,7 properties remain. new max is 32
SDD size :11 after 26
SDD proceeding with computation,7 properties remain. new max is 64
SDD size :26 after 29
SDD proceeding with computation,7 properties remain. new max is 128
SDD size :29 after 83
SDD proceeding with computation,7 properties remain. new max is 256
SDD size :83 after 279940
SDD proceeding with computation,7 properties remain. new max is 512
SDD size :279940 after 1.24441e+11
SDD proceeding with computation,7 properties remain. new max is 1024
SDD size :2.7433e+17 after 7.08979e+17
SDD proceeding with computation,7 properties remain. new max is 2048
SDD size :7.08979e+17 after 7.08979e+17
SDD proceeding with computation,7 properties remain. new max is 4096
SDD size :7.08979e+17 after 7.08979e+17
SDD proceeding with computation,7 properties remain. new max is 8192
SDD size :7.08979e+17 after 7.08979e+17
Detected timeout of ITS tools.
[2022-06-12 23:39:22] [INFO ] Flatten gal took : 52 ms
[2022-06-12 23:39:22] [INFO ] Applying decomposition
[2022-06-12 23:39:22] [INFO ] Flatten gal took : 59 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/graph4778420850073978236.txt, -o, /tmp/graph4778420850073978236.bin, -w, /tmp/graph4778420850073978236.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/graph4778420850073978236.bin, -l, -1, -v, -w, /tmp/graph4778420850073978236.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-12 23:39:22] [INFO ] Decomposing Gal with order
[2022-06-12 23:39:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-12 23:39:22] [INFO ] Removed a total of 622 redundant transitions.
[2022-06-12 23:39:23] [INFO ] Flatten gal took : 92 ms
[2022-06-12 23:39:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 262 labels/synchronizations in 65 ms.
[2022-06-12 23:39:23] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14178965900079968458.gal : 28 ms
[2022-06-12 23:39:23] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12739267151093229254.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/ReachabilityCardinality14178965900079968458.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality12739267151093229254.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/ReachabilityCardinality14178965900079968458.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality12739267151093229254.prop --nowitness
Loading property file /tmp/ReachabilityCardinality12739267151093229254.prop.
SDD proceeding with computation,7 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,7 properties remain. new max is 8
SDD size :1 after 8
SDD proceeding with computation,7 properties remain. new max is 16
SDD size :8 after 20
SDD proceeding with computation,7 properties remain. new max is 32
SDD size :20 after 332
SDD proceeding with computation,7 properties remain. new max is 64
SDD size :332 after 139976
SDD proceeding with computation,7 properties remain. new max is 128
SDD size :139976 after 1.24441e+11
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15172226791951406552
[2022-06-12 23:39:38] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15172226791951406552
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/ltsmin15172226791951406552]
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/ltsmin15172226791951406552] 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/ltsmin15172226791951406552] 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 2 resets, run finished after 9266 ms. (steps per millisecond=107 ) properties (out of 7) seen :0
Interrupted Best-First random walk after 738808 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=147 ) properties seen :{}
Interrupted Best-First random walk after 689005 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=137 ) properties seen :{}
Interrupted Best-First random walk after 769378 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=153 ) properties seen :{}
Interrupted Best-First random walk after 678881 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=135 ) properties seen :{}
Interrupted Best-First random walk after 798691 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=159 ) properties seen :{}
Interrupted Best-First random walk after 820787 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=164 ) properties seen :{}
Interrupted Best-First random walk after 813806 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=162 ) properties seen :{}
Interrupted probabilistic random walk after 1445118 steps, run timeout after 30001 ms. (steps per millisecond=48 ) properties seen :{}
Probabilistic random walk after 1445118 steps, saw 955516 distinct states, run finished after 30001 ms. (steps per millisecond=48 ) properties seen :{}
Running SMT prover for 7 properties.
// Phase 1: matrix 1218 rows 1447 cols
[2022-06-12 23:40:53] [INFO ] Computed 551 place invariants in 13 ms
[2022-06-12 23:40:53] [INFO ] [Real]Absence check using 551 positive place invariants in 107 ms returned sat
[2022-06-12 23:40:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:40:54] [INFO ] [Real]Absence check using state equation in 529 ms returned sat
[2022-06-12 23:40:54] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:40:54] [INFO ] [Nat]Absence check using 551 positive place invariants in 106 ms returned sat
[2022-06-12 23:40:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 23:40:55] [INFO ] [Nat]Absence check using state equation in 524 ms returned sat
[2022-06-12 23:40:55] [INFO ] State equation strengthened by 137 read => feed constraints.
[2022-06-12 23:40:55] [INFO ] [Nat]Added 137 Read/Feed constraints in 24 ms returned sat
[2022-06-12 23:40:55] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 1 ms to minimize.
[2022-06-12 23:40:55] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 0 ms to minimize.
[2022-06-12 23:40:55] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 1 ms to minimize.
[2022-06-12 23:40:55] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 0 ms to minimize.
[2022-06-12 23:40:55] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 0 ms to minimize.
[2022-06-12 23:40:55] [INFO ] Deduced a trap composed of 8 places in 44 ms of which 1 ms to minimize.
[2022-06-12 23:40:55] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 598 ms
[2022-06-12 23:40:55] [INFO ] Computed and/alt/rep : 1192/3404/1192 causal constraints (skipped 0 transitions) in 53 ms.
[2022-06-12 23:41:15] [INFO ] Added : 1020 causal constraints over 204 iterations in 20129 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 92 ms.
[2022-06-12 23:41:16] [INFO ] [Real]Absence check using 551 positive place invariants in 114 ms returned sat
[2022-06-12 23:41:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:41:16] [INFO ] [Real]Absence check using state equation in 563 ms returned sat
[2022-06-12 23:41:16] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:41:17] [INFO ] [Nat]Absence check using 551 positive place invariants in 110 ms returned sat
[2022-06-12 23:41:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 23:41:17] [INFO ] [Nat]Absence check using state equation in 583 ms returned sat
[2022-06-12 23:41:17] [INFO ] [Nat]Added 137 Read/Feed constraints in 41 ms returned sat
[2022-06-12 23:41:17] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 0 ms to minimize.
[2022-06-12 23:41:18] [INFO ] Deduced a trap composed of 6 places in 43 ms of which 1 ms to minimize.
[2022-06-12 23:41:18] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 0 ms to minimize.
[2022-06-12 23:41:18] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 0 ms to minimize.
[2022-06-12 23:41:18] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 411 ms
[2022-06-12 23:41:18] [INFO ] Computed and/alt/rep : 1192/3404/1192 causal constraints (skipped 0 transitions) in 58 ms.
[2022-06-12 23:41:38] [INFO ] Added : 1045 causal constraints over 209 iterations in 20073 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 59 ms.
[2022-06-12 23:41:38] [INFO ] [Real]Absence check using 551 positive place invariants in 97 ms returned sat
[2022-06-12 23:41:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:41:39] [INFO ] [Real]Absence check using state equation in 472 ms returned sat
[2022-06-12 23:41:39] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:41:39] [INFO ] [Nat]Absence check using 551 positive place invariants in 101 ms returned sat
[2022-06-12 23:41:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 23:41:39] [INFO ] [Nat]Absence check using state equation in 478 ms returned sat
[2022-06-12 23:41:39] [INFO ] [Nat]Added 137 Read/Feed constraints in 32 ms returned sat
[2022-06-12 23:41:40] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 1 ms to minimize.
[2022-06-12 23:41:40] [INFO ] Deduced a trap composed of 6 places in 58 ms of which 1 ms to minimize.
[2022-06-12 23:41:40] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 0 ms to minimize.
[2022-06-12 23:41:40] [INFO ] Deduced a trap composed of 8 places in 53 ms of which 1 ms to minimize.
[2022-06-12 23:41:40] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 1 ms to minimize.
[2022-06-12 23:41:40] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 0 ms to minimize.
[2022-06-12 23:41:40] [INFO ] Deduced a trap composed of 8 places in 47 ms of which 0 ms to minimize.
[2022-06-12 23:41:40] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 0 ms to minimize.
[2022-06-12 23:41:40] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 848 ms
[2022-06-12 23:41:40] [INFO ] Computed and/alt/rep : 1192/3404/1192 causal constraints (skipped 0 transitions) in 54 ms.
[2022-06-12 23:42:00] [INFO ] Added : 1048 causal constraints over 210 iterations in 20174 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 80 ms.
[2022-06-12 23:42:01] [INFO ] [Real]Absence check using 551 positive place invariants in 110 ms returned sat
[2022-06-12 23:42:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:42:01] [INFO ] [Real]Absence check using state equation in 586 ms returned sat
[2022-06-12 23:42:01] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:42:02] [INFO ] [Nat]Absence check using 551 positive place invariants in 130 ms returned sat
[2022-06-12 23:42:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 23:42:02] [INFO ] [Nat]Absence check using state equation in 587 ms returned sat
[2022-06-12 23:42:02] [INFO ] [Nat]Added 137 Read/Feed constraints in 45 ms returned sat
[2022-06-12 23:42:02] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 0 ms to minimize.
[2022-06-12 23:42:03] [INFO ] Deduced a trap composed of 6 places in 53 ms of which 1 ms to minimize.
[2022-06-12 23:42:03] [INFO ] Deduced a trap composed of 6 places in 62 ms of which 0 ms to minimize.
[2022-06-12 23:42:03] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 1 ms to minimize.
[2022-06-12 23:42:03] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 0 ms to minimize.
[2022-06-12 23:42:03] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 0 ms to minimize.
[2022-06-12 23:42:03] [INFO ] Deduced a trap composed of 5 places in 43 ms of which 0 ms to minimize.
[2022-06-12 23:42:03] [INFO ] Deduced a trap composed of 7 places in 48 ms of which 0 ms to minimize.
[2022-06-12 23:42:03] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 868 ms
[2022-06-12 23:42:03] [INFO ] Computed and/alt/rep : 1192/3404/1192 causal constraints (skipped 0 transitions) in 56 ms.
[2022-06-12 23:42:23] [INFO ] Added : 1020 causal constraints over 204 iterations in 20243 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 50 ms.
[2022-06-12 23:42:24] [INFO ] [Real]Absence check using 551 positive place invariants in 94 ms returned sat
[2022-06-12 23:42:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:42:24] [INFO ] [Real]Absence check using state equation in 450 ms returned sat
[2022-06-12 23:42:24] [INFO ] [Real]Added 137 Read/Feed constraints in 17 ms returned sat
[2022-06-12 23:42:24] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:42:25] [INFO ] [Nat]Absence check using 551 positive place invariants in 101 ms returned sat
[2022-06-12 23:42:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 23:42:25] [INFO ] [Nat]Absence check using state equation in 456 ms returned sat
[2022-06-12 23:42:25] [INFO ] [Nat]Added 137 Read/Feed constraints in 34 ms returned sat
[2022-06-12 23:42:25] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 1 ms to minimize.
[2022-06-12 23:42:25] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
[2022-06-12 23:42:25] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 0 ms to minimize.
[2022-06-12 23:42:25] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 0 ms to minimize.
[2022-06-12 23:42:25] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 390 ms
[2022-06-12 23:42:26] [INFO ] Computed and/alt/rep : 1192/3404/1192 causal constraints (skipped 0 transitions) in 56 ms.
[2022-06-12 23:42:46] [INFO ] Added : 990 causal constraints over 198 iterations in 20172 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 55 ms.
[2022-06-12 23:42:46] [INFO ] [Real]Absence check using 551 positive place invariants in 85 ms returned sat
[2022-06-12 23:42:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:42:46] [INFO ] [Real]Absence check using state equation in 423 ms returned sat
[2022-06-12 23:42:46] [INFO ] [Real]Added 137 Read/Feed constraints in 17 ms returned sat
[2022-06-12 23:42:47] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:42:47] [INFO ] [Nat]Absence check using 551 positive place invariants in 91 ms returned sat
[2022-06-12 23:42:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 23:42:47] [INFO ] [Nat]Absence check using state equation in 422 ms returned sat
[2022-06-12 23:42:47] [INFO ] [Nat]Added 137 Read/Feed constraints in 22 ms returned sat
[2022-06-12 23:42:47] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 0 ms to minimize.
[2022-06-12 23:42:47] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 1 ms to minimize.
[2022-06-12 23:42:47] [INFO ] Deduced a trap composed of 8 places in 44 ms of which 0 ms to minimize.
[2022-06-12 23:42:47] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 309 ms
[2022-06-12 23:42:48] [INFO ] Computed and/alt/rep : 1192/3404/1192 causal constraints (skipped 0 transitions) in 56 ms.
[2022-06-12 23:43:08] [INFO ] Added : 1004 causal constraints over 201 iterations in 20307 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 80 ms.
[2022-06-12 23:43:08] [INFO ] [Real]Absence check using 551 positive place invariants in 92 ms returned sat
[2022-06-12 23:43:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:43:09] [INFO ] [Real]Absence check using state equation in 431 ms returned sat
[2022-06-12 23:43:09] [INFO ] [Real]Added 137 Read/Feed constraints in 19 ms returned sat
[2022-06-12 23:43:09] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:43:09] [INFO ] [Nat]Absence check using 551 positive place invariants in 90 ms returned sat
[2022-06-12 23:43:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 23:43:09] [INFO ] [Nat]Absence check using state equation in 422 ms returned sat
[2022-06-12 23:43:09] [INFO ] [Nat]Added 137 Read/Feed constraints in 23 ms returned sat
[2022-06-12 23:43:09] [INFO ] Deduced a trap composed of 6 places in 55 ms of which 0 ms to minimize.
[2022-06-12 23:43:10] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 1 ms to minimize.
[2022-06-12 23:43:10] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 0 ms to minimize.
[2022-06-12 23:43:10] [INFO ] Deduced a trap composed of 6 places in 48 ms of which 0 ms to minimize.
[2022-06-12 23:43:10] [INFO ] Deduced a trap composed of 6 places in 50 ms of which 0 ms to minimize.
[2022-06-12 23:43:10] [INFO ] Deduced a trap composed of 8 places in 45 ms of which 1 ms to minimize.
[2022-06-12 23:43:10] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 1 ms to minimize.
[2022-06-12 23:43:10] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 728 ms
[2022-06-12 23:43:10] [INFO ] Computed and/alt/rep : 1192/3404/1192 causal constraints (skipped 0 transitions) in 53 ms.
[2022-06-12 23:43:30] [INFO ] Added : 1035 causal constraints over 207 iterations in 20185 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 57 ms.
Incomplete Parikh walk after 122700 steps, including 801 resets, run finished after 1076 ms. (steps per millisecond=114 ) properties (out of 7) seen :0 could not realise parikh vector
Incomplete Parikh walk after 149000 steps, including 583 resets, run finished after 1293 ms. (steps per millisecond=115 ) properties (out of 7) seen :2 could not realise parikh vector
FORMULA ShieldPPPt-PT-050B-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldPPPt-PT-050B-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 147300 steps, including 756 resets, run finished after 1218 ms. (steps per millisecond=120 ) properties (out of 5) seen :0 could not realise parikh vector
Incomplete Parikh walk after 133700 steps, including 1000 resets, run finished after 1140 ms. (steps per millisecond=117 ) properties (out of 5) seen :0 could not realise parikh vector
Incomplete Parikh walk after 124600 steps, including 812 resets, run finished after 1037 ms. (steps per millisecond=120 ) properties (out of 5) seen :0 could not realise parikh vector
Incomplete Parikh walk after 157200 steps, including 1000 resets, run finished after 1248 ms. (steps per millisecond=125 ) properties (out of 5) seen :0 could not realise parikh vector
Incomplete Parikh walk after 144300 steps, including 1000 resets, run finished after 1045 ms. (steps per millisecond=138 ) properties (out of 5) seen :0 could not realise parikh vector
Support contains 107 out of 1447 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1447/1447 places, 1218/1218 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 1447 transition count 1209
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 1438 transition count 1209
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 18 place count 1438 transition count 1199
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 38 place count 1428 transition count 1199
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 2 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 90 place count 1402 transition count 1173
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 104 place count 1395 transition count 1173
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 107 place count 1395 transition count 1173
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 108 place count 1394 transition count 1172
Iterating global reduction 2 with 1 rules applied. Total rules applied 109 place count 1394 transition count 1172
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 110 place count 1393 transition count 1171
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 111 place count 1392 transition count 1170
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 112 place count 1391 transition count 1169
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 113 place count 1390 transition count 1168
Applied a total of 113 rules in 370 ms. Remains 1390 /1447 variables (removed 57) and now considering 1168/1218 (removed 50) transitions.
Finished structural reductions, in 1 iterations. Remains : 1390/1447 places, 1168/1218 transitions.
[2022-06-12 23:43:39] [INFO ] Flatten gal took : 47 ms
[2022-06-12 23:43:39] [INFO ] Flatten gal took : 47 ms
[2022-06-12 23:43:39] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9986982792146360186.gal : 5 ms
[2022-06-12 23:43:39] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4852140416570031514.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/ReachabilityCardinality9986982792146360186.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality4852140416570031514.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/ReachabilityCardinality9986982792146360186.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality4852140416570031514.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality4852140416570031514.prop.
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :10 after 11
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :11 after 24
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :24 after 28
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :28 after 78
SDD proceeding with computation,5 properties remain. new max is 256
SDD size :78 after 2432
SDD proceeding with computation,5 properties remain. new max is 512
SDD size :2432 after 1.13382e+08
SDD proceeding with computation,5 properties remain. new max is 1024
SDD size :5.35607e+13 after 1.25421e+14
SDD proceeding with computation,5 properties remain. new max is 2048
SDD size :1.25421e+14 after 1.25421e+14
SDD proceeding with computation,5 properties remain. new max is 4096
SDD size :1.25421e+14 after 1.25421e+14
Detected timeout of ITS tools.
[2022-06-12 23:43:54] [INFO ] Flatten gal took : 42 ms
[2022-06-12 23:43:54] [INFO ] Applying decomposition
[2022-06-12 23:43:54] [INFO ] Flatten gal took : 42 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/graph869820469590002820.txt, -o, /tmp/graph869820469590002820.bin, -w, /tmp/graph869820469590002820.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/graph869820469590002820.bin, -l, -1, -v, -w, /tmp/graph869820469590002820.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-12 23:43:54] [INFO ] Decomposing Gal with order
[2022-06-12 23:43:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-12 23:43:54] [INFO ] Removed a total of 637 redundant transitions.
[2022-06-12 23:43:54] [INFO ] Flatten gal took : 91 ms
[2022-06-12 23:43:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 286 labels/synchronizations in 20 ms.
[2022-06-12 23:43:55] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13567188282285336576.gal : 12 ms
[2022-06-12 23:43:55] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2881354815996893603.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/ReachabilityCardinality13567188282285336576.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality2881354815996893603.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/ReachabilityCardinality13567188282285336576.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality2881354815996893603.prop --nowitness
Loading property file /tmp/ReachabilityCardinality2881354815996893603.prop.
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 6
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :6 after 15
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :15 after 33
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :33 after 249
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :249 after 6.29899e+06
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin470671878499517324
[2022-06-12 23:44:10] [INFO ] Built C files in 37ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin470671878499517324
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/ltsmin470671878499517324]
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/ltsmin470671878499517324] 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/ltsmin470671878499517324] 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 2 resets, run finished after 8739 ms. (steps per millisecond=114 ) properties (out of 5) seen :0
Interrupted Best-First random walk after 742647 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=148 ) properties seen :{}
Interrupted Best-First random walk after 777179 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=155 ) properties seen :{}
Interrupted Best-First random walk after 680098 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=135 ) properties seen :{}
Interrupted Best-First random walk after 796474 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=159 ) properties seen :{}
Interrupted Best-First random walk after 807596 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=161 ) properties seen :{}
Interrupted probabilistic random walk after 1631172 steps, run timeout after 30001 ms. (steps per millisecond=54 ) properties seen :{}
Probabilistic random walk after 1631172 steps, saw 1198700 distinct states, run finished after 30001 ms. (steps per millisecond=54 ) properties seen :{}
Running SMT prover for 5 properties.
// Phase 1: matrix 1168 rows 1390 cols
[2022-06-12 23:45:14] [INFO ] Computed 551 place invariants in 19 ms
[2022-06-12 23:45:15] [INFO ] [Real]Absence check using 551 positive place invariants in 127 ms returned sat
[2022-06-12 23:45:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:45:15] [INFO ] [Real]Absence check using state equation in 518 ms returned sat
[2022-06-12 23:45:15] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:45:15] [INFO ] [Nat]Absence check using 551 positive place invariants in 104 ms returned sat
[2022-06-12 23:45:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 23:45:16] [INFO ] [Nat]Absence check using state equation in 511 ms returned sat
[2022-06-12 23:45:16] [INFO ] State equation strengthened by 141 read => feed constraints.
[2022-06-12 23:45:16] [INFO ] [Nat]Added 141 Read/Feed constraints in 34 ms returned sat
[2022-06-12 23:45:16] [INFO ] Deduced a trap composed of 8 places in 47 ms of which 0 ms to minimize.
[2022-06-12 23:45:16] [INFO ] Deduced a trap composed of 6 places in 43 ms of which 0 ms to minimize.
[2022-06-12 23:45:16] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 1 ms to minimize.
[2022-06-12 23:45:16] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 0 ms to minimize.
[2022-06-12 23:45:16] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 401 ms
[2022-06-12 23:45:16] [INFO ] Computed and/alt/rep : 1145/3347/1145 causal constraints (skipped 0 transitions) in 55 ms.
[2022-06-12 23:45:37] [INFO ] Added : 1010 causal constraints over 203 iterations in 20486 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 62 ms.
[2022-06-12 23:45:37] [INFO ] [Real]Absence check using 551 positive place invariants in 103 ms returned sat
[2022-06-12 23:45:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:45:38] [INFO ] [Real]Absence check using state equation in 471 ms returned sat
[2022-06-12 23:45:38] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:45:38] [INFO ] [Nat]Absence check using 551 positive place invariants in 100 ms returned sat
[2022-06-12 23:45:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 23:45:38] [INFO ] [Nat]Absence check using state equation in 476 ms returned sat
[2022-06-12 23:45:39] [INFO ] [Nat]Added 141 Read/Feed constraints in 29 ms returned sat
[2022-06-12 23:45:39] [INFO ] Deduced a trap composed of 7 places in 57 ms of which 1 ms to minimize.
[2022-06-12 23:45:39] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 0 ms to minimize.
[2022-06-12 23:45:39] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 1 ms to minimize.
[2022-06-12 23:45:39] [INFO ] Deduced a trap composed of 6 places in 49 ms of which 1 ms to minimize.
[2022-06-12 23:45:39] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 0 ms to minimize.
[2022-06-12 23:45:39] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 0 ms to minimize.
[2022-06-12 23:45:39] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 647 ms
[2022-06-12 23:45:39] [INFO ] Computed and/alt/rep : 1145/3347/1145 causal constraints (skipped 0 transitions) in 53 ms.
[2022-06-12 23:45:59] [INFO ] Added : 1000 causal constraints over 200 iterations in 20203 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 74 ms.
[2022-06-12 23:46:00] [INFO ] [Real]Absence check using 551 positive place invariants in 115 ms returned sat
[2022-06-12 23:46:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:46:00] [INFO ] [Real]Absence check using state equation in 544 ms returned sat
[2022-06-12 23:46:00] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:46:01] [INFO ] [Nat]Absence check using 551 positive place invariants in 114 ms returned sat
[2022-06-12 23:46:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 23:46:01] [INFO ] [Nat]Absence check using state equation in 568 ms returned sat
[2022-06-12 23:46:01] [INFO ] [Nat]Added 141 Read/Feed constraints in 37 ms returned sat
[2022-06-12 23:46:01] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
[2022-06-12 23:46:01] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 1 ms to minimize.
[2022-06-12 23:46:01] [INFO ] Deduced a trap composed of 5 places in 47 ms of which 1 ms to minimize.
[2022-06-12 23:46:02] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 0 ms to minimize.
[2022-06-12 23:46:02] [INFO ] Deduced a trap composed of 6 places in 54 ms of which 0 ms to minimize.
[2022-06-12 23:46:02] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 0 ms to minimize.
[2022-06-12 23:46:02] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 0 ms to minimize.
[2022-06-12 23:46:02] [INFO ] Deduced a trap composed of 6 places in 46 ms of which 0 ms to minimize.
[2022-06-12 23:46:02] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 870 ms
[2022-06-12 23:46:02] [INFO ] Computed and/alt/rep : 1145/3347/1145 causal constraints (skipped 0 transitions) in 55 ms.
[2022-06-12 23:46:22] [INFO ] Added : 995 causal constraints over 199 iterations in 20072 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 56 ms.
[2022-06-12 23:46:22] [INFO ] [Real]Absence check using 551 positive place invariants in 95 ms returned sat
[2022-06-12 23:46:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:46:23] [INFO ] [Real]Absence check using state equation in 443 ms returned sat
[2022-06-12 23:46:23] [INFO ] [Real]Added 141 Read/Feed constraints in 18 ms returned sat
[2022-06-12 23:46:23] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:46:23] [INFO ] [Nat]Absence check using 551 positive place invariants in 101 ms returned sat
[2022-06-12 23:46:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 23:46:24] [INFO ] [Nat]Absence check using state equation in 444 ms returned sat
[2022-06-12 23:46:24] [INFO ] [Nat]Added 141 Read/Feed constraints in 28 ms returned sat
[2022-06-12 23:46:24] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 0 ms to minimize.
[2022-06-12 23:46:24] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 1 ms to minimize.
[2022-06-12 23:46:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 220 ms
[2022-06-12 23:46:24] [INFO ] Computed and/alt/rep : 1145/3347/1145 causal constraints (skipped 0 transitions) in 55 ms.
[2022-06-12 23:46:44] [INFO ] Added : 964 causal constraints over 193 iterations in 20324 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 85 ms.
[2022-06-12 23:46:45] [INFO ] [Real]Absence check using 551 positive place invariants in 95 ms returned sat
[2022-06-12 23:46:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:46:45] [INFO ] [Real]Absence check using state equation in 412 ms returned sat
[2022-06-12 23:46:45] [INFO ] [Real]Added 141 Read/Feed constraints in 18 ms returned sat
[2022-06-12 23:46:45] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:46:45] [INFO ] [Nat]Absence check using 551 positive place invariants in 91 ms returned sat
[2022-06-12 23:46:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 23:46:46] [INFO ] [Nat]Absence check using state equation in 411 ms returned sat
[2022-06-12 23:46:46] [INFO ] [Nat]Added 141 Read/Feed constraints in 23 ms returned sat
[2022-06-12 23:46:46] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 0 ms to minimize.
[2022-06-12 23:46:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 130 ms
[2022-06-12 23:46:46] [INFO ] Computed and/alt/rep : 1145/3347/1145 causal constraints (skipped 0 transitions) in 52 ms.
[2022-06-12 23:47:06] [INFO ] Added : 1020 causal constraints over 204 iterations in 20313 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 79 ms.
Incomplete Parikh walk after 144200 steps, including 1001 resets, run finished after 1169 ms. (steps per millisecond=123 ) properties (out of 5) seen :0 could not realise parikh vector
Incomplete Parikh walk after 157000 steps, including 1000 resets, run finished after 1298 ms. (steps per millisecond=120 ) properties (out of 5) seen :0 could not realise parikh vector
Incomplete Parikh walk after 201600 steps, including 1000 resets, run finished after 1667 ms. (steps per millisecond=120 ) properties (out of 5) seen :0 could not realise parikh vector
Incomplete Parikh walk after 145100 steps, including 736 resets, run finished after 1264 ms. (steps per millisecond=114 ) properties (out of 5) seen :0 could not realise parikh vector
Incomplete Parikh walk after 162400 steps, including 1001 resets, run finished after 1402 ms. (steps per millisecond=115 ) properties (out of 5) seen :0 could not realise parikh vector
Support contains 107 out of 1390 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1390/1390 places, 1168/1168 transitions.
Applied a total of 0 rules in 42 ms. Remains 1390 /1390 variables (removed 0) and now considering 1168/1168 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1390/1390 places, 1168/1168 transitions.
Starting structural reductions, iteration 0 : 1390/1390 places, 1168/1168 transitions.
Applied a total of 0 rules in 40 ms. Remains 1390 /1390 variables (removed 0) and now considering 1168/1168 (removed 0) transitions.
// Phase 1: matrix 1168 rows 1390 cols
[2022-06-12 23:47:13] [INFO ] Computed 551 place invariants in 11 ms
[2022-06-12 23:47:14] [INFO ] Implicit Places using invariants in 723 ms returned []
// Phase 1: matrix 1168 rows 1390 cols
[2022-06-12 23:47:14] [INFO ] Computed 551 place invariants in 4 ms
[2022-06-12 23:47:15] [INFO ] State equation strengthened by 141 read => feed constraints.
[2022-06-12 23:47:17] [INFO ] Implicit Places using invariants and state equation in 3385 ms returned []
Implicit Place search using SMT with State Equation took 4112 ms to find 0 implicit places.
[2022-06-12 23:47:18] [INFO ] Redundant transitions in 78 ms returned []
// Phase 1: matrix 1168 rows 1390 cols
[2022-06-12 23:47:18] [INFO ] Computed 551 place invariants in 4 ms
[2022-06-12 23:47:18] [INFO ] Dead Transitions using invariants and state equation in 572 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1390/1390 places, 1168/1168 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 919 ms. (steps per millisecond=108 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 1168 rows 1390 cols
[2022-06-12 23:47:19] [INFO ] Computed 551 place invariants in 9 ms
[2022-06-12 23:47:19] [INFO ] [Real]Absence check using 551 positive place invariants in 108 ms returned sat
[2022-06-12 23:47:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:47:20] [INFO ] [Real]Absence check using state equation in 515 ms returned sat
[2022-06-12 23:47:20] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:47:20] [INFO ] [Nat]Absence check using 551 positive place invariants in 108 ms returned sat
[2022-06-12 23:47:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 23:47:21] [INFO ] [Nat]Absence check using state equation in 479 ms returned sat
[2022-06-12 23:47:21] [INFO ] State equation strengthened by 141 read => feed constraints.
[2022-06-12 23:47:21] [INFO ] [Nat]Added 141 Read/Feed constraints in 32 ms returned sat
[2022-06-12 23:47:21] [INFO ] Deduced a trap composed of 8 places in 64 ms of which 1 ms to minimize.
[2022-06-12 23:47:21] [INFO ] Deduced a trap composed of 6 places in 50 ms of which 0 ms to minimize.
[2022-06-12 23:47:21] [INFO ] Deduced a trap composed of 7 places in 56 ms of which 0 ms to minimize.
[2022-06-12 23:47:21] [INFO ] Deduced a trap composed of 8 places in 55 ms of which 1 ms to minimize.
[2022-06-12 23:47:21] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 456 ms
[2022-06-12 23:47:21] [INFO ] Computed and/alt/rep : 1145/3347/1145 causal constraints (skipped 0 transitions) in 62 ms.
[2022-06-12 23:47:40] [INFO ] Added : 990 causal constraints over 199 iterations in 18808 ms. Result :unknown
[2022-06-12 23:47:40] [INFO ] [Real]Absence check using 551 positive place invariants in 95 ms returned sat
[2022-06-12 23:47:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:47:41] [INFO ] [Real]Absence check using state equation in 457 ms returned sat
[2022-06-12 23:47:41] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:47:41] [INFO ] [Nat]Absence check using 551 positive place invariants in 96 ms returned sat
[2022-06-12 23:47:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 23:47:41] [INFO ] [Nat]Absence check using state equation in 456 ms returned sat
[2022-06-12 23:47:41] [INFO ] [Nat]Added 141 Read/Feed constraints in 31 ms returned sat
[2022-06-12 23:47:41] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 1 ms to minimize.
[2022-06-12 23:47:41] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 0 ms to minimize.
[2022-06-12 23:47:42] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 0 ms to minimize.
[2022-06-12 23:47:42] [INFO ] Deduced a trap composed of 6 places in 59 ms of which 0 ms to minimize.
[2022-06-12 23:47:42] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 1 ms to minimize.
[2022-06-12 23:47:42] [INFO ] Deduced a trap composed of 3 places in 61 ms of which 1 ms to minimize.
[2022-06-12 23:47:42] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 673 ms
[2022-06-12 23:47:42] [INFO ] Computed and/alt/rep : 1145/3347/1145 causal constraints (skipped 0 transitions) in 54 ms.
[2022-06-12 23:48:01] [INFO ] Added : 980 causal constraints over 196 iterations in 18637 ms. Result :unknown
[2022-06-12 23:48:01] [INFO ] [Real]Absence check using 551 positive place invariants in 110 ms returned sat
[2022-06-12 23:48:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:48:01] [INFO ] [Real]Absence check using state equation in 538 ms returned sat
[2022-06-12 23:48:01] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:48:02] [INFO ] [Nat]Absence check using 551 positive place invariants in 112 ms returned sat
[2022-06-12 23:48:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 23:48:02] [INFO ] [Nat]Absence check using state equation in 557 ms returned sat
[2022-06-12 23:48:02] [INFO ] [Nat]Added 141 Read/Feed constraints in 37 ms returned sat
[2022-06-12 23:48:02] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 1 ms to minimize.
[2022-06-12 23:48:02] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 0 ms to minimize.
[2022-06-12 23:48:02] [INFO ] Deduced a trap composed of 5 places in 47 ms of which 0 ms to minimize.
[2022-06-12 23:48:03] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 0 ms to minimize.
[2022-06-12 23:48:03] [INFO ] Deduced a trap composed of 6 places in 49 ms of which 0 ms to minimize.
[2022-06-12 23:48:03] [INFO ] Deduced a trap composed of 3 places in 61 ms of which 0 ms to minimize.
[2022-06-12 23:48:03] [INFO ] Deduced a trap composed of 5 places in 43 ms of which 1 ms to minimize.
[2022-06-12 23:48:03] [INFO ] Deduced a trap composed of 6 places in 67 ms of which 0 ms to minimize.
[2022-06-12 23:48:03] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 852 ms
[2022-06-12 23:48:03] [INFO ] Computed and/alt/rep : 1145/3347/1145 causal constraints (skipped 0 transitions) in 59 ms.
[2022-06-12 23:48:22] [INFO ] Deduced a trap composed of 2 places in 631 ms of which 2 ms to minimize.
[2022-06-12 23:48:22] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
[2022-06-12 23:48:22] [INFO ] [Real]Absence check using 551 positive place invariants in 91 ms returned sat
[2022-06-12 23:48:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:48:23] [INFO ] [Real]Absence check using state equation in 433 ms returned sat
[2022-06-12 23:48:23] [INFO ] [Real]Added 141 Read/Feed constraints in 19 ms returned sat
[2022-06-12 23:48:23] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:48:23] [INFO ] [Nat]Absence check using 551 positive place invariants in 96 ms returned sat
[2022-06-12 23:48:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 23:48:23] [INFO ] [Nat]Absence check using state equation in 433 ms returned sat
[2022-06-12 23:48:23] [INFO ] [Nat]Added 141 Read/Feed constraints in 28 ms returned sat
[2022-06-12 23:48:24] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 0 ms to minimize.
[2022-06-12 23:48:24] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 0 ms to minimize.
[2022-06-12 23:48:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 206 ms
[2022-06-12 23:48:24] [INFO ] Computed and/alt/rep : 1145/3347/1145 causal constraints (skipped 0 transitions) in 54 ms.
[2022-06-12 23:48:43] [INFO ] Added : 964 causal constraints over 193 iterations in 19132 ms. Result :unknown
[2022-06-12 23:48:43] [INFO ] [Real]Absence check using 551 positive place invariants in 91 ms returned sat
[2022-06-12 23:48:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:48:43] [INFO ] [Real]Absence check using state equation in 412 ms returned sat
[2022-06-12 23:48:43] [INFO ] [Real]Added 141 Read/Feed constraints in 19 ms returned sat
[2022-06-12 23:48:44] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:48:44] [INFO ] [Nat]Absence check using 551 positive place invariants in 89 ms returned sat
[2022-06-12 23:48:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 23:48:44] [INFO ] [Nat]Absence check using state equation in 416 ms returned sat
[2022-06-12 23:48:44] [INFO ] [Nat]Added 141 Read/Feed constraints in 23 ms returned sat
[2022-06-12 23:48:44] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 1 ms to minimize.
[2022-06-12 23:48:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 136 ms
[2022-06-12 23:48:44] [INFO ] Computed and/alt/rep : 1145/3347/1145 causal constraints (skipped 0 transitions) in 53 ms.
[2022-06-12 23:49:04] [INFO ] Added : 1010 causal constraints over 202 iterations in 19230 ms. Result :unknown
[2022-06-12 23:49:04] [INFO ] Flatten gal took : 41 ms
[2022-06-12 23:49:04] [INFO ] Flatten gal took : 41 ms
[2022-06-12 23:49:04] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13610865575103904365.gal : 4 ms
[2022-06-12 23:49:04] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13548733095486509009.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/ReachabilityCardinality13610865575103904365.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality13548733095486509009.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/ReachabilityCardinality13610865575103904365.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality13548733095486509009.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality13548733095486509009.prop.
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :10 after 11
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :11 after 24
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :24 after 28
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :28 after 78
SDD proceeding with computation,5 properties remain. new max is 256
SDD size :78 after 2432
Detected timeout of ITS tools.
[2022-06-12 23:49:24] [INFO ] Flatten gal took : 38 ms
[2022-06-12 23:49:24] [INFO ] Applying decomposition
[2022-06-12 23:49:24] [INFO ] Flatten gal took : 38 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/graph4413752702937808650.txt, -o, /tmp/graph4413752702937808650.bin, -w, /tmp/graph4413752702937808650.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/graph4413752702937808650.bin, -l, -1, -v, -w, /tmp/graph4413752702937808650.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-12 23:49:24] [INFO ] Decomposing Gal with order
[2022-06-12 23:49:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-12 23:49:24] [INFO ] Removed a total of 636 redundant transitions.
[2022-06-12 23:49:24] [INFO ] Flatten gal took : 68 ms
[2022-06-12 23:49:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 282 labels/synchronizations in 10 ms.
[2022-06-12 23:49:24] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6531690328885568603.gal : 9 ms
[2022-06-12 23:49:24] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17940435664609423038.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/ReachabilityCardinality6531690328885568603.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality17940435664609423038.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/ReachabilityCardinality6531690328885568603.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality17940435664609423038.prop --nowitness
Loading property file /tmp/ReachabilityCardinality17940435664609423038.prop.
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 6
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :6 after 9
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :9 after 87
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :87 after 1221
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :1221 after 87486
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :1.60017e+22 after 8.94875e+51
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6595442017919679487
[2022-06-12 23:49:44] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6595442017919679487
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/ltsmin6595442017919679487]
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/ltsmin6595442017919679487] killed by timeout after 2 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/ltsmin6595442017919679487] killed by timeout after 2 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Partial Free-agglomeration rule applied 251 times.
Drop transitions removed 251 transitions
Iterating global reduction 0 with 251 rules applied. Total rules applied 251 place count 1390 transition count 1168
Applied a total of 251 rules in 86 ms. Remains 1390 /1390 variables (removed 0) and now considering 1168/1168 (removed 0) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 1168 rows 1390 cols
[2022-06-12 23:49:46] [INFO ] Computed 551 place invariants in 3 ms
[2022-06-12 23:49:46] [INFO ] [Real]Absence check using 551 positive place invariants in 93 ms returned sat
[2022-06-12 23:49:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:49:47] [INFO ] [Real]Absence check using state equation in 509 ms returned sat
[2022-06-12 23:49:47] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:49:47] [INFO ] [Nat]Absence check using 551 positive place invariants in 102 ms returned sat
[2022-06-12 23:49:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 23:49:48] [INFO ] [Nat]Absence check using state equation in 499 ms returned sat
[2022-06-12 23:49:48] [INFO ] State equation strengthened by 219 read => feed constraints.
[2022-06-12 23:49:48] [INFO ] [Nat]Added 219 Read/Feed constraints in 34 ms returned sat
[2022-06-12 23:49:48] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-06-12 23:49:48] [INFO ] Deduced a trap composed of 5 places in 48 ms of which 1 ms to minimize.
[2022-06-12 23:49:48] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 0 ms to minimize.
[2022-06-12 23:49:48] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
[2022-06-12 23:49:48] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 0 ms to minimize.
[2022-06-12 23:49:48] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 0 ms to minimize.
[2022-06-12 23:49:48] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 1 ms to minimize.
[2022-06-12 23:49:48] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 1 ms to minimize.
[2022-06-12 23:49:48] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 1 ms to minimize.
[2022-06-12 23:49:49] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 0 ms to minimize.
[2022-06-12 23:49:49] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 0 ms to minimize.
[2022-06-12 23:49:49] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1003 ms
[2022-06-12 23:49:49] [INFO ] Computed and/alt/rep : 1146/3927/1146 causal constraints (skipped 0 transitions) in 52 ms.
[2022-06-12 23:50:09] [INFO ] Added : 970 causal constraints over 194 iterations in 20099 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 44 ms.
[2022-06-12 23:50:09] [INFO ] [Real]Absence check using 551 positive place invariants in 97 ms returned sat
[2022-06-12 23:50:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:50:10] [INFO ] [Real]Absence check using state equation in 469 ms returned sat
[2022-06-12 23:50:10] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:50:10] [INFO ] [Nat]Absence check using 551 positive place invariants in 98 ms returned sat
[2022-06-12 23:50:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 23:50:10] [INFO ] [Nat]Absence check using state equation in 464 ms returned sat
[2022-06-12 23:50:10] [INFO ] [Nat]Added 219 Read/Feed constraints in 33 ms returned sat
[2022-06-12 23:50:10] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2022-06-12 23:50:11] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 0 ms to minimize.
[2022-06-12 23:50:11] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2022-06-12 23:50:11] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2022-06-12 23:50:11] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 0 ms to minimize.
[2022-06-12 23:50:11] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 0 ms to minimize.
[2022-06-12 23:50:11] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-06-12 23:50:11] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 0 ms to minimize.
[2022-06-12 23:50:11] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 0 ms to minimize.
[2022-06-12 23:50:11] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 0 ms to minimize.
[2022-06-12 23:50:11] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 0 ms to minimize.
[2022-06-12 23:50:11] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 0 ms to minimize.
[2022-06-12 23:50:11] [INFO ] Deduced a trap composed of 7 places in 20 ms of which 0 ms to minimize.
[2022-06-12 23:50:11] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1073 ms
[2022-06-12 23:50:11] [INFO ] Computed and/alt/rep : 1146/3927/1146 causal constraints (skipped 0 transitions) in 52 ms.
[2022-06-12 23:50:32] [INFO ] Added : 955 causal constraints over 191 iterations in 20275 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 104 ms.
[2022-06-12 23:50:32] [INFO ] [Real]Absence check using 551 positive place invariants in 108 ms returned sat
[2022-06-12 23:50:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:50:33] [INFO ] [Real]Absence check using state equation in 555 ms returned sat
[2022-06-12 23:50:33] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:50:33] [INFO ] [Nat]Absence check using 551 positive place invariants in 110 ms returned sat
[2022-06-12 23:50:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 23:50:33] [INFO ] [Nat]Absence check using state equation in 562 ms returned sat
[2022-06-12 23:50:34] [INFO ] [Nat]Added 219 Read/Feed constraints in 36 ms returned sat
[2022-06-12 23:50:34] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 0 ms to minimize.
[2022-06-12 23:50:34] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 0 ms to minimize.
[2022-06-12 23:50:34] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 0 ms to minimize.
[2022-06-12 23:50:34] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2022-06-12 23:50:34] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 0 ms to minimize.
[2022-06-12 23:50:34] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 1 ms to minimize.
[2022-06-12 23:50:34] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2022-06-12 23:50:34] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 0 ms to minimize.
[2022-06-12 23:50:34] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 0 ms to minimize.
[2022-06-12 23:50:34] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 5 ms to minimize.
[2022-06-12 23:50:34] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2022-06-12 23:50:35] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 0 ms to minimize.
[2022-06-12 23:50:35] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1054 ms
[2022-06-12 23:50:35] [INFO ] Computed and/alt/rep : 1146/3927/1146 causal constraints (skipped 0 transitions) in 52 ms.
[2022-06-12 23:50:55] [INFO ] Added : 965 causal constraints over 193 iterations in 20219 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 55 ms.
[2022-06-12 23:50:55] [INFO ] [Real]Absence check using 551 positive place invariants in 88 ms returned sat
[2022-06-12 23:50:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:50:56] [INFO ] [Real]Absence check using state equation in 422 ms returned sat
[2022-06-12 23:50:56] [INFO ] [Real]Added 219 Read/Feed constraints in 26 ms returned sat
[2022-06-12 23:50:56] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:50:56] [INFO ] [Nat]Absence check using 551 positive place invariants in 96 ms returned sat
[2022-06-12 23:50:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 23:50:56] [INFO ] [Nat]Absence check using state equation in 441 ms returned sat
[2022-06-12 23:50:56] [INFO ] [Nat]Added 219 Read/Feed constraints in 31 ms returned sat
[2022-06-12 23:50:56] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2022-06-12 23:50:57] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2022-06-12 23:50:57] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 1 ms to minimize.
[2022-06-12 23:50:57] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 1 ms to minimize.
[2022-06-12 23:50:57] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 0 ms to minimize.
[2022-06-12 23:50:57] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 0 ms to minimize.
[2022-06-12 23:50:57] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 1 ms to minimize.
[2022-06-12 23:50:57] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 573 ms
[2022-06-12 23:50:57] [INFO ] Computed and/alt/rep : 1146/3927/1146 causal constraints (skipped 0 transitions) in 53 ms.
[2022-06-12 23:51:17] [INFO ] Added : 980 causal constraints over 196 iterations in 20378 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 47 ms.
[2022-06-12 23:51:18] [INFO ] [Real]Absence check using 551 positive place invariants in 88 ms returned sat
[2022-06-12 23:51:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:51:18] [INFO ] [Real]Absence check using state equation in 420 ms returned sat
[2022-06-12 23:51:18] [INFO ] [Real]Added 219 Read/Feed constraints in 28 ms returned sat
[2022-06-12 23:51:18] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:51:18] [INFO ] [Nat]Absence check using 551 positive place invariants in 91 ms returned sat
[2022-06-12 23:51:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 23:51:19] [INFO ] [Nat]Absence check using state equation in 419 ms returned sat
[2022-06-12 23:51:19] [INFO ] [Nat]Added 219 Read/Feed constraints in 33 ms returned sat
[2022-06-12 23:51:19] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2022-06-12 23:51:19] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2022-06-12 23:51:19] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 0 ms to minimize.
[2022-06-12 23:51:19] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
[2022-06-12 23:51:19] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 0 ms to minimize.
[2022-06-12 23:51:19] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 0 ms to minimize.
[2022-06-12 23:51:19] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 5 ms to minimize.
[2022-06-12 23:51:19] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 0 ms to minimize.
[2022-06-12 23:51:20] [INFO ] Deduced a trap composed of 8 places in 45 ms of which 0 ms to minimize.
[2022-06-12 23:51:20] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
[2022-06-12 23:51:20] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 895 ms
[2022-06-12 23:51:20] [INFO ] Computed and/alt/rep : 1146/3927/1146 causal constraints (skipped 0 transitions) in 55 ms.
[2022-06-12 23:51:40] [INFO ] Added : 975 causal constraints over 195 iterations in 20175 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 56 ms.
[2022-06-12 23:51:40] [INFO ] Flatten gal took : 46 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin9844084683875795419
[2022-06-12 23:51:40] [INFO ] Computing symmetric may disable matrix : 1168 transitions.
[2022-06-12 23:51:40] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-12 23:51:40] [INFO ] Computing symmetric may enable matrix : 1168 transitions.
[2022-06-12 23:51:40] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-12 23:51:40] [INFO ] Applying decomposition
[2022-06-12 23:51:40] [INFO ] Flatten gal took : 77 ms
[2022-06-12 23:51:40] [INFO ] Flatten gal took : 43 ms
[2022-06-12 23:51:40] [INFO ] Input system was already deterministic with 1168 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/graph14381186369175387221.txt, -o, /tmp/graph14381186369175387221.bin, -w, /tmp/graph14381186369175387221.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/graph14381186369175387221.bin, -l, -1, -v, -w, /tmp/graph14381186369175387221.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-12 23:51:40] [INFO ] Computing Do-Not-Accords matrix : 1168 transitions.
[2022-06-12 23:51:40] [INFO ] Decomposing Gal with order
[2022-06-12 23:51:40] [INFO ] Computation of Completed DNA matrix. took 52 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-12 23:51:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-12 23:51:40] [INFO ] Built C files in 314ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9844084683875795419
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/ltsmin9844084683875795419]
[2022-06-12 23:51:41] [INFO ] Removed a total of 635 redundant transitions.
[2022-06-12 23:51:41] [INFO ] Flatten gal took : 91 ms
[2022-06-12 23:51:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 276 labels/synchronizations in 17 ms.
[2022-06-12 23:51:41] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability11795686920829352620.gal : 13 ms
[2022-06-12 23:51:41] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability15419588151849531615.prop : 7 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/ReachabilityFireability11795686920829352620.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityFireability15419588151849531615.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/ReachabilityFireability11795686920829352620.gal -t CGAL -reachable-file /tmp/ReachabilityFireability15419588151849531615.prop --nowitness
Loading property file /tmp/ReachabilityFireability15419588151849531615.prop.
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :2 after 9
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :9 after 33
[2022-06-12 23:51:41] [INFO ] Ran tautology test, simplified 0 / 5 in 950 ms.
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :33 after 249
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :249 after 3.1495e+06
[2022-06-12 23:51:41] [INFO ] BMC solution for property ShieldPPPt-PT-050B-ReachabilityFireability-01(UNSAT) depth K=0 took 69 ms
[2022-06-12 23:51:41] [INFO ] BMC solution for property ShieldPPPt-PT-050B-ReachabilityFireability-05(UNSAT) depth K=0 took 2 ms
[2022-06-12 23:51:41] [INFO ] BMC solution for property ShieldPPPt-PT-050B-ReachabilityFireability-07(UNSAT) depth K=0 took 1 ms
[2022-06-12 23:51:41] [INFO ] BMC solution for property ShieldPPPt-PT-050B-ReachabilityFireability-09(UNSAT) depth K=0 took 1 ms
[2022-06-12 23:51:41] [INFO ] BMC solution for property ShieldPPPt-PT-050B-ReachabilityFireability-14(UNSAT) depth K=0 took 0 ms
[2022-06-12 23:51:41] [INFO ] BMC solution for property ShieldPPPt-PT-050B-ReachabilityFireability-01(UNSAT) depth K=1 took 42 ms
[2022-06-12 23:51:41] [INFO ] BMC solution for property ShieldPPPt-PT-050B-ReachabilityFireability-05(UNSAT) depth K=1 took 10 ms
[2022-06-12 23:51:41] [INFO ] BMC solution for property ShieldPPPt-PT-050B-ReachabilityFireability-07(UNSAT) depth K=1 took 13 ms
[2022-06-12 23:51:42] [INFO ] BMC solution for property ShieldPPPt-PT-050B-ReachabilityFireability-09(UNSAT) depth K=1 took 28 ms
[2022-06-12 23:51:42] [INFO ] BMC solution for property ShieldPPPt-PT-050B-ReachabilityFireability-14(UNSAT) depth K=1 took 12 ms
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 1168 rows 1390 cols
[2022-06-12 23:51:42] [INFO ] Computed 551 place invariants in 3 ms
inv : p34 + p35 + p746 + p747 + p757 + p762 + p763 = 1
inv : p1971 + p1976 = 1
inv : p34 + p35 + p365 + p369 + p371 = 1
inv : p2396 + p2399 + p2404 = 1
inv : p3807 + p3812 = 1
inv : p3896 + p3901 = 1
inv : p1364 + p1365 + p1387 + p1390 + p1391 = 1
inv : p3449 + p3451 = 1
inv : p3218 + p3220 = 1
inv : p2073 + p2076 + p2077 = 1
inv : p3228 + p3233 + p3234 = 1
inv : p34 + p35 + p277 + p282 = 1
inv : p34 + p1266 + p1271 = 1
inv : p3518 + p3519 + p3576 + p3581 = 1
inv : p3137 + p3151 + p3156 + p3157 = 1
inv : p3287 + p3288 + p3320 + p3321 + p3323 + p3325 + p3328 = 1
inv : p34 + p35 + p408 + p412 = 1
inv : p2910 + p2912 = 1
inv : p1574 + p1579 = 1
inv : p34 + p35 + p71 + p76 + p77 = 1
inv : p3767 + p3770 + p3771 = 1
inv : p1919 + p1924 + p1925 = 1
inv : p2641 + p2645 = 1
inv : p2066 + p2071 + p2072 = 1
inv : p3844 + p3849 + p3850 = 1
inv : p2374 + p2379 + p2380 = 1
inv : p2510 + p2515 = 1
inv : p1758 + p1761 + p1762 = 1
inv : p34 + p35 + p746 + p747 + p754 + p756 = 1
inv : p2045 + p2048 + p2053 = 1
inv : p34 + p35 + p463 + p465 + p466 + p467 = 1
inv : p3508 + p3511 + p3516 = 1
inv : p3034 + p3037 + p3038 + p3042 = 1
inv : p34 + p35 + p365 + p379 + p384 + p385 = 1
inv : p34 + p35 + p893 + p898 = 1
inv : p3854 + p3855 = 1
inv : p34 + p35 + p746 + p747 + p804 + p809 = 1
inv : p34 + p35 + p900 + p918 + p923 + p924 = 1
inv : p34 + p35 + p982 + p1002 + p1005 + p1006 = 1
inv : p34 + p35 + p507 + p508 + p513 = 1
inv : p34 + p35 + p628 + p633 = 1
inv : p1582 + p1583 + p1586 + p1588 + p1591 = 1
inv : p3452 + p3455 + p3456 = 1
inv : p2143 + p2146 + p2147 = 1
inv : p3760 + p3765 + p3766 = 1
inv : p3280 + p3285 = 1
inv : p34 + p35 + p284 + p286 + p342 + p347 = 1
inv : p34 + p35 + p1109 + p1112 + p1113 + p1114 + p1117 = 1
inv : p1541 + p1543 + p1544 + p1545 = 1
inv : p34 + p1226 + p1231 + p1232 = 1
inv : p1794 + p1798 = 1
inv : p34 + p35 + p188 + p193 = 1
inv : p3595 + p3603 + p3605 = 1
inv : p2215 + p2216 + p2220 + p2223 + p2224 = 1
inv : p34 + p35 + p982 + p988 + p989 + p993 + p994 = 1
inv : p34 + p35 + p284 + p286 + p320 + p325 = 1
inv : p34 + p35 + p1131 + p1178 + p1182 = 1
inv : p34 + p35 + p900 + p925 + p928 + p929 = 1
inv : p2371 + p2373 = 1
inv : p34 + p35 + p982 + p985 + p987 = 1
inv : p34 + p35 + p600 + p602 = 1
inv : p34 + p35 + p982 + p995 + p1000 + p1001 = 1
inv : p34 + p35 + p1072 + p1077 + p1078 = 1
inv : p3067 + p3070 + p3071 = 1
inv : p2410 + p2414 = 1
inv : p3114 + p3119 = 1
inv : p34 + p35 + p562 + p566 = 1
inv : p3375 + p3380 + p3381 = 1
inv : p1871 + p1875 = 1
inv : p2756 + p2758 = 1
inv : p2795 + p2799 = 1
inv : p2344 + p2348 + p2349 = 1
inv : p2766 + p2771 + p2772 = 1
inv : p34 + p35 + p232 + p235 + p236 = 1
inv : p1364 + p1365 + p1370 + p1372 = 1
inv : p34 + p35 + p523 + p525 = 1
inv : p3742 + p3747 = 1
inv : p2920 + p2923 + p2924 = 1
inv : p3287 + p3288 + p3305 + p3308 + p3309 = 1
inv : p34 + p35 + p215 + p217 = 1
inv : p3235 + p3238 + p3239 = 1
inv : p34 + p35 + p1124 + p1129 = 1
inv : p34 + p35 + p548 + p549 + p556 = 1
inv : p1296 + p1299 + p1300 = 1
inv : p1364 + p1365 + p1410 + p1413 = 1
inv : p3137 + p3141 + p3143 = 1
inv : p3477 + p3482 = 1
inv : p3595 + p3613 + p3616 + p3617 = 1
inv : p3837 + p3838 + p3840 + p3841 = 1
inv : p34 + p35 + p1131 + p1149 + p1154 + p1155 = 1
inv : p2465 + p2468 + p2469 = 1
inv : p2003 + p2008 + p2009 = 1
inv : p1926 + p1929 + p1930 = 1
inv : p34 + p35 + p243 + p248 = 1
inv : p2256 + p2258 + p2259 + p2260 = 1
inv : p2600 + p2612 + p2615 + p2616 = 1
inv : p34 + p35 + p474 + p479 = 1
inv : p2833 + p2835 = 1
inv : p3191 + p3196 = 1
inv : p1604 + p1609 + p1610 = 1
inv : p1842 + p1845 + p1846 = 1
inv : p2836 + p2841 + p2842 = 1
inv : p34 + p35 + p78 + p81 + p82 = 1
inv : p34 + p35 + p680 + p685 + p686 = 1
inv : p2157 + p2160 + p2161 = 1
inv : p34 + p35 + p650 + p655 = 1
inv : p2619 + p2622 + p2623 = 1
inv : p34 + p35 + p746 + p747 + p771 + p776 + p777 = 1
inv : p1660 + p1663 + p1664 + p1668 = 1
inv : p2388 + p2393 + p2394 = 1
inv : p2091 + p2096 = 1
inv : p3518 + p3519 + p3553 + p3554 + p3559 = 1
inv : p2080 + p2085 + p2086 = 1
inv : p2448 + p2450 = 1
inv : p3595 + p3642 + p3646 = 1
inv : p3595 + p3620 + p3621 + p3625 + p3626 = 1
inv : p1364 + p1365 + p1373 + p1376 + p1377 = 1
inv : p2517 + p2519 + p2528 + p2531 + p2532 = 1
inv : p1717 + p1721 = 1
inv : p34 + p35 + p746 + p747 + p764 + p767 + p768 = 1
inv : p1310 + p1312 + p1313 + p1314 = 1
inv : p2517 + p2519 + p2535 + p2540 + p2541 = 1
inv : p34 + p35 + p1024 + p1028 = 1
inv : p34 + p35 + p365 + p386 + p389 + p390 = 1
inv : p2215 + p2227 + p2230 + p2231 = 1
inv : p2381 + p2384 + p2385 = 1
inv : p3674 + p3730 + p3735 = 1
inv : p3785 + p3790 = 1
inv : p2063 + p2065 = 1
inv : p1772 + p1775 + p1776 = 1
inv : p2861 + p2866 = 1
inv : p3137 + p3158 + p3161 + p3162 = 1
inv : p1534 + p1537 + p1538 = 1
inv : p34 + p35 + p841 + p844 + p845 = 1
inv : p34 + p35 + p617 + p622 + p623 = 1
inv : p3518 + p3519 + p3536 + p3539 + p3540 = 1
inv : p2766 + p2769 + p2770 = 1
inv : p3287 + p3288 + p3305 + p3310 + p3311 = 1
inv : p1364 + p1365 + p1398 + p1403 = 1
inv : p34 + p35 + p148 + p150 + p153 + p154 = 1
inv : p2718 + p2719 + p2721 + p2722 = 1
inv : p2990 + p2993 + p2994 = 1
inv : p2850 + p2853 + p2854 = 1
inv : p34 + p35 + p449 + p454 + p455 = 1
inv : p34 + p35 + p1072 + p1075 + p1076 = 1
inv : p3081 + p3086 + p3087 = 1
inv : p1695 + p1700 + p1701 = 1
inv : p2759 + p2762 + p2763 = 1
inv : p3257 + p3261 = 1
inv : p3595 + p3613 + p3618 + p3619 = 1
inv : p3287 + p3288 + p3312 + p3317 + p3318 = 1
inv : p1651 + p1656 = 1
inv : p34 + p35 + p446 + p448 = 1
inv : p3674 + p3675 + p3697 + p3700 + p3701 = 1
inv : p3466 + p3471 + p3472 = 1
inv : p34 + p35 + p100 + p102 + p103 + p104 = 1
inv : p34 + p35 + p284 + p286 + p292 + p294 = 1
inv : p1339 + p1341 + p1343 + p1348 + p1349 = 1
inv : p3411 + p3415 = 1
inv : p34 + p35 + p1131 + p1189 + p1194 = 1
inv : p34 + p35 + p485 + p489 = 1
inv : p1450 + p1455 + p1456 = 1
inv : p34 + p35 + p85 + p86 + p87 + p94 + p96 = 1
inv : p1937 + p1942 = 1
inv : p3287 + p3288 + p3334 + p3338 = 1
inv : p34 + p35 + p1131 + p1166 + p1167 + p1172 = 1
inv : p2102 + p2106 = 1
inv : p1725 + p1728 + p1733 = 1
inv : p1989 + p1992 + p1993 = 1
inv : p3834 + p3836 = 1
inv : p3674 + p3675 + p3690 + p3695 + p3696 = 1
inv : p34 + p35 + p900 + p966 + p970 + p975 = 1
inv : p2297 + p2300 + p2301 = 1
inv : p1765 + p1770 + p1771 = 1
inv : p1909 + p1911 = 1
inv : p1296 + p1301 + p1302 = 1
inv : p34 + p35 + p900 + p958 + p963 = 1
inv : p2843 + p2848 + p2849 = 1
inv : p2836 + p2839 + p2840 = 1
inv : p1310 + p1312 + p1315 + p1316 = 1
inv : p34 + p35 + p284 + p286 + p295 + p300 + p301 = 1
inv : p1355 + p1360 = 1
inv : p2165 + p2166 + p2168 + p2170 + p2173 = 1
inv : p34 + p35 + p365 + p372 + p375 + p376 = 1
inv : p2600 + p2605 + p2608 + p2609 = 1
inv : p34 + p35 + p1131 + p1149 + p1152 + p1153 = 1
inv : p2600 + p2612 + p2617 + p2618 = 1
inv : p1849 + p1851 + p1852 + p1853 = 1
inv : p3004 + p3007 + p3008 = 1
inv : p34 + p35 + p603 + p608 + p609 = 1
inv : p2682 + p2687 + p2688 = 1
inv : p2729 + p2734 = 1
inv : p34 + p35 + p724 + p732 = 1
inv : p2458 + p2461 + p2462 = 1
inv : p1835 + p1840 + p1841 = 1
inv : p34 + p1216 + p1218 = 1
inv : p1681 + p1686 + p1687 = 1
inv : p34 + p1244 + p1249 = 1
inv : p3674 + p3675 + p3683 + p3686 + p3687 = 1
inv : p1996 + p2001 + p2002 = 1
inv : p3518 + p3519 + p3526 + p3528 = 1
inv : p2517 + p2519 + p2564 + p2568 = 1
inv : p2517 + p2519 + p2525 + p2527 = 1
inv : p2997 + p3002 + p3003 = 1
inv : p2311 + p2314 + p2315 = 1
inv : p1527 + p1528 + p1532 + p1533 = 1
inv : p34 + p35 + p677 + p679 = 1
inv : p1447 + p1449 = 1
inv : p34 + p35 + p848 + p853 + p854 = 1
inv : p2125 + p2130 = 1
inv : p2150 + p2155 + p2156 = 1
inv : p3518 + p3519 + p3543 + p3548 + p3549 = 1
inv : p2025 + p2026 + p2028 + p2029 = 1
inv : p3074 + p3077 + p3078 = 1
inv : p2972 + p2977 = 1
inv : p3389 + p3394 + p3395 = 1
inv : p34 + p35 + p610 + p613 + p614 = 1
inv : p34 + p35 + p900 + p911 + p914 + p915 = 1
inv : p2927 + p2929 + p2930 + p2931 = 1
inv : p1364 + p1365 + p1380 + p1382 + p1385 + p1386 = 1
inv : p1688 + p1691 + p1692 = 1
inv : p3221 + p3224 + p3225 = 1
inv : p2234 + p2239 + p2240 = 1
inv : p34 + p35 + p141 + p146 + p147 = 1
inv : p34 + p35 + p50 + p52 = 1
inv : p34 + p1226 + p1229 + p1230 = 1
inv : p1293 + p1295 = 1
inv : p3137 + p3144 + p3147 + p3148 = 1
inv : p34 + p35 + p834 + p839 + p840 = 1
inv : p1986 + p1988 = 1
inv : p34 + p35 + p533 + p538 + p539 = 1
inv : p1955 + p1959 + p1964 + p1966 = 1
inv : p34 + p35 + p265 + p270 = 1
inv : p1497 + p1502 = 1
inv : p34 + p35 + p870 + p874 = 1
inv : p3774 + p3779 + p3780 = 1
inv : p1832 + p1834 = 1
inv : p3459 + p3462 + p3463 = 1
inv : p34 + p35 + p746 + p747 + p793 + p797 = 1
inv : p2451 + p2456 + p2457 = 1
inv : p3518 + p3519 + p3529 + p3534 + p3535 = 1
inv : p1912 + p1915 + p1916 = 1
inv : p34 + p35 + p694 + p699 + p700 = 1
inv : p2014 + p2019 = 1
inv : p3499 + p3504 = 1
inv : p2517 + p2519 + p2553 + p2554 + p2558 = 1
inv : p3873 + p3877 = 1
inv : p2696 + p2701 + p2702 = 1
inv : p34 + p35 + p687 + p690 + p691 = 1
inv : p1541 + p1543 + p1546 + p1547 = 1
inv : p1618 + p1623 + p1624 = 1
inv : p2689 + p2692 + p2693 = 1
inv : p1464 + p1469 + p1470 = 1
inv : p1457 + p1460 + p1461 = 1
inv : p3518 + p3519 + p3588 + p3593 = 1
inv : p2949 + p2953 = 1
inv : p1611 + p1614 + p1615 = 1
inv : p3382 + p3385 + p3386 = 1
inv : p34 + p35 + p284 + p286 + p302 + p305 + p306 = 1
inv : p1330 + p1335 + p1336 = 1
inv : p3177 + p3180 + p3184 + p3185 = 1
inv : p2267 + p2272 = 1
inv : p34 + p35 + p225 + p230 + p231 = 1
inv : p34 + p35 + p900 + p936 + p941 = 1
inv : p2179 + p2183 = 1
inv : p3595 + p3661 + p3665 + p3670 = 1
inv : p2304 + p2306 + p2307 + p2308 = 1
inv : p2652 + p2654 + p2655 + p2657 = 1
inv : p34 + p35 + p284 + p286 + p309 + p314 + p315 = 1
inv : p3674 + p3675 + p3719 + p3723 = 1
inv : p34 + p35 + p1086 + p1090 + p1095 = 1
inv : p3049 + p3054 = 1
inv : p2215 + p2216 + p2217 + p2219 = 1
inv : p34 + p35 + p218 + p221 + p222 = 1
inv : p34 + p35 + p463 + p465 + p468 + p469 = 1
inv : p2487 + p2491 = 1
inv : p34 + p35 + p138 + p140 = 1
inv : p1560 + p1563 + p1567 + p1569 = 1
inv : p1485 + p1486 + p1490 = 1
inv : p34 + p35 + p123 + p128 = 1
inv : p2517 + p2519 + p2528 + p2533 + p2534 = 1
inv : p34 + p35 + p61 + p63 = 1
inv : p3774 + p3777 + p3778 = 1
inv : p34 + p35 + p200 + p205 = 1
inv : p2080 + p2083 + p2084 = 1
inv : p3235 + p3240 + p3241 = 1
inv : p3372 + p3374 = 1
inv : p34 + p35 + p900 + p908 + p910 = 1
inv : p1860 + p1865 = 1
inv : p2215 + p2216 + p2220 + p2225 + p2226 = 1
inv : p3760 + p3763 + p3764 = 1
inv : p1472 + p1475 + p1477 + p1480 = 1
inv : p34 + p35 + p1065 + p1067 + p1068 + p1069 = 1
inv : p1912 + p1917 + p1918 = 1
inv : p34 + p35 + p64 + p69 + p70 = 1
inv : p1817 + p1822 = 1
inv : p34 + p35 + p284 + p286 + p331 + p335 = 1
inv : p2388 + p2391 + p2392 = 1
inv : p2517 + p2519 + p2542 + p2547 + p2548 = 1
inv : p34 + p35 + p746 + p747 + p812 + p816 + p821 + p822 = 1
inv : p2036 + p2041 = 1
inv : p3137 + p3158 + p3163 + p3164 = 1
inv : p2066 + p2069 + p2070 = 1
inv : p3221 + p3226 + p3227 = 1
inv : p34 + p1233 + p1238 + p1239 = 1
inv : p34 + p35 + p900 + p925 + p930 + p931 = 1
inv : p2498 + p2503 = 1
inv : p34 + p35 + p365 + p386 + p391 + p392 = 1
inv : p2374 + p2377 + p2378 = 1
inv : p34 + p35 + p526 + p529 + p530 = 1
inv : p34 + p35 + p232 + p237 + p238 = 1
inv : p1678 + p1680 = 1
inv : p2140 + p2142 = 1
inv : p2150 + p2153 + p2154 = 1
inv : p2806 + p2811 = 1
inv : p34 + p35 + p746 + p747 + p764 + p769 + p770 = 1
inv : p3375 + p3378 + p3379 = 1
inv : p1364 + p1365 + p1380 + p1382 + p1383 + p1384 = 1
inv : p3844 + p3847 + p3848 = 1
inv : p34 + p35 + p706 + p710 = 1
inv : p2600 + p2602 + p2604 = 1
inv : p34 + p35 + p582 + p585 + p587 + p590 = 1
inv : p1611 + p1616 + p1617 = 1
inv : p3595 + p3620 + p3621 + p3623 + p3624 = 1
inv : p3674 + p3675 + p3708 + p3713 = 1
inv : p2703 + p2707 = 1
inv : p2956 + p2957 + p2960 + p2961 + p2965 = 1
inv : p2381 + p2386 + p2387 = 1
inv : p3137 + p3151 + p3154 + p3155 = 1
inv : p1919 + p1922 + p1923 = 1
inv : p3137 + p3165 + p3169 + p3174 = 1
inv : p3595 + p3631 + p3636 = 1
inv : p1534 + p1539 + p1540 = 1
inv : p1765 + p1768 + p1769 = 1
inv : p34 + p35 + p1013 + p1018 = 1
inv : p2517 + p2519 + p2535 + p2538 + p2539 = 1
inv : p34 + p35 + p746 + p747 + p771 + p774 + p775 = 1
inv : p34 + p35 + p1062 + p1064 = 1
inv : p2215 + p2227 + p2232 + p2233 = 1
inv : p2895 + p2900 = 1
inv : p34 + p35 + p218 + p223 + p224 = 1
inv : p2679 + p2681 = 1
inv : p34 + p35 + p71 + p74 + p75 = 1
inv : p2696 + p2699 + p2700 = 1
inv : p3103 + p3107 = 1
inv : p1926 + p1931 + p1932 = 1
inv : p2465 + p2470 + p2471 = 1
inv : p2294 + p2296 = 1
inv : p34 + p35 + p1131 + p1156 + p1161 + p1162 = 1
inv : p34 + p35 + p78 + p83 + p84 = 1
inv : p3861 + p3862 + p3867 = 1
inv : p3228 + p3231 + p3232 = 1
inv : p3389 + p3392 + p3393 = 1
inv : p34 + p35 + p540 + p543 + p544 = 1
inv : p1524 + p1526 = 1
inv : p3595 + p3653 + p3658 = 1
inv : p34 + p35 + p365 + p393 + p397 + p402 = 1
inv : p2773 + p2778 + p2779 = 1
inv : p34 + p35 + p982 + p1002 + p1007 + p1008 = 1
inv : p1318 + p1321 + p1324 + p1326 = 1
inv : p3518 + p3519 + p3565 + p3569 = 1
inv : p2433 + p2438 = 1
inv : p3796 + p3800 = 1
inv : p2872 + p2876 = 1
inv : p34 + p35 + p982 + p988 + p989 + p991 + p992 = 1
inv : p34 + p35 + p1079 + p1084 + p1085 = 1
inv : p1849 + p1851 + p1854 + p1855 = 1
inv : p34 + p35 + p1131 + p1142 + p1147 + p1148 = 1
inv : p34 + p35 + p573 + p574 + p576 + p578 = 1
inv : p2157 + p2162 + p2163 = 1
inv : p1428 + p1432 + p1437 = 1
inv : p34 + p35 + p746 + p747 + p779 + p782 + p784 + p787 = 1
inv : p34 + p35 + p746 + p747 + p757 + p760 + p761 = 1
inv : p1842 + p1847 + p1848 = 1
inv : p34 + p35 + p1035 + p1040 = 1
inv : p1783 + p1788 = 1
inv : p2913 + p2916 + p2917 = 1
inv : p34 + p35 + p365 + p379 + p382 + p383 = 1
inv : p3287 + p3288 + p3298 + p3301 + p3302 = 1
inv : p3203 + p3208 = 1
inv : p2073 + p2078 + p2079 = 1
inv : p1706 + p1711 = 1
inv : p34 + p35 + p900 + p918 + p921 + p922 = 1
inv : p34 + p35 + p456 + p459 + p460 = 1
inv : p3452 + p3457 + p3458 = 1
inv : p3026 + p3030 = 1
inv : p34 + p1219 + p1224 + p1225 = 1
inv : p34 + p35 + p155 + p160 + p161 = 1
inv : p2920 + p2925 + p2926 = 1
inv : p34 + p1255 + p1259 = 1
inv : p2815 + p2816 + p2823 = 1
inv : p34 + p35 + p642 + p643 = 1
inv : p3757 + p3759 = 1
inv : p3837 + p3838 + p3842 + p3843 = 1
inv : p2630 + p2635 = 1
inv : p1996 + p1999 + p2000 = 1
inv : p1835 + p1838 + p1839 = 1
inv : p3595 + p3606 + p3609 + p3610 = 1
inv : p3674 + p3675 + p3683 + p3688 + p3689 = 1
inv : p3287 + p3288 + p3357 + p3362 = 1
inv : p1740 + p1745 = 1
inv : p2356 + p2361 = 1
inv : p34 + p35 + p419 + p424 = 1
inv : p34 + p35 + p982 + p995 + p998 + p999 = 1
inv : p3880 + p3884 + p3889 + p3890 = 1
inv : p3067 + p3072 + p3073 = 1
inv : p34 + p35 + p1101 + p1105 = 1
inv : p1948 + p1951 + p1952 = 1
inv : p1303 + p1306 + p1307 = 1
inv : p3431 + p3439 = 1
inv : p2784 + p2789 = 1
inv : p3287 + p3288 + p3298 + p3303 + p3304 = 1
inv : p3074 + p3079 + p3080 = 1
inv : p2987 + p2989 = 1
inv : p34 + p35 + p848 + p851 + p852 = 1
inv : p3518 + p3519 + p3529 + p3532 + p3533 = 1
inv : p34 + p35 + p859 + p864 = 1
inv : p1303 + p1308 + p1309 = 1
inv : p1688 + p1693 + p1694 = 1
inv : p34 + p35 + p694 + p697 + p698 = 1
inv : p1802 + p1805 + p1810 = 1
inv : p34 + p35 + p1079 + p1082 + p1083 = 1
inv : p34 + p1277 + p1278 + p1283 = 1
inv : p1989 + p1994 + p1995 = 1
inv : p34 + p35 + p163 + p165 + p166 + p171 = 1
inv : p2003 + p2006 + p2007 = 1
inv : p3674 + p3675 + p3690 + p3693 + p3694 = 1
inv : p2333 + p2337 = 1
inv : p34 + p35 + p610 + p615 + p616 = 1
inv : p2600 + p2605 + p2610 + p2611 = 1
inv : p2517 + p2587 + p2592 = 1
inv : p34 + p35 + p1131 + p1142 + p1145 + p1146 = 1
inv : p3126 + p3131 = 1
inv : p34 + p35 + p739 + p744 = 1
inv : p34 + p35 + p284 + p286 + p302 + p307 + p308 = 1
inv : p2199 + p2202 + p2207 = 1
inv : p2997 + p3000 + p3001 = 1
inv : p2843 + p2846 + p2847 = 1
inv : p3518 + p3519 + p3543 + p3546 + p3547 = 1
inv : p1552 + p1557 = 1
inv : p34 + p35 + p680 + p683 + p684 = 1
inv : p1755 + p1757 = 1
inv : p2190 + p2195 = 1
inv : p3422 + p3427 = 1
inv : p2913 + p2918 + p2919 = 1
inv : p1364 + p1365 + p1373 + p1378 + p1379 = 1
inv : p2619 + p2624 + p2625 = 1
inv : p34 + p35 + p900 + p947 + p951 = 1
inv : p3459 + p3464 + p3465 = 1
inv : p3287 + p3288 + p3345 + p3350 = 1
inv : p34 + p35 + p449 + p452 + p453 = 1
inv : p3064 + p3066 = 1
inv : p34 + p35 + p1131 + p1201 + p1206 = 1
inv : p34 + p35 + p431 + p436 = 1
inv : p3015 + p3020 = 1
inv : p1772 + p1777 + p1778 = 1
inv : p3491 + p3492 = 1
inv : p2311 + p2316 + p2317 = 1
inv : p34 + p35 + p456 + p461 + p462 = 1
inv : p34 + p35 + p831 + p833 = 1
inv : p2759 + p2764 + p2765 = 1
inv : p1457 + p1462 + p1463 = 1
inv : p2113 + p2118 = 1
inv : p34 + p35 + p254 + p258 = 1
inv : p34 + p35 + p526 + p531 + p532 = 1
inv : p34 + p35 + p662 + p667 = 1
inv : p2773 + p2776 + p2777 = 1
inv : p3595 + p3606 + p3611 + p3612 = 1
inv : p34 + p35 + p687 + p692 + p693 = 1
inv : p1450 + p1453 + p1454 = 1
inv : p1604 + p1607 + p1608 = 1
inv : p3287 + p3288 + p3312 + p3315 + p3316 = 1
inv : p34 + p35 + p617 + p620 + p621 = 1
inv : p34 + p1219 + p1222 + p1223 = 1
inv : p1882 + p1887 = 1
inv : p34 + p35 + p155 + p158 + p159 = 1
inv : p34 + p35 + p496 + p501 = 1
inv : p34 + p35 + p225 + p228 + p229 = 1
inv : p1601 + p1603 = 1
inv : p1695 + p1698 + p1699 = 1
inv : p2143 + p2148 + p2149 = 1
inv : p34 + p35 + p1131 + p1139 + p1141 = 1
inv : p3246 + p3251 = 1
inv : p2322 + p2326 + p2327 = 1
inv : p34 + p35 + p603 + p606 + p607 = 1
inv : p3287 + p3288 + p3295 + p3297 = 1
inv : p34 + p35 + p177 + p178 + p180 + p181 = 1
inv : p2990 + p2995 + p2996 = 1
inv : p34 + p1233 + p1236 + p1237 = 1
inv : p2738 + p2741 + p2744 + p2746 = 1
inv : p34 + p35 + p284 + p286 + p309 + p312 + p313 = 1
inv : p34 + p35 + p107 + p111 + p116 + p117 = 1
inv : p3466 + p3469 + p3470 = 1
inv : p34 + p35 + p148 + p150 + p151 + p152 = 1
inv : p1681 + p1684 + p1685 = 1
inv : p1618 + p1621 + p1622 = 1
inv : p3674 + p3675 + p3680 + p3682 = 1
inv : p1637 + p1640 + p1644 = 1
inv : p2304 + p2306 + p2309 + p2310 = 1
inv : p34 + p35 + p64 + p67 + p68 = 1
inv : p2664 + p2669 = 1
inv : p3382 + p3387 + p3388 = 1
inv : p1364 + p1420 + p1425 = 1
inv : p2517 + p2519 + p2542 + p2545 + p2546 = 1
inv : p2850 + p2855 + p2856 = 1
inv : p3092 + p3097 = 1
inv : p1364 + p1365 + p1387 + p1392 + p1393 = 1
inv : p34 + p35 + p1043 + p1047 + p1052 + p1053 = 1
inv : p2279 + p2284 = 1
inv : p2689 + p2694 + p2695 = 1
inv : p3004 + p3009 + p3010 = 1
inv : p34 + p35 + p284 + p286 + p295 + p298 + p299 = 1
inv : p2682 + p2685 + p2686 = 1
inv : p2934 + p2938 = 1
inv : p34 + p35 + p365 + p372 + p377 + p378 = 1
inv : p34 + p35 + p284 + p350 + p354 = 1
inv : p34 + p35 + p716 + p720 = 1
inv : p3268 + p3273 = 1
inv : p3674 + p3675 + p3697 + p3702 + p3703 = 1
inv : p34 + p35 + p900 + p911 + p916 + p917 = 1
inv : p1464 + p1467 + p1468 = 1
inv : p3856 + p3857 = 1
inv : p2880 + p2883 + p2885 + p2888 = 1
inv : p2458 + p2463 + p2464 = 1
inv : p34 + p35 + p1131 + p1156 + p1159 + p1160 = 1
inv : p34 + p35 + p533 + p536 + p537 = 1
inv : p34 + p35 + p540 + p545 + p546 = 1
inv : p1509 + p1514 = 1
inv : p2472 + p2473 + p2478 + p2479 + p2481 + p2482 = 1
inv : p3767 + p3772 + p3773 = 1
inv : p1629 + p1634 = 1
inv : p2927 + p2929 + p2932 + p2933 = 1
inv : p2517 + p2519 + p2575 + p2580 = 1
inv : p3518 + p3519 + p3536 + p3541 + p3542 = 1
inv : p34 + p35 + p141 + p144 + p145 = 1
inv : p2234 + p2237 + p2238 = 1
inv : p2297 + p2302 + p2303 = 1
inv : p2451 + p2454 + p2455 = 1
inv : p1890 + p1894 + p1899 = 1
inv : p34 + p35 + p881 + p886 = 1
inv : p1758 + p1763 + p1764 = 1
inv : p3400 + p3405 = 1
inv : p2241 + p2242 + p2245 + p2247 = 1
inv : p2420 + p2421 + p2426 = 1
inv : p3137 + p3144 + p3149 + p3150 = 1
inv : p34 + p35 + p841 + p846 + p847 = 1
inv : p3819 + p3824 = 1
inv : p34 + p35 + p834 + p837 + p838 = 1
inv : p3081 + p3084 + p3085 = 1
inv : p34 + p35 + p1065 + p1067 + p1070 + p1071 = 1
inv : p1527 + p1528 + p1530 + p1531 = 1
Total of 551 invariants.
[2022-06-12 23:51:42] [INFO ] Computed 551 place invariants in 21 ms
[2022-06-12 23:51:47] [INFO ] Proved 1390 variables to be positive in 4725 ms
[2022-06-12 23:51:48] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldPPPt-PT-050B-ReachabilityFireability-01
[2022-06-12 23:51:48] [INFO ] KInduction solution for property ShieldPPPt-PT-050B-ReachabilityFireability-01(SAT) depth K=0 took 706 ms
[2022-06-12 23:51:48] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldPPPt-PT-050B-ReachabilityFireability-05
[2022-06-12 23:51:48] [INFO ] KInduction solution for property ShieldPPPt-PT-050B-ReachabilityFireability-05(SAT) depth K=0 took 545 ms
[2022-06-12 23:51:49] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldPPPt-PT-050B-ReachabilityFireability-07
[2022-06-12 23:51:49] [INFO ] KInduction solution for property ShieldPPPt-PT-050B-ReachabilityFireability-07(SAT) depth K=0 took 489 ms
[2022-06-12 23:51:49] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldPPPt-PT-050B-ReachabilityFireability-09
[2022-06-12 23:51:49] [INFO ] KInduction solution for property ShieldPPPt-PT-050B-ReachabilityFireability-09(SAT) depth K=0 took 223 ms
[2022-06-12 23:51:49] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldPPPt-PT-050B-ReachabilityFireability-14
[2022-06-12 23:51:49] [INFO ] KInduction solution for property ShieldPPPt-PT-050B-ReachabilityFireability-14(SAT) depth K=0 took 259 ms
[2022-06-12 23:51:50] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldPPPt-PT-050B-ReachabilityFireability-01
[2022-06-12 23:51:50] [INFO ] KInduction solution for property ShieldPPPt-PT-050B-ReachabilityFireability-01(SAT) depth K=1 took 778 ms
[2022-06-12 23:51:52] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldPPPt-PT-050B-ReachabilityFireability-05
[2022-06-12 23:51:52] [INFO ] KInduction solution for property ShieldPPPt-PT-050B-ReachabilityFireability-05(SAT) depth K=1 took 2017 ms
Compilation finished in 11768 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin9844084683875795419]
Link finished in 80 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, ShieldPPPtPT050BReachabilityFireability01==true], workingDir=/tmp/ltsmin9844084683875795419]
[2022-06-12 23:51:54] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldPPPt-PT-050B-ReachabilityFireability-07
[2022-06-12 23:51:54] [INFO ] KInduction solution for property ShieldPPPt-PT-050B-ReachabilityFireability-07(SAT) depth K=1 took 1544 ms
[2022-06-12 23:52:00] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldPPPt-PT-050B-ReachabilityFireability-09
[2022-06-12 23:52:00] [INFO ] KInduction solution for property ShieldPPPt-PT-050B-ReachabilityFireability-09(SAT) depth K=1 took 6048 ms
[2022-06-12 23:52:01] [INFO ] BMC solution for property ShieldPPPt-PT-050B-ReachabilityFireability-01(UNSAT) depth K=2 took 18945 ms
[2022-06-12 23:52:06] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldPPPt-PT-050B-ReachabilityFireability-14
[2022-06-12 23:52:06] [INFO ] KInduction solution for property ShieldPPPt-PT-050B-ReachabilityFireability-14(SAT) depth K=1 took 5953 ms
[2022-06-12 23:52:17] [INFO ] BMC solution for property ShieldPPPt-PT-050B-ReachabilityFireability-05(UNSAT) depth K=2 took 16352 ms
[2022-06-12 23:52:45] [INFO ] BMC solution for property ShieldPPPt-PT-050B-ReachabilityFireability-07(UNSAT) depth K=2 took 27782 ms
[2022-06-12 23:53:14] [INFO ] BMC solution for property ShieldPPPt-PT-050B-ReachabilityFireability-09(UNSAT) depth K=2 took 29024 ms
Reachability property ShieldPPPt-PT-050B-ReachabilityFireability-14 is true.
FORMULA ShieldPPPt-PT-050B-ReachabilityFireability-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Reachability property ShieldPPPt-PT-050B-ReachabilityFireability-09 is true.
FORMULA ShieldPPPt-PT-050B-ReachabilityFireability-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
[2022-06-12 23:53:56] [INFO ] BMC solution for property ShieldPPPt-PT-050B-ReachabilityFireability-14(UNSAT) depth K=2 took 42319 ms
Reachability property ShieldPPPt-PT-050B-ReachabilityFireability-07 is true.
FORMULA ShieldPPPt-PT-050B-ReachabilityFireability-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Reachability property ShieldPPPt-PT-050B-ReachabilityFireability-01 is true.
FORMULA ShieldPPPt-PT-050B-ReachabilityFireability-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :1.60017e+22 after 1.42724e+115
[2022-06-13 00:01:51] [INFO ] BMC solution for property ShieldPPPt-PT-050B-ReachabilityFireability-01(UNSAT) depth K=3 took 474938 ms
[2022-06-13 00:02:58] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldPPPt-PT-050B-ReachabilityFireability-01
[2022-06-13 00:02:58] [INFO ] KInduction solution for property ShieldPPPt-PT-050B-ReachabilityFireability-01(SAT) depth K=2 took 651990 ms
WARNING : LTSmin timed out (>720 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, ShieldPPPtPT050BReachabilityFireability01==true], workingDir=/tmp/ltsmin9844084683875795419]
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, ShieldPPPtPT050BReachabilityFireability05==true], workingDir=/tmp/ltsmin9844084683875795419]
[2022-06-13 00:04:57] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldPPPt-PT-050B-ReachabilityFireability-05
[2022-06-13 00:04:57] [INFO ] KInduction solution for property ShieldPPPt-PT-050B-ReachabilityFireability-05(SAT) depth K=2 took 119038 ms
[2022-06-13 00:10:17] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldPPPt-PT-050B-ReachabilityFireability-05
[2022-06-13 00:10:17] [INFO ] KInduction solution for property ShieldPPPt-PT-050B-ReachabilityFireability-05(SAT) depth K=3 took 320770 ms
WARNING : LTSmin timed out (>720 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, ShieldPPPtPT050BReachabilityFireability05==true], workingDir=/tmp/ltsmin9844084683875795419]
Retrying LTSmin with larger timeout 5760 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, ShieldPPPtPT050BReachabilityFireability05==true], workingDir=/tmp/ltsmin9844084683875795419]
Detected timeout of ITS tools.
[2022-06-13 00:17:52] [INFO ] Applying decomposition
[2022-06-13 00:17:52] [INFO ] Flatten gal took : 111 ms
[2022-06-13 00:17:52] [INFO ] Decomposing Gal with order
[2022-06-13 00:17:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-13 00:17:52] [INFO ] Removed a total of 636 redundant transitions.
[2022-06-13 00:17:52] [INFO ] Flatten gal took : 189 ms
[2022-06-13 00:17:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 282 labels/synchronizations in 33 ms.
[2022-06-13 00:17:52] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability8004169816709909018.gal : 31 ms
[2022-06-13 00:17:52] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability15576525635197680493.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/ReachabilityFireability8004169816709909018.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityFireability15576525635197680493.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/ReachabilityFireability8004169816709909018.gal -t CGAL -reachable-file /tmp/ReachabilityFireability15576525635197680493.prop --nowitness
Loading property file /tmp/ReachabilityFireability15576525635197680493.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 6
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :6 after 9
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :9 after 87
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :87 after 249
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :249 after 87486
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :1.60017e+22 after 1.28607e+77
[2022-06-13 00:31:28] [INFO ] BMC solution for property ShieldPPPt-PT-050B-ReachabilityFireability-05(UNSAT) depth K=3 took 1777509 ms

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="ShieldPPPt-PT-050B"
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 ShieldPPPt-PT-050B, 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-165286037400258"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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