About the Execution of 2021-gold for ShieldIIPs-PT-100B
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16225.348 | 3600000.00 | 12641728.00 | 1366.60 | FFFTTTFT?TTTF?TT | normal |
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-165286037000066.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2021
Input is ShieldIIPs-PT-100B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r233-tall-165286037000066
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.2M
-rw-r--r-- 1 mcc users 6.5K Apr 29 14:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Apr 29 14:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Apr 29 14:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Apr 29 14:57 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 4.0K May 9 08:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 9 08:49 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 08:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 08:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 29 14:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 106K Apr 29 14:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 29 14:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 109K Apr 29 14:58 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 08:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 1.7M May 10 09:34 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityFireability-00
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityFireability-01
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityFireability-02
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityFireability-03
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityFireability-04
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityFireability-05
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityFireability-06
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityFireability-07
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityFireability-08
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityFireability-09
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityFireability-10
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityFireability-11
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityFireability-12
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityFireability-13
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityFireability-14
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityFireability-15
=== Now, execution of the tool begins
BK_START 1655069053997
Running Version 0
[2022-06-12 21:24:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-12 21:24:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-12 21:24:16] [INFO ] Load time of PNML (sax parser for PT used): 381 ms
[2022-06-12 21:24:16] [INFO ] Transformed 6003 places.
[2022-06-12 21:24:16] [INFO ] Transformed 5903 transitions.
[2022-06-12 21:24:16] [INFO ] Found NUPN structural information;
[2022-06-12 21:24:16] [INFO ] Parsed PT model containing 6003 places and 5903 transitions in 721 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 174 ms. (steps per millisecond=57 ) properties (out of 16) seen :3
FORMULA ShieldIIPs-PT-100B-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100B-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100B-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 13) 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 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 13) seen :0
Running SMT prover for 13 properties.
// Phase 1: matrix 5903 rows 6003 cols
[2022-06-12 21:24:17] [INFO ] Computed 901 place invariants in 80 ms
[2022-06-12 21:24:19] [INFO ] SMT Verify possible in real domain returnedunsat :0 sat :0 real:13
[2022-06-12 21:24:21] [INFO ] [Nat]Absence check using 901 positive place invariants in 632 ms returned sat
[2022-06-12 21:24:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:24:35] [INFO ] [Nat]Absence check using state equation in 12493 ms returned unsat :1 sat :12
Attempting to minimize the solution found.
Minimization took 8876 ms.
[2022-06-12 21:24:44] [INFO ] SMT Verify possible in nat domain returned unsat :1 sat :11
FORMULA ShieldIIPs-PT-100B-ReachabilityFireability-04 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 13 Parikh solutions to 11 different solutions.
Interrupted Parikh walk after 2109978 steps, including 1025 resets, run timeout after 30001 ms. (steps per millisecond=70 ) properties (out of 12) seen :7
FORMULA ShieldIIPs-PT-100B-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldIIPs-PT-100B-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldIIPs-PT-100B-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldIIPs-PT-100B-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldIIPs-PT-100B-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldIIPs-PT-100B-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldIIPs-PT-100B-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Interrupted Parikh walk after 2423297 steps, including 1050 resets, run timeout after 30001 ms. (steps per millisecond=80 ) properties (out of 5) seen :0
Interrupted Parikh walk after 2372260 steps, including 1045 resets, run timeout after 30001 ms. (steps per millisecond=79 ) properties (out of 5) seen :0
Interrupted Parikh walk after 2402010 steps, including 1049 resets, run timeout after 30001 ms. (steps per millisecond=80 ) properties (out of 5) seen :0
Support contains 200 out of 6003 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 6003/6003 places, 5903/5903 transitions.
Drop transitions removed 470 transitions
Trivial Post-agglo rules discarded 470 transitions
Performed 470 trivial Post agglomeration. Transition count delta: 470
Iterating post reduction 0 with 470 rules applied. Total rules applied 470 place count 6003 transition count 5433
Reduce places removed 470 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 478 rules applied. Total rules applied 948 place count 5533 transition count 5425
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 956 place count 5525 transition count 5425
Performed 488 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 488 Pre rules applied. Total rules applied 956 place count 5525 transition count 4937
Deduced a syphon composed of 488 places in 28 ms
Reduce places removed 488 places and 0 transitions.
Iterating global reduction 3 with 976 rules applied. Total rules applied 1932 place count 5037 transition count 4937
Discarding 661 places :
Symmetric choice reduction at 3 with 661 rule applications. Total rules 2593 place count 4376 transition count 4276
Iterating global reduction 3 with 661 rules applied. Total rules applied 3254 place count 4376 transition count 4276
Performed 247 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 247 Pre rules applied. Total rules applied 3254 place count 4376 transition count 4029
Deduced a syphon composed of 247 places in 24 ms
Reduce places removed 247 places and 0 transitions.
Iterating global reduction 3 with 494 rules applied. Total rules applied 3748 place count 4129 transition count 4029
Performed 1435 Post agglomeration using F-continuation condition.Transition count delta: 1435
Deduced a syphon composed of 1435 places in 15 ms
Reduce places removed 1435 places and 0 transitions.
Iterating global reduction 3 with 2870 rules applied. Total rules applied 6618 place count 2694 transition count 2594
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 642 times.
Drop transitions removed 642 transitions
Iterating global reduction 3 with 642 rules applied. Total rules applied 7260 place count 2694 transition count 2594
Applied a total of 7260 rules in 2293 ms. Remains 2694 /6003 variables (removed 3309) and now considering 2594/5903 (removed 3309) transitions.
Finished structural reductions, in 1 iterations. Remains : 2694/6003 places, 2594/5903 transitions.
[2022-06-12 21:26:47] [INFO ] Flatten gal took : 316 ms
[2022-06-12 21:26:47] [INFO ] Flatten gal took : 174 ms
[2022-06-12 21:26:47] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2960424045875187021.gal : 52 ms
[2022-06-12 21:26:47] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3506397104638529289.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/ReachabilityCardinality2960424045875187021.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality3506397104638529289.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/ReachabilityCardinality2960424045875187021.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality3506397104638529289.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality3506397104638529289.prop.
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :10 after 18
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :18 after 40
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :40 after 400
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :400 after 13854
SDD proceeding with computation,5 properties remain. new max is 256
SDD size :13854 after 1.9531e+08
SDD proceeding with computation,5 properties remain. new max is 512
SDD size :1.9531e+08 after 1.70857e+12
SDD proceeding with computation,5 properties remain. new max is 1024
SDD size :1.70857e+12 after 1.46931e+23
SDD proceeding with computation,5 properties remain. new max is 2048
SDD size :5.71268e+26 after 2.87306e+27
SDD proceeding with computation,5 properties remain. new max is 4096
SDD size :2.87306e+27 after 2.87306e+27
SDD proceeding with computation,5 properties remain. new max is 8192
SDD size :2.87306e+27 after 2.87306e+27
SDD proceeding with computation,5 properties remain. new max is 16384
SDD size :2.87306e+27 after 2.87306e+27
SDD proceeding with computation,5 properties remain. new max is 32768
SDD size :2.87306e+27 after 2.87306e+27
Detected timeout of ITS tools.
[2022-06-12 21:27:02] [INFO ] Flatten gal took : 189 ms
[2022-06-12 21:27:02] [INFO ] Applying decomposition
[2022-06-12 21:27:03] [INFO ] Flatten gal took : 134 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/graph2936692948913437566.txt, -o, /tmp/graph2936692948913437566.bin, -w, /tmp/graph2936692948913437566.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/graph2936692948913437566.bin, -l, -1, -v, -w, /tmp/graph2936692948913437566.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-12 21:27:03] [INFO ] Decomposing Gal with order
[2022-06-12 21:27:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-12 21:27:04] [INFO ] Removed a total of 2013 redundant transitions.
[2022-06-12 21:27:04] [INFO ] Flatten gal took : 306 ms
[2022-06-12 21:27:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 2264 labels/synchronizations in 152 ms.
[2022-06-12 21:27:04] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7679610550214246568.gal : 33 ms
[2022-06-12 21:27:04] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7006921936017473717.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/ReachabilityCardinality7679610550214246568.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality7006921936017473717.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/ReachabilityCardinality7679610550214246568.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality7006921936017473717.prop --nowitness
Loading property file /tmp/ReachabilityCardinality7006921936017473717.prop.
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :1 after 4
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :4 after 31
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :31 after 291
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :291 after 48531
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin18058819913943230217
[2022-06-12 21:27:19] [INFO ] Built C files in 73ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18058819913943230217
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/ltsmin18058819913943230217]
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/ltsmin18058819913943230217] 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/ltsmin18058819913943230217] 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 123 resets, run finished after 15902 ms. (steps per millisecond=62 ) properties (out of 5) seen :1
FORMULA ShieldIIPs-PT-100B-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Interrupted Best-First random walk after 454670 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=90 ) properties seen :{0=1}
FORMULA ShieldIIPs-PT-100B-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Interrupted Best-First random walk after 455778 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=91 ) properties seen :{0=1}
FORMULA ShieldIIPs-PT-100B-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Interrupted Best-First random walk after 432833 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=86 ) properties seen :{}
Interrupted Best-First random walk after 423091 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=84 ) properties seen :{}
Running SMT prover for 2 properties.
// Phase 1: matrix 2594 rows 2694 cols
[2022-06-12 21:27:56] [INFO ] Computed 901 place invariants in 120 ms
[2022-06-12 21:27:57] [INFO ] [Real]Absence check using 884 positive place invariants in 289 ms returned sat
[2022-06-12 21:27:57] [INFO ] [Real]Absence check using 884 positive and 17 generalized place invariants in 6 ms returned sat
[2022-06-12 21:27:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:27:59] [INFO ] [Real]Absence check using state equation in 1470 ms returned sat
[2022-06-12 21:27:59] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:27:59] [INFO ] [Nat]Absence check using 884 positive place invariants in 266 ms returned sat
[2022-06-12 21:27:59] [INFO ] [Nat]Absence check using 884 positive and 17 generalized place invariants in 8 ms returned sat
[2022-06-12 21:27:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:28:01] [INFO ] [Nat]Absence check using state equation in 1607 ms returned sat
[2022-06-12 21:28:01] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-06-12 21:28:01] [INFO ] [Nat]Added 4 Read/Feed constraints in 4 ms returned sat
[2022-06-12 21:28:01] [INFO ] Deduced a trap composed of 9 places in 476 ms of which 1 ms to minimize.
[2022-06-12 21:28:02] [INFO ] Deduced a trap composed of 6 places in 441 ms of which 1 ms to minimize.
[2022-06-12 21:28:02] [INFO ] Deduced a trap composed of 12 places in 396 ms of which 2 ms to minimize.
[2022-06-12 21:28:03] [INFO ] Deduced a trap composed of 6 places in 375 ms of which 2 ms to minimize.
[2022-06-12 21:28:03] [INFO ] Deduced a trap composed of 5 places in 373 ms of which 2 ms to minimize.
[2022-06-12 21:28:04] [INFO ] Deduced a trap composed of 18 places in 427 ms of which 0 ms to minimize.
[2022-06-12 21:28:04] [INFO ] Deduced a trap composed of 8 places in 381 ms of which 2 ms to minimize.
[2022-06-12 21:28:05] [INFO ] Deduced a trap composed of 10 places in 404 ms of which 2 ms to minimize.
[2022-06-12 21:28:05] [INFO ] Deduced a trap composed of 11 places in 370 ms of which 1 ms to minimize.
[2022-06-12 21:28:06] [INFO ] Deduced a trap composed of 14 places in 357 ms of which 1 ms to minimize.
[2022-06-12 21:28:06] [INFO ] Deduced a trap composed of 20 places in 372 ms of which 1 ms to minimize.
[2022-06-12 21:28:07] [INFO ] Deduced a trap composed of 17 places in 363 ms of which 1 ms to minimize.
[2022-06-12 21:28:07] [INFO ] Deduced a trap composed of 18 places in 353 ms of which 1 ms to minimize.
[2022-06-12 21:28:08] [INFO ] Deduced a trap composed of 21 places in 369 ms of which 1 ms to minimize.
[2022-06-12 21:28:08] [INFO ] Deduced a trap composed of 19 places in 346 ms of which 1 ms to minimize.
[2022-06-12 21:28:08] [INFO ] Deduced a trap composed of 18 places in 351 ms of which 1 ms to minimize.
[2022-06-12 21:28:09] [INFO ] Deduced a trap composed of 9 places in 326 ms of which 1 ms to minimize.
[2022-06-12 21:28:09] [INFO ] Deduced a trap composed of 16 places in 354 ms of which 0 ms to minimize.
[2022-06-12 21:28:10] [INFO ] Deduced a trap composed of 13 places in 341 ms of which 0 ms to minimize.
[2022-06-12 21:28:10] [INFO ] Deduced a trap composed of 14 places in 313 ms of which 1 ms to minimize.
[2022-06-12 21:28:11] [INFO ] Deduced a trap composed of 10 places in 349 ms of which 0 ms to minimize.
[2022-06-12 21:28:11] [INFO ] Deduced a trap composed of 19 places in 314 ms of which 6 ms to minimize.
[2022-06-12 21:28:11] [INFO ] Deduced a trap composed of 19 places in 333 ms of which 1 ms to minimize.
[2022-06-12 21:28:12] [INFO ] Deduced a trap composed of 12 places in 320 ms of which 1 ms to minimize.
[2022-06-12 21:28:12] [INFO ] Deduced a trap composed of 18 places in 297 ms of which 1 ms to minimize.
[2022-06-12 21:28:13] [INFO ] Deduced a trap composed of 15 places in 327 ms of which 1 ms to minimize.
[2022-06-12 21:28:13] [INFO ] Deduced a trap composed of 29 places in 322 ms of which 1 ms to minimize.
[2022-06-12 21:28:14] [INFO ] Deduced a trap composed of 18 places in 340 ms of which 1 ms to minimize.
[2022-06-12 21:28:14] [INFO ] Deduced a trap composed of 21 places in 322 ms of which 1 ms to minimize.
[2022-06-12 21:28:14] [INFO ] Deduced a trap composed of 21 places in 301 ms of which 2 ms to minimize.
[2022-06-12 21:28:15] [INFO ] Deduced a trap composed of 17 places in 317 ms of which 1 ms to minimize.
[2022-06-12 21:28:15] [INFO ] Deduced a trap composed of 19 places in 318 ms of which 1 ms to minimize.
[2022-06-12 21:28:16] [INFO ] Deduced a trap composed of 21 places in 293 ms of which 5 ms to minimize.
[2022-06-12 21:28:16] [INFO ] Deduced a trap composed of 15 places in 324 ms of which 0 ms to minimize.
[2022-06-12 21:28:16] [INFO ] Deduced a trap composed of 17 places in 310 ms of which 1 ms to minimize.
[2022-06-12 21:28:17] [INFO ] Deduced a trap composed of 16 places in 312 ms of which 1 ms to minimize.
[2022-06-12 21:28:17] [INFO ] Deduced a trap composed of 25 places in 319 ms of which 0 ms to minimize.
[2022-06-12 21:28:18] [INFO ] Deduced a trap composed of 25 places in 281 ms of which 1 ms to minimize.
[2022-06-12 21:28:18] [INFO ] Deduced a trap composed of 18 places in 323 ms of which 0 ms to minimize.
[2022-06-12 21:28:18] [INFO ] Deduced a trap composed of 19 places in 295 ms of which 1 ms to minimize.
[2022-06-12 21:28:19] [INFO ] Deduced a trap composed of 20 places in 291 ms of which 0 ms to minimize.
[2022-06-12 21:28:19] [INFO ] Deduced a trap composed of 24 places in 292 ms of which 1 ms to minimize.
[2022-06-12 21:28:20] [INFO ] Deduced a trap composed of 17 places in 300 ms of which 1 ms to minimize.
[2022-06-12 21:28:20] [INFO ] Deduced a trap composed of 23 places in 298 ms of which 1 ms to minimize.
[2022-06-12 21:28:20] [INFO ] Deduced a trap composed of 24 places in 308 ms of which 1 ms to minimize.
[2022-06-12 21:28:21] [INFO ] Deduced a trap composed of 21 places in 289 ms of which 0 ms to minimize.
[2022-06-12 21:28:21] [INFO ] Deduced a trap composed of 28 places in 281 ms of which 1 ms to minimize.
[2022-06-12 21:28:22] [INFO ] Deduced a trap composed of 23 places in 279 ms of which 1 ms to minimize.
[2022-06-12 21:28:22] [INFO ] Deduced a trap composed of 19 places in 265 ms of which 0 ms to minimize.
[2022-06-12 21:28:22] [INFO ] Deduced a trap composed of 21 places in 293 ms of which 1 ms to minimize.
[2022-06-12 21:28:23] [INFO ] Deduced a trap composed of 16 places in 288 ms of which 1 ms to minimize.
[2022-06-12 21:28:23] [INFO ] Deduced a trap composed of 16 places in 277 ms of which 1 ms to minimize.
[2022-06-12 21:28:23] [INFO ] Deduced a trap composed of 26 places in 273 ms of which 1 ms to minimize.
[2022-06-12 21:28:24] [INFO ] Trap strengthening (SAT) tested/added 54/53 trap constraints in 22847 ms
[2022-06-12 21:28:24] [INFO ] Computed and/alt/rep : 2461/13643/2461 causal constraints (skipped 132 transitions) in 179 ms.
[2022-06-12 21:28:44] [INFO ] Added : 550 causal constraints over 110 iterations in 20048 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 6 ms.
[2022-06-12 21:28:44] [INFO ] [Real]Absence check using 884 positive place invariants in 270 ms returned sat
[2022-06-12 21:28:44] [INFO ] [Real]Absence check using 884 positive and 17 generalized place invariants in 8 ms returned sat
[2022-06-12 21:28:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:28:46] [INFO ] [Real]Absence check using state equation in 1956 ms returned sat
[2022-06-12 21:28:46] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:28:47] [INFO ] [Nat]Absence check using 884 positive place invariants in 280 ms returned sat
[2022-06-12 21:28:47] [INFO ] [Nat]Absence check using 884 positive and 17 generalized place invariants in 6 ms returned sat
[2022-06-12 21:28:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:28:49] [INFO ] [Nat]Absence check using state equation in 2208 ms returned sat
[2022-06-12 21:28:49] [INFO ] [Nat]Added 4 Read/Feed constraints in 6 ms returned sat
[2022-06-12 21:28:49] [INFO ] Deduced a trap composed of 5 places in 261 ms of which 12 ms to minimize.
[2022-06-12 21:28:50] [INFO ] Deduced a trap composed of 7 places in 269 ms of which 1 ms to minimize.
[2022-06-12 21:28:50] [INFO ] Deduced a trap composed of 8 places in 257 ms of which 1 ms to minimize.
[2022-06-12 21:28:50] [INFO ] Deduced a trap composed of 11 places in 237 ms of which 1 ms to minimize.
[2022-06-12 21:28:51] [INFO ] Deduced a trap composed of 9 places in 209 ms of which 0 ms to minimize.
[2022-06-12 21:28:51] [INFO ] Deduced a trap composed of 8 places in 259 ms of which 1 ms to minimize.
[2022-06-12 21:28:51] [INFO ] Deduced a trap composed of 19 places in 220 ms of which 0 ms to minimize.
[2022-06-12 21:28:52] [INFO ] Deduced a trap composed of 6 places in 206 ms of which 0 ms to minimize.
[2022-06-12 21:28:52] [INFO ] Deduced a trap composed of 9 places in 204 ms of which 0 ms to minimize.
[2022-06-12 21:28:52] [INFO ] Deduced a trap composed of 9 places in 240 ms of which 1 ms to minimize.
[2022-06-12 21:28:53] [INFO ] Deduced a trap composed of 11 places in 240 ms of which 1 ms to minimize.
[2022-06-12 21:28:53] [INFO ] Deduced a trap composed of 14 places in 234 ms of which 3 ms to minimize.
[2022-06-12 21:28:53] [INFO ] Deduced a trap composed of 20 places in 224 ms of which 1 ms to minimize.
[2022-06-12 21:28:54] [INFO ] Deduced a trap composed of 16 places in 224 ms of which 1 ms to minimize.
[2022-06-12 21:28:54] [INFO ] Deduced a trap composed of 13 places in 208 ms of which 1 ms to minimize.
[2022-06-12 21:28:54] [INFO ] Deduced a trap composed of 10 places in 223 ms of which 0 ms to minimize.
[2022-06-12 21:28:55] [INFO ] Deduced a trap composed of 14 places in 202 ms of which 0 ms to minimize.
[2022-06-12 21:28:55] [INFO ] Deduced a trap composed of 17 places in 228 ms of which 2 ms to minimize.
[2022-06-12 21:28:55] [INFO ] Deduced a trap composed of 26 places in 212 ms of which 0 ms to minimize.
[2022-06-12 21:28:56] [INFO ] Deduced a trap composed of 18 places in 196 ms of which 0 ms to minimize.
[2022-06-12 21:28:56] [INFO ] Deduced a trap composed of 17 places in 195 ms of which 0 ms to minimize.
[2022-06-12 21:28:56] [INFO ] Deduced a trap composed of 24 places in 197 ms of which 1 ms to minimize.
[2022-06-12 21:28:56] [INFO ] Deduced a trap composed of 15 places in 192 ms of which 0 ms to minimize.
[2022-06-12 21:28:57] [INFO ] Deduced a trap composed of 23 places in 188 ms of which 1 ms to minimize.
[2022-06-12 21:28:57] [INFO ] Deduced a trap composed of 18 places in 189 ms of which 1 ms to minimize.
[2022-06-12 21:28:57] [INFO ] Deduced a trap composed of 19 places in 206 ms of which 0 ms to minimize.
[2022-06-12 21:28:58] [INFO ] Deduced a trap composed of 22 places in 180 ms of which 0 ms to minimize.
[2022-06-12 21:28:58] [INFO ] Deduced a trap composed of 18 places in 185 ms of which 1 ms to minimize.
[2022-06-12 21:28:58] [INFO ] Deduced a trap composed of 19 places in 185 ms of which 1 ms to minimize.
[2022-06-12 21:28:58] [INFO ] Deduced a trap composed of 18 places in 199 ms of which 1 ms to minimize.
[2022-06-12 21:28:59] [INFO ] Deduced a trap composed of 22 places in 191 ms of which 0 ms to minimize.
[2022-06-12 21:28:59] [INFO ] Deduced a trap composed of 18 places in 191 ms of which 3 ms to minimize.
[2022-06-12 21:28:59] [INFO ] Deduced a trap composed of 23 places in 185 ms of which 0 ms to minimize.
[2022-06-12 21:29:00] [INFO ] Deduced a trap composed of 19 places in 162 ms of which 1 ms to minimize.
[2022-06-12 21:29:00] [INFO ] Deduced a trap composed of 23 places in 183 ms of which 1 ms to minimize.
[2022-06-12 21:29:00] [INFO ] Deduced a trap composed of 21 places in 167 ms of which 1 ms to minimize.
[2022-06-12 21:29:00] [INFO ] Deduced a trap composed of 18 places in 166 ms of which 0 ms to minimize.
[2022-06-12 21:29:01] [INFO ] Deduced a trap composed of 19 places in 187 ms of which 1 ms to minimize.
[2022-06-12 21:29:01] [INFO ] Deduced a trap composed of 21 places in 181 ms of which 0 ms to minimize.
[2022-06-12 21:29:01] [INFO ] Deduced a trap composed of 19 places in 186 ms of which 1 ms to minimize.
[2022-06-12 21:29:02] [INFO ] Deduced a trap composed of 18 places in 176 ms of which 1 ms to minimize.
[2022-06-12 21:29:02] [INFO ] Deduced a trap composed of 17 places in 175 ms of which 1 ms to minimize.
[2022-06-12 21:29:02] [INFO ] Deduced a trap composed of 22 places in 170 ms of which 0 ms to minimize.
[2022-06-12 21:29:02] [INFO ] Deduced a trap composed of 26 places in 168 ms of which 1 ms to minimize.
[2022-06-12 21:29:03] [INFO ] Deduced a trap composed of 20 places in 175 ms of which 0 ms to minimize.
[2022-06-12 21:29:03] [INFO ] Deduced a trap composed of 20 places in 155 ms of which 1 ms to minimize.
[2022-06-12 21:29:03] [INFO ] Deduced a trap composed of 28 places in 164 ms of which 1 ms to minimize.
[2022-06-12 21:29:03] [INFO ] Deduced a trap composed of 25 places in 171 ms of which 0 ms to minimize.
[2022-06-12 21:29:04] [INFO ] Deduced a trap composed of 24 places in 158 ms of which 0 ms to minimize.
[2022-06-12 21:29:04] [INFO ] Deduced a trap composed of 21 places in 154 ms of which 1 ms to minimize.
[2022-06-12 21:29:04] [INFO ] Deduced a trap composed of 18 places in 179 ms of which 0 ms to minimize.
[2022-06-12 21:29:04] [INFO ] Deduced a trap composed of 21 places in 173 ms of which 1 ms to minimize.
[2022-06-12 21:29:05] [INFO ] Trap strengthening (SAT) tested/added 53/52 trap constraints in 15533 ms
[2022-06-12 21:29:05] [INFO ] Computed and/alt/rep : 2461/13643/2461 causal constraints (skipped 132 transitions) in 134 ms.
[2022-06-12 21:29:25] [INFO ] Added : 510 causal constraints over 102 iterations in 20209 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 54 ms.
Incomplete Parikh walk after 375800 steps, including 1014 resets, run finished after 4343 ms. (steps per millisecond=86 ) properties (out of 2) seen :0 could not realise parikh vector
Support contains 98 out of 2694 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2694/2694 places, 2594/2594 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 2694 transition count 2582
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 24 place count 2682 transition count 2582
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 24 place count 2682 transition count 2564
Deduced a syphon composed of 18 places in 8 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 60 place count 2664 transition count 2564
Performed 71 Post agglomeration using F-continuation condition.Transition count delta: 71
Deduced a syphon composed of 71 places in 8 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 2 with 142 rules applied. Total rules applied 202 place count 2593 transition count 2493
Partial Free-agglomeration rule applied 30 times.
Drop transitions removed 30 transitions
Iterating global reduction 2 with 30 rules applied. Total rules applied 232 place count 2593 transition count 2493
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 233 place count 2592 transition count 2492
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 234 place count 2591 transition count 2492
Applied a total of 234 rules in 435 ms. Remains 2591 /2694 variables (removed 103) and now considering 2492/2594 (removed 102) transitions.
Finished structural reductions, in 1 iterations. Remains : 2591/2694 places, 2492/2594 transitions.
[2022-06-12 21:29:30] [INFO ] Flatten gal took : 147 ms
[2022-06-12 21:29:30] [INFO ] Flatten gal took : 150 ms
[2022-06-12 21:29:30] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15311642340773484139.gal : 16 ms
[2022-06-12 21:29:30] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9891599920002755103.prop : 15 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/ReachabilityCardinality15311642340773484139.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality9891599920002755103.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/ReachabilityCardinality15311642340773484139.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality9891599920002755103.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality9891599920002755103.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :4 after 8
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :8 after 14
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :14 after 38
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :38 after 758
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :758 after 54434
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :54434 after 163298
Detected timeout of ITS tools.
[2022-06-12 21:29:45] [INFO ] Flatten gal took : 156 ms
[2022-06-12 21:29:45] [INFO ] Applying decomposition
[2022-06-12 21:29:46] [INFO ] Flatten gal took : 135 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/graph3770051737870681506.txt, -o, /tmp/graph3770051737870681506.bin, -w, /tmp/graph3770051737870681506.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/graph3770051737870681506.bin, -l, -1, -v, -w, /tmp/graph3770051737870681506.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-12 21:29:46] [INFO ] Decomposing Gal with order
[2022-06-12 21:29:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-12 21:29:46] [INFO ] Removed a total of 1941 redundant transitions.
[2022-06-12 21:29:46] [INFO ] Flatten gal took : 217 ms
[2022-06-12 21:29:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 2448 labels/synchronizations in 247 ms.
[2022-06-12 21:29:47] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality18142106074889186056.gal : 37 ms
[2022-06-12 21:29:47] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6137980857876267540.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/ReachabilityCardinality18142106074889186056.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality6137980857876267540.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/ReachabilityCardinality18142106074889186056.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality6137980857876267540.prop --nowitness
Loading property file /tmp/ReachabilityCardinality6137980857876267540.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :1 after 4
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :4 after 6
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :6 after 30
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :30 after 30
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :30 after 30
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2608370382812463310
[2022-06-12 21:30:02] [INFO ] Built C files in 44ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2608370382812463310
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/ltsmin2608370382812463310]
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/ltsmin2608370382812463310] 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/ltsmin2608370382812463310] 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 114 resets, run finished after 16163 ms. (steps per millisecond=61 ) properties (out of 2) seen :0
Interrupted Best-First random walk after 436865 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=87 ) properties seen :{}
Interrupted Best-First random walk after 413001 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=82 ) properties seen :{}
Interrupted probabilistic random walk after 715020 steps, run timeout after 30001 ms. (steps per millisecond=23 ) properties seen :{}
Probabilistic random walk after 715020 steps, saw 392975 distinct states, run finished after 30001 ms. (steps per millisecond=23 ) properties seen :{}
Running SMT prover for 2 properties.
// Phase 1: matrix 2492 rows 2591 cols
[2022-06-12 21:30:59] [INFO ] Computed 900 place invariants in 146 ms
[2022-06-12 21:31:00] [INFO ] [Real]Absence check using 886 positive place invariants in 212 ms returned sat
[2022-06-12 21:31:00] [INFO ] [Real]Absence check using 886 positive and 14 generalized place invariants in 4 ms returned sat
[2022-06-12 21:31:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:31:01] [INFO ] [Real]Absence check using state equation in 1404 ms returned sat
[2022-06-12 21:31:01] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:31:02] [INFO ] [Nat]Absence check using 886 positive place invariants in 223 ms returned sat
[2022-06-12 21:31:02] [INFO ] [Nat]Absence check using 886 positive and 14 generalized place invariants in 4 ms returned sat
[2022-06-12 21:31:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:31:03] [INFO ] [Nat]Absence check using state equation in 1631 ms returned sat
[2022-06-12 21:31:03] [INFO ] Deduced a trap composed of 7 places in 194 ms of which 0 ms to minimize.
[2022-06-12 21:31:04] [INFO ] Deduced a trap composed of 4 places in 195 ms of which 1 ms to minimize.
[2022-06-12 21:31:04] [INFO ] Deduced a trap composed of 4 places in 160 ms of which 1 ms to minimize.
[2022-06-12 21:31:04] [INFO ] Deduced a trap composed of 18 places in 174 ms of which 0 ms to minimize.
[2022-06-12 21:31:05] [INFO ] Deduced a trap composed of 5 places in 157 ms of which 1 ms to minimize.
[2022-06-12 21:31:05] [INFO ] Deduced a trap composed of 8 places in 180 ms of which 1 ms to minimize.
[2022-06-12 21:31:05] [INFO ] Deduced a trap composed of 6 places in 162 ms of which 0 ms to minimize.
[2022-06-12 21:31:05] [INFO ] Deduced a trap composed of 7 places in 153 ms of which 0 ms to minimize.
[2022-06-12 21:31:06] [INFO ] Deduced a trap composed of 9 places in 150 ms of which 1 ms to minimize.
[2022-06-12 21:31:06] [INFO ] Deduced a trap composed of 7 places in 156 ms of which 1 ms to minimize.
[2022-06-12 21:31:06] [INFO ] Deduced a trap composed of 3 places in 142 ms of which 1 ms to minimize.
[2022-06-12 21:31:06] [INFO ] Deduced a trap composed of 10 places in 140 ms of which 1 ms to minimize.
[2022-06-12 21:31:07] [INFO ] Deduced a trap composed of 8 places in 132 ms of which 0 ms to minimize.
[2022-06-12 21:31:07] [INFO ] Deduced a trap composed of 6 places in 125 ms of which 1 ms to minimize.
[2022-06-12 21:31:07] [INFO ] Deduced a trap composed of 6 places in 133 ms of which 0 ms to minimize.
[2022-06-12 21:31:07] [INFO ] Deduced a trap composed of 7 places in 121 ms of which 0 ms to minimize.
[2022-06-12 21:31:07] [INFO ] Deduced a trap composed of 8 places in 128 ms of which 1 ms to minimize.
[2022-06-12 21:31:08] [INFO ] Deduced a trap composed of 15 places in 124 ms of which 1 ms to minimize.
[2022-06-12 21:31:08] [INFO ] Deduced a trap composed of 14 places in 121 ms of which 1 ms to minimize.
[2022-06-12 21:31:08] [INFO ] Deduced a trap composed of 10 places in 121 ms of which 0 ms to minimize.
[2022-06-12 21:31:08] [INFO ] Deduced a trap composed of 20 places in 109 ms of which 1 ms to minimize.
[2022-06-12 21:31:08] [INFO ] Deduced a trap composed of 16 places in 104 ms of which 1 ms to minimize.
[2022-06-12 21:31:09] [INFO ] Deduced a trap composed of 8 places in 106 ms of which 1 ms to minimize.
[2022-06-12 21:31:09] [INFO ] Deduced a trap composed of 12 places in 93 ms of which 0 ms to minimize.
[2022-06-12 21:31:09] [INFO ] Deduced a trap composed of 20 places in 98 ms of which 1 ms to minimize.
[2022-06-12 21:31:09] [INFO ] Deduced a trap composed of 25 places in 95 ms of which 1 ms to minimize.
[2022-06-12 21:31:09] [INFO ] Deduced a trap composed of 19 places in 104 ms of which 0 ms to minimize.
[2022-06-12 21:31:09] [INFO ] Trap strengthening (SAT) tested/added 28/27 trap constraints in 6297 ms
[2022-06-12 21:31:10] [INFO ] Computed and/alt/rep : 2380/11379/2380 causal constraints (skipped 94 transitions) in 144 ms.
[2022-06-12 21:31:30] [INFO ] Added : 550 causal constraints over 110 iterations in 20088 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 56 ms.
[2022-06-12 21:31:30] [INFO ] [Real]Absence check using 886 positive place invariants in 224 ms returned sat
[2022-06-12 21:31:30] [INFO ] [Real]Absence check using 886 positive and 14 generalized place invariants in 4 ms returned sat
[2022-06-12 21:31:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:31:32] [INFO ] [Real]Absence check using state equation in 1520 ms returned sat
[2022-06-12 21:31:32] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:31:32] [INFO ] [Nat]Absence check using 886 positive place invariants in 234 ms returned sat
[2022-06-12 21:31:32] [INFO ] [Nat]Absence check using 886 positive and 14 generalized place invariants in 4 ms returned sat
[2022-06-12 21:31:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:31:34] [INFO ] [Nat]Absence check using state equation in 1737 ms returned sat
[2022-06-12 21:31:34] [INFO ] Deduced a trap composed of 5 places in 242 ms of which 0 ms to minimize.
[2022-06-12 21:31:35] [INFO ] Deduced a trap composed of 8 places in 235 ms of which 1 ms to minimize.
[2022-06-12 21:31:35] [INFO ] Deduced a trap composed of 8 places in 229 ms of which 1 ms to minimize.
[2022-06-12 21:31:35] [INFO ] Deduced a trap composed of 4 places in 216 ms of which 1 ms to minimize.
[2022-06-12 21:31:36] [INFO ] Deduced a trap composed of 10 places in 217 ms of which 1 ms to minimize.
[2022-06-12 21:31:36] [INFO ] Deduced a trap composed of 6 places in 227 ms of which 1 ms to minimize.
[2022-06-12 21:31:36] [INFO ] Deduced a trap composed of 6 places in 224 ms of which 1 ms to minimize.
[2022-06-12 21:31:37] [INFO ] Deduced a trap composed of 9 places in 223 ms of which 1 ms to minimize.
[2022-06-12 21:31:37] [INFO ] Deduced a trap composed of 4 places in 216 ms of which 1 ms to minimize.
[2022-06-12 21:31:37] [INFO ] Deduced a trap composed of 9 places in 233 ms of which 1 ms to minimize.
[2022-06-12 21:31:38] [INFO ] Deduced a trap composed of 5 places in 214 ms of which 1 ms to minimize.
[2022-06-12 21:31:38] [INFO ] Deduced a trap composed of 9 places in 216 ms of which 1 ms to minimize.
[2022-06-12 21:31:38] [INFO ] Deduced a trap composed of 6 places in 210 ms of which 1 ms to minimize.
[2022-06-12 21:31:39] [INFO ] Deduced a trap composed of 5 places in 210 ms of which 1 ms to minimize.
[2022-06-12 21:31:39] [INFO ] Deduced a trap composed of 10 places in 209 ms of which 0 ms to minimize.
[2022-06-12 21:31:39] [INFO ] Deduced a trap composed of 13 places in 206 ms of which 1 ms to minimize.
[2022-06-12 21:31:39] [INFO ] Deduced a trap composed of 6 places in 208 ms of which 0 ms to minimize.
[2022-06-12 21:31:40] [INFO ] Deduced a trap composed of 11 places in 210 ms of which 1 ms to minimize.
[2022-06-12 21:31:40] [INFO ] Deduced a trap composed of 12 places in 199 ms of which 1 ms to minimize.
[2022-06-12 21:31:40] [INFO ] Deduced a trap composed of 17 places in 195 ms of which 1 ms to minimize.
[2022-06-12 21:31:41] [INFO ] Deduced a trap composed of 6 places in 176 ms of which 1 ms to minimize.
[2022-06-12 21:31:41] [INFO ] Deduced a trap composed of 9 places in 183 ms of which 0 ms to minimize.
[2022-06-12 21:31:41] [INFO ] Deduced a trap composed of 10 places in 179 ms of which 1 ms to minimize.
[2022-06-12 21:31:41] [INFO ] Deduced a trap composed of 7 places in 191 ms of which 0 ms to minimize.
[2022-06-12 21:31:42] [INFO ] Deduced a trap composed of 9 places in 183 ms of which 0 ms to minimize.
[2022-06-12 21:31:42] [INFO ] Deduced a trap composed of 8 places in 189 ms of which 1 ms to minimize.
[2022-06-12 21:31:42] [INFO ] Deduced a trap composed of 16 places in 183 ms of which 1 ms to minimize.
[2022-06-12 21:31:43] [INFO ] Deduced a trap composed of 8 places in 209 ms of which 1 ms to minimize.
[2022-06-12 21:31:43] [INFO ] Deduced a trap composed of 8 places in 200 ms of which 0 ms to minimize.
[2022-06-12 21:31:43] [INFO ] Deduced a trap composed of 11 places in 198 ms of which 0 ms to minimize.
[2022-06-12 21:31:43] [INFO ] Deduced a trap composed of 10 places in 203 ms of which 0 ms to minimize.
[2022-06-12 21:31:44] [INFO ] Deduced a trap composed of 14 places in 185 ms of which 0 ms to minimize.
[2022-06-12 21:31:44] [INFO ] Deduced a trap composed of 18 places in 180 ms of which 1 ms to minimize.
[2022-06-12 21:31:44] [INFO ] Deduced a trap composed of 16 places in 184 ms of which 0 ms to minimize.
[2022-06-12 21:31:45] [INFO ] Deduced a trap composed of 10 places in 183 ms of which 1 ms to minimize.
[2022-06-12 21:31:45] [INFO ] Deduced a trap composed of 7 places in 172 ms of which 0 ms to minimize.
[2022-06-12 21:31:45] [INFO ] Deduced a trap composed of 7 places in 159 ms of which 1 ms to minimize.
[2022-06-12 21:31:45] [INFO ] Deduced a trap composed of 14 places in 159 ms of which 1 ms to minimize.
[2022-06-12 21:31:46] [INFO ] Deduced a trap composed of 11 places in 163 ms of which 1 ms to minimize.
[2022-06-12 21:31:46] [INFO ] Deduced a trap composed of 11 places in 152 ms of which 0 ms to minimize.
[2022-06-12 21:31:46] [INFO ] Deduced a trap composed of 16 places in 140 ms of which 0 ms to minimize.
[2022-06-12 21:31:46] [INFO ] Deduced a trap composed of 11 places in 143 ms of which 1 ms to minimize.
[2022-06-12 21:31:47] [INFO ] Deduced a trap composed of 11 places in 135 ms of which 0 ms to minimize.
[2022-06-12 21:31:47] [INFO ] Trap strengthening (SAT) tested/added 44/43 trap constraints in 12605 ms
[2022-06-12 21:31:47] [INFO ] Computed and/alt/rep : 2380/11379/2380 causal constraints (skipped 94 transitions) in 129 ms.
[2022-06-12 21:32:07] [INFO ] Added : 560 causal constraints over 112 iterations in 20164 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 46 ms.
Incomplete Parikh walk after 367200 steps, including 1014 resets, run finished after 5558 ms. (steps per millisecond=66 ) properties (out of 2) seen :0 could not realise parikh vector
Incomplete Parikh walk after 352400 steps, including 2089 resets, run finished after 4007 ms. (steps per millisecond=87 ) properties (out of 2) seen :0 could not realise parikh vector
Support contains 98 out of 2591 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2591/2591 places, 2492/2492 transitions.
Applied a total of 0 rules in 103 ms. Remains 2591 /2591 variables (removed 0) and now considering 2492/2492 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2591/2591 places, 2492/2492 transitions.
Starting structural reductions, iteration 0 : 2591/2591 places, 2492/2492 transitions.
Applied a total of 0 rules in 100 ms. Remains 2591 /2591 variables (removed 0) and now considering 2492/2492 (removed 0) transitions.
// Phase 1: matrix 2492 rows 2591 cols
[2022-06-12 21:32:17] [INFO ] Computed 900 place invariants in 55 ms
[2022-06-12 21:32:19] [INFO ] Implicit Places using invariants in 1749 ms returned []
// Phase 1: matrix 2492 rows 2591 cols
[2022-06-12 21:32:19] [INFO ] Computed 900 place invariants in 52 ms
[2022-06-12 21:32:23] [INFO ] Implicit Places using invariants and state equation in 4417 ms returned []
Implicit Place search using SMT with State Equation took 6168 ms to find 0 implicit places.
[2022-06-12 21:32:23] [INFO ] Redundant transitions in 326 ms returned []
// Phase 1: matrix 2492 rows 2591 cols
[2022-06-12 21:32:23] [INFO ] Computed 900 place invariants in 44 ms
[2022-06-12 21:32:25] [INFO ] Dead Transitions using invariants and state equation in 1660 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2591/2591 places, 2492/2492 transitions.
Incomplete random walk after 100000 steps, including 11 resets, run finished after 1704 ms. (steps per millisecond=58 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 2492 rows 2591 cols
[2022-06-12 21:32:27] [INFO ] Computed 900 place invariants in 48 ms
[2022-06-12 21:32:27] [INFO ] [Real]Absence check using 886 positive place invariants in 221 ms returned sat
[2022-06-12 21:32:27] [INFO ] [Real]Absence check using 886 positive and 14 generalized place invariants in 4 ms returned sat
[2022-06-12 21:32:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:32:29] [INFO ] [Real]Absence check using state equation in 1456 ms returned sat
[2022-06-12 21:32:29] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:32:29] [INFO ] [Nat]Absence check using 886 positive place invariants in 224 ms returned sat
[2022-06-12 21:32:29] [INFO ] [Nat]Absence check using 886 positive and 14 generalized place invariants in 4 ms returned sat
[2022-06-12 21:32:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:32:31] [INFO ] [Nat]Absence check using state equation in 1677 ms returned sat
[2022-06-12 21:32:31] [INFO ] Deduced a trap composed of 7 places in 180 ms of which 1 ms to minimize.
[2022-06-12 21:32:32] [INFO ] Deduced a trap composed of 4 places in 180 ms of which 1 ms to minimize.
[2022-06-12 21:32:32] [INFO ] Deduced a trap composed of 4 places in 181 ms of which 1 ms to minimize.
[2022-06-12 21:32:32] [INFO ] Deduced a trap composed of 18 places in 172 ms of which 1 ms to minimize.
[2022-06-12 21:32:32] [INFO ] Deduced a trap composed of 5 places in 161 ms of which 0 ms to minimize.
[2022-06-12 21:32:33] [INFO ] Deduced a trap composed of 8 places in 219 ms of which 0 ms to minimize.
[2022-06-12 21:32:33] [INFO ] Deduced a trap composed of 6 places in 178 ms of which 0 ms to minimize.
[2022-06-12 21:32:33] [INFO ] Deduced a trap composed of 7 places in 157 ms of which 0 ms to minimize.
[2022-06-12 21:32:33] [INFO ] Deduced a trap composed of 9 places in 149 ms of which 0 ms to minimize.
[2022-06-12 21:32:34] [INFO ] Deduced a trap composed of 7 places in 150 ms of which 0 ms to minimize.
[2022-06-12 21:32:34] [INFO ] Deduced a trap composed of 3 places in 144 ms of which 0 ms to minimize.
[2022-06-12 21:32:34] [INFO ] Deduced a trap composed of 10 places in 147 ms of which 1 ms to minimize.
[2022-06-12 21:32:34] [INFO ] Deduced a trap composed of 8 places in 151 ms of which 0 ms to minimize.
[2022-06-12 21:32:35] [INFO ] Deduced a trap composed of 6 places in 142 ms of which 0 ms to minimize.
[2022-06-12 21:32:35] [INFO ] Deduced a trap composed of 6 places in 140 ms of which 0 ms to minimize.
[2022-06-12 21:32:35] [INFO ] Deduced a trap composed of 7 places in 144 ms of which 0 ms to minimize.
[2022-06-12 21:32:35] [INFO ] Deduced a trap composed of 8 places in 130 ms of which 0 ms to minimize.
[2022-06-12 21:32:36] [INFO ] Deduced a trap composed of 15 places in 128 ms of which 0 ms to minimize.
[2022-06-12 21:32:36] [INFO ] Deduced a trap composed of 14 places in 132 ms of which 0 ms to minimize.
[2022-06-12 21:32:36] [INFO ] Deduced a trap composed of 10 places in 112 ms of which 0 ms to minimize.
[2022-06-12 21:32:36] [INFO ] Deduced a trap composed of 20 places in 117 ms of which 1 ms to minimize.
[2022-06-12 21:32:36] [INFO ] Deduced a trap composed of 16 places in 110 ms of which 1 ms to minimize.
[2022-06-12 21:32:37] [INFO ] Deduced a trap composed of 8 places in 111 ms of which 0 ms to minimize.
[2022-06-12 21:32:37] [INFO ] Deduced a trap composed of 12 places in 101 ms of which 1 ms to minimize.
[2022-06-12 21:32:37] [INFO ] Deduced a trap composed of 20 places in 100 ms of which 0 ms to minimize.
[2022-06-12 21:32:37] [INFO ] Deduced a trap composed of 25 places in 102 ms of which 0 ms to minimize.
[2022-06-12 21:32:37] [INFO ] Deduced a trap composed of 19 places in 105 ms of which 1 ms to minimize.
[2022-06-12 21:32:37] [INFO ] Trap strengthening (SAT) tested/added 28/27 trap constraints in 6481 ms
[2022-06-12 21:32:38] [INFO ] Computed and/alt/rep : 2380/11379/2380 causal constraints (skipped 94 transitions) in 164 ms.
[2022-06-12 21:32:49] [INFO ] Added : 340 causal constraints over 68 iterations in 11367 ms. Result :unknown
[2022-06-12 21:32:49] [INFO ] [Real]Absence check using 886 positive place invariants in 231 ms returned sat
[2022-06-12 21:32:49] [INFO ] [Real]Absence check using 886 positive and 14 generalized place invariants in 4 ms returned sat
[2022-06-12 21:32:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:32:51] [INFO ] [Real]Absence check using state equation in 1618 ms returned sat
[2022-06-12 21:32:51] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:32:52] [INFO ] [Nat]Absence check using 886 positive place invariants in 231 ms returned sat
[2022-06-12 21:32:52] [INFO ] [Nat]Absence check using 886 positive and 14 generalized place invariants in 4 ms returned sat
[2022-06-12 21:32:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:32:53] [INFO ] [Nat]Absence check using state equation in 1761 ms returned sat
[2022-06-12 21:32:54] [INFO ] Deduced a trap composed of 5 places in 238 ms of which 0 ms to minimize.
[2022-06-12 21:32:54] [INFO ] Deduced a trap composed of 8 places in 233 ms of which 1 ms to minimize.
[2022-06-12 21:32:54] [INFO ] Deduced a trap composed of 8 places in 220 ms of which 1 ms to minimize.
[2022-06-12 21:32:55] [INFO ] Deduced a trap composed of 4 places in 233 ms of which 1 ms to minimize.
[2022-06-12 21:32:55] [INFO ] Deduced a trap composed of 10 places in 234 ms of which 1 ms to minimize.
[2022-06-12 21:32:55] [INFO ] Deduced a trap composed of 6 places in 222 ms of which 0 ms to minimize.
[2022-06-12 21:32:56] [INFO ] Deduced a trap composed of 6 places in 228 ms of which 0 ms to minimize.
[2022-06-12 21:32:56] [INFO ] Deduced a trap composed of 9 places in 227 ms of which 1 ms to minimize.
[2022-06-12 21:32:56] [INFO ] Deduced a trap composed of 4 places in 219 ms of which 0 ms to minimize.
[2022-06-12 21:32:57] [INFO ] Deduced a trap composed of 9 places in 220 ms of which 0 ms to minimize.
[2022-06-12 21:32:57] [INFO ] Deduced a trap composed of 5 places in 227 ms of which 0 ms to minimize.
[2022-06-12 21:32:57] [INFO ] Deduced a trap composed of 9 places in 223 ms of which 0 ms to minimize.
[2022-06-12 21:32:57] [INFO ] Deduced a trap composed of 6 places in 203 ms of which 1 ms to minimize.
[2022-06-12 21:32:58] [INFO ] Deduced a trap composed of 5 places in 199 ms of which 0 ms to minimize.
[2022-06-12 21:32:58] [INFO ] Deduced a trap composed of 10 places in 216 ms of which 1 ms to minimize.
[2022-06-12 21:32:58] [INFO ] Deduced a trap composed of 13 places in 214 ms of which 1 ms to minimize.
[2022-06-12 21:32:59] [INFO ] Deduced a trap composed of 6 places in 221 ms of which 0 ms to minimize.
[2022-06-12 21:32:59] [INFO ] Deduced a trap composed of 11 places in 214 ms of which 1 ms to minimize.
[2022-06-12 21:32:59] [INFO ] Deduced a trap composed of 12 places in 195 ms of which 0 ms to minimize.
[2022-06-12 21:33:00] [INFO ] Deduced a trap composed of 17 places in 199 ms of which 0 ms to minimize.
[2022-06-12 21:33:00] [INFO ] Deduced a trap composed of 6 places in 200 ms of which 1 ms to minimize.
[2022-06-12 21:33:00] [INFO ] Deduced a trap composed of 9 places in 186 ms of which 0 ms to minimize.
[2022-06-12 21:33:00] [INFO ] Deduced a trap composed of 10 places in 192 ms of which 1 ms to minimize.
[2022-06-12 21:33:01] [INFO ] Deduced a trap composed of 7 places in 224 ms of which 1 ms to minimize.
[2022-06-12 21:33:01] [INFO ] Deduced a trap composed of 9 places in 185 ms of which 1 ms to minimize.
[2022-06-12 21:33:01] [INFO ] Deduced a trap composed of 8 places in 197 ms of which 0 ms to minimize.
[2022-06-12 21:33:02] [INFO ] Deduced a trap composed of 16 places in 188 ms of which 1 ms to minimize.
[2022-06-12 21:33:02] [INFO ] Deduced a trap composed of 8 places in 215 ms of which 0 ms to minimize.
[2022-06-12 21:33:02] [INFO ] Deduced a trap composed of 8 places in 209 ms of which 1 ms to minimize.
[2022-06-12 21:33:03] [INFO ] Deduced a trap composed of 11 places in 207 ms of which 0 ms to minimize.
[2022-06-12 21:33:03] [INFO ] Deduced a trap composed of 10 places in 230 ms of which 1 ms to minimize.
[2022-06-12 21:33:03] [INFO ] Deduced a trap composed of 14 places in 218 ms of which 0 ms to minimize.
[2022-06-12 21:33:04] [INFO ] Deduced a trap composed of 18 places in 214 ms of which 0 ms to minimize.
[2022-06-12 21:33:04] [INFO ] Deduced a trap composed of 16 places in 215 ms of which 0 ms to minimize.
[2022-06-12 21:33:04] [INFO ] Deduced a trap composed of 10 places in 182 ms of which 1 ms to minimize.
[2022-06-12 21:33:04] [INFO ] Deduced a trap composed of 7 places in 193 ms of which 1 ms to minimize.
[2022-06-12 21:33:05] [INFO ] Deduced a trap composed of 7 places in 165 ms of which 1 ms to minimize.
[2022-06-12 21:33:05] [INFO ] Deduced a trap composed of 14 places in 169 ms of which 0 ms to minimize.
[2022-06-12 21:33:05] [INFO ] Deduced a trap composed of 11 places in 151 ms of which 1 ms to minimize.
[2022-06-12 21:33:05] [INFO ] Deduced a trap composed of 11 places in 150 ms of which 0 ms to minimize.
[2022-06-12 21:33:06] [INFO ] Deduced a trap composed of 16 places in 141 ms of which 0 ms to minimize.
[2022-06-12 21:33:06] [INFO ] Deduced a trap composed of 11 places in 139 ms of which 0 ms to minimize.
[2022-06-12 21:33:06] [INFO ] Deduced a trap composed of 11 places in 136 ms of which 0 ms to minimize.
[2022-06-12 21:33:06] [INFO ] Trap strengthening (SAT) tested/added 44/43 trap constraints in 12908 ms
[2022-06-12 21:33:06] [INFO ] Computed and/alt/rep : 2380/11379/2380 causal constraints (skipped 94 transitions) in 133 ms.
[2022-06-12 21:33:13] [INFO ] Deduced a trap composed of 2 places in 2145 ms of which 3 ms to minimize.
[2022-06-12 21:33:13] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
[2022-06-12 21:33:13] [INFO ] Flatten gal took : 132 ms
[2022-06-12 21:33:13] [INFO ] Flatten gal took : 133 ms
[2022-06-12 21:33:14] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2579186811799404241.gal : 14 ms
[2022-06-12 21:33:14] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5370050551197506103.prop : 2 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality2579186811799404241.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality5370050551197506103.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/ReachabilityCardinality2579186811799404241.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality5370050551197506103.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality5370050551197506103.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :4 after 8
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :8 after 14
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :14 after 38
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :38 after 758
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :758 after 54434
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :54434 after 163298
Detected timeout of ITS tools.
[2022-06-12 21:33:29] [INFO ] Flatten gal took : 130 ms
[2022-06-12 21:33:29] [INFO ] Applying decomposition
[2022-06-12 21:33:29] [INFO ] Flatten gal took : 149 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/graph14608647249883867891.txt, -o, /tmp/graph14608647249883867891.bin, -w, /tmp/graph14608647249883867891.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/graph14608647249883867891.bin, -l, -1, -v, -w, /tmp/graph14608647249883867891.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-12 21:33:29] [INFO ] Decomposing Gal with order
[2022-06-12 21:33:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-12 21:33:30] [INFO ] Removed a total of 1938 redundant transitions.
[2022-06-12 21:33:30] [INFO ] Flatten gal took : 177 ms
[2022-06-12 21:33:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 1719 labels/synchronizations in 225 ms.
[2022-06-12 21:33:30] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13188436773070422507.gal : 19 ms
[2022-06-12 21:33:30] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality399785467663169078.prop : 74 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/ReachabilityCardinality13188436773070422507.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality399785467663169078.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/ReachabilityCardinality13188436773070422507.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality399785467663169078.prop --nowitness
Loading property file /tmp/ReachabilityCardinality399785467663169078.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 6
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :6 after 18
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :18 after 30
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :30 after 150
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :150 after 150
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :150 after 150
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin295258694260205941
[2022-06-12 21:33:45] [INFO ] Built C files in 35ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin295258694260205941
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/ltsmin295258694260205941]
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/ltsmin295258694260205941] 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/ltsmin295258694260205941] 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 91 ms. Remains 2591 /2591 variables (removed 0) and now considering 2492/2492 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 2492 rows 2591 cols
[2022-06-12 21:33:46] [INFO ] Computed 900 place invariants in 44 ms
[2022-06-12 21:33:47] [INFO ] [Real]Absence check using 886 positive place invariants in 187 ms returned sat
[2022-06-12 21:33:47] [INFO ] [Real]Absence check using 886 positive and 14 generalized place invariants in 3 ms returned sat
[2022-06-12 21:33:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:33:48] [INFO ] [Real]Absence check using state equation in 1312 ms returned sat
[2022-06-12 21:33:48] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:33:49] [INFO ] [Nat]Absence check using 886 positive place invariants in 213 ms returned sat
[2022-06-12 21:33:49] [INFO ] [Nat]Absence check using 886 positive and 14 generalized place invariants in 3 ms returned sat
[2022-06-12 21:33:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:33:50] [INFO ] [Nat]Absence check using state equation in 1506 ms returned sat
[2022-06-12 21:33:50] [INFO ] Deduced a trap composed of 7 places in 171 ms of which 1 ms to minimize.
[2022-06-12 21:33:51] [INFO ] Deduced a trap composed of 4 places in 181 ms of which 0 ms to minimize.
[2022-06-12 21:33:51] [INFO ] Deduced a trap composed of 4 places in 169 ms of which 1 ms to minimize.
[2022-06-12 21:33:51] [INFO ] Deduced a trap composed of 18 places in 163 ms of which 1 ms to minimize.
[2022-06-12 21:33:51] [INFO ] Deduced a trap composed of 5 places in 161 ms of which 3 ms to minimize.
[2022-06-12 21:33:52] [INFO ] Deduced a trap composed of 8 places in 157 ms of which 0 ms to minimize.
[2022-06-12 21:33:52] [INFO ] Deduced a trap composed of 6 places in 156 ms of which 1 ms to minimize.
[2022-06-12 21:33:52] [INFO ] Deduced a trap composed of 7 places in 134 ms of which 1 ms to minimize.
[2022-06-12 21:33:52] [INFO ] Deduced a trap composed of 9 places in 167 ms of which 0 ms to minimize.
[2022-06-12 21:33:53] [INFO ] Deduced a trap composed of 7 places in 146 ms of which 1 ms to minimize.
[2022-06-12 21:33:53] [INFO ] Deduced a trap composed of 3 places in 139 ms of which 1 ms to minimize.
[2022-06-12 21:33:53] [INFO ] Deduced a trap composed of 10 places in 126 ms of which 1 ms to minimize.
[2022-06-12 21:33:53] [INFO ] Deduced a trap composed of 8 places in 139 ms of which 0 ms to minimize.
[2022-06-12 21:33:53] [INFO ] Deduced a trap composed of 6 places in 138 ms of which 0 ms to minimize.
[2022-06-12 21:33:54] [INFO ] Deduced a trap composed of 6 places in 126 ms of which 1 ms to minimize.
[2022-06-12 21:33:54] [INFO ] Deduced a trap composed of 7 places in 143 ms of which 1 ms to minimize.
[2022-06-12 21:33:54] [INFO ] Deduced a trap composed of 8 places in 120 ms of which 0 ms to minimize.
[2022-06-12 21:33:54] [INFO ] Deduced a trap composed of 15 places in 140 ms of which 1 ms to minimize.
[2022-06-12 21:33:55] [INFO ] Deduced a trap composed of 14 places in 148 ms of which 1 ms to minimize.
[2022-06-12 21:33:55] [INFO ] Deduced a trap composed of 10 places in 137 ms of which 0 ms to minimize.
[2022-06-12 21:33:55] [INFO ] Deduced a trap composed of 20 places in 127 ms of which 1 ms to minimize.
[2022-06-12 21:33:55] [INFO ] Deduced a trap composed of 16 places in 104 ms of which 0 ms to minimize.
[2022-06-12 21:33:55] [INFO ] Deduced a trap composed of 8 places in 105 ms of which 1 ms to minimize.
[2022-06-12 21:33:56] [INFO ] Deduced a trap composed of 12 places in 116 ms of which 0 ms to minimize.
[2022-06-12 21:33:56] [INFO ] Deduced a trap composed of 20 places in 100 ms of which 0 ms to minimize.
[2022-06-12 21:33:56] [INFO ] Deduced a trap composed of 25 places in 96 ms of which 0 ms to minimize.
[2022-06-12 21:33:56] [INFO ] Deduced a trap composed of 19 places in 107 ms of which 1 ms to minimize.
[2022-06-12 21:33:56] [INFO ] Trap strengthening (SAT) tested/added 28/27 trap constraints in 6262 ms
[2022-06-12 21:33:56] [INFO ] Computed and/alt/rep : 2380/11379/2380 causal constraints (skipped 94 transitions) in 124 ms.
[2022-06-12 21:34:17] [INFO ] Added : 550 causal constraints over 110 iterations in 20232 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 43 ms.
[2022-06-12 21:34:17] [INFO ] [Real]Absence check using 886 positive place invariants in 232 ms returned sat
[2022-06-12 21:34:17] [INFO ] [Real]Absence check using 886 positive and 14 generalized place invariants in 4 ms returned sat
[2022-06-12 21:34:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:34:19] [INFO ] [Real]Absence check using state equation in 1581 ms returned sat
[2022-06-12 21:34:19] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:34:19] [INFO ] [Nat]Absence check using 886 positive place invariants in 229 ms returned sat
[2022-06-12 21:34:19] [INFO ] [Nat]Absence check using 886 positive and 14 generalized place invariants in 4 ms returned sat
[2022-06-12 21:34:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:34:21] [INFO ] [Nat]Absence check using state equation in 1755 ms returned sat
[2022-06-12 21:34:21] [INFO ] Deduced a trap composed of 5 places in 225 ms of which 0 ms to minimize.
[2022-06-12 21:34:22] [INFO ] Deduced a trap composed of 8 places in 230 ms of which 1 ms to minimize.
[2022-06-12 21:34:22] [INFO ] Deduced a trap composed of 8 places in 215 ms of which 1 ms to minimize.
[2022-06-12 21:34:22] [INFO ] Deduced a trap composed of 4 places in 221 ms of which 0 ms to minimize.
[2022-06-12 21:34:23] [INFO ] Deduced a trap composed of 10 places in 216 ms of which 1 ms to minimize.
[2022-06-12 21:34:23] [INFO ] Deduced a trap composed of 6 places in 209 ms of which 1 ms to minimize.
[2022-06-12 21:34:23] [INFO ] Deduced a trap composed of 6 places in 213 ms of which 1 ms to minimize.
[2022-06-12 21:34:24] [INFO ] Deduced a trap composed of 9 places in 224 ms of which 1 ms to minimize.
[2022-06-12 21:34:24] [INFO ] Deduced a trap composed of 4 places in 214 ms of which 1 ms to minimize.
[2022-06-12 21:34:24] [INFO ] Deduced a trap composed of 9 places in 243 ms of which 1 ms to minimize.
[2022-06-12 21:34:25] [INFO ] Deduced a trap composed of 5 places in 197 ms of which 1 ms to minimize.
[2022-06-12 21:34:25] [INFO ] Deduced a trap composed of 9 places in 197 ms of which 1 ms to minimize.
[2022-06-12 21:34:25] [INFO ] Deduced a trap composed of 6 places in 201 ms of which 1 ms to minimize.
[2022-06-12 21:34:25] [INFO ] Deduced a trap composed of 5 places in 209 ms of which 1 ms to minimize.
[2022-06-12 21:34:26] [INFO ] Deduced a trap composed of 10 places in 214 ms of which 1 ms to minimize.
[2022-06-12 21:34:26] [INFO ] Deduced a trap composed of 13 places in 217 ms of which 1 ms to minimize.
[2022-06-12 21:34:26] [INFO ] Deduced a trap composed of 6 places in 208 ms of which 0 ms to minimize.
[2022-06-12 21:34:27] [INFO ] Deduced a trap composed of 11 places in 202 ms of which 0 ms to minimize.
[2022-06-12 21:34:27] [INFO ] Deduced a trap composed of 12 places in 196 ms of which 0 ms to minimize.
[2022-06-12 21:34:27] [INFO ] Deduced a trap composed of 17 places in 197 ms of which 0 ms to minimize.
[2022-06-12 21:34:27] [INFO ] Deduced a trap composed of 6 places in 190 ms of which 1 ms to minimize.
[2022-06-12 21:34:28] [INFO ] Deduced a trap composed of 9 places in 183 ms of which 1 ms to minimize.
[2022-06-12 21:34:28] [INFO ] Deduced a trap composed of 10 places in 183 ms of which 0 ms to minimize.
[2022-06-12 21:34:28] [INFO ] Deduced a trap composed of 7 places in 186 ms of which 1 ms to minimize.
[2022-06-12 21:34:29] [INFO ] Deduced a trap composed of 9 places in 171 ms of which 0 ms to minimize.
[2022-06-12 21:34:29] [INFO ] Deduced a trap composed of 8 places in 185 ms of which 1 ms to minimize.
[2022-06-12 21:34:29] [INFO ] Deduced a trap composed of 16 places in 175 ms of which 1 ms to minimize.
[2022-06-12 21:34:29] [INFO ] Deduced a trap composed of 8 places in 196 ms of which 0 ms to minimize.
[2022-06-12 21:34:30] [INFO ] Deduced a trap composed of 8 places in 222 ms of which 1 ms to minimize.
[2022-06-12 21:34:30] [INFO ] Deduced a trap composed of 11 places in 210 ms of which 0 ms to minimize.
[2022-06-12 21:34:30] [INFO ] Deduced a trap composed of 10 places in 207 ms of which 1 ms to minimize.
[2022-06-12 21:34:31] [INFO ] Deduced a trap composed of 14 places in 202 ms of which 0 ms to minimize.
[2022-06-12 21:34:31] [INFO ] Deduced a trap composed of 18 places in 198 ms of which 1 ms to minimize.
[2022-06-12 21:34:31] [INFO ] Deduced a trap composed of 16 places in 198 ms of which 1 ms to minimize.
[2022-06-12 21:34:32] [INFO ] Deduced a trap composed of 10 places in 188 ms of which 1 ms to minimize.
[2022-06-12 21:34:32] [INFO ] Deduced a trap composed of 7 places in 175 ms of which 1 ms to minimize.
[2022-06-12 21:34:32] [INFO ] Deduced a trap composed of 7 places in 169 ms of which 0 ms to minimize.
[2022-06-12 21:34:32] [INFO ] Deduced a trap composed of 14 places in 165 ms of which 0 ms to minimize.
[2022-06-12 21:34:33] [INFO ] Deduced a trap composed of 11 places in 156 ms of which 1 ms to minimize.
[2022-06-12 21:34:33] [INFO ] Deduced a trap composed of 11 places in 162 ms of which 1 ms to minimize.
[2022-06-12 21:34:33] [INFO ] Deduced a trap composed of 16 places in 146 ms of which 0 ms to minimize.
[2022-06-12 21:34:33] [INFO ] Deduced a trap composed of 11 places in 150 ms of which 1 ms to minimize.
[2022-06-12 21:34:34] [INFO ] Deduced a trap composed of 11 places in 137 ms of which 0 ms to minimize.
[2022-06-12 21:34:34] [INFO ] Trap strengthening (SAT) tested/added 44/43 trap constraints in 12618 ms
[2022-06-12 21:34:34] [INFO ] Computed and/alt/rep : 2380/11379/2380 causal constraints (skipped 94 transitions) in 144 ms.
[2022-06-12 21:34:54] [INFO ] Added : 540 causal constraints over 108 iterations in 20078 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 43 ms.
[2022-06-12 21:34:54] [INFO ] Flatten gal took : 124 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin11045202155536283619
[2022-06-12 21:34:54] [INFO ] Too many transitions (2492) to apply POR reductions. Disabling POR matrices.
[2022-06-12 21:34:54] [INFO ] Built C files in 61ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11045202155536283619
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/ltsmin11045202155536283619]
[2022-06-12 21:34:54] [INFO ] Applying decomposition
[2022-06-12 21:34:54] [INFO ] Flatten gal took : 174 ms
[2022-06-12 21:34:55] [INFO ] Flatten gal took : 150 ms
[2022-06-12 21:34:55] [INFO ] Input system was already deterministic with 2492 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/graph5298287023652999022.txt, -o, /tmp/graph5298287023652999022.bin, -w, /tmp/graph5298287023652999022.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/graph5298287023652999022.bin, -l, -1, -v, -w, /tmp/graph5298287023652999022.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-12 21:34:55] [INFO ] Decomposing Gal with order
[2022-06-12 21:34:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-12 21:34:55] [INFO ] Removed a total of 1971 redundant transitions.
[2022-06-12 21:34:55] [INFO ] Ran tautology test, simplified 0 / 2 in 901 ms.
[2022-06-12 21:34:55] [INFO ] Flatten gal took : 232 ms
[2022-06-12 21:34:56] [INFO ] BMC solution for property ShieldIIPs-PT-100B-ReachabilityFireability-08(UNSAT) depth K=0 took 73 ms
[2022-06-12 21:34:56] [INFO ] BMC solution for property ShieldIIPs-PT-100B-ReachabilityFireability-13(UNSAT) depth K=0 took 4 ms
[2022-06-12 21:34:56] [INFO ] BMC solution for property ShieldIIPs-PT-100B-ReachabilityFireability-08(UNSAT) depth K=1 took 21 ms
[2022-06-12 21:34:56] [INFO ] BMC solution for property ShieldIIPs-PT-100B-ReachabilityFireability-13(UNSAT) depth K=1 took 12 ms
[2022-06-12 21:34:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 2374 labels/synchronizations in 326 ms.
[2022-06-12 21:34:56] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability15214602077928249653.gal : 45 ms
[2022-06-12 21:34:56] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability14266909030302385464.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/ReachabilityFireability15214602077928249653.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityFireability14266909030302385464.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/ReachabilityFireability15214602077928249653.gal -t CGAL -reachable-file /tmp/ReachabilityFireability14266909030302385464.prop --nowitness
Loading property file /tmp/ReachabilityFireability14266909030302385464.prop.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 2492 rows 2591 cols
[2022-06-12 21:34:57] [INFO ] Computed 900 place invariants in 77 ms
inv : p42 + p43 + p1685 + p1688 + p1690 + p1692 = 1
inv : p4385 + p4387 = 1
inv : p42 + p43 + p137 + p139 = 1
inv : p4021 + p4023 + p4025 + p4027 = 1
inv : p42 + p43 + p2664 + p2666 + p2668 + p2670 + p2671 = 1
inv : p42 + p43 + p638 + p645 + p648 + p649 = 1
inv : p42 + p43 + p2953 + p2955 = 1
inv : p5493 + p5495 = 1
inv : p3740 + p3742 + p3744 + p3746 = 1
inv : p42 + p43 + p1307 + p1309 + p1311 + p1313 = 1
inv : p4008 + p4011 + p4012 = 1
inv : p3962 + p3964 + p3966 + p3968 = 1
inv : p42 + p43 + p288 + p290 = 1
inv : p42 + p43 + p1744 + p1747 + p1749 + p1751 = 1
inv : p42 + p43 + p2540 + p2542 = 1
inv : p4251 + p4253 = 1
inv : p4952 + p4957 + p4958 = 1
inv : p42 + p43 + p741 + p744 + p746 + p748 = 1
inv : p42 + p43 + p2581 + p2602 + p2604 = 1
inv : p4176 + p4177 + p4185 + p4190 + p4191 = 1
inv : p42 + p43 + p2688 + p2691 + p2693 + p2695 + p2696 = 1
inv : p3946 + p3948 = 1
inv : p42 + p43 + p2012 + p2014 = 1
inv : p42 + p43 + p2474 + p2477 + p2478 = 1
inv : p42 + p43 + p2442 + p2444 + p2446 + p2448 = 1
inv : p42 + p43 + p701 + p703 = 1
inv : p4421 + p4424 + p4425 = 1
inv : p5837 + p5842 + p5843 = 1
inv : p42 + p43 + p763 + p768 + p769 = 1
inv : p42 + p43 + p419 + p421 = 1
inv : p42 + p43 + p1596 + p1598 = 1
inv : p42 + p43 + p186 + p188 + p190 + p192 = 1
inv : p42 + p43 + p1009 + p1011 = 1
inv : p42 + p43 + p2379 + p2381 = 1
inv : p42 + p43 + p1862 + p1865 + p1867 + p1869 = 1
inv : p42 + p43 + p1425 + p1427 + p1429 + p1431 = 1
inv : p42 + p43 + p3192 + p3194 = 1
inv : p42 + p43 + p859 + p862 + p864 + p866 = 1
inv : p4566 + p4568 + p4570 + p4572 = 1
inv : p4271 + p4273 + p4275 + p4277 = 1
inv : p3710 + p3712 = 1
inv : p42 + p43 + p3116 + p3136 + p3138 + p3140 + p3141 + p3142 + p3144 = 1
inv : p42 + p43 + p2297 + p2302 + p2303 = 1
inv : p3903 + p3905 + p3907 + p3909 = 1
inv : p3559 + p3561 = 1
inv : p42 + p43 + p328 + p331 + p333 + p334 + p335 = 1
inv : p42 + p43 + p2792 + p2794 = 1
inv : p3529 + p3530 + p3536 + p3539 + p3540 = 1
inv : p42 + p43 + p298 + p300 = 1
inv : p42 + p43 + p3310 + p3312 = 1
inv : p3772 + p3775 + p3776 = 1
inv : p4326 + p4328 = 1
inv : p42 + p43 + p232 + p235 + p236 = 1
inv : p5968 + p5972 + p5974 = 1
inv : p42 + p43 + p2779 + p2781 = 1
inv : p3795 + p3797 = 1
inv : p4313 + p4315 = 1
inv : p42 + p43 + p1272 + p1275 + p1277 + p1279 = 1
inv : p42 + p43 + p2946 + p2949 + p2950 = 1
inv : p5333 + p5335 + p5337 + p5339 = 1
inv : p42 + p43 + p2737 + p2739 + p2741 + p2743 + p2744 = 1
inv : p4684 + p4686 + p4688 + p4690 = 1
inv : p4133 + p4135 = 1
inv : p5244 + p5246 = 1
inv : p42 + p43 + p357 + p359 = 1
inv : p5923 + p5925 + p5927 + p5929 = 1
inv : p42 + p43 + p1921 + p1924 + p1926 + p1928 = 1
inv : p42 + p43 + p2733 + p2735 = 1
inv : p42 + p43 + p1671 + p1673 = 1
inv : p42 + p43 + p2959 + p2961 + p2963 + p2965 = 1
inv : p42 + p43 + p1537 + p1539 = 1
inv : p4104 + p4107 + p4109 + p4111 = 1
inv : p4871 + p4874 + p4876 + p4878 + p4879 = 1
inv : p5274 + p5276 + p5278 + p5280 = 1
inv : p5654 + p5660 + p5663 + p5664 = 1
inv : p42 + p43 + p3182 + p3184 + p3185 + p3186 = 1
inv : p4090 + p4092 = 1
inv : p42 + p43 + p1353 + p1358 + p1359 = 1
inv : p42 + p43 + p3386 + p3388 + p3390 + p3392 = 1
inv : p42 + p43 + p2796 + p2798 + p2800 + p2802 = 1
inv : p4444 + p4446 = 1
inv : p42 + p43 + p770 + p772 = 1
inv : p42 + p43 + p2769 + p2774 + p2775 = 1
inv : p42 + p43 + p1050 + p1052 + p1054 + p1058 + p1063 + p1064 = 1
inv : p42 + p43 + p2678 + p2680 + p2682 + p2684 = 1
inv : p42 + p43 + p2235 + p2237 = 1
inv : p42 + p43 + p1484 + p1486 + p1488 + p1490 = 1
inv : p42 + p43 + p3327 + p3329 + p3331 + p3333 = 1
inv : p4241 + p4243 = 1
inv : p42 + p43 + p1050 + p1052 + p1068 + p1069 + p1070 = 1
inv : p5992 + p5995 + p5997 + p5999 = 1
inv : p42 + p43 + p3028 + p3030 = 1
inv : p42 + p43 + p583 + p585 = 1
inv : p42 + p43 + p2130 + p2132 = 1
inv : p42 + p43 + p2581 + p2619 + p2621 + p2623 + p2625 = 1
inv : p5506 + p5508 = 1
inv : p42 + p43 + p2071 + p2073 = 1
inv : p42 + p43 + p760 + p762 = 1
inv : p42 + p43 + p800 + p803 + p805 + p807 = 1
inv : p5451 + p5453 + p5455 + p5457 = 1
inv : p42 + p43 + p1368 + p1370 + p1372 + p1374 = 1
inv : p42 + p43 + p2530 + p2532 = 1
inv : p42 + p43 + p3359 + p3362 + p3363 = 1
inv : p42 + p43 + p124 + p126 = 1
inv : p42 + p43 + p129 + p131 + p133 + p135 = 1
inv : p5461 + p5464 + p5466 + p5468 + p5470 + p5471 = 1
inv : p42 + p43 + p2061 + p2066 + p2067 = 1
inv : p4490 + p4492 = 1
inv : p42 + p43 + p2581 + p2615 + p2617 = 1
inv : p42 + p43 + p2581 + p2592 + p2597 + p2598 = 1
inv : p4716 + p4721 + p4722 = 1
inv : p42 + p43 + p291 + p296 + p297 = 1
inv : p42 + p43 + p347 + p349 = 1
inv : p42 + p43 + p2084 + p2086 = 1
inv : p42 + p43 + p3407 + p3409 + p3441 + p3443 = 1
inv : p42 + p43 + p2710 + p2713 + p2714 = 1
inv : p42 + p43 + p586 + p591 + p592 = 1
inv : p4802 + p4804 + p4806 + p4808 = 1
inv : p5919 + p5921 = 1
inv : p42 + p43 + p2900 + p2902 + p2904 + p2906 = 1
inv : p42 + p43 + p832 + p834 = 1
inv : p5080 + p5082 = 1
inv : p4448 + p4450 + p4452 + p4454 = 1
inv : p42 + p43 + p3064 + p3069 + p3070 = 1
inv : p4176 + p4177 + p4208 + p4210 = 1
inv : p42 + p43 + p2304 + p2306 = 1
inv : p42 + p43 + p2025 + p2027 = 1
inv : p42 + p43 + p3407 + p3409 + p3445 + p3447 + p3449 + p3451 = 1
inv : p42 + p43 + p682 + p685 + p687 + p689 = 1
inv : p5254 + p5256 = 1
inv : p42 + p43 + p3323 + p3325 = 1
inv : p5628 + p5630 + p5632 + p5634 = 1
inv : p42 + p43 + p1022 + p1024 = 1
inv : p42 + p43 + p3407 + p3409 + p3415 + p3417 = 1
inv : p42 + p43 + p245 + p247 + p249 + p251 = 1
inv : p42 + p43 + p704 + p706 + p709 + p710 = 1
inv : p4834 + p4836 + p4837 + p4838 = 1
inv : p42 + p43 + p1838 + p1840 + p1842 + p1844 = 1
inv : p5070 + p5073 + p5074 = 1
inv : p42 + p43 + p432 + p434 = 1
inv : p42 + p43 + p1825 + p1830 + p1831 = 1
inv : p4139 + p4141 + p4143 + p4145 = 1
inv : p4723 + p4725 = 1
inv : p42 + p43 + p2717 + p2719 = 1
inv : p42 + p43 + p478 + p480 = 1
inv : p5129 + p5134 + p5135 = 1
inv : p4176 + p4212 + p4214 + p4216 + p4218 = 1
inv : p3529 + p3530 + p3533 + p3535 = 1
inv : p42 + p43 + p2157 + p2160 + p2162 + p2164 = 1
inv : p42 + p43 + p527 + p532 + p533 = 1
inv : p4844 + p4846 = 1
inv : p42 + p43 + p1288 + p1289 + p1294 + p1297 + p1298 = 1
inv : p42 + p43 + p1720 + p1722 + p1724 + p1726 = 1
inv : p4772 + p4774 = 1
inv : p42 + p43 + p3209 + p3211 + p3213 + p3215 = 1
inv : p5306 + p5309 + p5310 = 1
inv : p4428 + p4430 = 1
inv : p5510 + p5512 + p5514 + p5516 = 1
inv : p5844 + p5846 = 1
inv : p5864 + p5866 + p5868 + p5870 = 1
inv : p42 + p43 + p3205 + p3207 = 1
inv : p42 + p43 + p1235 + p1238 + p1239 = 1
inv : p5375 + p5377 = 1
inv : p42 + p43 + p593 + p595 = 1
inv : p42 + p43 + p3407 + p3409 + p3425 + p3427 = 1
inv : -p4483 - p4484 + p4485 + p4486 = 0
inv : p3529 + p3530 + p3543 + p3545 = 1
inv : p42 + p43 + p1730 + p1732 = 1
inv : -p5958 - p5959 + p5960 + p5961 = 0
inv : p4916 + p4918 = 1
inv : p5139 + p5141 = 1
inv : p42 + p43 + p1050 + p1052 + p1054 + p1055 + p1056 + p1057 = 1
inv : p42 + p43 + p1317 + p1319 = 1
inv : p4509 + p4511 + p4513 + p4515 = 1
inv : p42 + p43 + p891 + p893 = 1
inv : p42 + p43 + p3268 + p3270 + p3272 + p3274 = 1
inv : p4893 + p4896 + p4897 = 1
inv : p5378 + p5380 + p5382 + p5384 = 1
inv : p5416 + p5417 + p5434 + p5436 = 1
inv : p4657 + p4658 + p4660 + p4661 = 1
inv : p42 + p43 + p1167 + p1168 + p1176 + p1179 + p1180 = 1
inv : p42 + p43 + p904 + p906 = 1
inv : p1120 + p1121 - p1122 - p1123 = 0
inv : p42 + p3487 + p3489 = 1
inv : p42 + p43 + p1661 + p1663 + p1665 + p1667 = 1
inv : p42 + p43 + p2245 + p2247 = 1
inv : p5365 + p5368 + p5369 = 1
inv : p5388 + p5390 = 1
inv : p42 + p43 + p1891 + p1893 = 1
inv : p42 + p43 + p2533 + p2538 + p2539 = 1
inv : p4064 + p4066 = 1
inv : p42 + p43 + p1717 + p1719 = 1
inv : p4595 + p4597 = 1
inv : p42 + p43 + p881 + p884 + p885 = 1
inv : p42 + p43 + p1530 + p1535 + p1536 = 1
inv : p4782 + p4784 = 1
inv : p42 + p43 + p2658 + p2660 = 1
inv : p42 + p43 + p2487 + p2489 + p2491 + p2493 = 1
inv : p42 + p43 + p3407 + p3456 + p3458 + p3460 + p3462 + p3464 = 1
inv : p4847 + p4849 + p4851 + p4853 + p4854 = 1
inv : p4903 + p4905 = 1
inv : p42 + p43 + p2924 + p2927 + p2929 + p2931 = 1
inv : p42 + p43 + p822 + p827 + p828 = 1
inv : p42 + p43 + p1612 + p1614 = 1
inv : p4625 + p4627 + p4629 + p4631 = 1
inv : p42 + p43 + p387 + p390 + p392 + p394 = 1
inv : p42 + p43 + p3241 + p3246 + p3247 = 1
inv : p3785 + p3787 + p3789 + p3791 = 1
inv : p42 + p43 + p1602 + p1604 + p1606 + p1608 = 1
inv : p5021 + p5023 = 1
inv : p4267 + p4269 = 1
inv : p4369 + p4371 = 1
inv : p42 + p43 + p2002 + p2007 + p2008 = 1
inv : p3956 + p3958 = 1
inv : p3844 + p3846 + p3848 + p3850 = 1
inv : p5601 + p5604 + p5605 = 1
inv : p42 + p43 + p2983 + p2986 + p2988 + p2990 = 1
inv : p42 + p43 + p269 + p272 + p274 + p276 = 1
inv : p42 + p43 + p2098 + p2101 + p2103 + p2105 = 1
inv : p4122 + p4126 + p4128 + p4131 + p4132 = 1
inv : p42 + p43 + p3005 + p3010 + p3011 = 1
inv : p4082 + p4084 + p4086 + p4088 = 1
inv : p4713 + p4715 = 1
inv : p42 + p43 + p845 + p847 = 1
inv : p42 + p43 + p2546 + p2548 + p2550 + p2552 = 1
inv : p42 + p43 + p210 + p213 + p215 + p217 = 1
inv : p42 + p43 + p3042 + p3045 + p3047 + p3049 = 1
inv : p5834 + p5836 = 1
inv : p4074 + p4076 = 1
inv : p4504 + p4505 + p4506 = 1
inv : p42 + p43 + p1407 + p1408 + p1412 + p1417 + p1418 = 1
inv : p5906 + p5908 = 1
inv : p4176 + p4177 + p4195 + p4197 = 1
inv : p42 + p43 + p3146 + p3148 = 1
inv : p42 + p43 + p1897 + p1899 + p1901 + p1903 = 1
inv : p42 + p43 + p151 + p154 + p156 + p158 = 1
inv : p42 + p43 + p314 + p316 = 1
inv : p42 + p43 + p1881 + p1883 = 1
inv : p42 + p43 + p505 + p508 + p510 + p512 = 1
inv : p5716 + p5718 = 1
inv : p42 + p43 + p196 + p198 = 1
inv : p42 + p43 + p1779 + p1781 + p1783 + p1785 = 1
inv : p42 + p43 + p111 + p113 = 1
inv : p42 + p43 + p1422 + p1424 = 1
inv : p5319 + p5321 + p5323 + p5325 = 1
inv : p42 + p43 + p1167 + p1168 + p1189 + p1191 + p1193 + p1195 + p1196 = 1
inv : p4310 + p4312 = 1
inv : p42 + p43 + p2776 + p2778 = 1
inv : p42 + p43 + p3116 + p3133 + p3135 = 1
inv : p42 + p43 + p360 + p362 = 1
inv : p4188 + p4189 - p4190 - p4191 = 0
inv : p5552 + p5554 = 1
inv : p42 + p43 + p114 + p119 + p120 = 1
inv : p3868 + p3871 + p3873 + p3875 = 1
inv : p42 + p43 + p1557 + p1559 + p1561 + p1563 = 1
inv : p4670 + p4672 + p4674 + p4676 = 1
inv : p42 + p43 + p776 + p778 + p780 + p782 = 1
inv : p3772 + p3777 + p3778 = 1
inv : p42 + p43 + p2648 + p2650 = 1
inv : p5778 + p5783 + p5784 = 1
inv : p42 + p43 + p717 + p719 + p721 + p723 = 1
inv : p42 + p3477 + p3480 + p3481 = 1
inv : p42 + p43 + p2481 + p2483 = 1
inv : p42 + p43 + p3369 + p3371 = 1
inv : p42 + p43 + p894 + p896 + p898 + p900 = 1
inv : p42 + p43 + p1050 + p1052 + p1065 + p1067 = 1
inv : p4480 + p4483 + p4484 = 1
inv : p3986 + p3989 + p3991 + p3993 = 1
inv : p5569 + p5571 + p5573 + p5575 + p5577 + p5578 = 1
inv : p42 + p43 + p2570 + p2573 + p2575 + p2577 = 1
inv : p42 + p43 + p3313 + p3315 + p3317 + p3319 = 1
inv : p42 + p43 + p819 + p821 = 1
inv : p3736 + p3738 = 1
inv : p42 + p43 + p2710 + p2715 + p2716 = 1
inv : p3858 + p3860 + p3862 + p3864 = 1
inv : p3618 + p3620 = 1
inv : p42 + p43 + p3077 + p3079 + p3081 + p3083 = 1
inv : p42 + p43 + p2471 + p2473 = 1
inv : p5555 + p5557 + p5559 + p5561 = 1
inv : p42 + p43 + p2133 + p2135 + p2137 + p2139 = 1
inv : p42 + p43 + p2068 + p2070 = 1
inv : p3887 + p3889 = 1
inv : p4611 + p4613 + p4615 + p4617 = 1
inv : p42 + p43 + p2969 + p2971 = 1
inv : p42 + p43 + p2556 + p2558 = 1
inv : p5129 + p5132 + p5133 = 1
inv : p4067 + p4070 + p4071 = 1
inv : p4605 + p4607 = 1
inv : p42 + p43 + p2707 + p2709 = 1
inv : p5955 + p5958 + p5959 = 1
inv : p5490 + p5492 = 1
inv : p42 + p43 + p2533 + p2536 + p2537 = 1
inv : p42 + p43 + p2474 + p2479 + p2480 = 1
inv : p42 + p43 + p232 + p237 + p238 = 1
inv : p42 + p43 + p2543 + p2545 = 1
inv : p3654 + p3659 + p3660 = 1
inv : p42 + p43 + p481 + p483 + p485 + p487 = 1
inv : p5483 + p5486 + p5487 = 1
inv : p42 + p43 + p3307 + p3309 = 1
inv : p42 + p43 + p2009 + p2011 = 1
inv : p42 + p43 + p422 + p424 + p426 + p428 = 1
inv : p4316 + p4318 + p4320 + p4322 = 1
inv : p42 + p43 + p2294 + p2296 = 1
inv : p42 + p43 + p3300 + p3303 + p3304 = 1
inv : p5416 + p5417 + p5431 + p5433 = 1
inv : p5726 + p5728 = 1
inv : p42 + p43 + p1766 + p1771 + p1772 = 1
inv : p42 + p43 + p2307 + p2309 = 1
inv : p42 + p43 + p1363 + p1365 = 1
inv : p42 + p43 + p1321 + p1323 + p1325 + p1327 = 1
inv : p42 + p43 + p2851 + p2853 = 1
inv : p42 + p43 + p1012 + p1014 + p1016 + p1018 = 1
inv : p4244 + p4247 + p4248 = 1
inv : p42 + p43 + p2415 + p2418 + p2419 = 1
inv : p4975 + p4977 = 1
inv : p42 + p43 + p2039 + p2041 + p2042 + p2043 + p2044 + p2046 = 1
inv : p3949 + p3951 + p3952 + p3953 = 1
inv : p5775 + p5777 = 1
inv : p42 + p43 + p999 + p1002 + p1003 = 1
inv : p5611 + p5613 = 1
inv : p42 + p43 + p121 + p123 = 1
inv : p5978 + p5980 = 1
inv : p42 + p43 + p1884 + p1887 + p1888 = 1
inv : p42 + p43 + p638 + p655 + p656 + p657 = 1
inv : p42 + p43 + p141 + p143 + p145 + p147 = 1
inv : p42 + p43 + p1648 + p1653 + p1654 = 1
inv : p42 + p43 + p1763 + p1765 = 1
inv : p42 + p43 + p2356 + p2361 + p2362 = 1
inv : p42 + p43 + p609 + p611 = 1
inv : p42 + p43 + p1439 + p1441 + p1443 + p1445 = 1
inv : p4421 + p4426 + p4427 = 1
inv : p5545 + p5546 - p5547 - p5548 = 0
inv : p42 + p43 + p1567 + p1570 + p1572 + p1574 = 1
inv : p42 + p43 + p2841 + p2843 + p2845 + p2847 = 1
inv : p5416 + p5417 + p5421 + p5423 = 1
inv : p4788 + p4790 + p4792 + p4794 = 1
inv : p42 + p43 + p1980 + p1983 + p1985 + p1987 = 1
inv : p4831 + p4833 = 1
inv : p4539 + p4544 + p4545 = 1
inv : p42 + p43 + p2855 + p2857 + p2859 + p2861 = 1
inv : p42 + p43 + p2297 + p2300 + p2301 = 1
inv : p3949 + p3951 + p3954 + p3955 = 1
inv : p42 + p43 + p931 + p940 + p943 + p944 = 1
inv : p5270 + p5272 = 1
inv : p5785 + p5787 = 1
inv : p42 + p43 + p3160 + p3163 + p3165 + p3167 = 1
inv : p42 + p43 + p1943 + p1946 + p1947 = 1
inv : p42 + p43 + p2973 + p2975 + p2977 + p2979 = 1
inv : p42 + p43 + p436 + p438 + p440 + p442 = 1
inv : p42 + p43 + p888 + p890 = 1
inv : p42 + p43 + p1167 + p1168 + p1173 + p1175 = 1
inv : p5874 + p5877 + p5879 + p5881 = 1
inv : p42 + p43 + p1999 + p2001 = 1
inv : p42 + p43 + p1907 + p1909 = 1
inv : p5195 + p5197 = 1
inv : p3605 + p3607 = 1
inv : p42 + p43 + p1248 + p1250 + p1252 + p1254 = 1
inv : p4122 + p4126 + p4128 + p4129 + p4130 = 1
inv : p42 + p43 + p1822 + p1824 = 1
inv : p42 + p43 + p2179 + p2182 + p2183 = 1
inv : p42 + p43 + p727 + p729 + p730 = 1
inv : p4657 + p4658 + p4662 + p4663 = 1
inv : p5909 + p5911 + p5913 + p5915 = 1
inv : p42 + p43 + p2238 + p2241 + p2242 = 1
inv : p42 + p43 + p1970 + p1972 + p1974 + p1976 = 1
inv : p4431 + p4433 = 1
inv : p5097 + p5099 + p5101 + p5103 = 1
inv : p42 + p43 + p596 + p598 = 1
inv : p42 + p43 + p1353 + p1356 + p1357 = 1
inv : p42 + p43 + p586 + p589 + p590 = 1
inv : p5372 + p5374 = 1
inv : p42 + p43 + p495 + p497 + p499 + p501 = 1
inv : p4362 + p4363 + p4365 + p4366 = 1
inv : p42 + p43 + p1376 + p1378 = 1
inv : p5215 + p5217 + p5219 + p5221 = 1
inv : p4598 + p4603 + p4604 = 1
inv : p4153 + p4155 + p4157 + p4159 = 1
inv : p4920 + p4922 + p4924 + p4926 = 1
inv : p42 + p43 + p931 + p953 + p955 + p957 + p959 = 1
inv : p5480 + p5482 = 1
inv : p42 + p43 + p1114 + p1116 = 1
inv : p42 + p43 + p1527 + p1529 = 1
inv : p3972 + p3974 = 1
inv : p4841 + p4843 = 1
inv : p5847 + p5849 = 1
inv : p42 + p43 + p527 + p530 + p531 = 1
inv : p42 + p43 + p1435 + p1437 = 1
inv : p42 + p43 + p3116 + p3120 + p3122 = 1
inv : p42 + p43 + p183 + p185 = 1
inv : p42 + p43 + p1085 + p1087 + p1089 + p1091 = 1
inv : p42 + p43 + p829 + p831 = 1
inv : p42 + p43 + p3091 + p3093 + p3095 + p3097 = 1
inv : p42 + p43 + p2147 + p2149 + p2151 + p2153 = 1
inv : p42 + p43 + p373 + p375 = 1
inv : p4834 + p4836 + p4839 + p4840 = 1
inv : p3890 + p3895 + p3896 = 1
inv : p42 + p43 + p259 + p261 + p263 + p265 = 1
inv : p4861 + p4863 + p4865 + p4867 = 1
inv : p42 + p43 + p1589 + p1594 + p1595 = 1
inv : p42 + p43 + p613 + p615 + p617 + p619 = 1
inv : p3782 + p3784 = 1
inv : p4176 + p4177 + p4182 + p4184 = 1
inv : p5778 + p5781 + p5782 = 1
inv : p42 + p43 + p1117 + p1122 + p1123 = 1
inv : p42 + p43 + p2265 + p2267 + p2269 + p2271 = 1
inv : p5362 + p5364 = 1
inv : p42 + p43 + p1449 + p1452 + p1454 + p1456 = 1
inv : p4434 + p4436 + p4438 + p4440 = 1
inv : p42 + p43 + p1167 + p1168 + p1183 + p1185 = 1
inv : p4962 + p4964 = 1
inv : p42 + p43 + p2366 + p2368 = 1
inv : p42 + p43 + p2324 + p2326 + p2328 + p2330 = 1
inv : p5185 + p5187 = 1
inv : p42 + p43 + p878 + p880 = 1
inv : p5048 + p5051 + p5053 + p5055 + p5056 = 1
inv : p4621 + p4623 = 1
inv : p42 + p43 + p2943 + p2945 = 1
inv : p3720 + p3722 = 1
inv : p42 + p43 + p2143 + p2145 = 1
inv : p5070 + p5075 + p5076 = 1
inv : p42 + p43 + p2838 + p2840 = 1
inv : p42 + p43 + p3015 + p3017 = 1
inv : p4890 + p4892 = 1
inv : p5860 + p5862 = 1
inv : p42 + p43 + p2058 + p2060 = 1
inv : p4176 + p4177 + p4192 + p4194 = 1
inv : p42 + p43 + p1407 + p1419 + p1421 = 1
inv : p42 + p43 + p1235 + p1240 + p1241 = 1
inv : p4399 + p4402 + p4404 + p4406 = 1
inv : p3831 + p3836 + p3837 = 1
inv : p42 + p43 + p3255 + p3256 + p3258 + p3260 + p3262 = 1
inv : p4775 + p4780 + p4781 = 1
inv : p5654 + p5667 + p5669 = 1
inv : p3897 + p3899 = 1
inv : p5837 + p5840 + p5841 = 1
inv : p42 + p43 + p2560 + p2562 + p2564 + p2566 = 1
inv : p4094 + p4096 + p4098 + p4100 = 1
inv : p42 + p43 + p1124 + p1126 = 1
inv : p4893 + p4898 + p4899 = 1
inv : p5654 + p5657 + p5659 = 1
inv : p4372 + p4374 = 1
inv : p42 + p43 + p2002 + p2005 + p2006 = 1
inv : p42 + p43 + p524 + p526 = 1
inv : p42 + p43 + p3407 + p3409 + p3428 + p3430 = 1
inv : p42 + p43 + p534 + p536 = 1
inv : p42 + p43 + p1658 + p1660 = 1
inv : p42 + p43 + p2766 + p2768 = 1
inv : p3622 + p3624 + p3626 + p3628 = 1
inv : p42 + p43 + p468 + p471 + p472 = 1
inv : p42 + p43 + p1331 + p1334 + p1336 + p1338 = 1
inv : p42 + p43 + p1852 + p1854 + p1856 + p1858 = 1
inv : p4900 + p4902 = 1
inv : p42 + p43 + p1586 + p1588 = 1
inv : p42 + p43 + p977 + p979 + p982 + p984 = 1
inv : p5257 + p5259 = 1
inv : p42 + p43 + p2120 + p2123 + p2124 = 1
inv : p5107 + p5109 + p5110 + p5111 + p5112 + p5114 = 1
inv : p42 + p43 + p2088 + p2090 + p2092 + p2094 = 1
inv : p42 + p43 + p170 + p172 = 1
inv : p42 + p43 + p1481 + p1483 = 1
inv : p42 + p43 + p1288 + p1289 + p1291 + p1293 = 1
inv : p42 + p43 + p2415 + p2420 + p2421 = 1
inv : p42 + p43 + p2835 + p2837 = 1
inv : p4576 + p4579 + p4581 + p4583 = 1
inv : p5608 + p5610 = 1
inv : p42 + p43 + p638 + p642 + p644 = 1
inv : p5896 + p5899 + p5900 = 1
inv : p3608 + p3610 + p3612 + p3614 = 1
inv : p42 + p43 + p255 + p257 = 1
inv : p42 + p43 + p3071 + p3073 = 1
inv : p42 + p43 + p881 + p886 + p887 = 1
inv : p4775 + p4778 + p4779 = 1
inv : p4539 + p4542 + p4543 = 1
inv : p42 + p43 + p1050 + p1081 + p1083 + p1084 = 1
inv : p4389 + p4391 + p4393 + p4395 + p4397 + p4398 = 1
inv : p5284 + p5287 + p5289 + p5291 = 1
inv : p42 + p43 + p1127 + p1129 = 1
inv : p42 + p43 + p2251 + p2253 + p2255 + p2257 = 1
inv : p42 + p43 + p3032 + p3034 + p3036 + p3038 = 1
inv : p42 + p43 + p1407 + p1408 + p1409 + p1411 = 1
inv : p4546 + p4548 = 1
inv : p42 + p43 + p1095 + p1097 + p1098 + p1100 + p1102 = 1
inv : p5018 + p5020 = 1
inv : p3890 + p3893 + p3894 = 1
inv : p5067 + p5069 = 1
inv : p3828 + p3830 = 1
inv : p5742 + p5744 = 1
inv : p42 + p43 + p318 + p320 + p322 + p324 = 1
inv : p42 + p43 + p2412 + p2414 = 1
inv : p3713 + p3718 + p3719 = 1
inv : p42 + p3477 + p3482 + p3483 = 1
inv : p42 + p43 + p3382 + p3384 + p3385 = 1
inv : p42 + p43 + p173 + p178 + p179 = 1
inv : p5008 + p5010 = 1
inv : p42 + p43 + p465 + p467 = 1
inv : p4122 + p4123 + p4124 + p4125 = 1
inv : p42 + p43 + p1675 + p1677 + p1679 + p1681 = 1
inv : p42 + p43 + p668 + p670 = 1
inv : p42 + p43 + p377 + p379 + p381 + p383 = 1
inv : p42 + p43 + p1144 + p1146 + p1147 + p1148 + p1150 = 1
inv : p42 + p43 + p599 + p601 + p603 + p605 = 1
inv : p3959 + p3961 = 1
inv : p42 + p43 + p2422 + p2424 = 1
inv : p42 + p43 + p931 + p967 + p969 + p971 + p973 + p975 = 1
inv : p42 + p43 + p1734 + p1736 + p1738 + p1740 = 1
inv : p5801 + p5803 = 1
inv : p42 + p43 + p1803 + p1805 + p1806 + p1807 + p1808 + p1810 = 1
inv : p42 + p43 + p2452 + p2455 + p2457 + p2459 = 1
inv : p42 + p43 + p1026 + p1028 + p1030 + p1032 = 1
inv : p42 + p43 + p3116 + p3130 + p3132 = 1
inv : p4743 + p4745 + p4747 + p4749 + p4750 = 1
inv : p42 + p43 + p1894 + p1896 = 1
inv : p4477 + p4479 = 1
inv : p42 + p43 + p2747 + p2750 + p2752 + p2754 = 1
inv : p42 + p43 + p2887 + p2892 + p2893 = 1
inv : p5673 + p5675 + p5677 + p5679 = 1
inv : p42 + p43 + p550 + p552 = 1
inv : p42 + p3490 + p3492 + p3494 + p3496 = 1
inv : p42 + p43 + p1793 + p1795 + p1797 + p1799 = 1
inv : p42 + p43 + p1832 + p1834 = 1
inv : p4667 + p4669 = 1
inv : p4284 + p4286 + p4288 + p4290 = 1
inv : p42 + p43 + p2828 + p2831 + p2832 = 1
inv : p42 + p43 + p3407 + p3409 + p3431 + p3433 + p3435 + p3437 = 1
inv : p5142 + p5144 + p5146 + p5148 = 1
inv : p5520 + p5523 + p5525 + p5527 = 1
inv : p4930 + p4933 + p4935 + p4937 = 1
inv : p4362 + p4363 + p4367 + p4368 = 1
inv : p5126 + p5128 = 1
inv : p4989 + p4992 + p4994 + p4996 = 1
inv : p5791 + p5793 + p5795 + p5797 = 1
inv : p42 + p43 + p2897 + p2899 = 1
inv : p4340 + p4343 + p4345 + p4347 = 1
inv : p42 + p43 + p1704 + p1706 = 1
inv : p3602 + p3604 = 1
inv : p3529 + p3530 + p3546 + p3548 = 1
inv : p42 + p43 + p2117 + p2119 = 1
inv : p42 + p43 + p672 + p674 + p676 + p678 = 1
inv : p42 + p43 + p2825 + p2827 = 1
inv : p4222 + p4225 + p4227 + p4229 = 1
inv : p42 + p43 + p638 + p658 + p660 + p662 + p664 + p666 = 1
inv : p5952 + p5954 = 1
inv : p5549 + p5551 = 1
inv : p42 + p43 + p1140 + p1142 = 1
inv : p42 + p43 + p2581 + p2629 + p2632 + p2634 + p2636 + p2638 = 1
inv : p42 + p43 + p542 + p544 + p546 + p548 = 1
inv : p42 + p43 + p3297 + p3298 + p3299 = 1
inv : p42 + p43 + p2497 + p2499 = 1
inv : p3691 + p3694 + p3696 + p3698 = 1
inv : p5011 + p5014 + p5015 = 1
inv : p42 + p43 + p3195 + p3197 + p3199 + p3201 + p3202 = 1
inv : p42 + p43 + p1232 + p1234 = 1
inv : p5719 + p5724 + p5725 = 1
inv : p42 + p43 + p2651 + p2656 + p2657 = 1
inv : p3592 + p3594 = 1
inv : p5850 + p5852 + p5854 + p5856 = 1
inv : p42 + p43 + p475 + p477 = 1
inv : p5188 + p5191 + p5192 = 1
inv : p5201 + p5203 + p5205 + p5207 = 1
inv : p42 + p43 + p3407 + p3409 + p3418 + p3421 + p3422 = 1
inv : p5962 + p5964 = 1
inv : p42 + p43 + p1288 + p1304 + p1306 = 1
inv : p5638 + p5641 + p5643 + p5645 = 1
inv : p4608 + p4610 = 1
inv : p3913 + p3915 = 1
inv : p3750 + p3753 + p3755 + p3757 = 1
inv : p4949 + p4951 = 1
inv : p42 + p43 + p638 + p652 + p654 = 1
inv : p42 + p43 + p931 + p950 + p952 = 1
inv : p42 + p3474 + p3476 = 1
inv : p42 + p43 + p714 + p716 = 1
inv : p42 + p43 + p409 + p414 + p415 = 1
inv : p42 + p43 + p1288 + p1289 + p1294 + p1299 + p1300 = 1
inv : p42 + p43 + p3300 + p3305 + p3306 = 1
inv : p4536 + p4538 = 1
inv : p4018 + p4020 = 1
inv : p42 + p43 + p1288 + p1289 + p1301 + p1303 = 1
inv : p42 + p43 + p2127 + p2129 = 1
inv : p3723 + p3725 = 1
inv : p4959 + p4961 = 1
inv : p3900 + p3902 = 1
inv : p42 + p43 + p2120 + p2125 + p2126 = 1
inv : p5247 + p5250 + p5251 = 1
inv : p4303 + p4306 + p4307 = 1
inv : p5483 + p5488 + p5489 = 1
inv : p42 + p43 + p1773 + p1775 = 1
inv : p4136 + p4138 = 1
inv : p5260 + p5262 + p5264 + p5266 = 1
inv : p42 + p43 + p623 + p626 + p628 + p630 = 1
inv : p42 + p43 + p2310 + p2312 + p2314 + p2316 = 1
inv : p42 + p43 + p1848 + p1850 = 1
inv : p42 + p43 + p1350 + p1352 = 1
inv : p42 + p43 + p1130 + p1132 + p1134 + p1136 = 1
inv : p5542 + p5547 + p5548 = 1
inv : p42 + p43 + p3116 + p3123 + p3126 + p3127 = 1
inv : p42 + p43 + p3359 + p3364 + p3365 = 1
inv : p42 + p43 + p3356 + p3358 = 1
inv : p42 + p43 + p446 + p449 + p451 + p453 + p454 = 1
inv : p4487 + p4489 = 1
inv : p42 + p43 + p1167 + p1203 + p1205 + p1207 + p1209 = 1
inv : p42 + p43 + p931 + p940 + p945 + p946 = 1
inv : p42 + p43 + p2061 + p2064 + p2065 = 1
inv : p42 + p43 + p242 + p244 = 1
inv : p42 + p43 + p1791 + p1792 = 1
inv : p42 + p43 + p1471 + p1476 + p1477 = 1
inv : p42 + p43 + p2334 + p2337 + p2339 + p2341 = 1
inv : p42 + p43 + p2192 + p2194 + p2196 + p2198 = 1
inv : p42 + p43 + p1380 + p1382 + p1384 + p1386 = 1
inv : p42 + p43 + p2179 + p2184 + p2185 = 1
inv : p42 + p43 + p3238 + p3240 = 1
inv : p42 + p43 + p2369 + p2371 + p2373 + p2375 = 1
inv : p3632 + p3635 + p3637 + p3639 = 1
inv : p42 + p43 + p2075 + p2076 + p2078 + p2080 + p2082 = 1
inv : p42 + p43 + p2511 + p2514 + p2516 + p2518 = 1
inv : p42 + p43 + p2806 + p2809 + p2811 + p2813 = 1
inv : p42 + p43 + p468 + p473 + p474 = 1
inv : p5746 + p5748 + p5749 + p5750 + p5752 = 1
inv : p4680 + p4682 = 1
inv : p4330 + p4332 + p4334 + p4336 + p4337 = 1
inv : p42 + p43 + p1360 + p1362 = 1
inv : p42 + p43 + p1884 + p1889 + p1890 = 1
inv : p3661 + p3663 = 1
inv : p4753 + p4756 + p4758 + p4760 + p4761 = 1
inv : p42 + p43 + p2202 + p2204 = 1
inv : p42 + p43 + p2189 + p2191 = 1
inv : p5654 + p5670 + p5671 + p5672 = 1
inv : p42 + p43 + p3248 + p3250 = 1
inv : p42 + p43 + p2581 + p2589 + p2591 = 1
inv : p42 + p43 + p1242 + p1244 = 1
inv : p42 + p43 + p2356 + p2359 + p2360 = 1
inv : p3838 + p3840 = 1
inv : p42 + p43 + p2275 + p2278 + p2280 + p2282 = 1
inv : p42 + p43 + p537 + p539 = 1
inv : p42 + p43 + p1648 + p1651 + p1652 = 1
inv : p5982 + p5984 + p5986 + p5988 = 1
inv : p42 + p43 + p773 + p775 = 1
inv : p42 + p43 + p2769 + p2772 + p2773 = 1
inv : p42 + p43 + p3366 + p3368 = 1
inv : p4031 + p4033 = 1
inv : p42 + p43 + p2015 + p2017 + p2019 + p2021 = 1
inv : p5024 + p5026 + p5028 + p5030 = 1
inv : p5083 + p5085 + p5087 + p5089 = 1
inv : p42 + p43 + p3061 + p3063 = 1
inv : p42 + p43 + p2393 + p2396 + p2398 + p2400 = 1
inv : p42 + p43 + p2484 + p2486 = 1
inv : p42 + p43 + p1050 + p1071 + p1073 + p1075 + p1077 = 1
inv : p42 + p43 + p1589 + p1592 + p1593 = 1
inv : p42 + p43 + p2946 + p2951 + p2952 = 1
inv : p5405 + p5407 + p5409 + p5411 = 1
inv : p5756 + p5759 + p5761 + p5762 + p5763 = 1
inv : p5624 + p5626 = 1
inv : p42 + p43 + p100 + p102 = 1
inv : p42 + p43 + p2865 + p2868 + p2870 + p2872 = 1
inv : p42 + p43 + p1154 + p1157 + p1159 + p1161 = 1
inv : p4965 + p4967 + p4969 + p4971 = 1
inv : p42 + p43 + p2428 + p2430 + p2432 + p2434 = 1
inv : p4952 + p4955 + p4956 = 1
inv : p42 + p43 + p3179 + p3181 = 1
inv : p42 + p43 + p2581 + p2599 + p2601 = 1
inv : p5211 + p5213 = 1
inv : -p1002 - p1003 + p1004 + p1005 = 0
inv : p42 + p43 + p1262 + p1264 + p1266 + p1268 = 1
inv : p5343 + p5346 + p5348 + p5350 = 1
inv : p42 + p43 + p790 + p792 + p794 + p796 = 1
inv : p42 + p43 + p350 + p353 + p354 = 1
inv : p4906 + p4908 + p4910 + p4912 = 1
inv : p42 + p43 + p908 + p910 + p912 + p914 = 1
inv : p3667 + p3669 + p3671 + p3673 = 1
inv : p42 + p43 + p1167 + p1168 + p1199 + p1201 = 1
inv : p5565 + p5567 = 1
inv : p5166 + p5169 + p5171 + p5173 = 1
inv : p1828 + p1829 - p1830 - p1831 = 0
inv : p42 + p43 + p1956 + p1958 + p1960 + p1962 = 1
inv : p4980 + p4981 + p4983 + p4985 + p4987 = 1
inv : p5416 + p5417 + p5437 + p5439 + p5441 + p5443 = 1
inv : p42 + p43 + p731 + p733 + p735 + p737 = 1
inv : p4300 + p4302 = 1
inv : p3726 + p3728 + p3730 + p3732 = 1
inv : p42 + p43 + p1943 + p1948 + p1949 = 1
inv : p42 + p43 + p931 + p963 + p965 = 1
inv : p5225 + p5228 + p5230 + p5232 = 1
inv : p42 + p43 + p1167 + p1168 + p1186 + p1188 = 1
inv : p42 + p43 + p180 + p182 = 1
inv : p42 + p43 + p2894 + p2896 = 1
inv : p5683 + p5685 = 1
inv : p42 + p3504 + p3506 + p3508 + p3510 = 1
inv : p5654 + p5660 + p5665 + p5666 = 1
inv : p42 + p43 + p2216 + p2219 + p2221 + p2223 = 1
inv : p42 + p43 + p1540 + p1542 = 1
inv : p42 + p43 + p3407 + p3409 + p3418 + p3423 + p3424 = 1
inv : p4149 + p4151 = 1
inv : p42 + p43 + p849 + p851 + p853 + p855 + p857 + p858 = 1
inv : p5687 + p5689 + p5691 + p5693 = 1
inv : p3831 + p3834 + p3835 = 1
inv : p42 + p43 + p3189 + p3191 = 1
inv : p42 + p43 + p3012 + p3014 = 1
inv : p42 + p43 + p564 + p567 + p569 + p571 = 1
inv : p42 + p43 + p229 + p231 = 1
inv : p4785 + p4787 = 1
inv : p42 + p43 + p3182 + p3184 + p3187 + p3188 = 1
inv : p42 + p43 + p1953 + p1955 = 1
inv : p5805 + p5807 + p5809 + p5811 = 1
inv : p3854 + p3856 = 1
inv : p5365 + p5370 + p5371 = 1
inv : p5156 + p5158 + p5160 + p5162 = 1
inv : p42 + p43 + p2828 + p2833 + p2834 = 1
inv : p42 + p43 + p2029 + p2031 + p2033 + p2035 = 1
inv : p5093 + p5095 = 1
inv : -p1710 - p1711 + p1712 + p1713 = 0
inv : p42 + p43 + p2782 + p2784 + p2786 + p2788 = 1
inv : p42 + p43 + p1835 + p1837 = 1
inv : p42 + p43 + p2363 + p2365 = 1
inv : p42 + p43 + p3150 + p3152 + p3154 + p3156 = 1
inv : p42 + p43 + p554 + p556 + p558 + p560 = 1
inv : p4257 + p4259 + p4261 + p4263 = 1
inv : p5416 + p5447 + p5449 = 1
inv : p4176 + p4177 + p4200 + p4202 + p4204 + p4206 = 1
inv : p42 + p43 + p788 + p789 = 1
inv : p42 + p3514 + p3517 + p3519 + p3521 = 1
inv : p42 + p43 + p763 + p766 + p767 = 1
inv : p5893 + p5895 = 1
inv : p5011 + p5016 + p5017 = 1
inv : p5697 + p5700 + p5702 + p5704 = 1
inv : p3651 + p3653 = 1
inv : p42 + p43 + p1599 + p1601 = 1
inv : p42 + p43 + p2956 + p2958 = 1
inv : p4549 + p4551 = 1
inv : p42 + p43 + p2884 + p2886 = 1
inv : p3573 + p3576 + p3578 + p3580 = 1
inv : p42 + p43 + p2651 + p2654 + p2655 = 1
inv : p42 + p43 + p1707 + p1709 + p1710 + p1711 = 1
inv : p42 + p43 + p304 + p306 + p308 + p310 = 1
inv : p42 + p43 + p1655 + p1657 = 1
inv : p5896 + p5901 + p5902 = 1
inv : p4008 + p4013 + p4014 = 1
inv : p5579 + p5582 + p5584 + p5586 = 1
inv : p3529 + p3530 + p3536 + p3541 + p3542 = 1
inv : p42 + p43 + p409 + p412 + p413 = 1
inv : p4857 + p4859 = 1
inv : p42 + p43 + p1258 + p1260 = 1
inv : p3779 + p3781 = 1
inv : p42 + p43 + p1645 + p1647 = 1
inv : p42 + p43 + p200 + p202 + p204 + p206 = 1
inv : p4564 + p4565 = 1
inv : p42 + p43 + p3002 + p3004 = 1
inv : p42 + p43 + p2425 + p2427 = 1
inv : p4726 + p4728 = 1
inv : p42 + p43 + p2261 + p2263 = 1
inv : p42 + p43 + p291 + p294 + p295 = 1
inv : p3713 + p3716 + p3717 = 1
inv : p42 + p43 + p3018 + p3020 + p3022 + p3024 = 1
inv : p4418 + p4420 = 1
inv : p5198 + p5200 = 1
inv : p42 + p43 + p1478 + p1480 = 1
inv : -p3598 - p3599 + p3600 + p3601 = 0
inv : p42 + p43 + p239 + p241 = 1
inv : p42 + p43 + p2581 + p2605 + p2607 + p2609 + p2611 = 1
inv : p42 + p43 + p711 + p713 = 1
inv : p5316 + p5318 = 1
inv : p4254 + p4256 = 1
inv : p4045 + p4048 + p4050 + p4052 = 1
inv : p4716 + p4719 + p4720 = 1
inv : p42 + p43 + p363 + p365 + p367 + p369 = 1
inv : p5303 + p5305 = 1
inv : p42 + p43 + p2353 + p2355 = 1
inv : p42 + p43 + p301 + p303 = 1
inv : -p4070 - p4071 + p4072 + p4073 = 0
inv : p42 + p43 + p3101 + p3104 + p3106 + p3107 + p3108 = 1
inv : p42 + p43 + p1050 + p1052 + p1054 + p1058 + p1061 + p1062 = 1
inv : p42 + p43 + p2887 + p2890 + p2891 = 1
inv : p42 + p43 + p1468 + p1470 = 1
inv : p5034 + p5036 = 1
inv : p42 + p43 + p2723 + p2725 + p2727 + p2729 = 1
inv : p42 + p43 + p1006 + p1008 = 1
inv : p3976 + p3978 + p3980 + p3982 + p3983 = 1
inv : p42 + p43 + p2914 + p2916 + p2918 + p2920 = 1
inv : p5313 + p5315 = 1
inv : p42 + p43 + p2238 + p2243 + p2244 = 1
inv : p4598 + p4601 + p4602 = 1
inv : p3769 + p3771 = 1
inv : p4664 + p4666 = 1
inv : p3809 + p3812 + p3814 + p3816 = 1
inv : p42 + p43 + p3074 + p3076 = 1
inv : p42 + p43 + p2186 + p2188 = 1
inv : p3664 + p3666 = 1
inv : p42 + p43 + p3374 + p3376 + p3378 + p3380 = 1
inv : p42 + p3484 + p3486 = 1
inv : p42 + p43 + p3278 + p3281 + p3283 + p3285 = 1
inv : p5136 + p5138 = 1
inv : p42 + p43 + p1543 + p1545 + p1547 + p1549 + p1551 + p1552 = 1
inv : p42 + p43 + p996 + p998 = 1
inv : p3841 + p3843 = 1
inv : p42 + p43 + p1766 + p1769 + p1770 = 1
inv : p42 + p43 + p1966 + p1968 = 1
inv : p4244 + p4249 + p4250 = 1
inv : p42 + p43 + p1498 + p1500 + p1502 + p1504 = 1
inv : p42 + p43 + p2501 + p2503 + p2505 + p2507 = 1
inv : p42 + p43 + p1167 + p1168 + p1176 + p1181 + p1182 = 1
inv : p3654 + p3657 + p3658 = 1
inv : p42 + p43 + p931 + p947 + p949 = 1
inv : p3927 + p3930 + p3932 + p3934 = 1
inv : p42 + p43 + p2581 + p2592 + p2595 + p2596 = 1
inv : p42 + p43 + p835 + p837 + p839 + p841 = 1
inv : p42 + p43 + p406 + p408 = 1
inv : p5188 + p5193 + p5194 = 1
inv : p4015 + p4017 = 1
inv : p42 + p43 + p1940 + p1942 = 1
inv : p42 + p43 + p1471 + p1474 + p1475 = 1
inv : p4798 + p4800 = 1
inv : p42 + p43 + p1407 + p1408 + p1412 + p1415 + p1416 = 1
inv : p5729 + p5731 = 1
inv : p3799 + p3801 + p3803 + p3805 = 1
inv : p42 + p43 + p1626 + p1629 + p1631 + p1633 = 1
inv : p5539 + p5541 = 1
inv : p42 + p43 + p2383 + p2385 + p2387 + p2389 = 1
inv : p5903 + p5905 = 1
inv : p5392 + p5394 + p5396 + p5398 = 1
inv : p5496 + p5498 + p5500 + p5502 = 1
inv : p4077 + p4079 = 1
inv : p42 + p43 + p1494 + p1496 = 1
inv : p5788 + p5790 = 1
inv : p4739 + p4741 = 1
inv : p5038 + p5040 + p5042 + p5044 + p5045 = 1
inv : p4458 + p4461 + p4463 + p4465 = 1
inv : p42 + p43 + p1508 + p1511 + p1513 + p1515 = 1
inv : p42 + p43 + p2674 + p2676 = 1
inv : p5247 + p5252 + p5253 = 1
inv : p42 + p43 + p704 + p706 + p707 + p708 = 1
inv : p42 + p43 + p2661 + p2663 = 1
inv : p42 + p3500 + p3502 = 1
inv : p4635 + p4638 + p4640 + p4642 = 1
inv : p4729 + p4731 + p4733 + p4735 = 1
inv : p42 + p43 + p350 + p355 + p356 = 1
inv : p5077 + p5079 = 1
inv : p42 + p43 + p918 + p921 + p923 + p925 = 1
inv : p42 + p43 + p1530 + p1533 + p1534 = 1
inv : p4163 + p4165 + p4166 + p4168 + p4170 = 1
inv : p4359 + p4361 = 1
inv : p42 + p43 + p3219 + p3222 + p3224 + p3226 = 1
inv : p825 + p826 - p827 - p828 = 0
inv : p3917 + p3919 + p3921 + p3923 = 1
inv : p4552 + p4554 + p4556 + p4558 = 1
inv : p3595 + p3598 + p3599 = 1
inv : p42 + p43 + p1950 + p1952 = 1
inv : p42 + p43 + p1616 + p1618 + p1620 + p1622 = 1
inv : p4005 + p4007 = 1
inv : p42 + p43 + p3251 + p3253 = 1
inv : p5329 + p5331 = 1
inv : p42 + p43 + p1390 + p1393 + p1395 + p1397 = 1
inv : p5152 + p5154 = 1
inv : p3563 + p3565 + p3567 + p3569 = 1
inv : p4375 + p4377 + p4379 + p4381 = 1
inv : p42 + p43 + p931 + p937 + p939 = 1
inv : p42 + p43 + p416 + p418 = 1
inv : p42 + p43 + p1036 + p1039 + p1041 + p1043 = 1
inv : p42 + p43 + p2910 + p2912 = 1
inv : p4654 + p4656 = 1
inv : p5732 + p5734 + p5736 + p5738 = 1
inv : p42 + p43 + p1776 + p1778 = 1
inv : p42 + p43 + p1213 + p1216 + p1217 + p1218 + p1220 + p1221 = 1
inv : p5306 + p5311 + p5312 = 1
inv : p4493 + p4495 + p4497 + p4499 = 1
inv : p42 + p43 + p2248 + p2250 = 1
inv : p4815 + p4817 + p4819 + p4821 = 1
inv : p42 + p43 + p2206 + p2208 + p2210 + p2212 = 1
inv : p42 + p43 + p3064 + p3067 + p3068 = 1
inv : p42 + p43 + p1553 + p1555 = 1
inv : p5601 + p5606 + p5607 = 1
inv : p42 + p43 + p114 + p117 + p118 = 1
inv : p42 + p43 + p491 + p493 = 1
inv : p5598 + p5600 = 1
inv : p42 + p43 + p2320 + p2322 + p2323 = 1
inv : p5416 + p5417 + p5424 + p5427 + p5428 = 1
inv : p3681 + p3683 + p3685 + p3687 = 1
inv : p42 + p43 + p1911 + p1913 + p1915 + p1917 = 1
inv : -p5427 - p5428 + p5429 + p5430 = 0
inv : p42 + p43 + p1245 + p1247 = 1
inv : p42 + p43 + p2438 + p2440 = 1
inv : p4694 + p4697 + p4699 + p4701 = 1
inv : p4517 + p4520 + p4522 + p4524 = 1
inv : p42 + p43 + p2720 + p2722 = 1
inv : -p648 - p649 + p650 + p651 = 0
inv : p42 + p43 + p3005 + p3008 + p3009 = 1
inv : p42 + p43 + p3396 + p3399 + p3401 + p3403 = 1
inv : p5933 + p5936 + p5938 + p5940 = 1
inv : p42 + p43 + p173 + p176 + p177 = 1
inv : p42 + p43 + p3264 + p3266 = 1
inv : p5722 + p5723 - p5724 - p5725 = 0
inv : p5614 + p5616 + p5618 + p5620 = 1
inv : p5815 + p5818 + p5820 + p5822 = 1
inv : p42 + p43 + p3337 + p3340 + p3342 + p3344 = 1
inv : p4035 + p4037 + p4039 + p4041 = 1
inv : p3677 + p3679 = 1
inv : p4303 + p4308 + p4309 = 1
inv : p42 + p43 + p3116 + p3123 + p3128 + p3129 = 1
inv : p3529 + p3549 + p3551 + p3553 + p3555 = 1
inv : p42 + p43 + p3087 + p3089 = 1
inv : p42 + p43 + p1714 + p1716 = 1
inv : p42 + p43 + p2176 + p2178 = 1
inv : p42 + p43 + p3241 + p3244 + p3245 = 1
Total of 900 invariants.
[2022-06-12 21:34:57] [INFO ] Computed 900 place invariants in 114 ms
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :3 after 9
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :9 after 12
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :12 after 12
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :12 after 12
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :12 after 114
[2022-06-12 21:35:05] [INFO ] BMC solution for property ShieldIIPs-PT-100B-ReachabilityFireability-08(UNSAT) depth K=2 took 9047 ms
[2022-06-12 21:35:08] [INFO ] Proved 2591 variables to be positive in 11554 ms
[2022-06-12 21:35:09] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldIIPs-PT-100B-ReachabilityFireability-08
[2022-06-12 21:35:09] [INFO ] KInduction solution for property ShieldIIPs-PT-100B-ReachabilityFireability-08(SAT) depth K=0 took 1085 ms
[2022-06-12 21:35:11] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldIIPs-PT-100B-ReachabilityFireability-13
[2022-06-12 21:35:11] [INFO ] KInduction solution for property ShieldIIPs-PT-100B-ReachabilityFireability-13(SAT) depth K=0 took 1730 ms
[2022-06-12 21:35:18] [INFO ] BMC solution for property ShieldIIPs-PT-100B-ReachabilityFireability-13(UNSAT) depth K=2 took 13183 ms
[2022-06-12 21:35:24] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldIIPs-PT-100B-ReachabilityFireability-08
[2022-06-12 21:35:24] [INFO ] KInduction solution for property ShieldIIPs-PT-100B-ReachabilityFireability-08(SAT) depth K=1 took 12716 ms
Compilation finished in 31031 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin11045202155536283619]
Link finished in 72 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, ShieldIIPsPT100BReachabilityFireability08==true], workingDir=/tmp/ltsmin11045202155536283619]
[2022-06-12 21:35:27] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldIIPs-PT-100B-ReachabilityFireability-13
[2022-06-12 21:35:27] [INFO ] KInduction solution for property ShieldIIPs-PT-100B-ReachabilityFireability-13(SAT) depth K=1 took 3839 ms
Detected timeout of ITS tools.
[2022-06-12 21:58:30] [INFO ] Applying decomposition
[2022-06-12 21:58:31] [INFO ] Flatten gal took : 471 ms
[2022-06-12 21:58:31] [INFO ] Decomposing Gal with order
[2022-06-12 21:58:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-12 21:58:32] [INFO ] Removed a total of 1938 redundant transitions.
[2022-06-12 21:58:32] [INFO ] Flatten gal took : 608 ms
[2022-06-12 21:58:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 1719 labels/synchronizations in 3977 ms.
[2022-06-12 21:58:37] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability2121181118492521412.gal : 62 ms
[2022-06-12 21:58:37] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability10829632145974510017.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/ReachabilityFireability2121181118492521412.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityFireability10829632145974510017.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/ReachabilityFireability2121181118492521412.gal -t CGAL -reachable-file /tmp/ReachabilityFireability10829632145974510017.prop --nowitness
Loading property file /tmp/ReachabilityFireability10829632145974510017.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 6
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :6 after 18
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :18 after 78
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :78 after 78
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :78 after 78
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :78 after 2.82175e+08
WARNING : LTSmin timed out (>1800 s) on command CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, -i, ShieldIIPsPT100BReachabilityFireability08==true], workingDir=/tmp/ltsmin11045202155536283619]
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, ShieldIIPsPT100BReachabilityFireability13==true], workingDir=/tmp/ltsmin11045202155536283619]
[2022-06-12 22:08:28] [INFO ] BMC solution for property ShieldIIPs-PT-100B-ReachabilityFireability-08(UNSAT) depth K=3 took 1989777 ms
[2022-06-12 22:19:08] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldIIPs-PT-100B-ReachabilityFireability-08
[2022-06-12 22:19:08] [INFO ] KInduction solution for property ShieldIIPs-PT-100B-ReachabilityFireability-08(SAT) depth K=2 took 2619893 ms
Detected timeout of ITS tools.
[2022-06-12 22:22:11] [INFO ] Flatten gal took : 375 ms
[2022-06-12 22:22:11] [INFO ] Input system was already deterministic with 2492 transitions.
[2022-06-12 22:22:11] [INFO ] Transformed 2591 places.
[2022-06-12 22:22:12] [INFO ] Transformed 2492 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-06-12 22:22:13] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability10786239269900950075.gal : 8 ms
[2022-06-12 22:22:13] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability13311056667824717588.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/ReachabilityFireability10786239269900950075.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityFireability13311056667824717588.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/ReachabilityFireability10786239269900950075.gal -t CGAL -reachable-file /tmp/ReachabilityFireability13311056667824717588.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/ReachabilityFireability13311056667824717588.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :10 after 44
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :44 after 64
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :64 after 440
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :440 after 1023
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :1023 after 12195
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :12195 after 169170
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :169170 after 941831
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :941831 after 1.5248e+06
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :1.5248e+06 after 2.68401e+07
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :2.68401e+07 after 4.5311e+08
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :4.5311e+08 after 2.57425e+09
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :2.57425e+09 after 1.10521e+10
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :1.10521e+10 after 2.23714e+11
SDD proceeding with computation,2 properties remain. new max is 131072
SDD size :2.23714e+11 after 1.79772e+13
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination ReachabilityFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldIIPs-PT-100B"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="gold2021"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool gold2021"
echo " Input is ShieldIIPs-PT-100B, 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-165286037000066"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPs-PT-100B.tgz
mv ShieldIIPs-PT-100B 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 '
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 ;