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-165286037200192.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 ShieldPPPs-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-165286037200192
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 8.2K Apr 30 03:35 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K Apr 30 03:35 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Apr 30 03:34 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Apr 30 03:34 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K May 9 08:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 9 08:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 08:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 9 08:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.9K Apr 30 03:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 90K Apr 30 03:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Apr 30 03:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 45K Apr 30 03:35 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 08:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:53 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 888K 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 ShieldPPPs-PT-050B-ReachabilityFireability-00
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityFireability-01
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityFireability-02
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityFireability-03
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityFireability-04
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityFireability-05
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityFireability-06
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityFireability-07
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityFireability-08
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityFireability-09
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityFireability-10
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityFireability-11
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityFireability-12
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityFireability-13
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityFireability-14
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1655073075746

Running Version 0
[2022-06-12 22:31:17] [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 22:31:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-12 22:31:17] [INFO ] Load time of PNML (sax parser for PT used): 181 ms
[2022-06-12 22:31:17] [INFO ] Transformed 3403 places.
[2022-06-12 22:31:17] [INFO ] Transformed 3153 transitions.
[2022-06-12 22:31:17] [INFO ] Found NUPN structural information;
[2022-06-12 22:31:17] [INFO ] Parsed PT model containing 3403 places and 3153 transitions in 386 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 102 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 158 ms. (steps per millisecond=63 ) properties (out of 16) seen :8
FORMULA ShieldPPPs-PT-050B-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-050B-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-050B-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-050B-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-050B-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-050B-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-050B-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-050B-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 8) 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 8) 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 8) 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 8) 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 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 3153 rows 3403 cols
[2022-06-12 22:31:18] [INFO ] Computed 551 place invariants in 57 ms
[2022-06-12 22:31:19] [INFO ] [Real]Absence check using 551 positive place invariants in 269 ms returned sat
[2022-06-12 22:31:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:31:20] [INFO ] [Real]Absence check using state equation in 1647 ms returned sat
[2022-06-12 22:31:22] [INFO ] Deduced a trap composed of 16 places in 1208 ms of which 21 ms to minimize.
[2022-06-12 22:31:23] [INFO ] Deduced a trap composed of 21 places in 1064 ms of which 8 ms to minimize.
[2022-06-12 22:31:23] [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 22:31:24] [INFO ] [Real]Absence check using 551 positive place invariants in 255 ms returned sat
[2022-06-12 22:31:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:31:26] [INFO ] [Real]Absence check using state equation in 1943 ms returned sat
[2022-06-12 22:31:26] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:31:27] [INFO ] [Nat]Absence check using 551 positive place invariants in 256 ms returned sat
[2022-06-12 22:31:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:31:29] [INFO ] [Nat]Absence check using state equation in 1991 ms returned sat
[2022-06-12 22:31:30] [INFO ] Deduced a trap composed of 29 places in 958 ms of which 4 ms to minimize.
[2022-06-12 22:31:31] [INFO ] Deduced a trap composed of 20 places in 950 ms of which 4 ms to minimize.
[2022-06-12 22:31:32] [INFO ] Deduced a trap composed of 35 places in 1005 ms of which 2 ms to minimize.
[2022-06-12 22:31:32] [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 22:31:33] [INFO ] [Real]Absence check using 551 positive place invariants in 267 ms returned sat
[2022-06-12 22:31:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:31:34] [INFO ] [Real]Absence check using state equation in 1658 ms returned sat
[2022-06-12 22:31:35] [INFO ] Deduced a trap composed of 15 places in 1007 ms of which 7 ms to minimize.
[2022-06-12 22:31:37] [INFO ] Deduced a trap composed of 31 places in 984 ms of which 2 ms to minimize.
[2022-06-12 22:31:38] [INFO ] Deduced a trap composed of 18 places in 963 ms of which 2 ms to minimize.
[2022-06-12 22:31:38] [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 22:31:38] [INFO ] [Real]Absence check using 551 positive place invariants in 281 ms returned sat
[2022-06-12 22:31:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:31:41] [INFO ] [Real]Absence check using state equation in 2765 ms returned sat
[2022-06-12 22:31:41] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:31:42] [INFO ] [Nat]Absence check using 551 positive place invariants in 272 ms returned sat
[2022-06-12 22:31:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:31:45] [INFO ] [Nat]Absence check using state equation in 2652 ms returned sat
[2022-06-12 22:31:46] [INFO ] Deduced a trap composed of 21 places in 877 ms of which 2 ms to minimize.
[2022-06-12 22:31:47] [INFO ] Deduced a trap composed of 22 places in 790 ms of which 1 ms to minimize.
[2022-06-12 22:31:47] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 3
[2022-06-12 22:31:47] [INFO ] [Real]Absence check using 551 positive place invariants in 234 ms returned sat
[2022-06-12 22:31:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:31:49] [INFO ] [Real]Absence check using state equation in 1596 ms returned sat
[2022-06-12 22:31:50] [INFO ] Deduced a trap composed of 27 places in 941 ms of which 2 ms to minimize.
[2022-06-12 22:31:51] [INFO ] Deduced a trap composed of 19 places in 925 ms of which 2 ms to minimize.
[2022-06-12 22:31:52] [INFO ] Deduced a trap composed of 21 places in 930 ms of which 2 ms to minimize.
[2022-06-12 22:31:52] [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 22:31:53] [INFO ] [Real]Absence check using 551 positive place invariants in 252 ms returned sat
[2022-06-12 22:31:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:31:54] [INFO ] [Real]Absence check using state equation in 1621 ms returned sat
[2022-06-12 22:31:56] [INFO ] Deduced a trap composed of 18 places in 957 ms of which 2 ms to minimize.
[2022-06-12 22:31:57] [INFO ] Deduced a trap composed of 26 places in 908 ms of which 2 ms to minimize.
[2022-06-12 22:31:58] [INFO ] Deduced a trap composed of 28 places in 869 ms of which 2 ms to minimize.
[2022-06-12 22:31:58] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 5
[2022-06-12 22:31:58] [INFO ] [Real]Absence check using 551 positive place invariants in 229 ms returned sat
[2022-06-12 22:31:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:32:00] [INFO ] [Real]Absence check using state equation in 1553 ms returned sat
[2022-06-12 22:32:01] [INFO ] Deduced a trap composed of 23 places in 1031 ms of which 2 ms to minimize.
[2022-06-12 22:32:02] [INFO ] Deduced a trap composed of 20 places in 1008 ms of which 2 ms to minimize.
[2022-06-12 22:32:03] [INFO ] Deduced a trap composed of 19 places in 998 ms of which 2 ms to minimize.
[2022-06-12 22:32:03] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 6
[2022-06-12 22:32:04] [INFO ] [Real]Absence check using 551 positive place invariants in 240 ms returned sat
[2022-06-12 22:32:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:32:06] [INFO ] [Real]Absence check using state equation in 1869 ms returned sat
[2022-06-12 22:32:07] [INFO ] Deduced a trap composed of 36 places in 953 ms of which 2 ms to minimize.
[2022-06-12 22:32:08] [INFO ] Deduced a trap composed of 28 places in 953 ms of which 2 ms to minimize.
[2022-06-12 22:32:09] [INFO ] Deduced a trap composed of 18 places in 929 ms of which 2 ms to minimize.
[2022-06-12 22:32:09] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 7
Fused 8 Parikh solutions to 1 different solutions.
Support contains 65 out of 3403 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3403/3403 places, 3153/3153 transitions.
Drop transitions removed 331 transitions
Trivial Post-agglo rules discarded 331 transitions
Performed 331 trivial Post agglomeration. Transition count delta: 331
Iterating post reduction 0 with 331 rules applied. Total rules applied 331 place count 3403 transition count 2822
Reduce places removed 331 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 338 rules applied. Total rules applied 669 place count 3072 transition count 2815
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 676 place count 3065 transition count 2815
Performed 251 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 251 Pre rules applied. Total rules applied 676 place count 3065 transition count 2564
Deduced a syphon composed of 251 places in 7 ms
Reduce places removed 251 places and 0 transitions.
Iterating global reduction 3 with 502 rules applied. Total rules applied 1178 place count 2814 transition count 2564
Discarding 342 places :
Symmetric choice reduction at 3 with 342 rule applications. Total rules 1520 place count 2472 transition count 2222
Iterating global reduction 3 with 342 rules applied. Total rules applied 1862 place count 2472 transition count 2222
Performed 137 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 137 Pre rules applied. Total rules applied 1862 place count 2472 transition count 2085
Deduced a syphon composed of 137 places in 16 ms
Reduce places removed 137 places and 0 transitions.
Iterating global reduction 3 with 274 rules applied. Total rules applied 2136 place count 2335 transition count 2085
Performed 731 Post agglomeration using F-continuation condition.Transition count delta: 731
Deduced a syphon composed of 731 places in 3 ms
Reduce places removed 731 places and 0 transitions.
Iterating global reduction 3 with 1462 rules applied. Total rules applied 3598 place count 1604 transition count 1354
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 423 times.
Drop transitions removed 423 transitions
Iterating global reduction 3 with 423 rules applied. Total rules applied 4021 place count 1604 transition count 1354
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 4022 place count 1603 transition count 1353
Applied a total of 4022 rules in 1675 ms. Remains 1603 /3403 variables (removed 1800) and now considering 1353/3153 (removed 1800) transitions.
Finished structural reductions, in 1 iterations. Remains : 1603/3403 places, 1353/3153 transitions.
[2022-06-12 22:32:11] [INFO ] Flatten gal took : 174 ms
[2022-06-12 22:32:11] [INFO ] Flatten gal took : 101 ms
[2022-06-12 22:32:11] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality463176012465212624.gal : 27 ms
[2022-06-12 22:32:11] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16540846355513487243.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/ReachabilityCardinality463176012465212624.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality16540846355513487243.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/ReachabilityCardinality463176012465212624.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality16540846355513487243.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality16540846355513487243.prop.
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,8 properties remain. new max is 8
SDD size :4 after 7
SDD proceeding with computation,8 properties remain. new max is 16
SDD size :7 after 13
SDD proceeding with computation,8 properties remain. new max is 32
SDD size :13 after 25
SDD proceeding with computation,8 properties remain. new max is 64
SDD size :25 after 433
SDD proceeding with computation,8 properties remain. new max is 128
SDD size :433 after 1297
SDD proceeding with computation,8 properties remain. new max is 256
SDD size :1297 after 248835
SDD proceeding with computation,8 properties remain. new max is 512
SDD size :248835 after 1.34371e+09
Detected timeout of ITS tools.
[2022-06-12 22:32:26] [INFO ] Flatten gal took : 86 ms
[2022-06-12 22:32:26] [INFO ] Applying decomposition
[2022-06-12 22:32:26] [INFO ] Flatten gal took : 80 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/graph358948555701354121.txt, -o, /tmp/graph358948555701354121.bin, -w, /tmp/graph358948555701354121.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/graph358948555701354121.bin, -l, -1, -v, -w, /tmp/graph358948555701354121.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-12 22:32:27] [INFO ] Decomposing Gal with order
[2022-06-12 22:32:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-12 22:32:27] [INFO ] Removed a total of 698 redundant transitions.
[2022-06-12 22:32:27] [INFO ] Flatten gal took : 177 ms
[2022-06-12 22:32:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 1234 labels/synchronizations in 129 ms.
[2022-06-12 22:32:27] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10952086818460584638.gal : 22 ms
[2022-06-12 22:32:27] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4237408931008692415.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/ReachabilityCardinality10952086818460584638.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality4237408931008692415.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/ReachabilityCardinality10952086818460584638.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality4237408931008692415.prop --nowitness
Loading property file /tmp/ReachabilityCardinality4237408931008692415.prop.
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,8 properties remain. new max is 8
SDD size :2 after 3
SDD proceeding with computation,8 properties remain. new max is 16
SDD size :3 after 6
SDD proceeding with computation,8 properties remain. new max is 32
SDD size :6 after 12
SDD proceeding with computation,8 properties remain. new max is 64
SDD size :12 after 21
SDD proceeding with computation,8 properties remain. new max is 128
SDD size :21 after 75
SDD proceeding with computation,8 properties remain. new max is 256
SDD size :75 after 1.61245e+08
Reachability property ShieldPPPs-PT-050B-ReachabilityFireability-11 is true.
FORMULA ShieldPPPs-PT-050B-ReachabilityFireability-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Reachability property ShieldPPPs-PT-050B-ReachabilityFireability-09 is true.
FORMULA ShieldPPPs-PT-050B-ReachabilityFireability-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Reachability property ShieldPPPs-PT-050B-ReachabilityFireability-08 is true.
FORMULA ShieldPPPs-PT-050B-ReachabilityFireability-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Reachability property ShieldPPPs-PT-050B-ReachabilityFireability-02 is true.
FORMULA ShieldPPPs-PT-050B-ReachabilityFireability-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :1.78133e+14 after 1.18083e+57
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin361651196065721190
[2022-06-12 22:32:42] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin361651196065721190
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/ltsmin361651196065721190]
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/ltsmin361651196065721190] 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/ltsmin361651196065721190] 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 118 resets, run finished after 12590 ms. (steps per millisecond=79 ) properties (out of 4) seen :3
FORMULA ShieldPPPs-PT-050B-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-050B-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-050B-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Interrupted Best-First random walk after 694361 steps, including 4 resets, run timeout after 5001 ms. (steps per millisecond=138 ) properties seen :{}
Running SMT prover for 1 properties.
// Phase 1: matrix 1353 rows 1603 cols
[2022-06-12 22:33:01] [INFO ] Computed 551 place invariants in 99 ms
[2022-06-12 22:33:02] [INFO ] [Real]Absence check using 523 positive place invariants in 129 ms returned sat
[2022-06-12 22:33:02] [INFO ] [Real]Absence check using 523 positive and 28 generalized place invariants in 7 ms returned sat
[2022-06-12 22:33:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:33:02] [INFO ] [Real]Absence check using state equation in 703 ms returned sat
[2022-06-12 22:33:02] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:33:03] [INFO ] [Nat]Absence check using 523 positive place invariants in 96 ms returned sat
[2022-06-12 22:33:03] [INFO ] [Nat]Absence check using 523 positive and 28 generalized place invariants in 6 ms returned sat
[2022-06-12 22:33:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:33:03] [INFO ] [Nat]Absence check using state equation in 706 ms returned sat
[2022-06-12 22:33:04] [INFO ] Deduced a trap composed of 4 places in 218 ms of which 1 ms to minimize.
[2022-06-12 22:33:04] [INFO ] Deduced a trap composed of 6 places in 139 ms of which 0 ms to minimize.
[2022-06-12 22:33:04] [INFO ] Deduced a trap composed of 6 places in 122 ms of which 0 ms to minimize.
[2022-06-12 22:33:04] [INFO ] Deduced a trap composed of 10 places in 129 ms of which 0 ms to minimize.
[2022-06-12 22:33:04] [INFO ] Deduced a trap composed of 6 places in 142 ms of which 1 ms to minimize.
[2022-06-12 22:33:04] [INFO ] Deduced a trap composed of 5 places in 135 ms of which 1 ms to minimize.
[2022-06-12 22:33:05] [INFO ] Deduced a trap composed of 11 places in 124 ms of which 0 ms to minimize.
[2022-06-12 22:33:05] [INFO ] Deduced a trap composed of 18 places in 128 ms of which 1 ms to minimize.
[2022-06-12 22:33:05] [INFO ] Deduced a trap composed of 9 places in 134 ms of which 1 ms to minimize.
[2022-06-12 22:33:05] [INFO ] Deduced a trap composed of 8 places in 116 ms of which 1 ms to minimize.
[2022-06-12 22:33:05] [INFO ] Deduced a trap composed of 5 places in 128 ms of which 1 ms to minimize.
[2022-06-12 22:33:06] [INFO ] Deduced a trap composed of 9 places in 127 ms of which 4 ms to minimize.
[2022-06-12 22:33:06] [INFO ] Deduced a trap composed of 5 places in 126 ms of which 0 ms to minimize.
[2022-06-12 22:33:06] [INFO ] Deduced a trap composed of 5 places in 139 ms of which 0 ms to minimize.
[2022-06-12 22:33:06] [INFO ] Deduced a trap composed of 8 places in 118 ms of which 0 ms to minimize.
[2022-06-12 22:33:06] [INFO ] Deduced a trap composed of 7 places in 109 ms of which 0 ms to minimize.
[2022-06-12 22:33:06] [INFO ] Deduced a trap composed of 5 places in 106 ms of which 1 ms to minimize.
[2022-06-12 22:33:07] [INFO ] Deduced a trap composed of 7 places in 73 ms of which 1 ms to minimize.
[2022-06-12 22:33:07] [INFO ] Deduced a trap composed of 5 places in 72 ms of which 0 ms to minimize.
[2022-06-12 22:33:07] [INFO ] Deduced a trap composed of 8 places in 68 ms of which 0 ms to minimize.
[2022-06-12 22:33:07] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 1 ms to minimize.
[2022-06-12 22:33:07] [INFO ] Deduced a trap composed of 5 places in 70 ms of which 0 ms to minimize.
[2022-06-12 22:33:07] [INFO ] Deduced a trap composed of 7 places in 69 ms of which 0 ms to minimize.
[2022-06-12 22:33:07] [INFO ] Deduced a trap composed of 7 places in 76 ms of which 0 ms to minimize.
[2022-06-12 22:33:07] [INFO ] Deduced a trap composed of 8 places in 59 ms of which 0 ms to minimize.
[2022-06-12 22:33:07] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 4183 ms
[2022-06-12 22:33:08] [INFO ] Computed and/alt/rep : 1344/5168/1344 causal constraints (skipped 0 transitions) in 72 ms.
[2022-06-12 22:33:28] [INFO ] Added : 815 causal constraints over 163 iterations in 20108 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 72 ms.
Incomplete Parikh walk after 98000 steps, including 894 resets, run finished after 847 ms. (steps per millisecond=115 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 10 out of 1603 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1603/1603 places, 1353/1353 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 1603 transition count 1346
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 1596 transition count 1346
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 14 place count 1596 transition count 1339
Deduced a syphon composed of 7 places in 4 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 28 place count 1589 transition count 1339
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 2 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 74 place count 1566 transition count 1316
Partial Free-agglomeration rule applied 11 times.
Drop transitions removed 11 transitions
Iterating global reduction 2 with 11 rules applied. Total rules applied 85 place count 1566 transition count 1316
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 86 place count 1565 transition count 1315
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 87 place count 1564 transition count 1314
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 88 place count 1563 transition count 1313
Applied a total of 88 rules in 349 ms. Remains 1563 /1603 variables (removed 40) and now considering 1313/1353 (removed 40) transitions.
Finished structural reductions, in 1 iterations. Remains : 1563/1603 places, 1313/1353 transitions.
[2022-06-12 22:33:29] [INFO ] Flatten gal took : 64 ms
[2022-06-12 22:33:29] [INFO ] Flatten gal took : 65 ms
[2022-06-12 22:33:29] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12756669965280737565.gal : 10 ms
[2022-06-12 22:33:29] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17424763511848877879.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/ReachabilityCardinality12756669965280737565.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality17424763511848877879.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/ReachabilityCardinality12756669965280737565.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality17424763511848877879.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality17424763511848877879.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 4
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :4 after 7
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :7 after 13
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :13 after 75
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :75 after 3300
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :3300 after 4721
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :4721 after 8544
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :8544 after 367989
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :367989 after 1.86027e+06
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1.86027e+06 after 1.06309e+08
Detected timeout of ITS tools.
[2022-06-12 22:33:44] [INFO ] Flatten gal took : 61 ms
[2022-06-12 22:33:44] [INFO ] Applying decomposition
[2022-06-12 22:33:44] [INFO ] Flatten gal took : 61 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/graph7936860678115350542.txt, -o, /tmp/graph7936860678115350542.bin, -w, /tmp/graph7936860678115350542.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/graph7936860678115350542.bin, -l, -1, -v, -w, /tmp/graph7936860678115350542.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-12 22:33:44] [INFO ] Decomposing Gal with order
[2022-06-12 22:33:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-12 22:33:45] [INFO ] Removed a total of 682 redundant transitions.
[2022-06-12 22:33:45] [INFO ] Flatten gal took : 101 ms
[2022-06-12 22:33:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 1260 labels/synchronizations in 55 ms.
[2022-06-12 22:33:45] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17399920234601706911.gal : 14 ms
[2022-06-12 22:33:45] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6185772826826707729.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/ReachabilityCardinality17399920234601706911.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality6185772826826707729.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/ReachabilityCardinality17399920234601706911.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality6185772826826707729.prop --nowitness
Loading property file /tmp/ReachabilityCardinality6185772826826707729.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 3
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :3 after 3
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :3 after 3
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :3 after 7
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :7 after 7
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :7 after 75
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :6.00615e+06 after 3.41423e+39
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14007919135042374208
[2022-06-12 22:34:00] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14007919135042374208
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/ltsmin14007919135042374208]
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/ltsmin14007919135042374208] 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/ltsmin14007919135042374208] 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 11281 ms. (steps per millisecond=88 ) properties (out of 1) seen :0
Interrupted Best-First random walk after 718575 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=143 ) properties seen :{}
Interrupted probabilistic random walk after 1530486 steps, run timeout after 30001 ms. (steps per millisecond=51 ) properties seen :{}
Probabilistic random walk after 1530486 steps, saw 1354002 distinct states, run finished after 30001 ms. (steps per millisecond=51 ) properties seen :{}
Running SMT prover for 1 properties.
// Phase 1: matrix 1313 rows 1563 cols
[2022-06-12 22:34:47] [INFO ] Computed 551 place invariants in 58 ms
[2022-06-12 22:34:47] [INFO ] [Real]Absence check using 522 positive place invariants in 99 ms returned sat
[2022-06-12 22:34:47] [INFO ] [Real]Absence check using 522 positive and 29 generalized place invariants in 11 ms returned sat
[2022-06-12 22:34:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:34:48] [INFO ] [Real]Absence check using state equation in 621 ms returned sat
[2022-06-12 22:34:48] [INFO ] Deduced a trap composed of 6 places in 156 ms of which 1 ms to minimize.
[2022-06-12 22:34:49] [INFO ] Deduced a trap composed of 6 places in 107 ms of which 0 ms to minimize.
[2022-06-12 22:34:49] [INFO ] Deduced a trap composed of 8 places in 102 ms of which 0 ms to minimize.
[2022-06-12 22:34:49] [INFO ] Deduced a trap composed of 6 places in 108 ms of which 0 ms to minimize.
[2022-06-12 22:34:49] [INFO ] Deduced a trap composed of 18 places in 91 ms of which 1 ms to minimize.
[2022-06-12 22:34:49] [INFO ] Deduced a trap composed of 13 places in 92 ms of which 1 ms to minimize.
[2022-06-12 22:34:49] [INFO ] Deduced a trap composed of 6 places in 93 ms of which 1 ms to minimize.
[2022-06-12 22:34:49] [INFO ] Deduced a trap composed of 6 places in 92 ms of which 0 ms to minimize.
[2022-06-12 22:34:50] [INFO ] Deduced a trap composed of 6 places in 92 ms of which 1 ms to minimize.
[2022-06-12 22:34:50] [INFO ] Deduced a trap composed of 7 places in 96 ms of which 0 ms to minimize.
[2022-06-12 22:34:50] [INFO ] Deduced a trap composed of 6 places in 89 ms of which 0 ms to minimize.
[2022-06-12 22:34:50] [INFO ] Deduced a trap composed of 11 places in 82 ms of which 0 ms to minimize.
[2022-06-12 22:34:50] [INFO ] Deduced a trap composed of 5 places in 87 ms of which 1 ms to minimize.
[2022-06-12 22:34:50] [INFO ] Deduced a trap composed of 8 places in 74 ms of which 0 ms to minimize.
[2022-06-12 22:34:50] [INFO ] Deduced a trap composed of 7 places in 71 ms of which 0 ms to minimize.
[2022-06-12 22:34:51] [INFO ] Deduced a trap composed of 8 places in 70 ms of which 1 ms to minimize.
[2022-06-12 22:34:51] [INFO ] Deduced a trap composed of 5 places in 71 ms of which 0 ms to minimize.
[2022-06-12 22:34:51] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 2564 ms
[2022-06-12 22:34:51] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:34:51] [INFO ] [Nat]Absence check using 522 positive place invariants in 92 ms returned sat
[2022-06-12 22:34:51] [INFO ] [Nat]Absence check using 522 positive and 29 generalized place invariants in 5 ms returned sat
[2022-06-12 22:34:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:34:52] [INFO ] [Nat]Absence check using state equation in 556 ms returned sat
[2022-06-12 22:34:52] [INFO ] Deduced a trap composed of 8 places in 237 ms of which 0 ms to minimize.
[2022-06-12 22:34:52] [INFO ] Deduced a trap composed of 9 places in 210 ms of which 0 ms to minimize.
[2022-06-12 22:34:52] [INFO ] Deduced a trap composed of 6 places in 207 ms of which 1 ms to minimize.
[2022-06-12 22:34:53] [INFO ] Deduced a trap composed of 8 places in 211 ms of which 1 ms to minimize.
[2022-06-12 22:34:53] [INFO ] Deduced a trap composed of 6 places in 211 ms of which 2 ms to minimize.
[2022-06-12 22:34:53] [INFO ] Deduced a trap composed of 5 places in 210 ms of which 0 ms to minimize.
[2022-06-12 22:34:53] [INFO ] Deduced a trap composed of 6 places in 207 ms of which 1 ms to minimize.
[2022-06-12 22:34:54] [INFO ] Deduced a trap composed of 11 places in 198 ms of which 1 ms to minimize.
[2022-06-12 22:34:54] [INFO ] Deduced a trap composed of 7 places in 194 ms of which 1 ms to minimize.
[2022-06-12 22:34:54] [INFO ] Deduced a trap composed of 6 places in 193 ms of which 0 ms to minimize.
[2022-06-12 22:34:54] [INFO ] Deduced a trap composed of 6 places in 212 ms of which 0 ms to minimize.
[2022-06-12 22:34:55] [INFO ] Deduced a trap composed of 8 places in 204 ms of which 0 ms to minimize.
[2022-06-12 22:34:55] [INFO ] Deduced a trap composed of 6 places in 200 ms of which 0 ms to minimize.
[2022-06-12 22:34:55] [INFO ] Deduced a trap composed of 6 places in 201 ms of which 0 ms to minimize.
[2022-06-12 22:34:55] [INFO ] Deduced a trap composed of 6 places in 202 ms of which 1 ms to minimize.
[2022-06-12 22:34:56] [INFO ] Deduced a trap composed of 9 places in 194 ms of which 1 ms to minimize.
[2022-06-12 22:34:56] [INFO ] Deduced a trap composed of 8 places in 216 ms of which 2 ms to minimize.
[2022-06-12 22:34:56] [INFO ] Deduced a trap composed of 6 places in 202 ms of which 1 ms to minimize.
[2022-06-12 22:34:56] [INFO ] Deduced a trap composed of 8 places in 186 ms of which 0 ms to minimize.
[2022-06-12 22:34:57] [INFO ] Deduced a trap composed of 6 places in 177 ms of which 1 ms to minimize.
[2022-06-12 22:34:57] [INFO ] Deduced a trap composed of 11 places in 170 ms of which 1 ms to minimize.
[2022-06-12 22:34:57] [INFO ] Deduced a trap composed of 6 places in 191 ms of which 1 ms to minimize.
[2022-06-12 22:34:57] [INFO ] Deduced a trap composed of 9 places in 187 ms of which 1 ms to minimize.
[2022-06-12 22:34:58] [INFO ] Deduced a trap composed of 6 places in 178 ms of which 0 ms to minimize.
[2022-06-12 22:34:58] [INFO ] Deduced a trap composed of 7 places in 189 ms of which 1 ms to minimize.
[2022-06-12 22:34:58] [INFO ] Deduced a trap composed of 6 places in 175 ms of which 1 ms to minimize.
[2022-06-12 22:34:58] [INFO ] Deduced a trap composed of 6 places in 184 ms of which 1 ms to minimize.
[2022-06-12 22:34:58] [INFO ] Deduced a trap composed of 9 places in 160 ms of which 1 ms to minimize.
[2022-06-12 22:34:59] [INFO ] Deduced a trap composed of 6 places in 155 ms of which 1 ms to minimize.
[2022-06-12 22:34:59] [INFO ] Deduced a trap composed of 4 places in 152 ms of which 1 ms to minimize.
[2022-06-12 22:34:59] [INFO ] Deduced a trap composed of 6 places in 151 ms of which 1 ms to minimize.
[2022-06-12 22:34:59] [INFO ] Deduced a trap composed of 6 places in 153 ms of which 1 ms to minimize.
[2022-06-12 22:35:00] [INFO ] Deduced a trap composed of 4 places in 170 ms of which 1 ms to minimize.
[2022-06-12 22:35:00] [INFO ] Deduced a trap composed of 6 places in 188 ms of which 11 ms to minimize.
[2022-06-12 22:35:00] [INFO ] Deduced a trap composed of 5 places in 132 ms of which 0 ms to minimize.
[2022-06-12 22:35:00] [INFO ] Deduced a trap composed of 7 places in 102 ms of which 1 ms to minimize.
[2022-06-12 22:35:00] [INFO ] Deduced a trap composed of 6 places in 113 ms of which 0 ms to minimize.
[2022-06-12 22:35:00] [INFO ] Deduced a trap composed of 6 places in 108 ms of which 1 ms to minimize.
[2022-06-12 22:35:01] [INFO ] Deduced a trap composed of 7 places in 108 ms of which 1 ms to minimize.
[2022-06-12 22:35:01] [INFO ] Deduced a trap composed of 13 places in 106 ms of which 0 ms to minimize.
[2022-06-12 22:35:01] [INFO ] Deduced a trap composed of 5 places in 104 ms of which 1 ms to minimize.
[2022-06-12 22:35:01] [INFO ] Deduced a trap composed of 10 places in 101 ms of which 0 ms to minimize.
[2022-06-12 22:35:01] [INFO ] Deduced a trap composed of 10 places in 95 ms of which 1 ms to minimize.
[2022-06-12 22:35:01] [INFO ] Deduced a trap composed of 7 places in 96 ms of which 1 ms to minimize.
[2022-06-12 22:35:01] [INFO ] Deduced a trap composed of 5 places in 87 ms of which 0 ms to minimize.
[2022-06-12 22:35:02] [INFO ] Deduced a trap composed of 6 places in 79 ms of which 0 ms to minimize.
[2022-06-12 22:35:02] [INFO ] Deduced a trap composed of 7 places in 86 ms of which 0 ms to minimize.
[2022-06-12 22:35:02] [INFO ] Deduced a trap composed of 8 places in 82 ms of which 0 ms to minimize.
[2022-06-12 22:35:02] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 0 ms to minimize.
[2022-06-12 22:35:02] [INFO ] Deduced a trap composed of 7 places in 76 ms of which 0 ms to minimize.
[2022-06-12 22:35:02] [INFO ] Deduced a trap composed of 7 places in 75 ms of which 1 ms to minimize.
[2022-06-12 22:35:02] [INFO ] Trap strengthening (SAT) tested/added 52/51 trap constraints in 10793 ms
[2022-06-12 22:35:02] [INFO ] Computed and/alt/rep : 1308/5143/1308 causal constraints (skipped 0 transitions) in 68 ms.
[2022-06-12 22:35:22] [INFO ] Added : 815 causal constraints over 163 iterations in 20086 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 46 ms.
Incomplete Parikh walk after 157300 steps, including 998 resets, run finished after 1537 ms. (steps per millisecond=102 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 10 out of 1563 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1563/1563 places, 1313/1313 transitions.
Applied a total of 0 rules in 48 ms. Remains 1563 /1563 variables (removed 0) and now considering 1313/1313 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1563/1563 places, 1313/1313 transitions.
Starting structural reductions, iteration 0 : 1563/1563 places, 1313/1313 transitions.
Applied a total of 0 rules in 48 ms. Remains 1563 /1563 variables (removed 0) and now considering 1313/1313 (removed 0) transitions.
// Phase 1: matrix 1313 rows 1563 cols
[2022-06-12 22:35:24] [INFO ] Computed 551 place invariants in 17 ms
[2022-06-12 22:35:25] [INFO ] Implicit Places using invariants in 818 ms returned []
// Phase 1: matrix 1313 rows 1563 cols
[2022-06-12 22:35:25] [INFO ] Computed 551 place invariants in 17 ms
[2022-06-12 22:35:27] [INFO ] Implicit Places using invariants and state equation in 1966 ms returned []
Implicit Place search using SMT with State Equation took 2786 ms to find 0 implicit places.
[2022-06-12 22:35:27] [INFO ] Redundant transitions in 93 ms returned []
// Phase 1: matrix 1313 rows 1563 cols
[2022-06-12 22:35:27] [INFO ] Computed 551 place invariants in 25 ms
[2022-06-12 22:35:28] [INFO ] Dead Transitions using invariants and state equation in 691 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1563/1563 places, 1313/1313 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 1276 ms. (steps per millisecond=78 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1313 rows 1563 cols
[2022-06-12 22:35:29] [INFO ] Computed 551 place invariants in 24 ms
[2022-06-12 22:35:29] [INFO ] [Real]Absence check using 522 positive place invariants in 91 ms returned sat
[2022-06-12 22:35:29] [INFO ] [Real]Absence check using 522 positive and 29 generalized place invariants in 5 ms returned sat
[2022-06-12 22:35:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:35:30] [INFO ] [Real]Absence check using state equation in 573 ms returned sat
[2022-06-12 22:35:30] [INFO ] Deduced a trap composed of 6 places in 101 ms of which 0 ms to minimize.
[2022-06-12 22:35:30] [INFO ] Deduced a trap composed of 6 places in 96 ms of which 1 ms to minimize.
[2022-06-12 22:35:30] [INFO ] Deduced a trap composed of 8 places in 91 ms of which 1 ms to minimize.
[2022-06-12 22:35:30] [INFO ] Deduced a trap composed of 6 places in 102 ms of which 0 ms to minimize.
[2022-06-12 22:35:31] [INFO ] Deduced a trap composed of 18 places in 89 ms of which 0 ms to minimize.
[2022-06-12 22:35:31] [INFO ] Deduced a trap composed of 13 places in 101 ms of which 0 ms to minimize.
[2022-06-12 22:35:31] [INFO ] Deduced a trap composed of 6 places in 99 ms of which 1 ms to minimize.
[2022-06-12 22:35:31] [INFO ] Deduced a trap composed of 6 places in 99 ms of which 0 ms to minimize.
[2022-06-12 22:35:31] [INFO ] Deduced a trap composed of 6 places in 95 ms of which 0 ms to minimize.
[2022-06-12 22:35:31] [INFO ] Deduced a trap composed of 7 places in 87 ms of which 0 ms to minimize.
[2022-06-12 22:35:32] [INFO ] Deduced a trap composed of 6 places in 87 ms of which 0 ms to minimize.
[2022-06-12 22:35:32] [INFO ] Deduced a trap composed of 11 places in 85 ms of which 0 ms to minimize.
[2022-06-12 22:35:32] [INFO ] Deduced a trap composed of 5 places in 79 ms of which 0 ms to minimize.
[2022-06-12 22:35:32] [INFO ] Deduced a trap composed of 8 places in 71 ms of which 0 ms to minimize.
[2022-06-12 22:35:32] [INFO ] Deduced a trap composed of 7 places in 69 ms of which 1 ms to minimize.
[2022-06-12 22:35:32] [INFO ] Deduced a trap composed of 8 places in 67 ms of which 1 ms to minimize.
[2022-06-12 22:35:32] [INFO ] Deduced a trap composed of 5 places in 69 ms of which 0 ms to minimize.
[2022-06-12 22:35:32] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 2407 ms
[2022-06-12 22:35:32] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:35:33] [INFO ] [Nat]Absence check using 522 positive place invariants in 91 ms returned sat
[2022-06-12 22:35:33] [INFO ] [Nat]Absence check using 522 positive and 29 generalized place invariants in 5 ms returned sat
[2022-06-12 22:35:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:35:33] [INFO ] [Nat]Absence check using state equation in 561 ms returned sat
[2022-06-12 22:35:33] [INFO ] Deduced a trap composed of 8 places in 198 ms of which 1 ms to minimize.
[2022-06-12 22:35:34] [INFO ] Deduced a trap composed of 9 places in 206 ms of which 0 ms to minimize.
[2022-06-12 22:35:34] [INFO ] Deduced a trap composed of 6 places in 198 ms of which 0 ms to minimize.
[2022-06-12 22:35:34] [INFO ] Deduced a trap composed of 8 places in 195 ms of which 1 ms to minimize.
[2022-06-12 22:35:34] [INFO ] Deduced a trap composed of 6 places in 192 ms of which 0 ms to minimize.
[2022-06-12 22:35:35] [INFO ] Deduced a trap composed of 5 places in 194 ms of which 1 ms to minimize.
[2022-06-12 22:35:35] [INFO ] Deduced a trap composed of 6 places in 183 ms of which 0 ms to minimize.
[2022-06-12 22:35:35] [INFO ] Deduced a trap composed of 11 places in 187 ms of which 1 ms to minimize.
[2022-06-12 22:35:35] [INFO ] Deduced a trap composed of 7 places in 189 ms of which 0 ms to minimize.
[2022-06-12 22:35:36] [INFO ] Deduced a trap composed of 6 places in 179 ms of which 1 ms to minimize.
[2022-06-12 22:35:36] [INFO ] Deduced a trap composed of 6 places in 181 ms of which 0 ms to minimize.
[2022-06-12 22:35:36] [INFO ] Deduced a trap composed of 8 places in 184 ms of which 0 ms to minimize.
[2022-06-12 22:35:36] [INFO ] Deduced a trap composed of 6 places in 181 ms of which 0 ms to minimize.
[2022-06-12 22:35:36] [INFO ] Deduced a trap composed of 6 places in 186 ms of which 1 ms to minimize.
[2022-06-12 22:35:37] [INFO ] Deduced a trap composed of 6 places in 188 ms of which 0 ms to minimize.
[2022-06-12 22:35:37] [INFO ] Deduced a trap composed of 9 places in 179 ms of which 1 ms to minimize.
[2022-06-12 22:35:37] [INFO ] Deduced a trap composed of 8 places in 179 ms of which 0 ms to minimize.
[2022-06-12 22:35:37] [INFO ] Deduced a trap composed of 6 places in 189 ms of which 0 ms to minimize.
[2022-06-12 22:35:38] [INFO ] Deduced a trap composed of 8 places in 184 ms of which 1 ms to minimize.
[2022-06-12 22:35:38] [INFO ] Deduced a trap composed of 6 places in 182 ms of which 1 ms to minimize.
[2022-06-12 22:35:38] [INFO ] Deduced a trap composed of 11 places in 180 ms of which 0 ms to minimize.
[2022-06-12 22:35:38] [INFO ] Deduced a trap composed of 6 places in 183 ms of which 0 ms to minimize.
[2022-06-12 22:35:39] [INFO ] Deduced a trap composed of 9 places in 180 ms of which 1 ms to minimize.
[2022-06-12 22:35:39] [INFO ] Deduced a trap composed of 6 places in 181 ms of which 1 ms to minimize.
[2022-06-12 22:35:39] [INFO ] Deduced a trap composed of 7 places in 179 ms of which 0 ms to minimize.
[2022-06-12 22:35:39] [INFO ] Deduced a trap composed of 6 places in 173 ms of which 1 ms to minimize.
[2022-06-12 22:35:39] [INFO ] Deduced a trap composed of 6 places in 167 ms of which 0 ms to minimize.
[2022-06-12 22:35:40] [INFO ] Deduced a trap composed of 9 places in 149 ms of which 1 ms to minimize.
[2022-06-12 22:35:40] [INFO ] Deduced a trap composed of 6 places in 144 ms of which 1 ms to minimize.
[2022-06-12 22:35:40] [INFO ] Deduced a trap composed of 4 places in 143 ms of which 1 ms to minimize.
[2022-06-12 22:35:40] [INFO ] Deduced a trap composed of 6 places in 147 ms of which 0 ms to minimize.
[2022-06-12 22:35:40] [INFO ] Deduced a trap composed of 6 places in 163 ms of which 1 ms to minimize.
[2022-06-12 22:35:41] [INFO ] Deduced a trap composed of 4 places in 170 ms of which 1 ms to minimize.
[2022-06-12 22:35:41] [INFO ] Deduced a trap composed of 6 places in 152 ms of which 1 ms to minimize.
[2022-06-12 22:35:41] [INFO ] Deduced a trap composed of 5 places in 130 ms of which 0 ms to minimize.
[2022-06-12 22:35:41] [INFO ] Deduced a trap composed of 7 places in 94 ms of which 1 ms to minimize.
[2022-06-12 22:35:41] [INFO ] Deduced a trap composed of 6 places in 102 ms of which 0 ms to minimize.
[2022-06-12 22:35:42] [INFO ] Deduced a trap composed of 6 places in 101 ms of which 0 ms to minimize.
[2022-06-12 22:35:42] [INFO ] Deduced a trap composed of 7 places in 102 ms of which 1 ms to minimize.
[2022-06-12 22:35:42] [INFO ] Deduced a trap composed of 13 places in 97 ms of which 0 ms to minimize.
[2022-06-12 22:35:42] [INFO ] Deduced a trap composed of 5 places in 96 ms of which 0 ms to minimize.
[2022-06-12 22:35:42] [INFO ] Deduced a trap composed of 10 places in 99 ms of which 0 ms to minimize.
[2022-06-12 22:35:42] [INFO ] Deduced a trap composed of 10 places in 89 ms of which 1 ms to minimize.
[2022-06-12 22:35:42] [INFO ] Deduced a trap composed of 7 places in 91 ms of which 1 ms to minimize.
[2022-06-12 22:35:43] [INFO ] Deduced a trap composed of 5 places in 77 ms of which 1 ms to minimize.
[2022-06-12 22:35:43] [INFO ] Deduced a trap composed of 6 places in 77 ms of which 0 ms to minimize.
[2022-06-12 22:35:43] [INFO ] Deduced a trap composed of 7 places in 80 ms of which 0 ms to minimize.
[2022-06-12 22:35:43] [INFO ] Deduced a trap composed of 8 places in 80 ms of which 0 ms to minimize.
[2022-06-12 22:35:43] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 0 ms to minimize.
[2022-06-12 22:35:43] [INFO ] Deduced a trap composed of 7 places in 72 ms of which 1 ms to minimize.
[2022-06-12 22:35:43] [INFO ] Deduced a trap composed of 7 places in 72 ms of which 1 ms to minimize.
[2022-06-12 22:35:43] [INFO ] Trap strengthening (SAT) tested/added 52/51 trap constraints in 10170 ms
[2022-06-12 22:35:43] [INFO ] Computed and/alt/rep : 1308/5143/1308 causal constraints (skipped 0 transitions) in 66 ms.
[2022-06-12 22:35:52] [INFO ] Added : 455 causal constraints over 91 iterations in 9052 ms. Result :unknown
[2022-06-12 22:35:52] [INFO ] Flatten gal took : 67 ms
[2022-06-12 22:35:53] [INFO ] Flatten gal took : 70 ms
[2022-06-12 22:35:53] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6119240324007800920.gal : 9 ms
[2022-06-12 22:35:53] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13070106743913129419.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/ReachabilityCardinality6119240324007800920.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality13070106743913129419.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/ReachabilityCardinality6119240324007800920.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality13070106743913129419.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality13070106743913129419.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 4
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :4 after 7
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :7 after 13
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :13 after 75
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :75 after 3300
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :3300 after 4721
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :4721 after 8544
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :8544 after 367989
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :367989 after 1.86027e+06
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1.86027e+06 after 1.06309e+08
Detected timeout of ITS tools.
[2022-06-12 22:36:08] [INFO ] Flatten gal took : 65 ms
[2022-06-12 22:36:08] [INFO ] Applying decomposition
[2022-06-12 22:36:08] [INFO ] Flatten gal took : 66 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/graph2200805057176466451.txt, -o, /tmp/graph2200805057176466451.bin, -w, /tmp/graph2200805057176466451.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/graph2200805057176466451.bin, -l, -1, -v, -w, /tmp/graph2200805057176466451.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-12 22:36:08] [INFO ] Decomposing Gal with order
[2022-06-12 22:36:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-12 22:36:08] [INFO ] Removed a total of 668 redundant transitions.
[2022-06-12 22:36:08] [INFO ] Flatten gal took : 114 ms
[2022-06-12 22:36:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 1106 labels/synchronizations in 66 ms.
[2022-06-12 22:36:08] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2976199368619180320.gal : 21 ms
[2022-06-12 22:36:08] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6912411206876004101.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/ReachabilityCardinality2976199368619180320.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality6912411206876004101.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/ReachabilityCardinality2976199368619180320.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality6912411206876004101.prop --nowitness
Loading property file /tmp/ReachabilityCardinality6912411206876004101.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 9
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :9 after 9
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :9 after 15
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :15 after 15
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :15 after 42
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :42 after 2.17062e+11
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10318073201230002555
[2022-06-12 22:36:23] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10318073201230002555
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/ltsmin10318073201230002555]
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/ltsmin10318073201230002555] 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/ltsmin10318073201230002555] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Applied a total of 0 rules in 70 ms. Remains 1563 /1563 variables (removed 0) and now considering 1313/1313 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1313 rows 1563 cols
[2022-06-12 22:36:24] [INFO ] Computed 551 place invariants in 17 ms
[2022-06-12 22:36:25] [INFO ] [Real]Absence check using 522 positive place invariants in 86 ms returned sat
[2022-06-12 22:36:25] [INFO ] [Real]Absence check using 522 positive and 29 generalized place invariants in 4 ms returned sat
[2022-06-12 22:36:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:36:25] [INFO ] [Real]Absence check using state equation in 577 ms returned sat
[2022-06-12 22:36:25] [INFO ] Deduced a trap composed of 6 places in 108 ms of which 1 ms to minimize.
[2022-06-12 22:36:26] [INFO ] Deduced a trap composed of 6 places in 159 ms of which 0 ms to minimize.
[2022-06-12 22:36:26] [INFO ] Deduced a trap composed of 8 places in 103 ms of which 0 ms to minimize.
[2022-06-12 22:36:26] [INFO ] Deduced a trap composed of 6 places in 113 ms of which 0 ms to minimize.
[2022-06-12 22:36:26] [INFO ] Deduced a trap composed of 18 places in 93 ms of which 1 ms to minimize.
[2022-06-12 22:36:26] [INFO ] Deduced a trap composed of 13 places in 98 ms of which 0 ms to minimize.
[2022-06-12 22:36:26] [INFO ] Deduced a trap composed of 6 places in 92 ms of which 0 ms to minimize.
[2022-06-12 22:36:26] [INFO ] Deduced a trap composed of 6 places in 82 ms of which 0 ms to minimize.
[2022-06-12 22:36:27] [INFO ] Deduced a trap composed of 6 places in 105 ms of which 1 ms to minimize.
[2022-06-12 22:36:27] [INFO ] Deduced a trap composed of 7 places in 97 ms of which 0 ms to minimize.
[2022-06-12 22:36:27] [INFO ] Deduced a trap composed of 6 places in 89 ms of which 0 ms to minimize.
[2022-06-12 22:36:27] [INFO ] Deduced a trap composed of 11 places in 98 ms of which 0 ms to minimize.
[2022-06-12 22:36:27] [INFO ] Deduced a trap composed of 5 places in 90 ms of which 0 ms to minimize.
[2022-06-12 22:36:27] [INFO ] Deduced a trap composed of 8 places in 101 ms of which 1 ms to minimize.
[2022-06-12 22:36:28] [INFO ] Deduced a trap composed of 7 places in 86 ms of which 0 ms to minimize.
[2022-06-12 22:36:28] [INFO ] Deduced a trap composed of 8 places in 69 ms of which 0 ms to minimize.
[2022-06-12 22:36:28] [INFO ] Deduced a trap composed of 5 places in 94 ms of which 0 ms to minimize.
[2022-06-12 22:36:28] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 2636 ms
[2022-06-12 22:36:28] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:36:28] [INFO ] [Nat]Absence check using 522 positive place invariants in 103 ms returned sat
[2022-06-12 22:36:28] [INFO ] [Nat]Absence check using 522 positive and 29 generalized place invariants in 5 ms returned sat
[2022-06-12 22:36:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:36:29] [INFO ] [Nat]Absence check using state equation in 569 ms returned sat
[2022-06-12 22:36:29] [INFO ] Deduced a trap composed of 8 places in 198 ms of which 0 ms to minimize.
[2022-06-12 22:36:29] [INFO ] Deduced a trap composed of 9 places in 204 ms of which 1 ms to minimize.
[2022-06-12 22:36:29] [INFO ] Deduced a trap composed of 6 places in 202 ms of which 1 ms to minimize.
[2022-06-12 22:36:30] [INFO ] Deduced a trap composed of 8 places in 198 ms of which 1 ms to minimize.
[2022-06-12 22:36:30] [INFO ] Deduced a trap composed of 6 places in 194 ms of which 1 ms to minimize.
[2022-06-12 22:36:30] [INFO ] Deduced a trap composed of 5 places in 207 ms of which 1 ms to minimize.
[2022-06-12 22:36:30] [INFO ] Deduced a trap composed of 6 places in 201 ms of which 0 ms to minimize.
[2022-06-12 22:36:31] [INFO ] Deduced a trap composed of 11 places in 195 ms of which 1 ms to minimize.
[2022-06-12 22:36:31] [INFO ] Deduced a trap composed of 7 places in 196 ms of which 0 ms to minimize.
[2022-06-12 22:36:31] [INFO ] Deduced a trap composed of 6 places in 196 ms of which 0 ms to minimize.
[2022-06-12 22:36:31] [INFO ] Deduced a trap composed of 6 places in 195 ms of which 1 ms to minimize.
[2022-06-12 22:36:32] [INFO ] Deduced a trap composed of 8 places in 207 ms of which 1 ms to minimize.
[2022-06-12 22:36:32] [INFO ] Deduced a trap composed of 6 places in 199 ms of which 1 ms to minimize.
[2022-06-12 22:36:32] [INFO ] Deduced a trap composed of 6 places in 195 ms of which 1 ms to minimize.
[2022-06-12 22:36:32] [INFO ] Deduced a trap composed of 6 places in 200 ms of which 1 ms to minimize.
[2022-06-12 22:36:33] [INFO ] Deduced a trap composed of 9 places in 195 ms of which 0 ms to minimize.
[2022-06-12 22:36:33] [INFO ] Deduced a trap composed of 8 places in 186 ms of which 1 ms to minimize.
[2022-06-12 22:36:33] [INFO ] Deduced a trap composed of 6 places in 188 ms of which 0 ms to minimize.
[2022-06-12 22:36:33] [INFO ] Deduced a trap composed of 8 places in 193 ms of which 0 ms to minimize.
[2022-06-12 22:36:34] [INFO ] Deduced a trap composed of 6 places in 183 ms of which 0 ms to minimize.
[2022-06-12 22:36:34] [INFO ] Deduced a trap composed of 11 places in 188 ms of which 1 ms to minimize.
[2022-06-12 22:36:34] [INFO ] Deduced a trap composed of 6 places in 181 ms of which 1 ms to minimize.
[2022-06-12 22:36:34] [INFO ] Deduced a trap composed of 9 places in 184 ms of which 1 ms to minimize.
[2022-06-12 22:36:35] [INFO ] Deduced a trap composed of 6 places in 182 ms of which 1 ms to minimize.
[2022-06-12 22:36:35] [INFO ] Deduced a trap composed of 7 places in 177 ms of which 1 ms to minimize.
[2022-06-12 22:36:35] [INFO ] Deduced a trap composed of 6 places in 178 ms of which 0 ms to minimize.
[2022-06-12 22:36:35] [INFO ] Deduced a trap composed of 6 places in 173 ms of which 1 ms to minimize.
[2022-06-12 22:36:35] [INFO ] Deduced a trap composed of 9 places in 157 ms of which 1 ms to minimize.
[2022-06-12 22:36:36] [INFO ] Deduced a trap composed of 6 places in 147 ms of which 1 ms to minimize.
[2022-06-12 22:36:36] [INFO ] Deduced a trap composed of 4 places in 147 ms of which 1 ms to minimize.
[2022-06-12 22:36:36] [INFO ] Deduced a trap composed of 6 places in 141 ms of which 1 ms to minimize.
[2022-06-12 22:36:36] [INFO ] Deduced a trap composed of 6 places in 162 ms of which 1 ms to minimize.
[2022-06-12 22:36:36] [INFO ] Deduced a trap composed of 4 places in 166 ms of which 1 ms to minimize.
[2022-06-12 22:36:37] [INFO ] Deduced a trap composed of 6 places in 163 ms of which 1 ms to minimize.
[2022-06-12 22:36:37] [INFO ] Deduced a trap composed of 5 places in 135 ms of which 0 ms to minimize.
[2022-06-12 22:36:37] [INFO ] Deduced a trap composed of 7 places in 106 ms of which 3 ms to minimize.
[2022-06-12 22:36:37] [INFO ] Deduced a trap composed of 6 places in 101 ms of which 1 ms to minimize.
[2022-06-12 22:36:37] [INFO ] Deduced a trap composed of 6 places in 132 ms of which 0 ms to minimize.
[2022-06-12 22:36:38] [INFO ] Deduced a trap composed of 7 places in 104 ms of which 1 ms to minimize.
[2022-06-12 22:36:38] [INFO ] Deduced a trap composed of 13 places in 103 ms of which 0 ms to minimize.
[2022-06-12 22:36:38] [INFO ] Deduced a trap composed of 5 places in 102 ms of which 1 ms to minimize.
[2022-06-12 22:36:38] [INFO ] Deduced a trap composed of 10 places in 101 ms of which 0 ms to minimize.
[2022-06-12 22:36:38] [INFO ] Deduced a trap composed of 10 places in 91 ms of which 0 ms to minimize.
[2022-06-12 22:36:38] [INFO ] Deduced a trap composed of 7 places in 91 ms of which 2 ms to minimize.
[2022-06-12 22:36:38] [INFO ] Deduced a trap composed of 5 places in 97 ms of which 1 ms to minimize.
[2022-06-12 22:36:39] [INFO ] Deduced a trap composed of 6 places in 84 ms of which 4 ms to minimize.
[2022-06-12 22:36:39] [INFO ] Deduced a trap composed of 7 places in 83 ms of which 1 ms to minimize.
[2022-06-12 22:36:39] [INFO ] Deduced a trap composed of 8 places in 83 ms of which 0 ms to minimize.
[2022-06-12 22:36:39] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 0 ms to minimize.
[2022-06-12 22:36:39] [INFO ] Deduced a trap composed of 7 places in 70 ms of which 1 ms to minimize.
[2022-06-12 22:36:39] [INFO ] Deduced a trap composed of 7 places in 71 ms of which 0 ms to minimize.
[2022-06-12 22:36:39] [INFO ] Trap strengthening (SAT) tested/added 52/51 trap constraints in 10544 ms
[2022-06-12 22:36:39] [INFO ] Computed and/alt/rep : 1308/5143/1308 causal constraints (skipped 0 transitions) in 63 ms.
[2022-06-12 22:36:59] [INFO ] Added : 810 causal constraints over 162 iterations in 20091 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 48 ms.
[2022-06-12 22:37:00] [INFO ] Flatten gal took : 54 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin9443079927892168831
[2022-06-12 22:37:00] [INFO ] Computing symmetric may disable matrix : 1313 transitions.
[2022-06-12 22:37:00] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-12 22:37:00] [INFO ] Computing symmetric may enable matrix : 1313 transitions.
[2022-06-12 22:37:00] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-12 22:37:00] [INFO ] Applying decomposition
[2022-06-12 22:37:00] [INFO ] Flatten gal took : 69 ms
[2022-06-12 22:37:00] [INFO ] Flatten gal took : 92 ms
[2022-06-12 22:37:00] [INFO ] Input system was already deterministic with 1313 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/graph16407984939138006049.txt, -o, /tmp/graph16407984939138006049.bin, -w, /tmp/graph16407984939138006049.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/graph16407984939138006049.bin, -l, -1, -v, -w, /tmp/graph16407984939138006049.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-12 22:37:00] [INFO ] Decomposing Gal with order
[2022-06-12 22:37:00] [INFO ] Computing Do-Not-Accords matrix : 1313 transitions.
[2022-06-12 22:37:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-12 22:37:00] [INFO ] Computation of Completed DNA matrix. took 68 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-12 22:37:00] [INFO ] Built C files in 448ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9443079927892168831
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/ltsmin9443079927892168831]
[2022-06-12 22:37:00] [INFO ] Removed a total of 711 redundant transitions.
[2022-06-12 22:37:00] [INFO ] Flatten gal took : 216 ms
[2022-06-12 22:37:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 1276 labels/synchronizations in 166 ms.
[2022-06-12 22:37:01] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability11179093345766730076.gal : 19 ms
[2022-06-12 22:37:01] [INFO ] Ran tautology test, simplified 0 / 1 in 1002 ms.
[2022-06-12 22:37:01] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability9457715913959807839.prop : 18 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/ReachabilityFireability11179093345766730076.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityFireability9457715913959807839.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/ReachabilityFireability11179093345766730076.gal -t CGAL -reachable-file /tmp/ReachabilityFireability9457715913959807839.prop --nowitness
[2022-06-12 22:37:01] [INFO ] BMC solution for property ShieldPPPs-PT-050B-ReachabilityFireability-14(UNSAT) depth K=0 took 59 ms
[2022-06-12 22:37:01] [INFO ] BMC solution for property ShieldPPPs-PT-050B-ReachabilityFireability-14(UNSAT) depth K=1 took 32 ms
Loading property file /tmp/ReachabilityFireability9457715913959807839.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1 after 6
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :6 after 6
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :6 after 6
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :6 after 12
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 1313 rows 1563 cols
[2022-06-12 22:37:02] [INFO ] Computed 551 place invariants in 29 ms
inv : p21 + p1827 + p1829 + p1831 + p1833 = 1
inv : p21 + p109 + p112 + p114 + p116 = 1
inv : p21 + p1887 + p1892 + p1893 = 1
inv : p2363 + p2365 + p2367 + p2369 = 1
inv : p21 + p205 + p208 + p209 = 1
inv : p2980 + p2982 + p2984 + p2986 = 1
inv : p21 + p162 + p164 = 1
inv : p21 + p1806 + p1811 + p1812 = 1
inv : p21 + p1820 + p1825 + p1826 = 1
inv : p21 + p1411 + p1416 + p1417 = 1
inv : p21 + p547 + p552 + p553 = 1
inv : p21 + p1669 + p1671 = 1
inv : p21 + p195 + p197 = 1
inv : p21 + p1774 + p1776 + p1778 + p1780 = 1
inv : p21 + p1150 + p1153 + p1154 = 1
inv : p21 + p466 + p471 + p472 = 1
inv : p21 + p1626 + p1628 + p1630 + p1632 = 1
inv : p21 + p71 + p74 + p75 = 1
inv : p21 + p681 + p686 + p687 = 1
inv : p21 + p1425 + p1427 + p1429 + p1431 = 1
inv : p21 + p399 + p404 + p405 = 1
inv : p21 + p1873 + p1878 + p1879 = 1
inv : p2373 + p2375 = 1
inv : p21 + p748 + p753 + p754 = 1
inv : p3227 + p3232 + p3233 = 1
inv : p21 + p1069 + p1072 + p1073 = 1
inv : p2655 + p2658 + p2660 + p2662 = 1
inv : p21 + p480 + p485 + p486 = 1
inv : p21 + p667 + p672 + p673 = 1
inv : p21 + p272 + p275 + p276 = 1
inv : p2038 + p2040 = 1
inv : p2243 + p2245 + p2247 + p2249 = 1
inv : p2042 + p2044 + p2046 + p2048 = 1
inv : p21 + p1305 + p1307 + p1309 + p1311 = 1
inv : p21 + p1636 + p1638 = 1
inv : p3366 + p3367 = 1
inv : p21 + p219 + p221 + p223 + p225 = 1
inv : p3181 + p3183 + p3185 + p3187 = 1
inv : p21 + p554 + p556 + p558 + p560 = 1
inv : p21 + p1217 + p1220 + p1221 = 1
inv : p3392 + p3395 + p3397 + p3399 = 1
inv : p3368 + p3372 + p3374 = 1
inv : p21 + p1344 + p1349 + p1350 = 1
inv : p3076 + p3078 = 1
inv : p21 + p1100 + p1102 = 1
inv : p2074 + p2077 + p2078 = 1
inv : p21 + p1143 + p1148 + p1149 = 1
inv : p2990 + p2993 + p2995 + p2997 = 1
inv : p21 + p664 + p666 = 1
inv : p3213 + p3218 + p3219 = 1
inv : p21 + p265 + p270 + p271 = 1
inv : -p2077 - p2078 + p2079 + p2080 = 0
inv : p21 + p1203 + p1206 + p1207 = 1
inv : p21 + p1315 + p1318 + p1320 + p1322 = 1
inv : p21 + p734 + p739 + p740 = 1
inv : p21 + p794 + p808 + p811 + p812 = 1
inv : p21 + p1136 + p1139 + p1140 = 1
inv : p2021 + p2024 + p2025 = 1
inv : -p2278 - p2279 + p2280 + p2281 = 0
inv : p3191 + p3194 + p3196 + p3198 = 1
inv : p21 + p332 + p337 + p338 = 1
inv : p21 + p198 + p203 + p204 = 1
inv : p2088 + p2091 + p2092 = 1
inv : p2148 + p2153 + p2154 = 1
inv : p2578 + p2580 + p2582 + p2584 = 1
inv : p3280 + p3285 + p3286 = 1
inv : p2842 + p2844 = 1
inv : p21 + p1270 + p1273 + p1274 = 1
inv : p3043 + p3045 = 1
inv : p21 + p1334 + p1336 = 1
inv : p21 + p607 + p610 + p611 = 1
inv : p21 + p1210 + p1215 + p1216 = 1
inv : p21 + p138 + p141 + p142 = 1
inv : p21 + p1133 + p1135 = 1
inv : p21 + p1746 + p1749 + p1750 = 1
inv : p21 + p1083 + p1086 + p1087 = 1
inv : -p2218 - p2219 + p2220 + p2221 = 0
inv : p21 + p614 + p619 + p620 = 1
inv : p21 + p949 + p952 + p953 = 1
inv : p21 + p674 + p677 + p678 = 1
inv : p21 + p769 + p771 + p773 + p775 = 1
inv : p21 + p1679 + p1682 + p1683 = 1
inv : p21 + p1538 + p1540 + p1541 + p1542 = 1
inv : p21 + p363 + p365 = 1
inv : p3258 + p3261 + p3263 + p3265 = 1
inv : p21 + p970 + p972 + p974 + p976 = 1
inv : p2885 + p2888 + p2889 = 1
inv : p2645 + p2647 + p2649 + p2651 = 1
inv : p21 + p212 + p217 + p218 = 1
inv : p21 + p1485 + p1488 + p1489 = 1
inv : p3019 + p3022 + p3023 = 1
inv : p3057 + p3060 + p3062 + p3064 = 1
inv : p2588 + p2591 + p2593 + p2595 = 1
inv : p21 + p1404 + p1407 + p1408 = 1
inv : p21 + p868 + p871 + p872 = 1
inv : p21 + p1303 + p1304 = 1
inv : p21 + p1929 + p1971 + p1973 = 1
inv : p2875 + p2877 = 1
inv : -p2888 - p2889 + p2890 + p2891 = 0
inv : -p811 - p812 + p813 + p814 = 0
inv : p21 + p932 + p934 = 1
inv : p21 + p444 + p447 + p449 + p451 = 1
inv : p2416 + p2421 + p2422 = 1
inv : p3220 + p3223 + p3224 = 1
inv : p2698 + p2700 + p2702 + p2704 = 1
inv : p21 + p1583 + p1586 + p1588 + p1590 = 1
inv : p3210 + p3212 = 1
inv : p21 + p1382 + p1385 + p1387 + p1389 = 1
inv : p21 + p1009 + p1014 + p1015 = 1
inv : p3354 + p3357 + p3358 = 1
inv : p21 + p473 + p476 + p477 = 1
inv : -p74 - p75 + p76 + p77 = 0
inv : p21 + p346 + p351 + p352 = 1
inv : p21 + p1076 + p1081 + p1082 = 1
inv : p3079 + p3084 + p3085 = 1
inv : p21 + p1002 + p1005 + p1006 = 1
inv : p21 + p511 + p514 + p516 + p518 = 1
inv : p21 + p1739 + p1744 + p1745 = 1
inv : p2620 + p2621 - p2622 - p2623 = 0
inv : p3026 + p3031 + p3032 = 1
inv : p21 + p99 + p101 + p103 + p105 = 1
inv : p2222 + p2225 + p2226 = 1
inv : p2176 + p2178 + p2180 + p2182 = 1
inv : p2406 + p2408 = 1
inv : p3382 + p3384 + p3386 + p3388 = 1
inv : p21 + p1090 + p1092 + p1094 + p1096 = 1
inv : p2071 + p2073 = 1
inv : p2275 + p2278 + p2279 = 1
inv : p2765 + p2767 + p2769 + p2771 = 1
inv : p21 + p1351 + p1354 + p1355 = 1
inv : p21 + p430 + p432 = 1
inv : p3167 + p3169 + p3171 + p3173 + p3175 + p3176 = 1
inv : p21 + p1368 + p1370 = 1
inv : p2808 + p2810 = 1
inv : p21 + p1880 + p1883 + p1884 = 1
inv : p21 + p533 + p538 + p539 = 1
inv : p21 + p152 + p154 + p156 + p158 = 1
inv : -p945 - p946 + p947 + p948 = 0
inv : p21 + p1929 + p1954 + p1957 + p1958 = 1
inv : p21 + p1904 + p1906 = 1
inv : p2923 + p2926 + p2928 + p2930 = 1
inv : p2409 + p2412 + p2413 = 1
inv : p21 + p1545 + p1548 + p1549 = 1
inv : p2342 + p2345 + p2346 = 1
inv : p2511 + p2513 + p2515 + p2517 = 1
inv : p2557 + p2560 + p2561 = 1
inv : p2187 + p2189 + p2191 + p2193 = 1
inv : p21 + p1066 + p1068 = 1
inv : p21 + p1686 + p1691 + p1692 = 1
inv : -p603 - p604 + p605 + p606 = 0
inv : p21 + p875 + p880 + p881 = 1
inv : p2811 + p2816 + p2817 = 1
inv : p2416 + p2419 + p2420 = 1
inv : p21 + p1605 + p1610 + p1611 = 1
inv : p2550 + p2553 + p2554 = 1
inv : -p2084 - p2085 + p2086 + p2087 = 0
inv : p21 + p262 + p264 = 1
inv : p21 + p1746 + p1751 + p1752 = 1
inv : p2674 + p2676 = 1
inv : p21 + p1047 + p1050 + p1052 + p1054 = 1
inv : p21 + p1929 + p1940 + p1943 + p1944 = 1
inv : p2952 + p2957 + p2958 = 1
inv : p2825 + p2830 + p2831 = 1
inv : p21 + p367 + p369 + p371 + p373 = 1
inv : p21 + p1157 + p1159 + p1161 + p1163 = 1
inv : p21 + p1619 + p1624 + p1625 = 1
inv : p21 + p1736 + p1738 = 1
inv : p21 + p779 + p782 + p784 + p786 = 1
inv : p2289 + p2292 + p2293 = 1
inv : p21 + p1401 + p1403 = 1
inv : p3093 + p3098 + p3099 = 1
inv : p21 + p688 + p690 + p692 + p694 = 1
inv : p2215 + p2218 + p2219 = 1
inv : p2476 + p2481 + p2482 = 1
inv : p2148 + p2151 + p2152 = 1
inv : p21 + p463 + p465 = 1
inv : p2296 + p2298 + p2300 + p2302 = 1
inv : p2440 + p2442 = 1
inv : p21 + p1016 + p1021 + p1022 = 1
inv : p21 + p1693 + p1695 + p1697 + p1699 = 1
inv : p21 + p95 + p97 = 1
inv : p2473 + p2475 = 1
inv : p21 + p50 + p52 = 1
inv : p2641 + p2643 = 1
inv : p21 + p1803 + p1805 = 1
inv : p3160 + p3165 + p3166 = 1
inv : p2610 + p2613 + p2614 = 1
inv : p2617 + p2622 + p2623 = 1
inv : p2356 + p2359 + p2360 = 1
inv : p21 + p1238 + p1240 + p1242 + p1244 = 1
inv : p21 + p286 + p288 + p290 + p292 = 1
inv : p2751 + p2754 + p2755 = 1
inv : p2758 + p2763 + p2764 = 1
inv : p2007 + p2012 + p2013 = 1
inv : p3019 + p3024 + p3025 = 1
inv : p2892 + p2895 + p2896 = 1
inv : p2878 + p2883 + p2884 = 1
inv : p21 + p1478 + p1481 + p1482 = 1
inv : p21 + p1552 + p1557 + p1558 = 1
inv : p2349 + p2354 + p2355 = 1
inv : p2507 + p2509 = 1
inv : p2540 + p2542 = 1
inv : p2320 + p2323 + p2325 + p2327 = 1
inv : p21 + p1291 + p1293 + p1295 + p1297 = 1
inv : p21 + p913 + p916 + p918 + p920 = 1
inv : p21 + p1267 + p1269 = 1
inv : p21 + p1234 + p1236 = 1
inv : p21 + p138 + p143 + p144 = 1
inv : p2959 + p2962 + p2963 = 1
inv : p2208 + p2213 + p2214 = 1
inv : p21 + p396 + p398 = 1
inv : p3114 + p3116 + p3118 + p3120 = 1
inv : p21 + p501 + p503 + p505 + p507 = 1
inv : p21 + p1784 + p1787 + p1789 + p1791 + p1792 = 1
inv : p21 + p540 + p543 + p544 = 1
inv : p21 + p296 + p298 = 1
inv : -p1950 - p1951 + p1952 + p1953 = 0
inv : p21 + p1612 + p1615 + p1616 = 1
inv : p2945 + p2948 + p2949 = 1
inv : p21 + p279 + p284 + p285 = 1
inv : p2017 + p2018 - p2019 - p2020 = 0
inv : p21 + p1929 + p1975 + p1977 + p1979 + p1981 = 1
inv : p2574 + p2576 = 1
inv : -p1280 - p1281 + p1282 + p1283 = 0
inv : p2021 + p2026 + p2027 = 1
inv : p21 + p1337 + p1340 + p1341 = 1
inv : p2789 + p2792 + p2794 + p2796 = 1
inv : p21 + p681 + p684 + p685 = 1
inv : p21 + p1559 + p1561 + p1563 + p1565 = 1
inv : p21 + p935 + p938 + p939 = 1
inv : p21 + p1640 + p1642 + p1644 + p1646 = 1
inv : p2377 + p2379 + p2381 + p2383 = 1
inv : p3086 + p3089 + p3090 = 1
inv : p2677 + p2680 + p2681 = 1
inv : p21 + p1284 + p1287 + p1288 = 1
inv : p21 + p1200 + p1202 = 1
inv : p21 + p176 + p179 + p181 + p183 = 1
inv : p2052 + p2055 + p2057 + p2059 = 1
inv : p3248 + p3250 + p3252 + p3254 = 1
inv : p3033 + p3035 + p3037 + p3039 = 1
inv : p21 + p1602 + p1604 = 1
inv : p2543 + p2548 + p2549 = 1
inv : p3294 + p3299 + p3300 = 1
inv : p21 + p1167 + p1169 = 1
inv : p3378 + p3380 = 1
inv : p21 + p1753 + p1755 + p1756 + p1757 = 1
inv : p21 + p420 + p422 + p424 + p426 = 1
inv : p21 + p1181 + p1184 + p1186 + p1188 = 1
inv : p2430 + p2432 + p2434 + p2436 = 1
inv : p21 + p734 + p737 + p738 = 1
inv : -p409 - p410 + p411 + p412 = 0
inv : p2624 + p2627 + p2628 = 1
inv : p21 + p1672 + p1677 + p1678 = 1
inv : p21 + p329 + p331 = 1
inv : p21 + p78 + p81 + p82 = 1
inv : p3287 + p3290 + p3291 = 1
inv : p3146 + p3151 + p3152 = 1
inv : p21 + p882 + p885 + p886 = 1
inv : p21 + p1372 + p1374 + p1376 + p1378 = 1
inv : p3364 + p3365 = 1
inv : p3301 + p3303 + p3305 + p3307 = 1
inv : -p2687 - p2688 + p2689 + p2690 = 0
inv : p2490 + p2495 + p2496 = 1
inv : p21 + p1143 + p1146 + p1147 = 1
inv : p21 + p1150 + p1155 + p1156 = 1
inv : p2483 + p2486 + p2487 = 1
inv : p2607 + p2609 = 1
inv : p21 + p229 + p231 = 1
inv : p21 + p1837 + p1839 = 1
inv : p21 + p1813 + p1818 + p1819 = 1
inv : p21 + p131 + p134 + p135 = 1
inv : p21 + p1918 + p1921 + p1923 + p1925 = 1
inv : p21 + p1418 + p1423 + p1424 = 1
inv : p21 + p540 + p545 + p546 = 1
inv : p2454 + p2457 + p2459 + p2461 = 1
inv : p2708 + p2710 = 1
inv : p21 + p279 + p282 + p283 = 1
inv : p21 + p212 + p215 + p216 = 1
inv : p21 + p1717 + p1720 + p1722 + p1724 = 1
inv : p21 + p1468 + p1470 = 1
inv : p21 + p755 + p757 + p759 + p761 = 1
inv : p21 + p1485 + p1490 + p1491 = 1
inv : p21 + p1516 + p1519 + p1521 + p1523 = 1
inv : p21 + p956 + p958 + p960 + p962 = 1
inv : p21 + p1337 + p1342 + p1343 = 1
inv : p21 + p1270 + p1275 + p1276 = 1
inv : p21 + p1880 + p1885 + p1886 = 1
inv : p21 + p635 + p637 + p639 + p641 = 1
inv : p21 + p1076 + p1079 + p1080 = 1
inv : p21 + p1104 + p1106 + p1108 + p1110 = 1
inv : p21 + p836 + p838 + p840 + p842 = 1
inv : p21 + p1351 + p1356 + p1357 = 1
inv : p2741 + p2743 = 1
inv : p21 + p1435 + p1437 = 1
inv : p21 + p1203 + p1208 + p1209 = 1
inv : p21 + p497 + p499 = 1
inv : p21 + p1870 + p1872 = 1
inv : p21 + p1471 + p1476 + p1477 = 1
inv : p2564 + p2566 + p2568 + p2570 = 1
inv : p21 + p1404 + p1409 + p1410 = 1
inv : p21 + p145 + p148 + p149 = 1
inv : p21 + p64 + p67 + p68 = 1
inv : p21 + p1929 + p1937 + p1939 = 1
inv : p21 + p413 + p416 + p417 = 1
inv : p21 + p832 + p834 = 1
inv : p21 + p1929 + p1961 + p1963 + p1965 + p1967 = 1
inv : p3146 + p3149 + p3150 = 1
inv : p21 + p310 + p313 + p315 + p317 = 1
inv : p21 + p794 + p801 + p804 + p805 = 1
inv : p21 + p332 + p335 + p336 = 1
inv : p2155 + p2160 + p2161 = 1
inv : p21 + p1506 + p1508 + p1510 + p1512 = 1
inv : p21 + p1069 + p1074 + p1075 = 1
inv : p3287 + p3292 + p3293 = 1
inv : p21 + p1707 + p1709 + p1711 + p1713 = 1
inv : p21 + p339 + p344 + p345 = 1
inv : p2239 + p2241 = 1
inv : p3079 + p3082 + p3083 = 1
inv : p21 + p645 + p648 + p650 + p652 = 1
inv : p21 + p233 + p235 + p237 + p239 = 1
inv : p21 + p794 + p822 + p824 + p826 + p828 + p830 = 1
inv : p21 + p846 + p849 + p851 + p853 = 1
inv : p21 + p1136 + p1141 + p1142 = 1
inv : p3354 + p3359 + p3360 = 1
inv : p21 + p399 + p402 + p403 = 1
inv : p21 + p1344 + p1347 + p1348 = 1
inv : p2119 + p2122 + p2124 + p2126 = 1
inv : p2901 + p2903 + p2905 + p2907 = 1
inv : p2272 + p2274 = 1
inv : p21 + p1009 + p1012 + p1013 = 1
inv : p2289 + p2294 + p2295 = 1
inv : p3277 + p3279 = 1
inv : p21 + p466 + p469 + p470 = 1
inv : p21 + p346 + p349 + p350 = 1
inv : p21 + p1820 + p1823 + p1824 = 1
inv : p21 + p473 + p478 + p479 = 1
inv : p3012 + p3015 + p3016 = 1
inv : -p610 - p611 + p612 + p613 = 0
inv : p21 + p1224 + p1226 + p1228 + p1230 = 1
inv : p21 + p300 + p302 + p304 + p306 = 1
inv : p21 + p1908 + p1910 + p1912 + p1914 = 1
inv : p2222 + p2227 + p2228 = 1
inv : p21 + p1873 + p1876 + p1877 = 1
inv : p2028 + p2030 + p2032 + p2034 = 1
inv : p2878 + p2881 + p2882 = 1
inv : p21 + p1605 + p1608 + p1609 = 1
inv : p21 + p748 + p751 + p752 = 1
inv : p21 + p1569 + p1571 = 1
inv : p3156 + p3157 - p3158 - p3159 = 0
inv : p21 + p942 + p945 + p946 = 1
inv : p21 + p765 + p767 = 1
inv : p2423 + p2428 + p2429 = 1
inv : p21 + p61 + p63 = 1
inv : p21 + p614 + p617 + p618 = 1
inv : p21 + p1083 + p1088 + p1089 = 1
inv : p21 + p533 + p536 + p537 = 1
inv : p21 + p1739 + p1742 + p1743 = 1
inv : p3026 + p3029 + p3030 = 1
inv : p2229 + p2231 + p2233 + p2235 = 1
inv : p21 + p1002 + p1007 + p1008 = 1
inv : p2004 + p2006 = 1
inv : p2846 + p2848 + p2850 + p2852 = 1
inv : p21 + p1650 + p1653 + p1655 + p1657 = 1
inv : p21 + p85 + p87 + p89 + p91 = 1
inv : p21 + p1449 + p1452 + p1454 + p1456 = 1
inv : p21 + p794 + p815 + p818 + p819 = 1
inv : p21 + p128 + p130 = 1
inv : p21 + p702 + p704 + p706 + p708 = 1
inv : p2521 + p2524 + p2526 + p2528 = 1
inv : p21 + p903 + p905 + p907 + p909 = 1
inv : p3124 + p3127 + p3129 + p3131 = 1
inv : p2691 + p2694 + p2695 = 1
inv : p21 + p1023 + p1025 + p1027 + p1029 = 1
inv : p2557 + p2562 + p2563 = 1
inv : p3325 + p3328 + p3330 + p3332 = 1
inv : p21 + p1210 + p1213 + p1214 = 1
inv : p2109 + p2111 + p2113 + p2115 = 1
inv : p3213 + p3216 + p3217 = 1
inv : p21 + p1217 + p1222 + p1223 = 1
inv : p3220 + p3225 + p3226 = 1
inv : -p3350 - p3351 + p3352 + p3353 = 0
inv : p2744 + p2747 + p2748 = 1
inv : p21 + p530 + p532 = 1
inv : p2779 + p2781 + p2783 + p2785 = 1
inv : p21 + p674 + p679 + p680 = 1
inv : p21 + p868 + p873 + p874 = 1
inv : p2088 + p2093 + p2094 = 1
inv : p2610 + p2615 + p2616 = 1
inv : p21 + p1538 + p1540 + p1543 + p1544 = 1
inv : p21 + p794 + p798 + p800 = 1
inv : p21 + p1038 + p1039 + p1041 + p1043 + p1045 = 1
inv : p2081 + p2084 + p2085 = 1
inv : p2162 + p2164 + p2166 + p2168 = 1
inv : p21 + p667 + p670 + p671 = 1
inv : p21 + p198 + p201 + p202 = 1
inv : p3160 + p3163 + p3164 = 1
inv : p2306 + p2308 = 1
inv : p342 + p343 - p344 - p345 = 0
inv : p21 + p1703 + p1705 = 1
inv : p21 + p865 + p867 = 1
inv : p21 + p1851 + p1854 + p1856 + p1858 = 1
inv : p21 + p1686 + p1689 + p1690 = 1
inv : p21 + p205 + p210 + p211 = 1
inv : p2141 + p2146 + p2147 = 1
inv : -p744 - p745 + p746 + p747 = 0
inv : p2490 + p2493 + p2494 = 1
inv : p21 + p1612 + p1617 + p1618 = 1
inv : p21 + p166 + p168 + p170 + p172 = 1
inv : p2818 + p2823 + p2824 = 1
inv : p2892 + p2897 + p2898 = 1
inv : p3344 + p3346 = 1
inv : p3311 + p3313 = 1
inv : p21 + p882 + p887 + p888 = 1
inv : p2339 + p2341 = 1
inv : p483 + p484 - p485 - p486 = 0
inv : p21 + p1248 + p1251 + p1253 + p1255 = 1
inv : p2751 + p2756 + p2757 = 1
inv : p21 + p597 + p599 = 1
inv : p2832 + p2834 + p2836 + p2838 = 1
inv : p2677 + p2682 + p2683 = 1
inv : p21 + p1552 + p1555 + p1556 = 1
inv : p21 + p578 + p581 + p583 + p585 = 1
inv : p3110 + p3112 = 1
inv : p21 + p564 + p566 = 1
inv : -p2285 - p2286 + p2287 + p2288 = 0
inv : p2476 + p2479 + p2480 = 1
inv : p2712 + p2714 + p2716 + p2718 = 1
inv : p21 + p1679 + p1684 + p1685 = 1
inv : p21 + p1502 + p1504 = 1
inv : p21 + p1753 + p1755 + p1758 + p1759 = 1
inv : p2208 + p2211 + p2212 = 1
inv : p2744 + p2749 + p2750 = 1
inv : p2349 + p2352 + p2353 = 1
inv : p2821 + p2822 - p2823 - p2824 = 0
inv : p2775 + p2777 = 1
inv : p2387 + p2390 + p2392 + p2394 = 1
inv : p2684 + p2687 + p2688 = 1
inv : p2624 + p2629 + p2630 = 1
inv : p3086 + p3091 + p3092 = 1
inv : p21 + p889 + p891 + p893 + p895 = 1
inv : p2141 + p2144 + p2145 = 1
inv : p1414 + p1415 - p1416 - p1417 = 0
inv : p2691 + p2696 + p2697 = 1
inv : p21 + p1492 + p1494 + p1496 + p1498 = 1
inv : p21 + p1929 + p1940 + p1945 + p1946 = 1
inv : p2945 + p2950 + p2951 = 1
inv : p2282 + p2285 + p2286 = 1
inv : p21 + p568 + p570 + p572 + p574 = 1
inv : p21 + p1894 + p1896 + p1898 + p1900 = 1
inv : p3347 + p3350 + p3351 = 1
inv : p2825 + p2828 + p2829 = 1
inv : p21 + p1171 + p1173 + p1175 + p1177 = 1
inv : p2631 + p2633 + p2635 + p2637 = 1
inv : -p67 - p68 + p69 + p70 = 0
inv : p2409 + p2414 + p2415 = 1
inv : p21 + p377 + p380 + p382 + p384 = 1
inv : p21 + p899 + p901 = 1
inv : p21 + p1535 + p1537 = 1
inv : p3143 + p3145 = 1
inv : p21 + p794 + p815 + p820 + p821 = 1
inv : p3294 + p3297 + p3298 = 1
inv : p2722 + p2725 + p2727 + p2729 = 1
inv : p21 + p949 + p954 + p955 = 1
inv : p21 + p1929 + p1985 + p1988 + p1990 + p1992 = 1
inv : p2310 + p2312 + p2314 + p2316 = 1
inv : p3177 + p3179 = 1
inv : p2543 + p2546 + p2547 = 1
inv : p2913 + p2915 + p2917 + p2919 = 1
inv : p2423 + p2426 + p2427 = 1
inv : p1816 + p1817 - p1818 - p1819 = 0
inv : p2550 + p2555 + p2556 = 1
inv : p21 + p621 + p623 + p625 + p627 = 1
inv : p21 + p1770 + p1772 = 1
inv : p21 + p145 + p150 + p151 = 1
inv : p21 + p712 + p715 + p717 + p719 = 1
inv : p21 + p875 + p878 + p879 = 1
inv : p2966 + p2968 + p2970 + p2972 = 1
inv : p2952 + p2955 + p2956 = 1
inv : p21 + p966 + p968 = 1
inv : p21 + p1672 + p1675 + p1676 = 1
inv : p3227 + p3230 + p3231 = 1
inv : p21 + p600 + p603 + p604 = 1
inv : p2342 + p2347 + p2348 = 1
inv : p2095 + p2097 + p2099 + p2101 + p2102 + p2103 = 1
inv : p2909 + p2911 = 1
inv : p2942 + p2944 = 1
inv : p2497 + p2499 + p2501 + p2503 = 1
inv : p21 + p78 + p83 + p84 = 1
inv : p21 + p794 + p801 + p806 + p807 = 1
inv : p21 + p999 + p1001 = 1
inv : p3315 + p3317 + p3319 + p3321 = 1
inv : p2014 + p2019 + p2020 = 1
inv : p21 + p1418 + p1421 + p1422 = 1
inv : p21 + p355 + p357 + p359 + p361 = 1
inv : p2483 + p2488 + p2489 = 1
inv : p2172 + p2174 = 1
inv : p21 + p131 + p136 + p137 = 1
inv : p21 + p1841 + p1843 + p1845 + p1847 = 1
inv : p21 + p1016 + p1019 + p1020 = 1
inv : p21 + p1806 + p1809 + p1810 = 1
inv : p21 + p698 + p700 = 1
inv : p3153 + p3158 + p3159 = 1
inv : p21 + p1545 + p1550 + p1551 = 1
inv : p2138 + p2140 = 1
inv : p21 + p1439 + p1441 + p1443 + p1445 = 1
inv : p3280 + p3283 + p3284 = 1
inv : p2356 + p2361 + p2362 = 1
inv : p21 + p1033 + p1035 = 1
inv : p21 + p741 + p744 + p745 = 1
inv : p21 + p1760 + p1762 + p1764 + p1766 = 1
inv : p21 + p1277 + p1280 + p1281 = 1
inv : p2976 + p2978 = 1
inv : p2444 + p2446 + p2448 + p2450 = 1
inv : p21 + p980 + p983 + p985 + p987 = 1
inv : p21 + p1358 + p1360 + p1362 + p1364 = 1
inv : p3047 + p3049 + p3051 + p3053 = 1
inv : p3012 + p3017 + p3018 = 1
inv : p21 + p413 + p418 + p419 = 1
inv : p21 + p631 + p633 = 1
inv : p3009 + p3011 = 1
inv : p2253 + p2256 + p2258 + p2260 = 1
inv : p21 + p406 + p409 + p410 = 1
inv : p3234 + p3236 + p3238 + p3240 = 1
inv : p1890 + p1891 - p1892 - p1893 = 0
inv : p21 + p272 + p277 + p278 = 1
inv : -p1287 - p1288 + p1289 + p1290 = 0
inv : p21 + p935 + p940 + p941 = 1
inv : p2007 + p2010 + p2011 = 1
inv : p3244 + p3246 = 1
inv : p21 + p1573 + p1575 + p1577 + p1579 + p1580 = 1
inv : p21 + p1619 + p1622 + p1623 = 1
inv : p21 + p265 + p268 + p269 = 1
inv : p21 + p1114 + p1117 + p1119 + p1121 = 1
inv : p2761 + p2762 - p2763 - p2764 = 0
inv : p3093 + p3096 + p3097 = 1
inv : p21 + p434 + p436 + p438 + p440 = 1
inv : p2205 + p2207 = 1
inv : p21 + p487 + p489 + p491 + p493 = 1
inv : p21 + p547 + p550 + p551 = 1
inv : p21 + p243 + p246 + p248 + p250 = 1
inv : p3100 + p3102 + p3104 + p3106 = 1
inv : p2959 + p2964 + p2965 = 1
inv : p2811 + p2814 + p2815 = 1
inv : p21 + p1929 + p1947 + p1950 + p1951 = 1
inv : p21 + p1478 + p1483 + p1484 = 1
inv : p21 + p731 + p733 = 1
inv : p2155 + p2158 + p2159 = 1
inv : p21 + p1471 + p1474 + p1475 = 1
inv : p2105 + p2107 = 1
inv : p21 + p1929 + p1954 + p1959 + p1960 = 1
inv : p2856 + p2859 + p2861 + p2863 = 1
Total of 551 invariants.
[2022-06-12 22:37:02] [INFO ] Computed 551 place invariants in 66 ms
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :12 after 75
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1.91868e+09 after 1.33485e+14
[2022-06-12 22:37:09] [INFO ] BMC solution for property ShieldPPPs-PT-050B-ReachabilityFireability-14(UNSAT) depth K=2 took 8479 ms
[2022-06-12 22:37:10] [INFO ] Proved 1563 variables to be positive in 8749 ms
[2022-06-12 22:37:11] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldPPPs-PT-050B-ReachabilityFireability-14
[2022-06-12 22:37:11] [INFO ] KInduction solution for property ShieldPPPs-PT-050B-ReachabilityFireability-14(SAT) depth K=0 took 678 ms
[2022-06-12 22:37:12] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldPPPs-PT-050B-ReachabilityFireability-14
[2022-06-12 22:37:12] [INFO ] KInduction solution for property ShieldPPPs-PT-050B-ReachabilityFireability-14(SAT) depth K=1 took 1236 ms
Compilation finished in 16855 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin9443079927892168831]
Link finished in 84 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, ShieldPPPsPT050BReachabilityFireability14==true], workingDir=/tmp/ltsmin9443079927892168831]
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1.33485e+14 after 1.09157e+76
[2022-06-12 22:39:44] [INFO ] BMC solution for property ShieldPPPs-PT-050B-ReachabilityFireability-14(UNSAT) depth K=3 took 154035 ms
Detected timeout of ITS tools.
[2022-06-12 22:58:55] [INFO ] Applying decomposition
[2022-06-12 22:58:55] [INFO ] Flatten gal took : 210 ms
[2022-06-12 22:58:56] [INFO ] Decomposing Gal with order
[2022-06-12 22:58:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-12 22:58:56] [INFO ] Removed a total of 668 redundant transitions.
[2022-06-12 22:58:56] [INFO ] Flatten gal took : 237 ms
[2022-06-12 22:58:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 1106 labels/synchronizations in 193 ms.
[2022-06-12 22:58:56] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability8580768861460298592.gal : 38 ms
[2022-06-12 22:58:56] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability5421198727899026325.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/ReachabilityFireability8580768861460298592.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityFireability5421198727899026325.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/ReachabilityFireability8580768861460298592.gal -t CGAL -reachable-file /tmp/ReachabilityFireability5421198727899026325.prop --nowitness
Loading property file /tmp/ReachabilityFireability5421198727899026325.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 9
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :9 after 9
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :9 after 15
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :15 after 15
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :15 after 24
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :24 after 9.17013e+09
Detected timeout of ITS tools.
[2022-06-12 23:20:51] [INFO ] Flatten gal took : 305 ms
[2022-06-12 23:20:52] [INFO ] Input system was already deterministic with 1313 transitions.
[2022-06-12 23:20:53] [INFO ] Transformed 1563 places.
[2022-06-12 23:20:53] [INFO ] Transformed 1313 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-06-12 23:20:53] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability9077198562352921632.gal : 20 ms
[2022-06-12 23:20:53] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability1878861966535491532.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/ReachabilityFireability9077198562352921632.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityFireability1878861966535491532.prop, --nowitness, --load-order, /home/mcc/execution/model.ord, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityFireability9077198562352921632.gal -t CGAL -reachable-file /tmp/ReachabilityFireability1878861966535491532.prop --nowitness --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/ReachabilityFireability1878861966535491532.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 7
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :7 after 35
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :35 after 161
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :161 after 311
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :311 after 2257
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :2257 after 3742
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :3742 after 26818
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :26818 after 4.41653e+06
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :4.41653e+06 after 5.27805e+06
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :5.27805e+06 after 1.02587e+07
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :1.02587e+07 after 2.38488e+10
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :2.38488e+10 after 3.28199e+10
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :3.28199e+10 after 4.41084e+10
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :4.41084e+10 after 5.01341e+12
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :5.01341e+12 after 1.4247e+14
[2022-06-12 23:23:03] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldPPPs-PT-050B-ReachabilityFireability-14
[2022-06-12 23:23:03] [INFO ] KInduction solution for property ShieldPPPs-PT-050B-ReachabilityFireability-14(SAT) depth K=2 took 2751023 ms
SDD proceeding with computation,1 properties remain. new max is 262144
SDD size :1.4247e+14 after 3.41492e+14
SDD proceeding with computation,1 properties remain. new max is 524288
SDD size :3.41492e+14 after 1.97027e+18

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="ShieldPPPs-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 ShieldPPPs-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-165286037200192"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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