About the Execution of 2021-gold for Peterson-COL-7
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 8817.516 | 3600000.00 | 13086248.00 | 1028.60 | TTFTFTFTFTTFFT?T | 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.r179-tall-165277026700017.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 Peterson-COL-7, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r179-tall-165277026700017
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 484K
-rw-r--r-- 1 mcc users 7.8K Apr 30 10:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Apr 30 10:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Apr 30 09:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 30 09:51 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.1K May 9 08:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 9 08:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 9 08:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 9 08:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.8K Apr 30 10:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 66K Apr 30 10:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 30 10:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 97K Apr 30 10:31 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_pt
-rw-r--r-- 1 mcc users 2 May 10 09:34 instance
-rw-r--r-- 1 mcc users 5 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 47K 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 Peterson-COL-7-ReachabilityCardinality-00
FORMULA_NAME Peterson-COL-7-ReachabilityCardinality-01
FORMULA_NAME Peterson-COL-7-ReachabilityCardinality-02
FORMULA_NAME Peterson-COL-7-ReachabilityCardinality-03
FORMULA_NAME Peterson-COL-7-ReachabilityCardinality-04
FORMULA_NAME Peterson-COL-7-ReachabilityCardinality-05
FORMULA_NAME Peterson-COL-7-ReachabilityCardinality-06
FORMULA_NAME Peterson-COL-7-ReachabilityCardinality-07
FORMULA_NAME Peterson-COL-7-ReachabilityCardinality-08
FORMULA_NAME Peterson-COL-7-ReachabilityCardinality-09
FORMULA_NAME Peterson-COL-7-ReachabilityCardinality-10
FORMULA_NAME Peterson-COL-7-ReachabilityCardinality-11
FORMULA_NAME Peterson-COL-7-ReachabilityCardinality-12
FORMULA_NAME Peterson-COL-7-ReachabilityCardinality-13
FORMULA_NAME Peterson-COL-7-ReachabilityCardinality-14
FORMULA_NAME Peterson-COL-7-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1655068462970
Running Version 0
[2022-06-12 21:14:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-12 21:14:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-12 21:14:24] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
[2022-06-12 21:14:24] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-06-12 21:14:25] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 663 ms
[2022-06-12 21:14:25] [INFO ] Imported 11 HL places and 14 HL transitions for a total of 2048 PT places and 3384.0 transition bindings in 22 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
[2022-06-12 21:14:25] [INFO ] Built PT skeleton of HLPN with 11 places and 14 transitions in 3 ms.
[2022-06-12 21:14:25] [INFO ] Skeletonized HLPN properties in 1 ms.
Successfully produced net in file /tmp/petri1000_16356053201312520896.dot
Reduce places removed 2 places and 0 transitions.
FORMULA Peterson-COL-7-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-COL-7-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 100003 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=1369 ) properties (out of 14) seen :4
Running SMT prover for 10 properties.
// Phase 1: matrix 14 rows 9 cols
[2022-06-12 21:14:25] [INFO ] Computed 1 place invariants in 7 ms
[2022-06-12 21:14:25] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned unsat
[2022-06-12 21:14:25] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2022-06-12 21:14:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:14:25] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2022-06-12 21:14:25] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:14:25] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned unsat
[2022-06-12 21:14:25] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned unsat
[2022-06-12 21:14:25] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned unsat
[2022-06-12 21:14:25] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned unsat
[2022-06-12 21:14:25] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned unsat
[2022-06-12 21:14:25] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned unsat
[2022-06-12 21:14:25] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned unsat
Successfully simplified 10 atomic propositions for a total of 10 simplifications.
FORMULA Peterson-COL-7-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-COL-7-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-COL-7-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-COL-7-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-COL-7-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-COL-7-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-COL-7-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-COL-7-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-COL-7-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-COL-7-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-06-12 21:14:25] [INFO ] Flatten gal took : 14 ms
[2022-06-12 21:14:25] [INFO ] Flatten gal took : 2 ms
[2022-06-12 21:14:25] [INFO ] Unfolded HLPN to a Petri net with 2048 places and 3208 transitions in 65 ms.
[2022-06-12 21:14:25] [INFO ] Unfolded HLPN properties in 5 ms.
Successfully produced net in file /tmp/petri1001_17010717180272110609.dot
Deduced a syphon composed of 56 places in 18 ms
Reduce places removed 56 places and 112 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 4) seen :2
FORMULA Peterson-COL-7-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-7-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2022-06-12 21:14:26] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
// Phase 1: matrix 2760 rows 1992 cols
[2022-06-12 21:14:26] [INFO ] Computed 31 place invariants in 36 ms
[2022-06-12 21:14:26] [INFO ] [Real]Absence check using 23 positive place invariants in 38 ms returned sat
[2022-06-12 21:14:26] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 20 ms returned sat
[2022-06-12 21:14:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:14:27] [INFO ] [Real]Absence check using state equation in 964 ms returned sat
[2022-06-12 21:14:27] [INFO ] State equation strengthened by 546 read => feed constraints.
[2022-06-12 21:14:27] [INFO ] [Real]Added 546 Read/Feed constraints in 129 ms returned sat
[2022-06-12 21:14:27] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:14:28] [INFO ] [Nat]Absence check using 23 positive place invariants in 41 ms returned sat
[2022-06-12 21:14:28] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 17 ms returned sat
[2022-06-12 21:14:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:14:28] [INFO ] [Nat]Absence check using state equation in 840 ms returned sat
[2022-06-12 21:14:29] [INFO ] [Nat]Added 546 Read/Feed constraints in 163 ms returned sat
[2022-06-12 21:14:30] [INFO ] Deduced a trap composed of 33 places in 1033 ms of which 13 ms to minimize.
[2022-06-12 21:14:31] [INFO ] Deduced a trap composed of 59 places in 957 ms of which 4 ms to minimize.
[2022-06-12 21:14:32] [INFO ] Deduced a trap composed of 78 places in 948 ms of which 5 ms to minimize.
[2022-06-12 21:14:33] [INFO ] Deduced a trap composed of 88 places in 951 ms of which 10 ms to minimize.
[2022-06-12 21:14:33] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
[2022-06-12 21:14:33] [INFO ] [Real]Absence check using 23 positive place invariants in 37 ms returned sat
[2022-06-12 21:14:33] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 14 ms returned sat
[2022-06-12 21:14:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:14:34] [INFO ] [Real]Absence check using state equation in 810 ms returned sat
[2022-06-12 21:14:34] [INFO ] [Real]Added 546 Read/Feed constraints in 187 ms returned sat
[2022-06-12 21:14:34] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:14:35] [INFO ] [Nat]Absence check using 23 positive place invariants in 35 ms returned sat
[2022-06-12 21:14:35] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 13 ms returned sat
[2022-06-12 21:14:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:14:35] [INFO ] [Nat]Absence check using state equation in 809 ms returned sat
[2022-06-12 21:14:36] [INFO ] [Nat]Added 546 Read/Feed constraints in 203 ms returned sat
[2022-06-12 21:14:37] [INFO ] Deduced a trap composed of 67 places in 859 ms of which 3 ms to minimize.
[2022-06-12 21:14:38] [INFO ] Deduced a trap composed of 160 places in 891 ms of which 2 ms to minimize.
[2022-06-12 21:14:39] [INFO ] Deduced a trap composed of 17 places in 879 ms of which 2 ms to minimize.
[2022-06-12 21:14:40] [INFO ] Deduced a trap composed of 60 places in 881 ms of which 2 ms to minimize.
[2022-06-12 21:14:40] [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
Fused 2 Parikh solutions to 1 different solutions.
Support contains 16 out of 1992 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Drop transitions removed 896 transitions
Trivial Post-agglo rules discarded 896 transitions
Performed 896 trivial Post agglomeration. Transition count delta: 896
Iterating post reduction 0 with 896 rules applied. Total rules applied 896 place count 1992 transition count 2200
Reduce places removed 896 places and 0 transitions.
Iterating post reduction 1 with 896 rules applied. Total rules applied 1792 place count 1096 transition count 2200
Performed 440 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 440 Pre rules applied. Total rules applied 1792 place count 1096 transition count 1760
Deduced a syphon composed of 440 places in 3 ms
Reduce places removed 440 places and 0 transitions.
Iterating global reduction 2 with 880 rules applied. Total rules applied 2672 place count 656 transition count 1760
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 3 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 2784 place count 600 transition count 1704
Applied a total of 2784 rules in 413 ms. Remains 600 /1992 variables (removed 1392) and now considering 1704/3096 (removed 1392) transitions.
Finished structural reductions, in 1 iterations. Remains : 600/1992 places, 1704/3096 transitions.
[2022-06-12 21:14:40] [INFO ] Flatten gal took : 175 ms
[2022-06-12 21:14:40] [INFO ] Flatten gal took : 147 ms
[2022-06-12 21:14:40] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality791848649215968293.gal : 45 ms
[2022-06-12 21:14:40] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3830514392042968732.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/ReachabilityCardinality791848649215968293.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality3830514392042968732.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/ReachabilityCardinality791848649215968293.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality3830514392042968732.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality3830514392042968732.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 3
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :3 after 7
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :7 after 8
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :8 after 9
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :9 after 13
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :13 after 32
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :32 after 48
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :48 after 98
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :98 after 156
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :156 after 875
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :875 after 2218
Detected timeout of ITS tools.
[2022-06-12 21:14:56] [INFO ] Flatten gal took : 92 ms
[2022-06-12 21:14:56] [INFO ] Applying decomposition
[2022-06-12 21:14:56] [INFO ] Flatten gal took : 80 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph16580451168213854180.txt, -o, /tmp/graph16580451168213854180.bin, -w, /tmp/graph16580451168213854180.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/graph16580451168213854180.bin, -l, -1, -v, -w, /tmp/graph16580451168213854180.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-12 21:14:56] [INFO ] Decomposing Gal with order
[2022-06-12 21:14:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-12 21:14:56] [INFO ] Removed a total of 2609 redundant transitions.
[2022-06-12 21:14:56] [INFO ] Flatten gal took : 215 ms
[2022-06-12 21:14:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 491 labels/synchronizations in 62 ms.
[2022-06-12 21:14:57] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5760047885580944015.gal : 22 ms
[2022-06-12 21:14:57] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10866110511718021544.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/ReachabilityCardinality5760047885580944015.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality10866110511718021544.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/ReachabilityCardinality5760047885580944015.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality10866110511718021544.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality10866110511718021544.prop.
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 4
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :4 after 14
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :14 after 22
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :22 after 30
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :30 after 32
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :32 after 88
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :88 after 392
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :392 after 2737
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :2737 after 5846
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :5846 after 52708
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9642664110182393110
[2022-06-12 21:15:12] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9642664110182393110
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/ltsmin9642664110182393110]
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/ltsmin9642664110182393110] 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/ltsmin9642664110182393110] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2784 ms. (steps per millisecond=359 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1013 ms. (steps per millisecond=987 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 736 ms. (steps per millisecond=1358 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 4774806 steps, run timeout after 30001 ms. (steps per millisecond=159 ) properties seen :{}
Probabilistic random walk after 4774806 steps, saw 548854 distinct states, run finished after 30016 ms. (steps per millisecond=159 ) properties seen :{}
Running SMT prover for 2 properties.
[2022-06-12 21:15:47] [INFO ] Flow matrix only has 1368 transitions (discarded 336 similar events)
// Phase 1: matrix 1368 rows 600 cols
[2022-06-12 21:15:47] [INFO ] Computed 31 place invariants in 15 ms
[2022-06-12 21:15:47] [INFO ] [Real]Absence check using 23 positive place invariants in 12 ms returned sat
[2022-06-12 21:15:47] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 4 ms returned sat
[2022-06-12 21:15:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:15:48] [INFO ] [Real]Absence check using state equation in 229 ms returned sat
[2022-06-12 21:15:48] [INFO ] State equation strengthened by 546 read => feed constraints.
[2022-06-12 21:15:48] [INFO ] [Real]Added 546 Read/Feed constraints in 56 ms returned sat
[2022-06-12 21:15:48] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:15:48] [INFO ] [Nat]Absence check using 23 positive place invariants in 12 ms returned sat
[2022-06-12 21:15:48] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 4 ms returned sat
[2022-06-12 21:15:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:15:48] [INFO ] [Nat]Absence check using state equation in 262 ms returned sat
[2022-06-12 21:15:48] [INFO ] [Nat]Added 546 Read/Feed constraints in 62 ms returned sat
[2022-06-12 21:15:48] [INFO ] Deduced a trap composed of 24 places in 181 ms of which 1 ms to minimize.
[2022-06-12 21:15:49] [INFO ] Deduced a trap composed of 24 places in 184 ms of which 1 ms to minimize.
[2022-06-12 21:15:49] [INFO ] Deduced a trap composed of 25 places in 181 ms of which 0 ms to minimize.
[2022-06-12 21:15:49] [INFO ] Deduced a trap composed of 35 places in 183 ms of which 0 ms to minimize.
[2022-06-12 21:15:49] [INFO ] Deduced a trap composed of 31 places in 181 ms of which 1 ms to minimize.
[2022-06-12 21:15:50] [INFO ] Deduced a trap composed of 38 places in 185 ms of which 1 ms to minimize.
[2022-06-12 21:15:50] [INFO ] Deduced a trap composed of 95 places in 182 ms of which 0 ms to minimize.
[2022-06-12 21:15:50] [INFO ] Deduced a trap composed of 115 places in 183 ms of which 0 ms to minimize.
[2022-06-12 21:15:50] [INFO ] Deduced a trap composed of 105 places in 180 ms of which 0 ms to minimize.
[2022-06-12 21:15:50] [INFO ] Deduced a trap composed of 60 places in 184 ms of which 1 ms to minimize.
[2022-06-12 21:15:51] [INFO ] Deduced a trap composed of 67 places in 186 ms of which 0 ms to minimize.
[2022-06-12 21:15:51] [INFO ] Deduced a trap composed of 57 places in 186 ms of which 0 ms to minimize.
[2022-06-12 21:15:51] [INFO ] Deduced a trap composed of 53 places in 182 ms of which 0 ms to minimize.
[2022-06-12 21:15:51] [INFO ] Deduced a trap composed of 52 places in 181 ms of which 1 ms to minimize.
[2022-06-12 21:15:52] [INFO ] Deduced a trap composed of 57 places in 186 ms of which 1 ms to minimize.
[2022-06-12 21:15:52] [INFO ] Deduced a trap composed of 82 places in 184 ms of which 1 ms to minimize.
[2022-06-12 21:15:52] [INFO ] Deduced a trap composed of 111 places in 154 ms of which 1 ms to minimize.
[2022-06-12 21:15:52] [INFO ] Deduced a trap composed of 134 places in 156 ms of which 0 ms to minimize.
[2022-06-12 21:15:52] [INFO ] Deduced a trap composed of 47 places in 185 ms of which 0 ms to minimize.
[2022-06-12 21:15:53] [INFO ] Deduced a trap composed of 66 places in 182 ms of which 1 ms to minimize.
[2022-06-12 21:15:53] [INFO ] Deduced a trap composed of 89 places in 186 ms of which 0 ms to minimize.
[2022-06-12 21:15:53] [INFO ] Deduced a trap composed of 44 places in 149 ms of which 0 ms to minimize.
[2022-06-12 21:15:53] [INFO ] Deduced a trap composed of 55 places in 206 ms of which 1 ms to minimize.
[2022-06-12 21:15:54] [INFO ] Deduced a trap composed of 24 places in 202 ms of which 0 ms to minimize.
[2022-06-12 21:15:54] [INFO ] Deduced a trap composed of 80 places in 198 ms of which 0 ms to minimize.
[2022-06-12 21:15:54] [INFO ] Deduced a trap composed of 105 places in 202 ms of which 1 ms to minimize.
[2022-06-12 21:15:54] [INFO ] Deduced a trap composed of 104 places in 195 ms of which 0 ms to minimize.
[2022-06-12 21:15:55] [INFO ] Deduced a trap composed of 79 places in 193 ms of which 1 ms to minimize.
[2022-06-12 21:15:55] [INFO ] Deduced a trap composed of 20 places in 198 ms of which 0 ms to minimize.
[2022-06-12 21:15:55] [INFO ] Deduced a trap composed of 16 places in 197 ms of which 1 ms to minimize.
[2022-06-12 21:15:55] [INFO ] Deduced a trap composed of 59 places in 207 ms of which 2 ms to minimize.
[2022-06-12 21:15:56] [INFO ] Deduced a trap composed of 52 places in 210 ms of which 1 ms to minimize.
[2022-06-12 21:15:56] [INFO ] Deduced a trap composed of 17 places in 199 ms of which 1 ms to minimize.
[2022-06-12 21:15:56] [INFO ] Deduced a trap composed of 15 places in 195 ms of which 1 ms to minimize.
[2022-06-12 21:15:56] [INFO ] Deduced a trap composed of 14 places in 198 ms of which 2 ms to minimize.
[2022-06-12 21:15:57] [INFO ] Deduced a trap composed of 17 places in 192 ms of which 1 ms to minimize.
[2022-06-12 21:15:57] [INFO ] Deduced a trap composed of 81 places in 184 ms of which 0 ms to minimize.
[2022-06-12 21:15:57] [INFO ] Deduced a trap composed of 56 places in 187 ms of which 0 ms to minimize.
[2022-06-12 21:15:57] [INFO ] Deduced a trap composed of 113 places in 159 ms of which 1 ms to minimize.
[2022-06-12 21:15:57] [INFO ] Deduced a trap composed of 55 places in 162 ms of which 0 ms to minimize.
[2022-06-12 21:15:58] [INFO ] Deduced a trap composed of 94 places in 166 ms of which 1 ms to minimize.
[2022-06-12 21:15:58] [INFO ] Deduced a trap composed of 55 places in 165 ms of which 1 ms to minimize.
[2022-06-12 21:15:58] [INFO ] Deduced a trap composed of 109 places in 163 ms of which 1 ms to minimize.
[2022-06-12 21:15:58] [INFO ] Deduced a trap composed of 129 places in 164 ms of which 1 ms to minimize.
[2022-06-12 21:15:59] [INFO ] Deduced a trap composed of 44 places in 174 ms of which 0 ms to minimize.
[2022-06-12 21:15:59] [INFO ] Deduced a trap composed of 32 places in 193 ms of which 1 ms to minimize.
[2022-06-12 21:15:59] [INFO ] Deduced a trap composed of 73 places in 196 ms of which 0 ms to minimize.
[2022-06-12 21:15:59] [INFO ] Deduced a trap composed of 71 places in 192 ms of which 0 ms to minimize.
[2022-06-12 21:16:00] [INFO ] Deduced a trap composed of 93 places in 193 ms of which 0 ms to minimize.
[2022-06-12 21:16:00] [INFO ] Deduced a trap composed of 93 places in 196 ms of which 0 ms to minimize.
[2022-06-12 21:16:00] [INFO ] Deduced a trap composed of 21 places in 192 ms of which 0 ms to minimize.
[2022-06-12 21:16:00] [INFO ] Deduced a trap composed of 15 places in 190 ms of which 0 ms to minimize.
[2022-06-12 21:16:00] [INFO ] Deduced a trap composed of 29 places in 200 ms of which 9 ms to minimize.
[2022-06-12 21:16:01] [INFO ] Deduced a trap composed of 20 places in 180 ms of which 0 ms to minimize.
[2022-06-12 21:16:01] [INFO ] Deduced a trap composed of 23 places in 203 ms of which 1 ms to minimize.
[2022-06-12 21:16:01] [INFO ] Deduced a trap composed of 81 places in 191 ms of which 1 ms to minimize.
[2022-06-12 21:16:01] [INFO ] Deduced a trap composed of 38 places in 190 ms of which 0 ms to minimize.
[2022-06-12 21:16:02] [INFO ] Deduced a trap composed of 82 places in 219 ms of which 1 ms to minimize.
[2022-06-12 21:16:02] [INFO ] Deduced a trap composed of 43 places in 190 ms of which 0 ms to minimize.
[2022-06-12 21:16:02] [INFO ] Deduced a trap composed of 26 places in 192 ms of which 1 ms to minimize.
[2022-06-12 21:16:03] [INFO ] Deduced a trap composed of 44 places in 184 ms of which 1 ms to minimize.
[2022-06-12 21:16:03] [INFO ] Deduced a trap composed of 20 places in 183 ms of which 0 ms to minimize.
[2022-06-12 21:16:03] [INFO ] Deduced a trap composed of 30 places in 185 ms of which 0 ms to minimize.
[2022-06-12 21:16:03] [INFO ] Deduced a trap composed of 13 places in 193 ms of which 1 ms to minimize.
[2022-06-12 21:16:03] [INFO ] Deduced a trap composed of 35 places in 184 ms of which 1 ms to minimize.
[2022-06-12 21:16:04] [INFO ] Deduced a trap composed of 31 places in 188 ms of which 1 ms to minimize.
[2022-06-12 21:16:04] [INFO ] Deduced a trap composed of 34 places in 190 ms of which 0 ms to minimize.
[2022-06-12 21:16:04] [INFO ] Deduced a trap composed of 27 places in 190 ms of which 1 ms to minimize.
[2022-06-12 21:16:04] [INFO ] Deduced a trap composed of 15 places in 176 ms of which 1 ms to minimize.
[2022-06-12 21:16:05] [INFO ] Deduced a trap composed of 24 places in 178 ms of which 1 ms to minimize.
[2022-06-12 21:16:05] [INFO ] Deduced a trap composed of 31 places in 196 ms of which 1 ms to minimize.
[2022-06-12 21:16:05] [INFO ] Deduced a trap composed of 12 places in 191 ms of which 1 ms to minimize.
[2022-06-12 21:16:06] [INFO ] Deduced a trap composed of 71 places in 178 ms of which 1 ms to minimize.
[2022-06-12 21:16:06] [INFO ] Deduced a trap composed of 70 places in 180 ms of which 0 ms to minimize.
[2022-06-12 21:16:06] [INFO ] Deduced a trap composed of 77 places in 171 ms of which 1 ms to minimize.
[2022-06-12 21:16:06] [INFO ] Deduced a trap composed of 23 places in 175 ms of which 0 ms to minimize.
[2022-06-12 21:16:07] [INFO ] Deduced a trap composed of 25 places in 183 ms of which 0 ms to minimize.
[2022-06-12 21:16:07] [INFO ] Deduced a trap composed of 73 places in 178 ms of which 1 ms to minimize.
[2022-06-12 21:16:07] [INFO ] Deduced a trap composed of 64 places in 195 ms of which 1 ms to minimize.
[2022-06-12 21:16:07] [INFO ] Deduced a trap composed of 29 places in 178 ms of which 0 ms to minimize.
[2022-06-12 21:16:11] [INFO ] Deduced a trap composed of 2 places in 217 ms of which 0 ms to minimize.
[2022-06-12 21:16:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 81 trap constraints in 22616 ms
[2022-06-12 21:16:11] [INFO ] [Real]Absence check using 23 positive place invariants in 11 ms returned sat
[2022-06-12 21:16:11] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 5 ms returned sat
[2022-06-12 21:16:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:16:11] [INFO ] [Real]Absence check using state equation in 241 ms returned sat
[2022-06-12 21:16:11] [INFO ] [Real]Added 546 Read/Feed constraints in 55 ms returned sat
[2022-06-12 21:16:11] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:16:11] [INFO ] [Nat]Absence check using 23 positive place invariants in 13 ms returned sat
[2022-06-12 21:16:11] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 7 ms returned sat
[2022-06-12 21:16:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:16:12] [INFO ] [Nat]Absence check using state equation in 235 ms returned sat
[2022-06-12 21:16:12] [INFO ] [Nat]Added 546 Read/Feed constraints in 56 ms returned sat
[2022-06-12 21:16:12] [INFO ] Deduced a trap composed of 17 places in 181 ms of which 1 ms to minimize.
[2022-06-12 21:16:12] [INFO ] Deduced a trap composed of 58 places in 187 ms of which 1 ms to minimize.
[2022-06-12 21:16:12] [INFO ] Deduced a trap composed of 53 places in 187 ms of which 0 ms to minimize.
[2022-06-12 21:16:13] [INFO ] Deduced a trap composed of 66 places in 185 ms of which 0 ms to minimize.
[2022-06-12 21:16:13] [INFO ] Deduced a trap composed of 38 places in 189 ms of which 1 ms to minimize.
[2022-06-12 21:16:13] [INFO ] Deduced a trap composed of 69 places in 189 ms of which 0 ms to minimize.
[2022-06-12 21:16:13] [INFO ] Deduced a trap composed of 44 places in 191 ms of which 0 ms to minimize.
[2022-06-12 21:16:13] [INFO ] Deduced a trap composed of 98 places in 189 ms of which 0 ms to minimize.
[2022-06-12 21:16:14] [INFO ] Deduced a trap composed of 44 places in 186 ms of which 1 ms to minimize.
[2022-06-12 21:16:14] [INFO ] Deduced a trap composed of 21 places in 187 ms of which 0 ms to minimize.
[2022-06-12 21:16:14] [INFO ] Deduced a trap composed of 21 places in 190 ms of which 0 ms to minimize.
[2022-06-12 21:16:14] [INFO ] Deduced a trap composed of 39 places in 190 ms of which 0 ms to minimize.
[2022-06-12 21:16:15] [INFO ] Deduced a trap composed of 56 places in 186 ms of which 1 ms to minimize.
[2022-06-12 21:16:15] [INFO ] Deduced a trap composed of 57 places in 194 ms of which 1 ms to minimize.
[2022-06-12 21:16:15] [INFO ] Deduced a trap composed of 35 places in 189 ms of which 1 ms to minimize.
[2022-06-12 21:16:15] [INFO ] Deduced a trap composed of 48 places in 186 ms of which 0 ms to minimize.
[2022-06-12 21:16:16] [INFO ] Deduced a trap composed of 21 places in 187 ms of which 0 ms to minimize.
[2022-06-12 21:16:16] [INFO ] Deduced a trap composed of 30 places in 190 ms of which 0 ms to minimize.
[2022-06-12 21:16:16] [INFO ] Deduced a trap composed of 31 places in 188 ms of which 1 ms to minimize.
[2022-06-12 21:16:16] [INFO ] Deduced a trap composed of 61 places in 181 ms of which 1 ms to minimize.
[2022-06-12 21:16:17] [INFO ] Deduced a trap composed of 62 places in 186 ms of which 0 ms to minimize.
[2022-06-12 21:16:17] [INFO ] Deduced a trap composed of 48 places in 188 ms of which 0 ms to minimize.
[2022-06-12 21:16:17] [INFO ] Deduced a trap composed of 75 places in 194 ms of which 0 ms to minimize.
[2022-06-12 21:16:17] [INFO ] Deduced a trap composed of 61 places in 185 ms of which 0 ms to minimize.
[2022-06-12 21:16:17] [INFO ] Deduced a trap composed of 82 places in 187 ms of which 1 ms to minimize.
[2022-06-12 21:16:18] [INFO ] Deduced a trap composed of 81 places in 191 ms of which 0 ms to minimize.
[2022-06-12 21:16:18] [INFO ] Deduced a trap composed of 89 places in 196 ms of which 0 ms to minimize.
[2022-06-12 21:16:18] [INFO ] Deduced a trap composed of 41 places in 191 ms of which 1 ms to minimize.
[2022-06-12 21:16:18] [INFO ] Deduced a trap composed of 47 places in 179 ms of which 1 ms to minimize.
[2022-06-12 21:16:19] [INFO ] Deduced a trap composed of 113 places in 183 ms of which 0 ms to minimize.
[2022-06-12 21:16:19] [INFO ] Deduced a trap composed of 54 places in 197 ms of which 4 ms to minimize.
[2022-06-12 21:16:19] [INFO ] Deduced a trap composed of 12 places in 185 ms of which 1 ms to minimize.
[2022-06-12 21:16:19] [INFO ] Deduced a trap composed of 12 places in 177 ms of which 1 ms to minimize.
[2022-06-12 21:16:20] [INFO ] Deduced a trap composed of 51 places in 186 ms of which 0 ms to minimize.
[2022-06-12 21:16:20] [INFO ] Deduced a trap composed of 13 places in 186 ms of which 1 ms to minimize.
[2022-06-12 21:16:20] [INFO ] Deduced a trap composed of 16 places in 191 ms of which 1 ms to minimize.
[2022-06-12 21:16:20] [INFO ] Deduced a trap composed of 55 places in 192 ms of which 0 ms to minimize.
[2022-06-12 21:16:20] [INFO ] Deduced a trap composed of 83 places in 179 ms of which 0 ms to minimize.
[2022-06-12 21:16:21] [INFO ] Deduced a trap composed of 103 places in 177 ms of which 0 ms to minimize.
[2022-06-12 21:16:21] [INFO ] Deduced a trap composed of 67 places in 180 ms of which 1 ms to minimize.
[2022-06-12 21:16:21] [INFO ] Deduced a trap composed of 79 places in 180 ms of which 0 ms to minimize.
[2022-06-12 21:16:21] [INFO ] Deduced a trap composed of 108 places in 179 ms of which 0 ms to minimize.
[2022-06-12 21:16:22] [INFO ] Deduced a trap composed of 31 places in 190 ms of which 1 ms to minimize.
[2022-06-12 21:16:22] [INFO ] Deduced a trap composed of 48 places in 188 ms of which 1 ms to minimize.
[2022-06-12 21:16:22] [INFO ] Deduced a trap composed of 56 places in 183 ms of which 1 ms to minimize.
[2022-06-12 21:16:22] [INFO ] Deduced a trap composed of 55 places in 188 ms of which 0 ms to minimize.
[2022-06-12 21:16:23] [INFO ] Deduced a trap composed of 93 places in 182 ms of which 0 ms to minimize.
[2022-06-12 21:16:23] [INFO ] Deduced a trap composed of 79 places in 188 ms of which 0 ms to minimize.
[2022-06-12 21:16:23] [INFO ] Deduced a trap composed of 25 places in 180 ms of which 1 ms to minimize.
[2022-06-12 21:16:23] [INFO ] Deduced a trap composed of 47 places in 198 ms of which 0 ms to minimize.
[2022-06-12 21:16:23] [INFO ] Deduced a trap composed of 41 places in 185 ms of which 1 ms to minimize.
[2022-06-12 21:16:24] [INFO ] Deduced a trap composed of 121 places in 178 ms of which 0 ms to minimize.
[2022-06-12 21:16:24] [INFO ] Deduced a trap composed of 149 places in 200 ms of which 0 ms to minimize.
[2022-06-12 21:16:24] [INFO ] Deduced a trap composed of 81 places in 180 ms of which 1 ms to minimize.
[2022-06-12 21:16:24] [INFO ] Deduced a trap composed of 113 places in 177 ms of which 0 ms to minimize.
[2022-06-12 21:16:25] [INFO ] Deduced a trap composed of 114 places in 179 ms of which 1 ms to minimize.
[2022-06-12 21:16:25] [INFO ] Deduced a trap composed of 131 places in 173 ms of which 0 ms to minimize.
[2022-06-12 21:16:25] [INFO ] Deduced a trap composed of 113 places in 172 ms of which 0 ms to minimize.
[2022-06-12 21:16:25] [INFO ] Deduced a trap composed of 30 places in 174 ms of which 1 ms to minimize.
[2022-06-12 21:16:26] [INFO ] Deduced a trap composed of 82 places in 174 ms of which 1 ms to minimize.
[2022-06-12 21:16:26] [INFO ] Deduced a trap composed of 106 places in 176 ms of which 1 ms to minimize.
[2022-06-12 21:16:26] [INFO ] Deduced a trap composed of 119 places in 177 ms of which 1 ms to minimize.
[2022-06-12 21:16:26] [INFO ] Deduced a trap composed of 133 places in 175 ms of which 0 ms to minimize.
[2022-06-12 21:16:26] [INFO ] Deduced a trap composed of 146 places in 177 ms of which 0 ms to minimize.
[2022-06-12 21:16:27] [INFO ] Deduced a trap composed of 147 places in 178 ms of which 1 ms to minimize.
[2022-06-12 21:16:27] [INFO ] Deduced a trap composed of 95 places in 197 ms of which 0 ms to minimize.
[2022-06-12 21:16:27] [INFO ] Deduced a trap composed of 96 places in 178 ms of which 1 ms to minimize.
[2022-06-12 21:16:27] [INFO ] Deduced a trap composed of 49 places in 169 ms of which 1 ms to minimize.
[2022-06-12 21:16:28] [INFO ] Deduced a trap composed of 73 places in 181 ms of which 0 ms to minimize.
[2022-06-12 21:16:28] [INFO ] Deduced a trap composed of 34 places in 183 ms of which 1 ms to minimize.
[2022-06-12 21:16:28] [INFO ] Deduced a trap composed of 44 places in 175 ms of which 1 ms to minimize.
[2022-06-12 21:16:28] [INFO ] Deduced a trap composed of 39 places in 182 ms of which 0 ms to minimize.
[2022-06-12 21:16:29] [INFO ] Deduced a trap composed of 57 places in 171 ms of which 0 ms to minimize.
[2022-06-12 21:16:29] [INFO ] Deduced a trap composed of 51 places in 172 ms of which 0 ms to minimize.
[2022-06-12 21:16:29] [INFO ] Deduced a trap composed of 61 places in 175 ms of which 1 ms to minimize.
[2022-06-12 21:16:29] [INFO ] Deduced a trap composed of 42 places in 176 ms of which 1 ms to minimize.
[2022-06-12 21:16:29] [INFO ] Deduced a trap composed of 71 places in 169 ms of which 0 ms to minimize.
[2022-06-12 21:16:30] [INFO ] Deduced a trap composed of 53 places in 172 ms of which 0 ms to minimize.
[2022-06-12 21:16:30] [INFO ] Deduced a trap composed of 12 places in 193 ms of which 1 ms to minimize.
[2022-06-12 21:16:30] [INFO ] Deduced a trap composed of 13 places in 167 ms of which 1 ms to minimize.
[2022-06-12 21:16:30] [INFO ] Deduced a trap composed of 24 places in 169 ms of which 1 ms to minimize.
[2022-06-12 21:16:31] [INFO ] Deduced a trap composed of 62 places in 174 ms of which 1 ms to minimize.
[2022-06-12 21:16:31] [INFO ] Deduced a trap composed of 38 places in 177 ms of which 0 ms to minimize.
[2022-06-12 21:16:31] [INFO ] Deduced a trap composed of 34 places in 173 ms of which 0 ms to minimize.
[2022-06-12 21:16:31] [INFO ] Deduced a trap composed of 89 places in 175 ms of which 0 ms to minimize.
[2022-06-12 21:16:31] [INFO ] Deduced a trap composed of 76 places in 171 ms of which 1 ms to minimize.
[2022-06-12 21:16:32] [INFO ] Deduced a trap composed of 80 places in 175 ms of which 0 ms to minimize.
[2022-06-12 21:16:32] [INFO ] Deduced a trap composed of 60 places in 174 ms of which 0 ms to minimize.
[2022-06-12 21:16:32] [INFO ] Deduced a trap composed of 49 places in 173 ms of which 1 ms to minimize.
[2022-06-12 21:16:32] [INFO ] Deduced a trap composed of 43 places in 181 ms of which 1 ms to minimize.
[2022-06-12 21:16:33] [INFO ] Deduced a trap composed of 89 places in 172 ms of which 0 ms to minimize.
[2022-06-12 21:16:33] [INFO ] Deduced a trap composed of 119 places in 176 ms of which 0 ms to minimize.
[2022-06-12 21:16:33] [INFO ] Deduced a trap composed of 78 places in 174 ms of which 0 ms to minimize.
[2022-06-12 21:16:33] [INFO ] Deduced a trap composed of 94 places in 177 ms of which 0 ms to minimize.
[2022-06-12 21:16:33] [INFO ] Deduced a trap composed of 114 places in 174 ms of which 1 ms to minimize.
[2022-06-12 21:16:34] [INFO ] Deduced a trap composed of 132 places in 173 ms of which 1 ms to minimize.
[2022-06-12 21:16:34] [INFO ] Deduced a trap composed of 16 places in 184 ms of which 0 ms to minimize.
[2022-06-12 21:16:34] [INFO ] Deduced a trap composed of 15 places in 181 ms of which 1 ms to minimize.
[2022-06-12 21:16:34] [INFO ] Deduced a trap composed of 50 places in 184 ms of which 1 ms to minimize.
[2022-06-12 21:16:35] [INFO ] Deduced a trap composed of 112 places in 189 ms of which 0 ms to minimize.
[2022-06-12 21:16:35] [INFO ] Deduced a trap composed of 62 places in 176 ms of which 0 ms to minimize.
[2022-06-12 21:16:35] [INFO ] Deduced a trap composed of 21 places in 176 ms of which 0 ms to minimize.
[2022-06-12 21:16:35] [INFO ] Deduced a trap composed of 25 places in 179 ms of which 0 ms to minimize.
[2022-06-12 21:16:36] [INFO ] Deduced a trap composed of 29 places in 174 ms of which 0 ms to minimize.
[2022-06-12 21:16:36] [INFO ] Deduced a trap composed of 11 places in 180 ms of which 0 ms to minimize.
[2022-06-12 21:16:36] [INFO ] Deduced a trap composed of 88 places in 180 ms of which 0 ms to minimize.
[2022-06-12 21:16:36] [INFO ] Deduced a trap composed of 76 places in 177 ms of which 1 ms to minimize.
[2022-06-12 21:16:37] [INFO ] Deduced a trap composed of 28 places in 179 ms of which 1 ms to minimize.
[2022-06-12 21:16:37] [INFO ] Deduced a trap composed of 39 places in 180 ms of which 1 ms to minimize.
[2022-06-12 21:16:37] [INFO ] Deduced a trap composed of 26 places in 189 ms of which 0 ms to minimize.
[2022-06-12 21:16:37] [INFO ] Deduced a trap composed of 65 places in 179 ms of which 1 ms to minimize.
[2022-06-12 21:16:38] [INFO ] Deduced a trap composed of 15 places in 176 ms of which 0 ms to minimize.
[2022-06-12 21:16:38] [INFO ] Deduced a trap composed of 14 places in 176 ms of which 1 ms to minimize.
[2022-06-12 21:16:38] [INFO ] Deduced a trap composed of 27 places in 173 ms of which 0 ms to minimize.
[2022-06-12 21:16:38] [INFO ] Deduced a trap composed of 31 places in 172 ms of which 1 ms to minimize.
[2022-06-12 21:16:40] [INFO ] Deduced a trap composed of 29 places in 172 ms of which 0 ms to minimize.
[2022-06-12 21:16:40] [INFO ] Deduced a trap composed of 28 places in 167 ms of which 1 ms to minimize.
[2022-06-12 21:16:41] [INFO ] Deduced a trap composed of 17 places in 177 ms of which 1 ms to minimize.
[2022-06-12 21:16:41] [INFO ] Deduced a trap composed of 79 places in 186 ms of which 1 ms to minimize.
[2022-06-12 21:16:41] [INFO ] Deduced a trap composed of 61 places in 178 ms of which 0 ms to minimize.
[2022-06-12 21:16:41] [INFO ] Deduced a trap composed of 62 places in 183 ms of which 1 ms to minimize.
[2022-06-12 21:16:42] [INFO ] Deduced a trap composed of 91 places in 182 ms of which 0 ms to minimize.
[2022-06-12 21:16:42] [INFO ] Deduced a trap composed of 105 places in 188 ms of which 1 ms to minimize.
[2022-06-12 21:16:42] [INFO ] Deduced a trap composed of 120 places in 180 ms of which 1 ms to minimize.
[2022-06-12 21:16:56] [INFO ] Deduced a trap composed of 2 places in 228 ms of which 1 ms to minimize.
[2022-06-12 21:16:56] [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
FORMULA Peterson-COL-7-ReachabilityCardinality-04 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 2 Parikh solutions to 1 different solutions.
Support contains 8 out of 600 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 600/600 places, 1704/1704 transitions.
Applied a total of 0 rules in 60 ms. Remains 600 /600 variables (removed 0) and now considering 1704/1704 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 600/600 places, 1704/1704 transitions.
[2022-06-12 21:16:57] [INFO ] Flatten gal took : 58 ms
[2022-06-12 21:16:57] [INFO ] Flatten gal took : 56 ms
[2022-06-12 21:16:57] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7593420074286613242.gal : 8 ms
[2022-06-12 21:16:57] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3407220801972602346.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/ReachabilityCardinality7593420074286613242.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality3407220801972602346.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/ReachabilityCardinality7593420074286613242.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality3407220801972602346.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality3407220801972602346.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 3
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :3 after 7
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :7 after 8
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :8 after 9
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :9 after 13
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :13 after 32
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :32 after 48
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :48 after 98
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :98 after 156
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :156 after 875
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :875 after 2218
Detected timeout of ITS tools.
[2022-06-12 21:17:12] [INFO ] Flatten gal took : 52 ms
[2022-06-12 21:17:12] [INFO ] Applying decomposition
[2022-06-12 21:17:12] [INFO ] Flatten gal took : 52 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/graph12210782906845362295.txt, -o, /tmp/graph12210782906845362295.bin, -w, /tmp/graph12210782906845362295.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/graph12210782906845362295.bin, -l, -1, -v, -w, /tmp/graph12210782906845362295.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-12 21:17:12] [INFO ] Decomposing Gal with order
[2022-06-12 21:17:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-12 21:17:12] [INFO ] Removed a total of 2585 redundant transitions.
[2022-06-12 21:17:12] [INFO ] Flatten gal took : 116 ms
[2022-06-12 21:17:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 396 labels/synchronizations in 51 ms.
[2022-06-12 21:17:12] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1161690789463573680.gal : 14 ms
[2022-06-12 21:17:12] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16137966301019809716.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/ReachabilityCardinality1161690789463573680.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality16137966301019809716.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/ReachabilityCardinality1161690789463573680.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality16137966301019809716.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality16137966301019809716.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 4
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :4 after 16
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :16 after 19
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :19 after 26
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :26 after 33
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :33 after 40
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :40 after 238
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :238 after 524
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :524 after 2265
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :2265 after 6670
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :6670 after 11385
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin234897571596233570
[2022-06-12 21:17:27] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin234897571596233570
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/ltsmin234897571596233570]
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/ltsmin234897571596233570] 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/ltsmin234897571596233570] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2253 ms. (steps per millisecond=443 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 759 ms. (steps per millisecond=1317 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 4846968 steps, run timeout after 30001 ms. (steps per millisecond=161 ) properties seen :{}
Probabilistic random walk after 4846968 steps, saw 554685 distinct states, run finished after 30001 ms. (steps per millisecond=161 ) properties seen :{}
Running SMT prover for 1 properties.
[2022-06-12 21:18:01] [INFO ] Flow matrix only has 1368 transitions (discarded 336 similar events)
// Phase 1: matrix 1368 rows 600 cols
[2022-06-12 21:18:01] [INFO ] Computed 31 place invariants in 17 ms
[2022-06-12 21:18:01] [INFO ] [Real]Absence check using 23 positive place invariants in 10 ms returned sat
[2022-06-12 21:18:01] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 4 ms returned sat
[2022-06-12 21:18:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:18:02] [INFO ] [Real]Absence check using state equation in 227 ms returned sat
[2022-06-12 21:18:02] [INFO ] State equation strengthened by 546 read => feed constraints.
[2022-06-12 21:18:02] [INFO ] [Real]Added 546 Read/Feed constraints in 55 ms returned sat
[2022-06-12 21:18:02] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:18:02] [INFO ] [Nat]Absence check using 23 positive place invariants in 12 ms returned sat
[2022-06-12 21:18:02] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 5 ms returned sat
[2022-06-12 21:18:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:18:02] [INFO ] [Nat]Absence check using state equation in 258 ms returned sat
[2022-06-12 21:18:02] [INFO ] [Nat]Added 546 Read/Feed constraints in 63 ms returned sat
[2022-06-12 21:18:03] [INFO ] Deduced a trap composed of 17 places in 171 ms of which 0 ms to minimize.
[2022-06-12 21:18:03] [INFO ] Deduced a trap composed of 58 places in 177 ms of which 1 ms to minimize.
[2022-06-12 21:18:03] [INFO ] Deduced a trap composed of 53 places in 182 ms of which 1 ms to minimize.
[2022-06-12 21:18:03] [INFO ] Deduced a trap composed of 66 places in 178 ms of which 0 ms to minimize.
[2022-06-12 21:18:03] [INFO ] Deduced a trap composed of 38 places in 181 ms of which 1 ms to minimize.
[2022-06-12 21:18:04] [INFO ] Deduced a trap composed of 69 places in 186 ms of which 1 ms to minimize.
[2022-06-12 21:18:04] [INFO ] Deduced a trap composed of 44 places in 175 ms of which 1 ms to minimize.
[2022-06-12 21:18:04] [INFO ] Deduced a trap composed of 98 places in 179 ms of which 1 ms to minimize.
[2022-06-12 21:18:04] [INFO ] Deduced a trap composed of 44 places in 181 ms of which 0 ms to minimize.
[2022-06-12 21:18:05] [INFO ] Deduced a trap composed of 21 places in 184 ms of which 1 ms to minimize.
[2022-06-12 21:18:05] [INFO ] Deduced a trap composed of 21 places in 180 ms of which 0 ms to minimize.
[2022-06-12 21:18:05] [INFO ] Deduced a trap composed of 39 places in 180 ms of which 1 ms to minimize.
[2022-06-12 21:18:05] [INFO ] Deduced a trap composed of 56 places in 180 ms of which 0 ms to minimize.
[2022-06-12 21:18:05] [INFO ] Deduced a trap composed of 57 places in 180 ms of which 0 ms to minimize.
[2022-06-12 21:18:06] [INFO ] Deduced a trap composed of 35 places in 176 ms of which 1 ms to minimize.
[2022-06-12 21:18:06] [INFO ] Deduced a trap composed of 48 places in 180 ms of which 0 ms to minimize.
[2022-06-12 21:18:06] [INFO ] Deduced a trap composed of 21 places in 173 ms of which 0 ms to minimize.
[2022-06-12 21:18:06] [INFO ] Deduced a trap composed of 30 places in 178 ms of which 0 ms to minimize.
[2022-06-12 21:18:07] [INFO ] Deduced a trap composed of 31 places in 174 ms of which 0 ms to minimize.
[2022-06-12 21:18:07] [INFO ] Deduced a trap composed of 61 places in 182 ms of which 0 ms to minimize.
[2022-06-12 21:18:07] [INFO ] Deduced a trap composed of 62 places in 188 ms of which 1 ms to minimize.
[2022-06-12 21:18:07] [INFO ] Deduced a trap composed of 48 places in 185 ms of which 1 ms to minimize.
[2022-06-12 21:18:07] [INFO ] Deduced a trap composed of 75 places in 183 ms of which 1 ms to minimize.
[2022-06-12 21:18:08] [INFO ] Deduced a trap composed of 61 places in 183 ms of which 1 ms to minimize.
[2022-06-12 21:18:08] [INFO ] Deduced a trap composed of 82 places in 183 ms of which 1 ms to minimize.
[2022-06-12 21:18:08] [INFO ] Deduced a trap composed of 81 places in 179 ms of which 0 ms to minimize.
[2022-06-12 21:18:08] [INFO ] Deduced a trap composed of 89 places in 182 ms of which 0 ms to minimize.
[2022-06-12 21:18:09] [INFO ] Deduced a trap composed of 41 places in 182 ms of which 1 ms to minimize.
[2022-06-12 21:18:09] [INFO ] Deduced a trap composed of 47 places in 181 ms of which 1 ms to minimize.
[2022-06-12 21:18:09] [INFO ] Deduced a trap composed of 113 places in 184 ms of which 0 ms to minimize.
[2022-06-12 21:18:09] [INFO ] Deduced a trap composed of 54 places in 188 ms of which 1 ms to minimize.
[2022-06-12 21:18:09] [INFO ] Deduced a trap composed of 12 places in 185 ms of which 0 ms to minimize.
[2022-06-12 21:18:10] [INFO ] Deduced a trap composed of 12 places in 184 ms of which 1 ms to minimize.
[2022-06-12 21:18:10] [INFO ] Deduced a trap composed of 51 places in 186 ms of which 0 ms to minimize.
[2022-06-12 21:18:10] [INFO ] Deduced a trap composed of 13 places in 179 ms of which 0 ms to minimize.
[2022-06-12 21:18:10] [INFO ] Deduced a trap composed of 16 places in 175 ms of which 0 ms to minimize.
[2022-06-12 21:18:11] [INFO ] Deduced a trap composed of 55 places in 184 ms of which 1 ms to minimize.
[2022-06-12 21:18:11] [INFO ] Deduced a trap composed of 83 places in 172 ms of which 1 ms to minimize.
[2022-06-12 21:18:11] [INFO ] Deduced a trap composed of 103 places in 173 ms of which 1 ms to minimize.
[2022-06-12 21:18:11] [INFO ] Deduced a trap composed of 67 places in 172 ms of which 0 ms to minimize.
[2022-06-12 21:18:11] [INFO ] Deduced a trap composed of 79 places in 177 ms of which 1 ms to minimize.
[2022-06-12 21:18:12] [INFO ] Deduced a trap composed of 108 places in 175 ms of which 2 ms to minimize.
[2022-06-12 21:18:12] [INFO ] Deduced a trap composed of 31 places in 186 ms of which 0 ms to minimize.
[2022-06-12 21:18:12] [INFO ] Deduced a trap composed of 48 places in 182 ms of which 0 ms to minimize.
[2022-06-12 21:18:12] [INFO ] Deduced a trap composed of 56 places in 184 ms of which 1 ms to minimize.
[2022-06-12 21:18:13] [INFO ] Deduced a trap composed of 55 places in 189 ms of which 1 ms to minimize.
[2022-06-12 21:18:13] [INFO ] Deduced a trap composed of 93 places in 186 ms of which 1 ms to minimize.
[2022-06-12 21:18:13] [INFO ] Deduced a trap composed of 79 places in 191 ms of which 1 ms to minimize.
[2022-06-12 21:18:13] [INFO ] Deduced a trap composed of 25 places in 180 ms of which 0 ms to minimize.
[2022-06-12 21:18:14] [INFO ] Deduced a trap composed of 47 places in 185 ms of which 1 ms to minimize.
[2022-06-12 21:18:14] [INFO ] Deduced a trap composed of 41 places in 183 ms of which 0 ms to minimize.
[2022-06-12 21:18:14] [INFO ] Deduced a trap composed of 121 places in 173 ms of which 1 ms to minimize.
[2022-06-12 21:18:14] [INFO ] Deduced a trap composed of 149 places in 178 ms of which 0 ms to minimize.
[2022-06-12 21:18:15] [INFO ] Deduced a trap composed of 81 places in 177 ms of which 1 ms to minimize.
[2022-06-12 21:18:15] [INFO ] Deduced a trap composed of 113 places in 174 ms of which 0 ms to minimize.
[2022-06-12 21:18:15] [INFO ] Deduced a trap composed of 114 places in 176 ms of which 0 ms to minimize.
[2022-06-12 21:18:15] [INFO ] Deduced a trap composed of 131 places in 173 ms of which 0 ms to minimize.
[2022-06-12 21:18:15] [INFO ] Deduced a trap composed of 113 places in 173 ms of which 0 ms to minimize.
[2022-06-12 21:18:16] [INFO ] Deduced a trap composed of 30 places in 178 ms of which 0 ms to minimize.
[2022-06-12 21:18:16] [INFO ] Deduced a trap composed of 82 places in 176 ms of which 1 ms to minimize.
[2022-06-12 21:18:16] [INFO ] Deduced a trap composed of 106 places in 172 ms of which 1 ms to minimize.
[2022-06-12 21:18:16] [INFO ] Deduced a trap composed of 119 places in 180 ms of which 1 ms to minimize.
[2022-06-12 21:18:17] [INFO ] Deduced a trap composed of 133 places in 177 ms of which 0 ms to minimize.
[2022-06-12 21:18:17] [INFO ] Deduced a trap composed of 146 places in 174 ms of which 0 ms to minimize.
[2022-06-12 21:18:17] [INFO ] Deduced a trap composed of 147 places in 174 ms of which 1 ms to minimize.
[2022-06-12 21:18:17] [INFO ] Deduced a trap composed of 95 places in 174 ms of which 1 ms to minimize.
[2022-06-12 21:18:17] [INFO ] Deduced a trap composed of 96 places in 170 ms of which 0 ms to minimize.
[2022-06-12 21:18:18] [INFO ] Deduced a trap composed of 49 places in 171 ms of which 0 ms to minimize.
[2022-06-12 21:18:18] [INFO ] Deduced a trap composed of 73 places in 179 ms of which 0 ms to minimize.
[2022-06-12 21:18:18] [INFO ] Deduced a trap composed of 34 places in 188 ms of which 0 ms to minimize.
[2022-06-12 21:18:18] [INFO ] Deduced a trap composed of 44 places in 183 ms of which 0 ms to minimize.
[2022-06-12 21:18:19] [INFO ] Deduced a trap composed of 39 places in 185 ms of which 0 ms to minimize.
[2022-06-12 21:18:19] [INFO ] Deduced a trap composed of 57 places in 170 ms of which 0 ms to minimize.
[2022-06-12 21:18:19] [INFO ] Deduced a trap composed of 51 places in 177 ms of which 0 ms to minimize.
[2022-06-12 21:18:19] [INFO ] Deduced a trap composed of 61 places in 174 ms of which 1 ms to minimize.
[2022-06-12 21:18:20] [INFO ] Deduced a trap composed of 42 places in 177 ms of which 1 ms to minimize.
[2022-06-12 21:18:20] [INFO ] Deduced a trap composed of 71 places in 166 ms of which 1 ms to minimize.
[2022-06-12 21:18:20] [INFO ] Deduced a trap composed of 53 places in 175 ms of which 1 ms to minimize.
[2022-06-12 21:18:20] [INFO ] Deduced a trap composed of 12 places in 172 ms of which 1 ms to minimize.
[2022-06-12 21:18:20] [INFO ] Deduced a trap composed of 13 places in 165 ms of which 1 ms to minimize.
[2022-06-12 21:18:21] [INFO ] Deduced a trap composed of 24 places in 173 ms of which 0 ms to minimize.
[2022-06-12 21:18:21] [INFO ] Deduced a trap composed of 62 places in 174 ms of which 1 ms to minimize.
[2022-06-12 21:18:21] [INFO ] Deduced a trap composed of 38 places in 169 ms of which 0 ms to minimize.
[2022-06-12 21:18:21] [INFO ] Deduced a trap composed of 34 places in 176 ms of which 1 ms to minimize.
[2022-06-12 21:18:22] [INFO ] Deduced a trap composed of 89 places in 171 ms of which 0 ms to minimize.
[2022-06-12 21:18:22] [INFO ] Deduced a trap composed of 76 places in 175 ms of which 0 ms to minimize.
[2022-06-12 21:18:22] [INFO ] Deduced a trap composed of 80 places in 173 ms of which 0 ms to minimize.
[2022-06-12 21:18:22] [INFO ] Deduced a trap composed of 60 places in 168 ms of which 0 ms to minimize.
[2022-06-12 21:18:22] [INFO ] Deduced a trap composed of 49 places in 178 ms of which 0 ms to minimize.
[2022-06-12 21:18:23] [INFO ] Deduced a trap composed of 43 places in 166 ms of which 0 ms to minimize.
[2022-06-12 21:18:23] [INFO ] Deduced a trap composed of 89 places in 174 ms of which 0 ms to minimize.
[2022-06-12 21:18:23] [INFO ] Deduced a trap composed of 119 places in 175 ms of which 0 ms to minimize.
[2022-06-12 21:18:23] [INFO ] Deduced a trap composed of 78 places in 173 ms of which 1 ms to minimize.
[2022-06-12 21:18:24] [INFO ] Deduced a trap composed of 94 places in 170 ms of which 0 ms to minimize.
[2022-06-12 21:18:24] [INFO ] Deduced a trap composed of 114 places in 174 ms of which 1 ms to minimize.
[2022-06-12 21:18:24] [INFO ] Deduced a trap composed of 132 places in 172 ms of which 0 ms to minimize.
[2022-06-12 21:18:24] [INFO ] Deduced a trap composed of 16 places in 179 ms of which 1 ms to minimize.
[2022-06-12 21:18:24] [INFO ] Deduced a trap composed of 15 places in 179 ms of which 1 ms to minimize.
[2022-06-12 21:18:25] [INFO ] Deduced a trap composed of 50 places in 188 ms of which 1 ms to minimize.
[2022-06-12 21:18:25] [INFO ] Deduced a trap composed of 112 places in 187 ms of which 0 ms to minimize.
[2022-06-12 21:18:25] [INFO ] Deduced a trap composed of 62 places in 184 ms of which 1 ms to minimize.
[2022-06-12 21:18:25] [INFO ] Deduced a trap composed of 21 places in 174 ms of which 0 ms to minimize.
[2022-06-12 21:18:26] [INFO ] Deduced a trap composed of 25 places in 180 ms of which 1 ms to minimize.
[2022-06-12 21:18:26] [INFO ] Deduced a trap composed of 29 places in 170 ms of which 1 ms to minimize.
[2022-06-12 21:18:26] [INFO ] Deduced a trap composed of 11 places in 183 ms of which 1 ms to minimize.
[2022-06-12 21:18:26] [INFO ] Deduced a trap composed of 88 places in 170 ms of which 1 ms to minimize.
[2022-06-12 21:18:27] [INFO ] Deduced a trap composed of 76 places in 175 ms of which 0 ms to minimize.
[2022-06-12 21:18:27] [INFO ] Deduced a trap composed of 28 places in 169 ms of which 1 ms to minimize.
[2022-06-12 21:18:27] [INFO ] Deduced a trap composed of 39 places in 170 ms of which 0 ms to minimize.
[2022-06-12 21:18:27] [INFO ] Deduced a trap composed of 26 places in 184 ms of which 0 ms to minimize.
[2022-06-12 21:18:28] [INFO ] Deduced a trap composed of 65 places in 182 ms of which 1 ms to minimize.
[2022-06-12 21:18:28] [INFO ] Deduced a trap composed of 15 places in 178 ms of which 0 ms to minimize.
[2022-06-12 21:18:28] [INFO ] Deduced a trap composed of 14 places in 171 ms of which 0 ms to minimize.
[2022-06-12 21:18:28] [INFO ] Deduced a trap composed of 27 places in 169 ms of which 0 ms to minimize.
[2022-06-12 21:18:29] [INFO ] Deduced a trap composed of 31 places in 174 ms of which 1 ms to minimize.
[2022-06-12 21:18:30] [INFO ] Deduced a trap composed of 29 places in 171 ms of which 0 ms to minimize.
[2022-06-12 21:18:31] [INFO ] Deduced a trap composed of 28 places in 168 ms of which 1 ms to minimize.
[2022-06-12 21:18:31] [INFO ] Deduced a trap composed of 17 places in 176 ms of which 1 ms to minimize.
[2022-06-12 21:18:31] [INFO ] Deduced a trap composed of 79 places in 170 ms of which 1 ms to minimize.
[2022-06-12 21:18:31] [INFO ] Deduced a trap composed of 61 places in 170 ms of which 1 ms to minimize.
[2022-06-12 21:18:32] [INFO ] Deduced a trap composed of 62 places in 177 ms of which 0 ms to minimize.
[2022-06-12 21:18:32] [INFO ] Deduced a trap composed of 91 places in 180 ms of which 1 ms to minimize.
[2022-06-12 21:18:32] [INFO ] Deduced a trap composed of 105 places in 189 ms of which 0 ms to minimize.
[2022-06-12 21:18:32] [INFO ] Deduced a trap composed of 120 places in 181 ms of which 0 ms to minimize.
[2022-06-12 21:18:47] [INFO ] Deduced a trap composed of 2 places in 243 ms of which 0 ms to minimize.
[2022-06-12 21:18:47] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
Support contains 8 out of 600 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 600/600 places, 1704/1704 transitions.
Applied a total of 0 rules in 51 ms. Remains 600 /600 variables (removed 0) and now considering 1704/1704 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 600/600 places, 1704/1704 transitions.
Starting structural reductions, iteration 0 : 600/600 places, 1704/1704 transitions.
Applied a total of 0 rules in 46 ms. Remains 600 /600 variables (removed 0) and now considering 1704/1704 (removed 0) transitions.
[2022-06-12 21:18:47] [INFO ] Flow matrix only has 1368 transitions (discarded 336 similar events)
// Phase 1: matrix 1368 rows 600 cols
[2022-06-12 21:18:47] [INFO ] Computed 31 place invariants in 5 ms
[2022-06-12 21:18:48] [INFO ] Implicit Places using invariants in 418 ms returned [0, 1, 2, 3, 4, 5, 6, 7]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 421 ms to find 8 implicit places.
[2022-06-12 21:18:48] [INFO ] Redundant transitions in 153 ms returned []
[2022-06-12 21:18:48] [INFO ] Flow matrix only has 1368 transitions (discarded 336 similar events)
// Phase 1: matrix 1368 rows 592 cols
[2022-06-12 21:18:48] [INFO ] Computed 23 place invariants in 10 ms
[2022-06-12 21:18:48] [INFO ] Dead Transitions using invariants and state equation in 531 ms returned []
Starting structural reductions, iteration 1 : 592/600 places, 1704/1704 transitions.
Applied a total of 0 rules in 28 ms. Remains 592 /592 variables (removed 0) and now considering 1704/1704 (removed 0) transitions.
[2022-06-12 21:18:48] [INFO ] Redundant transitions in 110 ms returned []
[2022-06-12 21:18:48] [INFO ] Flow matrix only has 1368 transitions (discarded 336 similar events)
// Phase 1: matrix 1368 rows 592 cols
[2022-06-12 21:18:48] [INFO ] Computed 23 place invariants in 4 ms
[2022-06-12 21:18:49] [INFO ] Dead Transitions using invariants and state equation in 582 ms returned []
Finished structural reductions, in 2 iterations. Remains : 592/600 places, 1704/1704 transitions.
[2022-06-12 21:18:49] [INFO ] Flatten gal took : 52 ms
[2022-06-12 21:18:49] [INFO ] Flatten gal took : 56 ms
[2022-06-12 21:18:49] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12822964422431196419.gal : 9 ms
[2022-06-12 21:18:49] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14143528710336252806.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/ReachabilityCardinality12822964422431196419.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality14143528710336252806.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/ReachabilityCardinality12822964422431196419.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality14143528710336252806.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality14143528710336252806.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 4
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :4 after 9
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :9 after 17
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :17 after 24
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :24 after 32
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :32 after 77
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :77 after 174
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :174 after 382
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :382 after 506
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :506 after 3582
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :3582 after 7224
Detected timeout of ITS tools.
[2022-06-12 21:19:04] [INFO ] Flatten gal took : 44 ms
[2022-06-12 21:19:04] [INFO ] Applying decomposition
[2022-06-12 21:19:04] [INFO ] Flatten gal took : 47 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/graph9766262083994374049.txt, -o, /tmp/graph9766262083994374049.bin, -w, /tmp/graph9766262083994374049.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/graph9766262083994374049.bin, -l, -1, -v, -w, /tmp/graph9766262083994374049.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-12 21:19:04] [INFO ] Decomposing Gal with order
[2022-06-12 21:19:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-12 21:19:05] [INFO ] Removed a total of 2622 redundant transitions.
[2022-06-12 21:19:05] [INFO ] Flatten gal took : 112 ms
[2022-06-12 21:19:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 111 labels/synchronizations in 15 ms.
[2022-06-12 21:19:05] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12386502042949597231.gal : 8 ms
[2022-06-12 21:19:05] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12389049818115506906.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/ReachabilityCardinality12386502042949597231.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality12389049818115506906.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/ReachabilityCardinality12386502042949597231.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality12389049818115506906.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality12389049818115506906.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 4
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :4 after 12
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :12 after 21
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :21 after 32
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :32 after 186
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :186 after 250
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :250 after 678
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :678 after 6783
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :6783 after 15207
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :15207 after 142778
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11630371819501294575
[2022-06-12 21:19:20] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11630371819501294575
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/ltsmin11630371819501294575]
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/ltsmin11630371819501294575] 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/ltsmin11630371819501294575] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2142 ms. (steps per millisecond=466 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 682 ms. (steps per millisecond=1466 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 4869819 steps, run timeout after 30001 ms. (steps per millisecond=162 ) properties seen :{}
Probabilistic random walk after 4869819 steps, saw 555430 distinct states, run finished after 30001 ms. (steps per millisecond=162 ) properties seen :{}
Running SMT prover for 1 properties.
[2022-06-12 21:19:54] [INFO ] Flow matrix only has 1368 transitions (discarded 336 similar events)
// Phase 1: matrix 1368 rows 592 cols
[2022-06-12 21:19:54] [INFO ] Computed 23 place invariants in 3 ms
[2022-06-12 21:19:54] [INFO ] [Real]Absence check using 23 positive place invariants in 9 ms returned sat
[2022-06-12 21:19:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:19:54] [INFO ] [Real]Absence check using state equation in 271 ms returned sat
[2022-06-12 21:19:54] [INFO ] State equation strengthened by 546 read => feed constraints.
[2022-06-12 21:19:54] [INFO ] [Real]Added 546 Read/Feed constraints in 57 ms returned sat
[2022-06-12 21:19:54] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:19:54] [INFO ] [Nat]Absence check using 23 positive place invariants in 11 ms returned sat
[2022-06-12 21:19:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:19:54] [INFO ] [Nat]Absence check using state equation in 243 ms returned sat
[2022-06-12 21:19:55] [INFO ] [Nat]Added 546 Read/Feed constraints in 61 ms returned sat
[2022-06-12 21:19:55] [INFO ] Deduced a trap composed of 131 places in 192 ms of which 1 ms to minimize.
[2022-06-12 21:19:55] [INFO ] Deduced a trap composed of 29 places in 190 ms of which 0 ms to minimize.
[2022-06-12 21:19:55] [INFO ] Deduced a trap composed of 36 places in 183 ms of which 0 ms to minimize.
[2022-06-12 21:19:55] [INFO ] Deduced a trap composed of 43 places in 184 ms of which 0 ms to minimize.
[2022-06-12 21:19:56] [INFO ] Deduced a trap composed of 26 places in 177 ms of which 0 ms to minimize.
[2022-06-12 21:19:56] [INFO ] Deduced a trap composed of 36 places in 177 ms of which 0 ms to minimize.
[2022-06-12 21:19:56] [INFO ] Deduced a trap composed of 23 places in 175 ms of which 1 ms to minimize.
[2022-06-12 21:19:56] [INFO ] Deduced a trap composed of 23 places in 171 ms of which 1 ms to minimize.
[2022-06-12 21:19:57] [INFO ] Deduced a trap composed of 60 places in 176 ms of which 0 ms to minimize.
[2022-06-12 21:19:57] [INFO ] Deduced a trap composed of 55 places in 172 ms of which 1 ms to minimize.
[2022-06-12 21:19:57] [INFO ] Deduced a trap composed of 50 places in 177 ms of which 1 ms to minimize.
[2022-06-12 21:19:57] [INFO ] Deduced a trap composed of 75 places in 178 ms of which 1 ms to minimize.
[2022-06-12 21:19:57] [INFO ] Deduced a trap composed of 64 places in 179 ms of which 0 ms to minimize.
[2022-06-12 21:19:58] [INFO ] Deduced a trap composed of 63 places in 176 ms of which 1 ms to minimize.
[2022-06-12 21:19:58] [INFO ] Deduced a trap composed of 14 places in 181 ms of which 0 ms to minimize.
[2022-06-12 21:19:58] [INFO ] Deduced a trap composed of 51 places in 178 ms of which 0 ms to minimize.
[2022-06-12 21:19:58] [INFO ] Deduced a trap composed of 25 places in 174 ms of which 1 ms to minimize.
[2022-06-12 21:19:58] [INFO ] Deduced a trap composed of 22 places in 180 ms of which 1 ms to minimize.
[2022-06-12 21:19:59] [INFO ] Deduced a trap composed of 35 places in 183 ms of which 1 ms to minimize.
[2022-06-12 21:19:59] [INFO ] Deduced a trap composed of 70 places in 182 ms of which 1 ms to minimize.
[2022-06-12 21:19:59] [INFO ] Deduced a trap composed of 31 places in 176 ms of which 0 ms to minimize.
[2022-06-12 21:19:59] [INFO ] Deduced a trap composed of 96 places in 182 ms of which 0 ms to minimize.
[2022-06-12 21:20:00] [INFO ] Deduced a trap composed of 91 places in 182 ms of which 0 ms to minimize.
[2022-06-12 21:20:00] [INFO ] Deduced a trap composed of 89 places in 183 ms of which 0 ms to minimize.
[2022-06-12 21:20:00] [INFO ] Deduced a trap composed of 71 places in 181 ms of which 0 ms to minimize.
[2022-06-12 21:20:00] [INFO ] Deduced a trap composed of 77 places in 181 ms of which 1 ms to minimize.
[2022-06-12 21:20:01] [INFO ] Deduced a trap composed of 85 places in 182 ms of which 1 ms to minimize.
[2022-06-12 21:20:01] [INFO ] Deduced a trap composed of 71 places in 179 ms of which 0 ms to minimize.
[2022-06-12 21:20:01] [INFO ] Deduced a trap composed of 38 places in 187 ms of which 1 ms to minimize.
[2022-06-12 21:20:01] [INFO ] Deduced a trap composed of 74 places in 182 ms of which 1 ms to minimize.
[2022-06-12 21:20:01] [INFO ] Deduced a trap composed of 106 places in 183 ms of which 1 ms to minimize.
[2022-06-12 21:20:02] [INFO ] Deduced a trap composed of 131 places in 180 ms of which 0 ms to minimize.
[2022-06-12 21:20:02] [INFO ] Deduced a trap composed of 66 places in 177 ms of which 0 ms to minimize.
[2022-06-12 21:20:02] [INFO ] Deduced a trap composed of 78 places in 184 ms of which 0 ms to minimize.
[2022-06-12 21:20:02] [INFO ] Deduced a trap composed of 83 places in 179 ms of which 1 ms to minimize.
[2022-06-12 21:20:03] [INFO ] Deduced a trap composed of 58 places in 181 ms of which 0 ms to minimize.
[2022-06-12 21:20:03] [INFO ] Deduced a trap composed of 70 places in 179 ms of which 0 ms to minimize.
[2022-06-12 21:20:03] [INFO ] Deduced a trap composed of 99 places in 180 ms of which 1 ms to minimize.
[2022-06-12 21:20:03] [INFO ] Deduced a trap composed of 102 places in 179 ms of which 0 ms to minimize.
[2022-06-12 21:20:03] [INFO ] Deduced a trap composed of 78 places in 175 ms of which 0 ms to minimize.
[2022-06-12 21:20:04] [INFO ] Deduced a trap composed of 38 places in 170 ms of which 1 ms to minimize.
[2022-06-12 21:20:04] [INFO ] Deduced a trap composed of 90 places in 169 ms of which 1 ms to minimize.
[2022-06-12 21:20:04] [INFO ] Deduced a trap composed of 22 places in 178 ms of which 0 ms to minimize.
[2022-06-12 21:20:04] [INFO ] Deduced a trap composed of 50 places in 178 ms of which 0 ms to minimize.
[2022-06-12 21:20:05] [INFO ] Deduced a trap composed of 122 places in 185 ms of which 0 ms to minimize.
[2022-06-12 21:20:05] [INFO ] Deduced a trap composed of 30 places in 179 ms of which 1 ms to minimize.
[2022-06-12 21:20:05] [INFO ] Deduced a trap composed of 15 places in 188 ms of which 0 ms to minimize.
[2022-06-12 21:20:05] [INFO ] Deduced a trap composed of 25 places in 191 ms of which 0 ms to minimize.
[2022-06-12 21:20:05] [INFO ] Deduced a trap composed of 83 places in 188 ms of which 0 ms to minimize.
[2022-06-12 21:20:06] [INFO ] Deduced a trap composed of 52 places in 187 ms of which 0 ms to minimize.
[2022-06-12 21:20:06] [INFO ] Deduced a trap composed of 27 places in 193 ms of which 1 ms to minimize.
[2022-06-12 21:20:06] [INFO ] Deduced a trap composed of 43 places in 178 ms of which 1 ms to minimize.
[2022-06-12 21:20:06] [INFO ] Deduced a trap composed of 58 places in 183 ms of which 0 ms to minimize.
[2022-06-12 21:20:07] [INFO ] Deduced a trap composed of 70 places in 180 ms of which 0 ms to minimize.
[2022-06-12 21:20:07] [INFO ] Deduced a trap composed of 68 places in 179 ms of which 0 ms to minimize.
[2022-06-12 21:20:07] [INFO ] Deduced a trap composed of 43 places in 178 ms of which 1 ms to minimize.
[2022-06-12 21:20:07] [INFO ] Deduced a trap composed of 92 places in 178 ms of which 0 ms to minimize.
[2022-06-12 21:20:08] [INFO ] Deduced a trap composed of 41 places in 189 ms of which 0 ms to minimize.
[2022-06-12 21:20:08] [INFO ] Deduced a trap composed of 134 places in 176 ms of which 1 ms to minimize.
[2022-06-12 21:20:08] [INFO ] Deduced a trap composed of 12 places in 177 ms of which 1 ms to minimize.
[2022-06-12 21:20:08] [INFO ] Deduced a trap composed of 59 places in 174 ms of which 1 ms to minimize.
[2022-06-12 21:20:08] [INFO ] Deduced a trap composed of 65 places in 179 ms of which 1 ms to minimize.
[2022-06-12 21:20:09] [INFO ] Deduced a trap composed of 29 places in 174 ms of which 1 ms to minimize.
[2022-06-12 21:20:09] [INFO ] Deduced a trap composed of 67 places in 177 ms of which 1 ms to minimize.
[2022-06-12 21:20:09] [INFO ] Deduced a trap composed of 51 places in 178 ms of which 1 ms to minimize.
[2022-06-12 21:20:09] [INFO ] Deduced a trap composed of 63 places in 180 ms of which 0 ms to minimize.
[2022-06-12 21:20:10] [INFO ] Deduced a trap composed of 56 places in 177 ms of which 1 ms to minimize.
[2022-06-12 21:20:10] [INFO ] Deduced a trap composed of 68 places in 175 ms of which 0 ms to minimize.
[2022-06-12 21:20:10] [INFO ] Deduced a trap composed of 63 places in 179 ms of which 0 ms to minimize.
[2022-06-12 21:20:10] [INFO ] Deduced a trap composed of 49 places in 180 ms of which 1 ms to minimize.
[2022-06-12 21:20:10] [INFO ] Deduced a trap composed of 45 places in 181 ms of which 0 ms to minimize.
[2022-06-12 21:20:11] [INFO ] Deduced a trap composed of 30 places in 178 ms of which 1 ms to minimize.
[2022-06-12 21:20:11] [INFO ] Deduced a trap composed of 62 places in 178 ms of which 1 ms to minimize.
[2022-06-12 21:20:11] [INFO ] Deduced a trap composed of 90 places in 178 ms of which 1 ms to minimize.
[2022-06-12 21:20:11] [INFO ] Deduced a trap composed of 12 places in 176 ms of which 0 ms to minimize.
[2022-06-12 21:20:12] [INFO ] Deduced a trap composed of 29 places in 180 ms of which 1 ms to minimize.
[2022-06-12 21:20:12] [INFO ] Deduced a trap composed of 45 places in 182 ms of which 0 ms to minimize.
[2022-06-12 21:20:12] [INFO ] Deduced a trap composed of 32 places in 175 ms of which 0 ms to minimize.
[2022-06-12 21:20:13] [INFO ] Deduced a trap composed of 45 places in 180 ms of which 1 ms to minimize.
[2022-06-12 21:20:13] [INFO ] Deduced a trap composed of 54 places in 179 ms of which 1 ms to minimize.
[2022-06-12 21:20:13] [INFO ] Deduced a trap composed of 78 places in 184 ms of which 1 ms to minimize.
[2022-06-12 21:20:13] [INFO ] Deduced a trap composed of 60 places in 183 ms of which 1 ms to minimize.
[2022-06-12 21:20:13] [INFO ] Deduced a trap composed of 22 places in 181 ms of which 1 ms to minimize.
[2022-06-12 21:20:14] [INFO ] Deduced a trap composed of 84 places in 180 ms of which 0 ms to minimize.
[2022-06-12 21:20:14] [INFO ] Deduced a trap composed of 76 places in 176 ms of which 0 ms to minimize.
[2022-06-12 21:20:14] [INFO ] Deduced a trap composed of 60 places in 173 ms of which 1 ms to minimize.
[2022-06-12 21:20:14] [INFO ] Deduced a trap composed of 42 places in 175 ms of which 0 ms to minimize.
[2022-06-12 21:20:15] [INFO ] Deduced a trap composed of 13 places in 171 ms of which 0 ms to minimize.
[2022-06-12 21:20:15] [INFO ] Deduced a trap composed of 64 places in 173 ms of which 0 ms to minimize.
[2022-06-12 21:20:15] [INFO ] Deduced a trap composed of 48 places in 180 ms of which 1 ms to minimize.
[2022-06-12 21:20:15] [INFO ] Deduced a trap composed of 36 places in 182 ms of which 1 ms to minimize.
[2022-06-12 21:20:16] [INFO ] Deduced a trap composed of 16 places in 166 ms of which 0 ms to minimize.
[2022-06-12 21:20:16] [INFO ] Deduced a trap composed of 12 places in 180 ms of which 1 ms to minimize.
[2022-06-12 21:20:17] [INFO ] Deduced a trap composed of 50 places in 173 ms of which 1 ms to minimize.
[2022-06-12 21:20:17] [INFO ] Deduced a trap composed of 43 places in 184 ms of which 0 ms to minimize.
[2022-06-12 21:20:17] [INFO ] Deduced a trap composed of 70 places in 175 ms of which 0 ms to minimize.
[2022-06-12 21:20:17] [INFO ] Deduced a trap composed of 30 places in 149 ms of which 1 ms to minimize.
[2022-06-12 21:20:17] [INFO ] Deduced a trap composed of 57 places in 160 ms of which 0 ms to minimize.
[2022-06-12 21:20:18] [INFO ] Deduced a trap composed of 12 places in 168 ms of which 0 ms to minimize.
[2022-06-12 21:20:18] [INFO ] Deduced a trap composed of 69 places in 174 ms of which 0 ms to minimize.
[2022-06-12 21:20:18] [INFO ] Deduced a trap composed of 57 places in 169 ms of which 0 ms to minimize.
[2022-06-12 21:20:18] [INFO ] Deduced a trap composed of 60 places in 169 ms of which 1 ms to minimize.
[2022-06-12 21:20:39] [INFO ] Deduced a trap composed of 2 places in 215 ms of which 0 ms to minimize.
[2022-06-12 21:20:39] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
Support contains 8 out of 592 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 592/592 places, 1704/1704 transitions.
Applied a total of 0 rules in 30 ms. Remains 592 /592 variables (removed 0) and now considering 1704/1704 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 592/592 places, 1704/1704 transitions.
Starting structural reductions, iteration 0 : 592/592 places, 1704/1704 transitions.
Applied a total of 0 rules in 24 ms. Remains 592 /592 variables (removed 0) and now considering 1704/1704 (removed 0) transitions.
[2022-06-12 21:20:39] [INFO ] Flow matrix only has 1368 transitions (discarded 336 similar events)
// Phase 1: matrix 1368 rows 592 cols
[2022-06-12 21:20:39] [INFO ] Computed 23 place invariants in 8 ms
[2022-06-12 21:20:40] [INFO ] Implicit Places using invariants in 322 ms returned []
[2022-06-12 21:20:40] [INFO ] Flow matrix only has 1368 transitions (discarded 336 similar events)
// Phase 1: matrix 1368 rows 592 cols
[2022-06-12 21:20:40] [INFO ] Computed 23 place invariants in 8 ms
[2022-06-12 21:20:40] [INFO ] State equation strengthened by 546 read => feed constraints.
[2022-06-12 21:20:44] [INFO ] Implicit Places using invariants and state equation in 4181 ms returned []
Implicit Place search using SMT with State Equation took 4505 ms to find 0 implicit places.
[2022-06-12 21:20:44] [INFO ] Redundant transitions in 37 ms returned []
[2022-06-12 21:20:44] [INFO ] Flow matrix only has 1368 transitions (discarded 336 similar events)
// Phase 1: matrix 1368 rows 592 cols
[2022-06-12 21:20:44] [INFO ] Computed 23 place invariants in 7 ms
[2022-06-12 21:20:45] [INFO ] Dead Transitions using invariants and state equation in 543 ms returned []
Finished structural reductions, in 1 iterations. Remains : 592/592 places, 1704/1704 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 249 ms. (steps per millisecond=401 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2022-06-12 21:20:45] [INFO ] Flow matrix only has 1368 transitions (discarded 336 similar events)
// Phase 1: matrix 1368 rows 592 cols
[2022-06-12 21:20:45] [INFO ] Computed 23 place invariants in 10 ms
[2022-06-12 21:20:45] [INFO ] [Real]Absence check using 23 positive place invariants in 8 ms returned sat
[2022-06-12 21:20:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:20:45] [INFO ] [Real]Absence check using state equation in 251 ms returned sat
[2022-06-12 21:20:45] [INFO ] State equation strengthened by 546 read => feed constraints.
[2022-06-12 21:20:45] [INFO ] [Real]Added 546 Read/Feed constraints in 60 ms returned sat
[2022-06-12 21:20:45] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:20:45] [INFO ] [Nat]Absence check using 23 positive place invariants in 9 ms returned sat
[2022-06-12 21:20:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:20:46] [INFO ] [Nat]Absence check using state equation in 257 ms returned sat
[2022-06-12 21:20:46] [INFO ] [Nat]Added 546 Read/Feed constraints in 62 ms returned sat
[2022-06-12 21:20:46] [INFO ] Deduced a trap composed of 131 places in 197 ms of which 0 ms to minimize.
[2022-06-12 21:20:46] [INFO ] Deduced a trap composed of 29 places in 194 ms of which 1 ms to minimize.
[2022-06-12 21:20:46] [INFO ] Deduced a trap composed of 36 places in 194 ms of which 0 ms to minimize.
[2022-06-12 21:20:47] [INFO ] Deduced a trap composed of 43 places in 223 ms of which 0 ms to minimize.
[2022-06-12 21:20:47] [INFO ] Deduced a trap composed of 26 places in 200 ms of which 1 ms to minimize.
[2022-06-12 21:20:47] [INFO ] Deduced a trap composed of 36 places in 200 ms of which 1 ms to minimize.
[2022-06-12 21:20:47] [INFO ] Deduced a trap composed of 23 places in 194 ms of which 1 ms to minimize.
[2022-06-12 21:20:48] [INFO ] Deduced a trap composed of 23 places in 195 ms of which 0 ms to minimize.
[2022-06-12 21:20:48] [INFO ] Deduced a trap composed of 60 places in 201 ms of which 0 ms to minimize.
[2022-06-12 21:20:48] [INFO ] Deduced a trap composed of 55 places in 198 ms of which 0 ms to minimize.
[2022-06-12 21:20:48] [INFO ] Deduced a trap composed of 50 places in 197 ms of which 0 ms to minimize.
[2022-06-12 21:20:49] [INFO ] Deduced a trap composed of 75 places in 196 ms of which 0 ms to minimize.
[2022-06-12 21:20:49] [INFO ] Deduced a trap composed of 64 places in 221 ms of which 0 ms to minimize.
[2022-06-12 21:20:49] [INFO ] Deduced a trap composed of 63 places in 197 ms of which 1 ms to minimize.
[2022-06-12 21:20:49] [INFO ] Deduced a trap composed of 14 places in 204 ms of which 0 ms to minimize.
[2022-06-12 21:20:50] [INFO ] Deduced a trap composed of 51 places in 201 ms of which 1 ms to minimize.
[2022-06-12 21:20:50] [INFO ] Deduced a trap composed of 25 places in 203 ms of which 1 ms to minimize.
[2022-06-12 21:20:50] [INFO ] Deduced a trap composed of 22 places in 208 ms of which 0 ms to minimize.
[2022-06-12 21:20:50] [INFO ] Deduced a trap composed of 35 places in 209 ms of which 0 ms to minimize.
[2022-06-12 21:20:51] [INFO ] Deduced a trap composed of 70 places in 204 ms of which 1 ms to minimize.
[2022-06-12 21:20:51] [INFO ] Deduced a trap composed of 31 places in 205 ms of which 1 ms to minimize.
[2022-06-12 21:20:51] [INFO ] Deduced a trap composed of 96 places in 209 ms of which 1 ms to minimize.
[2022-06-12 21:20:51] [INFO ] Deduced a trap composed of 91 places in 211 ms of which 0 ms to minimize.
[2022-06-12 21:20:52] [INFO ] Deduced a trap composed of 89 places in 177 ms of which 0 ms to minimize.
[2022-06-12 21:20:52] [INFO ] Deduced a trap composed of 71 places in 206 ms of which 0 ms to minimize.
[2022-06-12 21:20:52] [INFO ] Deduced a trap composed of 77 places in 208 ms of which 0 ms to minimize.
[2022-06-12 21:20:52] [INFO ] Deduced a trap composed of 85 places in 211 ms of which 1 ms to minimize.
[2022-06-12 21:20:53] [INFO ] Deduced a trap composed of 71 places in 204 ms of which 1 ms to minimize.
[2022-06-12 21:20:53] [INFO ] Deduced a trap composed of 38 places in 210 ms of which 0 ms to minimize.
[2022-06-12 21:20:53] [INFO ] Deduced a trap composed of 74 places in 204 ms of which 0 ms to minimize.
[2022-06-12 21:20:53] [INFO ] Deduced a trap composed of 106 places in 206 ms of which 0 ms to minimize.
[2022-06-12 21:20:54] [INFO ] Deduced a trap composed of 131 places in 205 ms of which 1 ms to minimize.
[2022-06-12 21:20:54] [INFO ] Deduced a trap composed of 66 places in 207 ms of which 0 ms to minimize.
[2022-06-12 21:20:54] [INFO ] Deduced a trap composed of 78 places in 210 ms of which 0 ms to minimize.
[2022-06-12 21:20:54] [INFO ] Deduced a trap composed of 83 places in 204 ms of which 1 ms to minimize.
[2022-06-12 21:20:55] [INFO ] Deduced a trap composed of 58 places in 203 ms of which 0 ms to minimize.
[2022-06-12 21:20:55] [INFO ] Deduced a trap composed of 70 places in 199 ms of which 1 ms to minimize.
[2022-06-12 21:20:55] [INFO ] Deduced a trap composed of 99 places in 193 ms of which 1 ms to minimize.
[2022-06-12 21:20:55] [INFO ] Deduced a trap composed of 102 places in 197 ms of which 0 ms to minimize.
[2022-06-12 21:20:56] [INFO ] Deduced a trap composed of 78 places in 194 ms of which 1 ms to minimize.
[2022-06-12 21:20:56] [INFO ] Deduced a trap composed of 38 places in 197 ms of which 0 ms to minimize.
[2022-06-12 21:20:56] [INFO ] Deduced a trap composed of 90 places in 176 ms of which 1 ms to minimize.
[2022-06-12 21:20:56] [INFO ] Deduced a trap composed of 22 places in 187 ms of which 1 ms to minimize.
[2022-06-12 21:20:57] [INFO ] Deduced a trap composed of 50 places in 207 ms of which 0 ms to minimize.
[2022-06-12 21:20:57] [INFO ] Deduced a trap composed of 122 places in 202 ms of which 1 ms to minimize.
[2022-06-12 21:20:57] [INFO ] Deduced a trap composed of 30 places in 202 ms of which 1 ms to minimize.
[2022-06-12 21:20:57] [INFO ] Deduced a trap composed of 15 places in 197 ms of which 0 ms to minimize.
[2022-06-12 21:20:58] [INFO ] Deduced a trap composed of 25 places in 210 ms of which 1 ms to minimize.
[2022-06-12 21:20:58] [INFO ] Deduced a trap composed of 83 places in 199 ms of which 0 ms to minimize.
[2022-06-12 21:20:58] [INFO ] Deduced a trap composed of 52 places in 203 ms of which 1 ms to minimize.
[2022-06-12 21:20:58] [INFO ] Deduced a trap composed of 27 places in 202 ms of which 1 ms to minimize.
[2022-06-12 21:20:59] [INFO ] Deduced a trap composed of 43 places in 187 ms of which 1 ms to minimize.
[2022-06-12 21:20:59] [INFO ] Deduced a trap composed of 58 places in 187 ms of which 1 ms to minimize.
[2022-06-12 21:20:59] [INFO ] Deduced a trap composed of 70 places in 183 ms of which 1 ms to minimize.
[2022-06-12 21:20:59] [INFO ] Deduced a trap composed of 68 places in 191 ms of which 1 ms to minimize.
[2022-06-12 21:20:59] [INFO ] Deduced a trap composed of 43 places in 185 ms of which 1 ms to minimize.
[2022-06-12 21:21:00] [INFO ] Deduced a trap composed of 92 places in 189 ms of which 1 ms to minimize.
[2022-06-12 21:21:00] [INFO ] Deduced a trap composed of 41 places in 190 ms of which 0 ms to minimize.
[2022-06-12 21:21:00] [INFO ] Deduced a trap composed of 134 places in 192 ms of which 0 ms to minimize.
[2022-06-12 21:21:00] [INFO ] Deduced a trap composed of 12 places in 188 ms of which 1 ms to minimize.
[2022-06-12 21:21:01] [INFO ] Deduced a trap composed of 59 places in 191 ms of which 0 ms to minimize.
[2022-06-12 21:21:01] [INFO ] Deduced a trap composed of 65 places in 194 ms of which 1 ms to minimize.
[2022-06-12 21:21:01] [INFO ] Deduced a trap composed of 29 places in 188 ms of which 1 ms to minimize.
[2022-06-12 21:21:01] [INFO ] Deduced a trap composed of 67 places in 191 ms of which 0 ms to minimize.
[2022-06-12 21:21:02] [INFO ] Deduced a trap composed of 51 places in 190 ms of which 1 ms to minimize.
[2022-06-12 21:21:02] [INFO ] Deduced a trap composed of 63 places in 193 ms of which 1 ms to minimize.
[2022-06-12 21:21:02] [INFO ] Deduced a trap composed of 56 places in 215 ms of which 20 ms to minimize.
[2022-06-12 21:21:02] [INFO ] Deduced a trap composed of 68 places in 189 ms of which 1 ms to minimize.
[2022-06-12 21:21:03] [INFO ] Deduced a trap composed of 63 places in 189 ms of which 0 ms to minimize.
[2022-06-12 21:21:03] [INFO ] Deduced a trap composed of 49 places in 188 ms of which 0 ms to minimize.
[2022-06-12 21:21:03] [INFO ] Deduced a trap composed of 45 places in 188 ms of which 0 ms to minimize.
[2022-06-12 21:21:03] [INFO ] Deduced a trap composed of 30 places in 187 ms of which 1 ms to minimize.
[2022-06-12 21:21:03] [INFO ] Deduced a trap composed of 62 places in 196 ms of which 1 ms to minimize.
[2022-06-12 21:21:04] [INFO ] Deduced a trap composed of 90 places in 188 ms of which 0 ms to minimize.
[2022-06-12 21:21:04] [INFO ] Deduced a trap composed of 12 places in 190 ms of which 1 ms to minimize.
[2022-06-12 21:21:04] [INFO ] Deduced a trap composed of 29 places in 188 ms of which 1 ms to minimize.
[2022-06-12 21:21:05] [INFO ] Deduced a trap composed of 45 places in 189 ms of which 0 ms to minimize.
[2022-06-12 21:21:05] [INFO ] Deduced a trap composed of 32 places in 189 ms of which 1 ms to minimize.
[2022-06-12 21:21:05] [INFO ] Deduced a trap composed of 45 places in 194 ms of which 1 ms to minimize.
[2022-06-12 21:21:05] [INFO ] Deduced a trap composed of 54 places in 196 ms of which 1 ms to minimize.
[2022-06-12 21:21:05] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
[2022-06-12 21:21:05] [INFO ] Flatten gal took : 45 ms
[2022-06-12 21:21:06] [INFO ] Flatten gal took : 44 ms
[2022-06-12 21:21:06] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11207914711546039756.gal : 6 ms
[2022-06-12 21:21:06] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3833445525957336906.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/ReachabilityCardinality11207914711546039756.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality3833445525957336906.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/ReachabilityCardinality11207914711546039756.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality3833445525957336906.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality3833445525957336906.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 4
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :4 after 9
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :9 after 17
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :17 after 24
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :24 after 32
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :32 after 77
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :77 after 174
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :174 after 382
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :382 after 506
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :506 after 3582
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :3582 after 7224
Detected timeout of ITS tools.
[2022-06-12 21:21:26] [INFO ] Flatten gal took : 48 ms
[2022-06-12 21:21:26] [INFO ] Applying decomposition
[2022-06-12 21:21:26] [INFO ] Flatten gal took : 47 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/graph8032534801471700685.txt, -o, /tmp/graph8032534801471700685.bin, -w, /tmp/graph8032534801471700685.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/graph8032534801471700685.bin, -l, -1, -v, -w, /tmp/graph8032534801471700685.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-12 21:21:26] [INFO ] Decomposing Gal with order
[2022-06-12 21:21:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-12 21:21:26] [INFO ] Removed a total of 2627 redundant transitions.
[2022-06-12 21:21:26] [INFO ] Flatten gal took : 113 ms
[2022-06-12 21:21:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 375 labels/synchronizations in 26 ms.
[2022-06-12 21:21:26] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11990538975481049115.gal : 9 ms
[2022-06-12 21:21:26] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality631058520478814994.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/ReachabilityCardinality11990538975481049115.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality631058520478814994.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/ReachabilityCardinality11990538975481049115.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality631058520478814994.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality631058520478814994.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :4 after 14
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :14 after 18
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :18 after 28
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :28 after 30
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :30 after 36
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :36 after 226
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :226 after 450
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :450 after 1342
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1342 after 3764
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :3764 after 8716
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :8716 after 60906
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :60906 after 240396
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5919665255795575977
[2022-06-12 21:21:46] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5919665255795575977
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/ltsmin5919665255795575977]
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/ltsmin5919665255795575977] killed by timeout after 2 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin5919665255795575977] killed by timeout after 2 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Graph (trivial) has 1288 edges and 592 vertex of which 448 / 592 are part of one of the 56 SCC in 8 ms
Free SCC test removed 392 places
Drop transitions removed 784 transitions
Ensure Unique test removed 392 transitions
Reduce isomorphic transitions removed 1176 transitions.
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 56 Pre rules applied. Total rules applied 1 place count 200 transition count 472
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 0 with 112 rules applied. Total rules applied 113 place count 144 transition count 472
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 0 with 24 rules applied. Total rules applied 137 place count 128 transition count 464
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 145 place count 128 transition count 464
Applied a total of 145 rules in 30 ms. Remains 128 /592 variables (removed 464) and now considering 464/1704 (removed 1240) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 464 rows 128 cols
[2022-06-12 21:21:48] [INFO ] Computed 15 place invariants in 3 ms
[2022-06-12 21:21:48] [INFO ] [Real]Absence check using 15 positive place invariants in 3 ms returned sat
[2022-06-12 21:21:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:21:48] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2022-06-12 21:21:48] [INFO ] Computed and/alt/rep : 155/1135/155 causal constraints (skipped 294 transitions) in 65 ms.
[2022-06-12 21:21:48] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:21:48] [INFO ] [Nat]Absence check using 15 positive place invariants in 2 ms returned sat
[2022-06-12 21:21:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:21:49] [INFO ] [Nat]Absence check using state equation in 61 ms returned sat
[2022-06-12 21:21:49] [INFO ] Computed and/alt/rep : 155/1135/155 causal constraints (skipped 294 transitions) in 31 ms.
[2022-06-12 21:21:49] [INFO ] Added : 155 causal constraints over 31 iterations in 951 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 8 ms.
[2022-06-12 21:21:50] [INFO ] Flatten gal took : 44 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin298157566304249551
[2022-06-12 21:21:50] [INFO ] Too many transitions (1704) to apply POR reductions. Disabling POR matrices.
[2022-06-12 21:21:50] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin298157566304249551
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/ltsmin298157566304249551]
[2022-06-12 21:21:50] [INFO ] Applying decomposition
[2022-06-12 21:21:50] [INFO ] Flatten gal took : 71 ms
[2022-06-12 21:21:50] [INFO ] Flatten gal took : 49 ms
[2022-06-12 21:21:50] [INFO ] Input system was already deterministic with 1704 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/graph15512712938373729340.txt, -o, /tmp/graph15512712938373729340.bin, -w, /tmp/graph15512712938373729340.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/graph15512712938373729340.bin, -l, -1, -v, -w, /tmp/graph15512712938373729340.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-12 21:21:50] [INFO ] Decomposing Gal with order
[2022-06-12 21:21:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-12 21:21:50] [INFO ] Removed a total of 2607 redundant transitions.
[2022-06-12 21:21:50] [INFO ] Flatten gal took : 96 ms
[2022-06-12 21:21:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 253 labels/synchronizations in 34 ms.
[2022-06-12 21:21:50] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1270373712907393687.gal : 9 ms
[2022-06-12 21:21:50] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7145961404782373916.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/ReachabilityCardinality1270373712907393687.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality7145961404782373916.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/ReachabilityCardinality1270373712907393687.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality7145961404782373916.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality7145961404782373916.prop.
[2022-06-12 21:21:51] [INFO ] Ran tautology test, simplified 0 / 1 in 841 ms.
[2022-06-12 21:21:51] [INFO ] BMC solution for property Peterson-COL-7-ReachabilityCardinality-14(UNSAT) depth K=0 took 21 ms
[2022-06-12 21:21:51] [INFO ] BMC solution for property Peterson-COL-7-ReachabilityCardinality-14(UNSAT) depth K=1 took 14 ms
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 1368 out of 1704 initially.
// Phase 1: matrix 1368 rows 592 cols
[2022-06-12 21:21:51] [INFO ] Computed 23 place invariants in 5 ms
inv : Turn_8 + Turn_9 + Turn_10 + Turn_11 + Turn_12 + Turn_13 + Turn_14 + Turn_15 = 1
inv : WantSection_4 + WantSection_5 = 1
inv : WantSection_14 + WantSection_15 = 1
inv : WantSection_10 + AskForSection_35 + TestTurn_35 + TestTurn_36 + TestTurn_37 + TestTurn_38 + TestTurn_39 + TestTurn_40 + TestTurn_41 + BeginLoop_280 + BeginLoop_288 + BeginLoop_296 + BeginLoop_304 + BeginLoop_312 + BeginLoop_320 + BeginLoop_328 + EndTurn_35 + EndTurn_36 + EndTurn_37 + EndTurn_38 + EndTurn_39 + EndTurn_40 + EndTurn_41 + CS_5 + IsEndLoop_280 + IsEndLoop_281 + IsEndLoop_282 + IsEndLoop_283 + IsEndLoop_284 + IsEndLoop_286 + IsEndLoop_288 + IsEndLoop_289 + IsEndLoop_290 + IsEndLoop_291 + IsEndLoop_292 + IsEndLoop_294 + IsEndLoop_296 + IsEndLoop_297 + IsEndLoop_298 + IsEndLoop_299 + IsEndLoop_300 + IsEndLoop_302 + IsEndLoop_304 + IsEndLoop_305 + IsEndLoop_306 + IsEndLoop_307 + IsEndLoop_308 + IsEndLoop_310 + IsEndLoop_312 + IsEndLoop_313 + IsEndLoop_314 + IsEndLoop_315 + IsEndLoop_316 + IsEndLoop_318 + IsEndLoop_320 + IsEndLoop_321 + IsEndLoop_322 + IsEndLoop_323 + IsEndLoop_324 + IsEndLoop_326 + IsEndLoop_328 + IsEndLoop_329 + IsEndLoop_330 + IsEndLoop_331 + IsEndLoop_332 + IsEndLoop_334 = 1
inv : Turn_16 + Turn_17 + Turn_18 + Turn_19 + Turn_20 + Turn_21 + Turn_22 + Turn_23 = 1
inv : Turn_0 + Turn_1 + Turn_2 + Turn_3 + Turn_4 + Turn_5 + Turn_6 + Turn_7 = 1
inv : WantSection_6 + AskForSection_21 + TestTurn_21 + TestTurn_22 + TestTurn_23 + TestTurn_24 + TestTurn_25 + TestTurn_26 + TestTurn_27 + BeginLoop_168 + BeginLoop_176 + BeginLoop_184 + BeginLoop_192 + BeginLoop_200 + BeginLoop_208 + BeginLoop_216 + EndTurn_21 + EndTurn_22 + EndTurn_23 + EndTurn_24 + EndTurn_25 + EndTurn_26 + EndTurn_27 + CS_3 + IsEndLoop_168 + IsEndLoop_169 + IsEndLoop_170 + IsEndLoop_172 + IsEndLoop_173 + IsEndLoop_174 + IsEndLoop_176 + IsEndLoop_177 + IsEndLoop_178 + IsEndLoop_180 + IsEndLoop_181 + IsEndLoop_182 + IsEndLoop_184 + IsEndLoop_185 + IsEndLoop_186 + IsEndLoop_188 + IsEndLoop_189 + IsEndLoop_190 + IsEndLoop_192 + IsEndLoop_193 + IsEndLoop_194 + IsEndLoop_196 + IsEndLoop_197 + IsEndLoop_198 + IsEndLoop_200 + IsEndLoop_201 + IsEndLoop_202 + IsEndLoop_204 + IsEndLoop_205 + IsEndLoop_206 + IsEndLoop_208 + IsEndLoop_209 + IsEndLoop_210 + IsEndLoop_212 + IsEndLoop_213 + IsEndLoop_214 + IsEndLoop_216 + IsEndLoop_217 + IsEndLoop_218 + IsEndLoop_220 + IsEndLoop_221 + IsEndLoop_222 = 1
inv : WantSection_12 + WantSection_13 = 1
inv : WantSection_6 + WantSection_7 = 1
inv : WantSection_2 + WantSection_3 = 1
inv : WantSection_8 + AskForSection_28 + TestTurn_28 + TestTurn_29 + TestTurn_30 + TestTurn_31 + TestTurn_32 + TestTurn_33 + TestTurn_34 + BeginLoop_224 + BeginLoop_232 + BeginLoop_240 + BeginLoop_248 + BeginLoop_256 + BeginLoop_264 + BeginLoop_272 + EndTurn_28 + EndTurn_29 + EndTurn_30 + EndTurn_31 + EndTurn_32 + EndTurn_33 + EndTurn_34 + CS_4 + IsEndLoop_224 + IsEndLoop_225 + IsEndLoop_226 + IsEndLoop_227 + IsEndLoop_229 + IsEndLoop_230 + IsEndLoop_232 + IsEndLoop_233 + IsEndLoop_234 + IsEndLoop_235 + IsEndLoop_237 + IsEndLoop_238 + IsEndLoop_240 + IsEndLoop_241 + IsEndLoop_242 + IsEndLoop_243 + IsEndLoop_245 + IsEndLoop_246 + IsEndLoop_248 + IsEndLoop_249 + IsEndLoop_250 + IsEndLoop_251 + IsEndLoop_253 + IsEndLoop_254 + IsEndLoop_256 + IsEndLoop_257 + IsEndLoop_258 + IsEndLoop_259 + IsEndLoop_261 + IsEndLoop_262 + IsEndLoop_264 + IsEndLoop_265 + IsEndLoop_266 + IsEndLoop_267 + IsEndLoop_269 + IsEndLoop_270 + IsEndLoop_272 + IsEndLoop_273 + IsEndLoop_274 + IsEndLoop_275 + IsEndLoop_277 + IsEndLoop_278 = 1
inv : Turn_40 + Turn_41 + Turn_42 + Turn_43 + Turn_44 + Turn_45 + Turn_46 + Turn_47 = 1
inv : Turn_48 + Turn_49 + Turn_50 + Turn_51 + Turn_52 + Turn_53 + Turn_54 + Turn_55 = 1
inv : WantSection_8 + WantSection_9 = 1
inv : WantSection_12 + AskForSection_42 + TestTurn_42 + TestTurn_43 + TestTurn_44 + TestTurn_45 + TestTurn_46 + TestTurn_47 + TestTurn_48 + BeginLoop_336 + BeginLoop_344 + BeginLoop_352 + BeginLoop_360 + BeginLoop_368 + BeginLoop_376 + BeginLoop_384 + EndTurn_42 + EndTurn_43 + EndTurn_44 + EndTurn_45 + EndTurn_46 + EndTurn_47 + EndTurn_48 + CS_6 + IsEndLoop_336 + IsEndLoop_337 + IsEndLoop_338 + IsEndLoop_339 + IsEndLoop_340 + IsEndLoop_341 + IsEndLoop_344 + IsEndLoop_345 + IsEndLoop_346 + IsEndLoop_347 + IsEndLoop_348 + IsEndLoop_349 + IsEndLoop_352 + IsEndLoop_353 + IsEndLoop_354 + IsEndLoop_355 + IsEndLoop_356 + IsEndLoop_357 + IsEndLoop_360 + IsEndLoop_361 + IsEndLoop_362 + IsEndLoop_363 + IsEndLoop_364 + IsEndLoop_365 + IsEndLoop_368 + IsEndLoop_369 + IsEndLoop_370 + IsEndLoop_371 + IsEndLoop_372 + IsEndLoop_373 + IsEndLoop_376 + IsEndLoop_377 + IsEndLoop_378 + IsEndLoop_379 + IsEndLoop_380 + IsEndLoop_381 + IsEndLoop_384 + IsEndLoop_385 + IsEndLoop_386 + IsEndLoop_387 + IsEndLoop_388 + IsEndLoop_389 = 1
inv : WantSection_4 + AskForSection_14 + TestTurn_14 + TestTurn_15 + TestTurn_16 + TestTurn_17 + TestTurn_18 + TestTurn_19 + TestTurn_20 + BeginLoop_112 + BeginLoop_120 + BeginLoop_128 + BeginLoop_136 + BeginLoop_144 + BeginLoop_152 + BeginLoop_160 + EndTurn_14 + EndTurn_15 + EndTurn_16 + EndTurn_17 + EndTurn_18 + EndTurn_19 + EndTurn_20 + CS_2 + IsEndLoop_112 + IsEndLoop_113 + IsEndLoop_115 + IsEndLoop_116 + IsEndLoop_117 + IsEndLoop_118 + IsEndLoop_120 + IsEndLoop_121 + IsEndLoop_123 + IsEndLoop_124 + IsEndLoop_125 + IsEndLoop_126 + IsEndLoop_128 + IsEndLoop_129 + IsEndLoop_131 + IsEndLoop_132 + IsEndLoop_133 + IsEndLoop_134 + IsEndLoop_136 + IsEndLoop_137 + IsEndLoop_139 + IsEndLoop_140 + IsEndLoop_141 + IsEndLoop_142 + IsEndLoop_144 + IsEndLoop_145 + IsEndLoop_147 + IsEndLoop_148 + IsEndLoop_149 + IsEndLoop_150 + IsEndLoop_152 + IsEndLoop_153 + IsEndLoop_155 + IsEndLoop_156 + IsEndLoop_157 + IsEndLoop_158 + IsEndLoop_160 + IsEndLoop_161 + IsEndLoop_163 + IsEndLoop_164 + IsEndLoop_165 + IsEndLoop_166 = 1
inv : WantSection_0 + WantSection_1 = 1
inv : WantSection_0 + AskForSection_0 + TestTurn_0 + TestTurn_1 + TestTurn_2 + TestTurn_3 + TestTurn_4 + TestTurn_5 + TestTurn_6 + BeginLoop_0 + BeginLoop_8 + BeginLoop_16 + BeginLoop_24 + BeginLoop_32 + BeginLoop_40 + BeginLoop_48 + EndTurn_0 + EndTurn_1 + EndTurn_2 + EndTurn_3 + EndTurn_4 + EndTurn_5 + EndTurn_6 + CS_0 + IsEndLoop_1 + IsEndLoop_2 + IsEndLoop_3 + IsEndLoop_4 + IsEndLoop_5 + IsEndLoop_6 + IsEndLoop_9 + IsEndLoop_10 + IsEndLoop_11 + IsEndLoop_12 + IsEndLoop_13 + IsEndLoop_14 + IsEndLoop_17 + IsEndLoop_18 + IsEndLoop_19 + IsEndLoop_20 + IsEndLoop_21 + IsEndLoop_22 + IsEndLoop_25 + IsEndLoop_26 + IsEndLoop_27 + IsEndLoop_28 + IsEndLoop_29 + IsEndLoop_30 + IsEndLoop_33 + IsEndLoop_34 + IsEndLoop_35 + IsEndLoop_36 + IsEndLoop_37 + IsEndLoop_38 + IsEndLoop_41 + IsEndLoop_42 + IsEndLoop_43 + IsEndLoop_44 + IsEndLoop_45 + IsEndLoop_46 + IsEndLoop_49 + IsEndLoop_50 + IsEndLoop_51 + IsEndLoop_52 + IsEndLoop_53 + IsEndLoop_54 = 1
inv : Turn_24 + Turn_25 + Turn_26 + Turn_27 + Turn_28 + Turn_29 + Turn_30 + Turn_31 = 1
inv : WantSection_14 + AskForSection_49 + TestTurn_49 + TestTurn_50 + TestTurn_51 + TestTurn_52 + TestTurn_53 + TestTurn_54 + TestTurn_55 + BeginLoop_392 + BeginLoop_400 + BeginLoop_408 + BeginLoop_416 + BeginLoop_424 + BeginLoop_432 + BeginLoop_440 + EndTurn_49 + EndTurn_50 + EndTurn_51 + EndTurn_52 + EndTurn_53 + EndTurn_54 + EndTurn_55 + CS_7 + IsEndLoop_392 + IsEndLoop_393 + IsEndLoop_394 + IsEndLoop_395 + IsEndLoop_396 + IsEndLoop_397 + IsEndLoop_400 + IsEndLoop_401 + IsEndLoop_402 + IsEndLoop_403 + IsEndLoop_404 + IsEndLoop_405 + IsEndLoop_408 + IsEndLoop_409 + IsEndLoop_410 + IsEndLoop_411 + IsEndLoop_412 + IsEndLoop_413 + IsEndLoop_416 + IsEndLoop_417 + IsEndLoop_418 + IsEndLoop_419 + IsEndLoop_420 + IsEndLoop_421 + IsEndLoop_424 + IsEndLoop_425 + IsEndLoop_426 + IsEndLoop_427 + IsEndLoop_428 + IsEndLoop_429 + IsEndLoop_432 + IsEndLoop_433 + IsEndLoop_434 + IsEndLoop_435 + IsEndLoop_436 + IsEndLoop_437 + IsEndLoop_440 + IsEndLoop_441 + IsEndLoop_442 + IsEndLoop_443 + IsEndLoop_444 + IsEndLoop_445 = 1
inv : WantSection_10 + WantSection_11 = 1
inv : WantSection_2 + AskForSection_7 + TestTurn_7 + TestTurn_8 + TestTurn_9 + TestTurn_10 + TestTurn_11 + TestTurn_12 + TestTurn_13 + BeginLoop_56 + BeginLoop_64 + BeginLoop_72 + BeginLoop_80 + BeginLoop_88 + BeginLoop_96 + BeginLoop_104 + EndTurn_7 + EndTurn_8 + EndTurn_9 + EndTurn_10 + EndTurn_11 + EndTurn_12 + EndTurn_13 + CS_1 + IsEndLoop_56 + IsEndLoop_58 + IsEndLoop_59 + IsEndLoop_60 + IsEndLoop_61 + IsEndLoop_62 + IsEndLoop_64 + IsEndLoop_66 + IsEndLoop_67 + IsEndLoop_68 + IsEndLoop_69 + IsEndLoop_70 + IsEndLoop_72 + IsEndLoop_74 + IsEndLoop_75 + IsEndLoop_76 + IsEndLoop_77 + IsEndLoop_78 + IsEndLoop_80 + IsEndLoop_82 + IsEndLoop_83 + IsEndLoop_84 + IsEndLoop_85 + IsEndLoop_86 + IsEndLoop_88 + IsEndLoop_90 + IsEndLoop_91 + IsEndLoop_92 + IsEndLoop_93 + IsEndLoop_94 + IsEndLoop_96 + IsEndLoop_98 + IsEndLoop_99 + IsEndLoop_100 + IsEndLoop_101 + IsEndLoop_102 + IsEndLoop_104 + IsEndLoop_106 + IsEndLoop_107 + IsEndLoop_108 + IsEndLoop_109 + IsEndLoop_110 = 1
inv : Turn_32 + Turn_33 + Turn_34 + Turn_35 + Turn_36 + Turn_37 + Turn_38 + Turn_39 = 1
Total of 23 invariants.
[2022-06-12 21:21:51] [INFO ] Computed 23 place invariants in 6 ms
[2022-06-12 21:21:51] [INFO ] BMC solution for property Peterson-COL-7-ReachabilityCardinality-14(UNSAT) depth K=2 took 660 ms
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 4
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :4 after 12
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :12 after 16
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :16 after 27
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :27 after 77
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :77 after 164
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :164 after 376
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :376 after 1054
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1054 after 2913
[2022-06-12 21:21:54] [INFO ] Proved 592 variables to be positive in 2358 ms
[2022-06-12 21:21:54] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-COL-7-ReachabilityCardinality-14
[2022-06-12 21:21:54] [INFO ] KInduction solution for property Peterson-COL-7-ReachabilityCardinality-14(SAT) depth K=0 took 56 ms
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :2913 after 19816
[2022-06-12 21:21:55] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-COL-7-ReachabilityCardinality-14
[2022-06-12 21:21:55] [INFO ] KInduction solution for property Peterson-COL-7-ReachabilityCardinality-14(SAT) depth K=1 took 1829 ms
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :19816 after 46038
Compilation finished in 14275 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin298157566304249551]
Link finished in 53 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, PetersonCOL7ReachabilityCardinality14==true], workingDir=/tmp/ltsmin298157566304249551]
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :46038 after 279854
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :279854 after 1.46797e+06
[2022-06-12 21:23:15] [INFO ] BMC solution for property Peterson-COL-7-ReachabilityCardinality-14(UNSAT) depth K=3 took 83316 ms
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :1.46797e+06 after 9.43398e+06
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :9.43398e+06 after 1.04985e+07
[2022-06-12 21:40:05] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-COL-7-ReachabilityCardinality-14
[2022-06-12 21:40:05] [INFO ] KInduction solution for property Peterson-COL-7-ReachabilityCardinality-14(SAT) depth K=2 took 1089294 ms
[2022-06-12 21:40:18] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-COL-7-ReachabilityCardinality-14
[2022-06-12 21:40:18] [INFO ] KInduction solution for property Peterson-COL-7-ReachabilityCardinality-14(SAT) depth K=3 took 13485 ms
SDD proceeding with computation,1 properties remain. new max is 262144
SDD size :1.04985e+07 after 1.29053e+07
[2022-06-12 21:42:37] [INFO ] BMC solution for property Peterson-COL-7-ReachabilityCardinality-14(UNSAT) depth K=4 took 1162044 ms
Detected timeout of ITS tools.
[2022-06-12 21:44:19] [INFO ] Applying decomposition
[2022-06-12 21:44:19] [INFO ] Flatten gal took : 180 ms
[2022-06-12 21:44:19] [INFO ] Decomposing Gal with order
[2022-06-12 21:44:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-12 21:44:19] [INFO ] Removed a total of 3679 redundant transitions.
[2022-06-12 21:44:19] [INFO ] Flatten gal took : 273 ms
[2022-06-12 21:44:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 18 ms.
[2022-06-12 21:44:20] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3088761372757638862.gal : 29 ms
[2022-06-12 21:44:20] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality18420017709510802176.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/ReachabilityCardinality3088761372757638862.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality18420017709510802176.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/ReachabilityCardinality3088761372757638862.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality18420017709510802176.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality18420017709510802176.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 3
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :3 after 7
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :7 after 8
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :8 after 9
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :9 after 13
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :13 after 32
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :32 after 63
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :63 after 110
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :110 after 425
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :425 after 1077
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :1077 after 2136
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :2136 after 10573
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :10573 after 20119
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :20119 after 45299
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :45299 after 241106
Detected timeout of ITS tools.
[2022-06-12 22:06:48] [INFO ] Flatten gal took : 171 ms
[2022-06-12 22:06:48] [INFO ] Input system was already deterministic with 1704 transitions.
[2022-06-12 22:06:48] [INFO ] Transformed 592 places.
[2022-06-12 22:06:48] [INFO ] Transformed 1704 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:06:49] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3651731395148949133.gal : 10 ms
[2022-06-12 22:06:49] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13769796327321838416.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/ReachabilityCardinality3651731395148949133.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality13769796327321838416.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/ReachabilityCardinality3651731395148949133.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality13769796327321838416.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/ReachabilityCardinality13769796327321838416.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :4 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 18
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :18 after 26
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :26 after 30
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :30 after 32
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :32 after 318
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :318 after 398
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :398 after 1550
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1550 after 18614
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :18614 after 46490
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :46490 after 867380
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :867380 after 2.22927e+07
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
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination ReachabilityCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Peterson-COL-7"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="gold2021"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool gold2021"
echo " Input is Peterson-COL-7, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r179-tall-165277026700017"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Peterson-COL-7.tgz
mv Peterson-COL-7 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;