About the Execution of 2021-gold for AutoFlight-PT-48b
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
1780.836 | 291859.00 | 341221.00 | 108.40 | TTFTTTTTTTTTFTTF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2022-input.r010-tajo-165245701800192.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2022-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2021
Input is AutoFlight-PT-48b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r010-tajo-165245701800192
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 10K Apr 30 02:08 CTLCardinality.txt
-rw-r--r-- 1 mcc users 116K Apr 30 02:08 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Apr 30 02:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Apr 30 02:07 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K May 9 07:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 9 07:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 07:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 07:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.4K Apr 30 02:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 83K Apr 30 02:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.9K Apr 30 02:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 90K Apr 30 02:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 07:05 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 07:05 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 956K May 10 09:33 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 AutoFlight-PT-48b-ReachabilityFireability-00
FORMULA_NAME AutoFlight-PT-48b-ReachabilityFireability-01
FORMULA_NAME AutoFlight-PT-48b-ReachabilityFireability-02
FORMULA_NAME AutoFlight-PT-48b-ReachabilityFireability-03
FORMULA_NAME AutoFlight-PT-48b-ReachabilityFireability-04
FORMULA_NAME AutoFlight-PT-48b-ReachabilityFireability-05
FORMULA_NAME AutoFlight-PT-48b-ReachabilityFireability-06
FORMULA_NAME AutoFlight-PT-48b-ReachabilityFireability-07
FORMULA_NAME AutoFlight-PT-48b-ReachabilityFireability-08
FORMULA_NAME AutoFlight-PT-48b-ReachabilityFireability-09
FORMULA_NAME AutoFlight-PT-48b-ReachabilityFireability-10
FORMULA_NAME AutoFlight-PT-48b-ReachabilityFireability-11
FORMULA_NAME AutoFlight-PT-48b-ReachabilityFireability-12
FORMULA_NAME AutoFlight-PT-48b-ReachabilityFireability-13
FORMULA_NAME AutoFlight-PT-48b-ReachabilityFireability-14
FORMULA_NAME AutoFlight-PT-48b-ReachabilityFireability-15
=== Now, execution of the tool begins
BK_START 1655069828356
Running Version 0
[2022-06-12 21:37:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-12 21:37:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-12 21:37:10] [INFO ] Load time of PNML (sax parser for PT used): 172 ms
[2022-06-12 21:37:10] [INFO ] Transformed 3950 places.
[2022-06-12 21:37:10] [INFO ] Transformed 3936 transitions.
[2022-06-12 21:37:10] [INFO ] Found NUPN structural information;
[2022-06-12 21:37:10] [INFO ] Parsed PT model containing 3950 places and 3936 transitions in 310 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 5 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 16) seen :6
FORMULA AutoFlight-PT-48b-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-48b-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-48b-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-48b-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-48b-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-48b-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 3936 rows 3950 cols
[2022-06-12 21:37:11] [INFO ] Computed 258 place invariants in 101 ms
[2022-06-12 21:37:12] [INFO ] [Real]Absence check using 257 positive place invariants in 314 ms returned sat
[2022-06-12 21:37:12] [INFO ] [Real]Absence check using 257 positive and 1 generalized place invariants in 12 ms returned sat
[2022-06-12 21:37:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:37:16] [INFO ] [Real]Absence check using state equation in 4006 ms returned unknown
[2022-06-12 21:37:17] [INFO ] [Real]Absence check using 257 positive place invariants in 638 ms returned sat
[2022-06-12 21:37:17] [INFO ] [Real]Absence check using 257 positive and 1 generalized place invariants in 24 ms returned sat
[2022-06-12 21:37:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:37:21] [INFO ] [Real]Absence check using state equation in 3581 ms returned unknown
[2022-06-12 21:37:22] [INFO ] [Real]Absence check using 257 positive place invariants in 510 ms returned sat
[2022-06-12 21:37:22] [INFO ] [Real]Absence check using 257 positive and 1 generalized place invariants in 14 ms returned sat
[2022-06-12 21:37:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:37:26] [INFO ] [Real]Absence check using state equation in 3919 ms returned unknown
[2022-06-12 21:37:27] [INFO ] [Real]Absence check using 257 positive place invariants in 249 ms returned sat
[2022-06-12 21:37:27] [INFO ] [Real]Absence check using 257 positive and 1 generalized place invariants in 12 ms returned sat
[2022-06-12 21:37:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:37:29] [INFO ] [Real]Absence check using state equation in 1941 ms returned sat
[2022-06-12 21:37:31] [INFO ] Deduced a trap composed of 25 places in 1817 ms of which 13 ms to minimize.
[2022-06-12 21:37:33] [INFO ] Deduced a trap composed of 12 places in 2687 ms of which 4 ms to minimize.
[2022-06-12 21:37: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 3
[2022-06-12 21:37:34] [INFO ] [Real]Absence check using 257 positive place invariants in 384 ms returned sat
[2022-06-12 21:37:34] [INFO ] [Real]Absence check using 257 positive and 1 generalized place invariants in 13 ms returned sat
[2022-06-12 21:37:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:37:38] [INFO ] [Real]Absence check using state equation in 4105 ms returned unknown
[2022-06-12 21:37:40] [INFO ] [Real]Absence check using 257 positive place invariants in 553 ms returned sat
[2022-06-12 21:37:40] [INFO ] [Real]Absence check using 257 positive and 1 generalized place invariants in 38 ms returned sat
[2022-06-12 21:37:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:37:43] [INFO ] [Real]Absence check using state equation in 3821 ms returned unknown
[2022-06-12 21:37:44] [INFO ] [Real]Absence check using 257 positive place invariants in 297 ms returned sat
[2022-06-12 21:37:44] [INFO ] [Real]Absence check using 257 positive and 1 generalized place invariants in 12 ms returned sat
[2022-06-12 21:37:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:37:46] [INFO ] [Real]Absence check using state equation in 1852 ms returned sat
[2022-06-12 21:37:48] [INFO ] Deduced a trap composed of 43 places in 1787 ms of which 6 ms to minimize.
[2022-06-12 21:37:50] [INFO ] Deduced a trap composed of 41 places in 1703 ms of which 4 ms to minimize.
[2022-06-12 21:37:50] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 6
[2022-06-12 21:37:51] [INFO ] [Real]Absence check using 257 positive place invariants in 207 ms returned sat
[2022-06-12 21:37:51] [INFO ] [Real]Absence check using 257 positive and 1 generalized place invariants in 10 ms returned sat
[2022-06-12 21:37:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:37:53] [INFO ] [Real]Absence check using state equation in 2029 ms returned sat
[2022-06-12 21:37:53] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:37:54] [INFO ] [Nat]Absence check using 257 positive place invariants in 266 ms returned sat
[2022-06-12 21:37:54] [INFO ] [Nat]Absence check using 257 positive and 1 generalized place invariants in 8 ms returned unsat
[2022-06-12 21:37:55] [INFO ] [Real]Absence check using 257 positive place invariants in 347 ms returned sat
[2022-06-12 21:37:55] [INFO ] [Real]Absence check using 257 positive and 1 generalized place invariants in 11 ms returned sat
[2022-06-12 21:37:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:37:59] [INFO ] [Real]Absence check using state equation in 4021 ms returned unknown
[2022-06-12 21:38:00] [INFO ] [Real]Absence check using 257 positive place invariants in 270 ms returned sat
[2022-06-12 21:38:00] [INFO ] [Real]Absence check using 257 positive and 1 generalized place invariants in 15 ms returned unsat
FORMULA AutoFlight-PT-48b-ReachabilityFireability-15 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA AutoFlight-PT-48b-ReachabilityFireability-13 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 10 Parikh solutions to 1 different solutions.
Support contains 252 out of 3950 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3950/3950 places, 3936/3936 transitions.
Drop transitions removed 1382 transitions
Trivial Post-agglo rules discarded 1382 transitions
Performed 1382 trivial Post agglomeration. Transition count delta: 1382
Iterating post reduction 0 with 1382 rules applied. Total rules applied 1382 place count 3950 transition count 2554
Reduce places removed 1382 places and 0 transitions.
Ensure Unique test removed 138 transitions
Reduce isomorphic transitions removed 138 transitions.
Drop transitions removed 61 transitions
Trivial Post-agglo rules discarded 61 transitions
Performed 61 trivial Post agglomeration. Transition count delta: 61
Iterating post reduction 1 with 1581 rules applied. Total rules applied 2963 place count 2568 transition count 2355
Reduce places removed 61 places and 0 transitions.
Performed 120 Post agglomeration using F-continuation condition.Transition count delta: 120
Iterating post reduction 2 with 181 rules applied. Total rules applied 3144 place count 2507 transition count 2235
Reduce places removed 120 places and 0 transitions.
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 3 with 146 rules applied. Total rules applied 3290 place count 2387 transition count 2209
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 3293 place count 2384 transition count 2209
Performed 442 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 442 Pre rules applied. Total rules applied 3293 place count 2384 transition count 1767
Deduced a syphon composed of 442 places in 13 ms
Reduce places removed 442 places and 0 transitions.
Iterating global reduction 5 with 884 rules applied. Total rules applied 4177 place count 1942 transition count 1767
Discarding 291 places :
Symmetric choice reduction at 5 with 291 rule applications. Total rules 4468 place count 1651 transition count 1476
Iterating global reduction 5 with 291 rules applied. Total rules applied 4759 place count 1651 transition count 1476
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 7 rules applied. Total rules applied 4766 place count 1651 transition count 1469
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 4767 place count 1650 transition count 1469
Performed 84 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 84 Pre rules applied. Total rules applied 4767 place count 1650 transition count 1385
Deduced a syphon composed of 84 places in 7 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 7 with 168 rules applied. Total rules applied 4935 place count 1566 transition count 1385
Performed 328 Post agglomeration using F-continuation condition.Transition count delta: 328
Deduced a syphon composed of 328 places in 2 ms
Reduce places removed 328 places and 0 transitions.
Iterating global reduction 7 with 656 rules applied. Total rules applied 5591 place count 1238 transition count 1057
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 4 places in 3 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 7 with 8 rules applied. Total rules applied 5599 place count 1234 transition count 1058
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 7 with 19 rules applied. Total rules applied 5618 place count 1234 transition count 1039
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 3 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 5624 place count 1231 transition count 1036
Free-agglomeration rule applied 107 times.
Iterating global reduction 7 with 107 rules applied. Total rules applied 5731 place count 1231 transition count 929
Reduce places removed 107 places and 0 transitions.
Iterating post reduction 7 with 107 rules applied. Total rules applied 5838 place count 1124 transition count 929
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 5839 place count 1124 transition count 928
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 5840 place count 1124 transition count 928
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 5841 place count 1123 transition count 927
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 5842 place count 1122 transition count 927
Applied a total of 5842 rules in 1187 ms. Remains 1122 /3950 variables (removed 2828) and now considering 927/3936 (removed 3009) transitions.
Finished structural reductions, in 1 iterations. Remains : 1122/3950 places, 927/3936 transitions.
[2022-06-12 21:38:01] [INFO ] Flatten gal took : 95 ms
[2022-06-12 21:38:01] [INFO ] Flatten gal took : 71 ms
[2022-06-12 21:38:01] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5808167516354559397.gal : 22 ms
[2022-06-12 21:38:01] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5682302197044266725.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/ReachabilityCardinality5808167516354559397.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality5682302197044266725.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/ReachabilityCardinality5808167516354559397.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality5682302197044266725.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality5682302197044266725.prop.
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,8 properties remain. new max is 8
SDD size :3 after 5
SDD proceeding with computation,8 properties remain. new max is 16
SDD size :5 after 50
SDD proceeding with computation,8 properties remain. new max is 32
SDD size :50 after 176
SDD proceeding with computation,8 properties remain. new max is 64
SDD size :176 after 347
SDD proceeding with computation,8 properties remain. new max is 128
SDD size :347 after 1903
SDD proceeding with computation,8 properties remain. new max is 256
SDD size :1903 after 2083
SDD proceeding with computation,8 properties remain. new max is 512
SDD size :2083 after 2915
SDD proceeding with computation,8 properties remain. new max is 1024
SDD size :2915 after 12467
SDD proceeding with computation,8 properties remain. new max is 2048
SDD size :12467 after 14091
SDD proceeding with computation,8 properties remain. new max is 4096
SDD size :14091 after 99243
SDD proceeding with computation,8 properties remain. new max is 8192
SDD size :99243 after 235794
SDD proceeding with computation,8 properties remain. new max is 16384
SDD size :235794 after 494054
Detected timeout of ITS tools.
[2022-06-12 21:38:16] [INFO ] Flatten gal took : 83 ms
[2022-06-12 21:38:16] [INFO ] Applying decomposition
[2022-06-12 21:38:16] [INFO ] Flatten gal took : 49 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/graph10420745898228170277.txt, -o, /tmp/graph10420745898228170277.bin, -w, /tmp/graph10420745898228170277.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/graph10420745898228170277.bin, -l, -1, -v, -w, /tmp/graph10420745898228170277.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-12 21:38:17] [INFO ] Decomposing Gal with order
[2022-06-12 21:38:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-12 21:38:17] [INFO ] Removed a total of 225 redundant transitions.
[2022-06-12 21:38:17] [INFO ] Flatten gal took : 112 ms
[2022-06-12 21:38:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 28 labels/synchronizations in 53 ms.
[2022-06-12 21:38:17] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10871165335372070460.gal : 15 ms
[2022-06-12 21:38:17] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7396828436521931451.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/ReachabilityCardinality10871165335372070460.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality7396828436521931451.prop, --nowitness], workingDir=/home/mcc/execution]
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality10871165335372070460.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality7396828436521931451.prop --nowitness
Loading property file /tmp/ReachabilityCardinality7396828436521931451.prop.
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,8 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,8 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,8 properties remain. new max is 32
SDD size :1 after 1
SDD proceeding with computation,8 properties remain. new max is 64
SDD size :1 after 53
SDD proceeding with computation,8 properties remain. new max is 128
SDD size :53 after 53
SDD proceeding with computation,8 properties remain. new max is 256
SDD size :3851 after 5147
SDD proceeding with computation,8 properties remain. new max is 512
SDD size :5147 after 9035
SDD proceeding with computation,8 properties remain. new max is 1024
SDD size :9035 after 9.67118e+07
SDD proceeding with computation,8 properties remain. new max is 2048
SDD size :9.67118e+07 after 1.02381e+08
Reachability property AutoFlight-PT-48b-ReachabilityFireability-14 is true.
FORMULA AutoFlight-PT-48b-ReachabilityFireability-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Invariant property AutoFlight-PT-48b-ReachabilityFireability-02 does not hold.
FORMULA AutoFlight-PT-48b-ReachabilityFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,6 properties remain. new max is 2048
SDD size :1.02381e+08 after 6.9665e+15
SDD proceeding with computation,6 properties remain. new max is 4096
SDD size :6.9665e+15 after 6.99164e+15
SDD proceeding with computation,6 properties remain. new max is 8192
SDD size :6.99164e+15 after 6.99165e+15
SDD proceeding with computation,6 properties remain. new max is 16384
SDD size :6.99165e+15 after 7.04288e+15
SDD proceeding with computation,6 properties remain. new max is 32768
SDD size :1.25709e+17 after 1.21724e+27
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin18260475462081868110
[2022-06-12 21:38:32] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18260475462081868110
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/ltsmin18260475462081868110]
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/ltsmin18260475462081868110] 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/ltsmin18260475462081868110] 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 3725 resets, run finished after 4134 ms. (steps per millisecond=241 ) properties (out of 6) seen :3
FORMULA AutoFlight-PT-48b-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-48b-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-48b-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 310 resets, run finished after 4197 ms. (steps per millisecond=238 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 285 resets, run finished after 2474 ms. (steps per millisecond=404 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 288 resets, run finished after 2070 ms. (steps per millisecond=483 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 927 rows 1122 cols
[2022-06-12 21:38:46] [INFO ] Computed 257 place invariants in 43 ms
[2022-06-12 21:38:46] [INFO ] [Real]Absence check using 255 positive place invariants in 70 ms returned sat
[2022-06-12 21:38:46] [INFO ] [Real]Absence check using 255 positive and 2 generalized place invariants in 21 ms returned sat
[2022-06-12 21:38:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:38:47] [INFO ] [Real]Absence check using state equation in 599 ms returned sat
[2022-06-12 21:38:47] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:38:47] [INFO ] [Nat]Absence check using 255 positive place invariants in 71 ms returned sat
[2022-06-12 21:38:47] [INFO ] [Nat]Absence check using 255 positive and 2 generalized place invariants in 7 ms returned sat
[2022-06-12 21:38:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:38:48] [INFO ] [Nat]Absence check using state equation in 735 ms returned sat
[2022-06-12 21:38:48] [INFO ] State equation strengthened by 243 read => feed constraints.
[2022-06-12 21:38:48] [INFO ] [Nat]Added 243 Read/Feed constraints in 34 ms returned sat
[2022-06-12 21:38:48] [INFO ] Deduced a trap composed of 10 places in 206 ms of which 1 ms to minimize.
[2022-06-12 21:38:48] [INFO ] Deduced a trap composed of 9 places in 210 ms of which 2 ms to minimize.
[2022-06-12 21:38:49] [INFO ] Deduced a trap composed of 11 places in 254 ms of which 1 ms to minimize.
[2022-06-12 21:38:49] [INFO ] Deduced a trap composed of 10 places in 261 ms of which 2 ms to minimize.
[2022-06-12 21:38:49] [INFO ] Deduced a trap composed of 9 places in 250 ms of which 1 ms to minimize.
[2022-06-12 21:38:50] [INFO ] Deduced a trap composed of 47 places in 258 ms of which 1 ms to minimize.
[2022-06-12 21:38:50] [INFO ] Deduced a trap composed of 75 places in 249 ms of which 1 ms to minimize.
[2022-06-12 21:38:50] [INFO ] Deduced a trap composed of 41 places in 236 ms of which 1 ms to minimize.
[2022-06-12 21:38:50] [INFO ] Deduced a trap composed of 13 places in 226 ms of which 1 ms to minimize.
[2022-06-12 21:38:51] [INFO ] Deduced a trap composed of 13 places in 219 ms of which 0 ms to minimize.
[2022-06-12 21:38:51] [INFO ] Deduced a trap composed of 283 places in 251 ms of which 1 ms to minimize.
[2022-06-12 21:38:51] [INFO ] Deduced a trap composed of 19 places in 226 ms of which 1 ms to minimize.
[2022-06-12 21:38:52] [INFO ] Deduced a trap composed of 24 places in 245 ms of which 1 ms to minimize.
[2022-06-12 21:38:52] [INFO ] Deduced a trap composed of 19 places in 257 ms of which 1 ms to minimize.
[2022-06-12 21:38:52] [INFO ] Deduced a trap composed of 37 places in 227 ms of which 1 ms to minimize.
[2022-06-12 21:38:53] [INFO ] Deduced a trap composed of 52 places in 257 ms of which 1 ms to minimize.
[2022-06-12 21:38:53] [INFO ] Deduced a trap composed of 77 places in 258 ms of which 1 ms to minimize.
[2022-06-12 21:38:53] [INFO ] Deduced a trap composed of 115 places in 245 ms of which 0 ms to minimize.
[2022-06-12 21:38:54] [INFO ] Deduced a trap composed of 377 places in 247 ms of which 1 ms to minimize.
[2022-06-12 21:38:54] [INFO ] Deduced a trap composed of 396 places in 230 ms of which 1 ms to minimize.
[2022-06-12 21:38:54] [INFO ] Deduced a trap composed of 393 places in 238 ms of which 1 ms to minimize.
[2022-06-12 21:38:54] [INFO ] Deduced a trap composed of 390 places in 225 ms of which 1 ms to minimize.
[2022-06-12 21:38:55] [INFO ] Deduced a trap composed of 369 places in 213 ms of which 1 ms to minimize.
[2022-06-12 21:38:55] [INFO ] Deduced a trap composed of 302 places in 211 ms of which 1 ms to minimize.
[2022-06-12 21:38:55] [INFO ] Deduced a trap composed of 386 places in 211 ms of which 0 ms to minimize.
[2022-06-12 21:38:55] [INFO ] Deduced a trap composed of 369 places in 235 ms of which 1 ms to minimize.
[2022-06-12 21:38:56] [INFO ] Deduced a trap composed of 377 places in 230 ms of which 1 ms to minimize.
[2022-06-12 21:38:56] [INFO ] Deduced a trap composed of 365 places in 286 ms of which 1 ms to minimize.
[2022-06-12 21:38:56] [INFO ] Deduced a trap composed of 391 places in 251 ms of which 1 ms to minimize.
[2022-06-12 21:38:57] [INFO ] Deduced a trap composed of 387 places in 249 ms of which 7 ms to minimize.
[2022-06-12 21:38:57] [INFO ] Deduced a trap composed of 369 places in 242 ms of which 1 ms to minimize.
[2022-06-12 21:38:57] [INFO ] Deduced a trap composed of 381 places in 215 ms of which 1 ms to minimize.
[2022-06-12 21:38:58] [INFO ] Deduced a trap composed of 320 places in 218 ms of which 0 ms to minimize.
[2022-06-12 21:38:58] [INFO ] Deduced a trap composed of 383 places in 229 ms of which 1 ms to minimize.
[2022-06-12 21:38:58] [INFO ] Deduced a trap composed of 396 places in 269 ms of which 1 ms to minimize.
[2022-06-12 21:38:58] [INFO ] Deduced a trap composed of 370 places in 259 ms of which 0 ms to minimize.
[2022-06-12 21:38:59] [INFO ] Deduced a trap composed of 419 places in 235 ms of which 1 ms to minimize.
[2022-06-12 21:38:59] [INFO ] Deduced a trap composed of 359 places in 251 ms of which 0 ms to minimize.
[2022-06-12 21:38:59] [INFO ] Deduced a trap composed of 363 places in 219 ms of which 1 ms to minimize.
[2022-06-12 21:39:00] [INFO ] Deduced a trap composed of 370 places in 228 ms of which 1 ms to minimize.
[2022-06-12 21:39:00] [INFO ] Deduced a trap composed of 377 places in 231 ms of which 0 ms to minimize.
[2022-06-12 21:39:00] [INFO ] Deduced a trap composed of 420 places in 225 ms of which 1 ms to minimize.
[2022-06-12 21:39:00] [INFO ] Deduced a trap composed of 425 places in 224 ms of which 0 ms to minimize.
[2022-06-12 21:39:01] [INFO ] Deduced a trap composed of 424 places in 205 ms of which 1 ms to minimize.
[2022-06-12 21:39:01] [INFO ] Deduced a trap composed of 433 places in 222 ms of which 1 ms to minimize.
[2022-06-12 21:39:01] [INFO ] Deduced a trap composed of 432 places in 216 ms of which 1 ms to minimize.
[2022-06-12 21:39:01] [INFO ] Deduced a trap composed of 17 places in 100 ms of which 0 ms to minimize.
[2022-06-12 21:39:02] [INFO ] Deduced a trap composed of 79 places in 99 ms of which 0 ms to minimize.
[2022-06-12 21:39:02] [INFO ] Deduced a trap composed of 105 places in 120 ms of which 1 ms to minimize.
[2022-06-12 21:39:02] [INFO ] Trap strengthening (SAT) tested/added 50/49 trap constraints in 13847 ms
[2022-06-12 21:39:02] [INFO ] Computed and/alt/rep : 922/1792/922 causal constraints (skipped 1 transitions) in 64 ms.
[2022-06-12 21:39:15] [INFO ] Added : 755 causal constraints over 151 iterations in 13366 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 21 ms.
[2022-06-12 21:39:15] [INFO ] [Real]Absence check using 255 positive place invariants in 67 ms returned sat
[2022-06-12 21:39:15] [INFO ] [Real]Absence check using 255 positive and 2 generalized place invariants in 10 ms returned sat
[2022-06-12 21:39:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:39:16] [INFO ] [Real]Absence check using state equation in 381 ms returned sat
[2022-06-12 21:39:16] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:39:16] [INFO ] [Nat]Absence check using 255 positive place invariants in 62 ms returned sat
[2022-06-12 21:39:16] [INFO ] [Nat]Absence check using 255 positive and 2 generalized place invariants in 6 ms returned sat
[2022-06-12 21:39:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:39:16] [INFO ] [Nat]Absence check using state equation in 501 ms returned sat
[2022-06-12 21:39:17] [INFO ] [Nat]Added 243 Read/Feed constraints in 32 ms returned sat
[2022-06-12 21:39:17] [INFO ] Deduced a trap composed of 9 places in 163 ms of which 2 ms to minimize.
[2022-06-12 21:39:17] [INFO ] Deduced a trap composed of 10 places in 196 ms of which 1 ms to minimize.
[2022-06-12 21:39:17] [INFO ] Deduced a trap composed of 45 places in 187 ms of which 1 ms to minimize.
[2022-06-12 21:39:17] [INFO ] Deduced a trap composed of 38 places in 199 ms of which 1 ms to minimize.
[2022-06-12 21:39:18] [INFO ] Deduced a trap composed of 10 places in 230 ms of which 1 ms to minimize.
[2022-06-12 21:39:18] [INFO ] Deduced a trap composed of 9 places in 228 ms of which 1 ms to minimize.
[2022-06-12 21:39:18] [INFO ] Deduced a trap composed of 10 places in 222 ms of which 0 ms to minimize.
[2022-06-12 21:39:18] [INFO ] Deduced a trap composed of 10 places in 210 ms of which 0 ms to minimize.
[2022-06-12 21:39:19] [INFO ] Deduced a trap composed of 13 places in 211 ms of which 1 ms to minimize.
[2022-06-12 21:39:19] [INFO ] Deduced a trap composed of 19 places in 204 ms of which 1 ms to minimize.
[2022-06-12 21:39:19] [INFO ] Deduced a trap composed of 20 places in 225 ms of which 0 ms to minimize.
[2022-06-12 21:39:19] [INFO ] Deduced a trap composed of 75 places in 200 ms of which 1 ms to minimize.
[2022-06-12 21:39:20] [INFO ] Deduced a trap composed of 71 places in 188 ms of which 0 ms to minimize.
[2022-06-12 21:39:20] [INFO ] Deduced a trap composed of 14 places in 186 ms of which 1 ms to minimize.
[2022-06-12 21:39:20] [INFO ] Deduced a trap composed of 17 places in 181 ms of which 1 ms to minimize.
[2022-06-12 21:39:20] [INFO ] Deduced a trap composed of 67 places in 182 ms of which 1 ms to minimize.
[2022-06-12 21:39:21] [INFO ] Deduced a trap composed of 71 places in 186 ms of which 1 ms to minimize.
[2022-06-12 21:39:21] [INFO ] Deduced a trap composed of 74 places in 181 ms of which 1 ms to minimize.
[2022-06-12 21:39:21] [INFO ] Deduced a trap composed of 77 places in 207 ms of which 1 ms to minimize.
[2022-06-12 21:39:21] [INFO ] Deduced a trap composed of 72 places in 215 ms of which 1 ms to minimize.
[2022-06-12 21:39:22] [INFO ] Deduced a trap composed of 421 places in 216 ms of which 1 ms to minimize.
[2022-06-12 21:39:22] [INFO ] Deduced a trap composed of 385 places in 214 ms of which 0 ms to minimize.
[2022-06-12 21:39:22] [INFO ] Deduced a trap composed of 426 places in 219 ms of which 0 ms to minimize.
[2022-06-12 21:39:22] [INFO ] Deduced a trap composed of 17 places in 216 ms of which 1 ms to minimize.
[2022-06-12 21:39:23] [INFO ] Deduced a trap composed of 428 places in 227 ms of which 1 ms to minimize.
[2022-06-12 21:39:23] [INFO ] Deduced a trap composed of 398 places in 241 ms of which 1 ms to minimize.
[2022-06-12 21:39:23] [INFO ] Deduced a trap composed of 398 places in 237 ms of which 0 ms to minimize.
[2022-06-12 21:39:24] [INFO ] Deduced a trap composed of 415 places in 226 ms of which 1 ms to minimize.
[2022-06-12 21:39:24] [INFO ] Deduced a trap composed of 412 places in 236 ms of which 1 ms to minimize.
[2022-06-12 21:39:24] [INFO ] Deduced a trap composed of 388 places in 247 ms of which 0 ms to minimize.
[2022-06-12 21:39:24] [INFO ] Deduced a trap composed of 412 places in 254 ms of which 0 ms to minimize.
[2022-06-12 21:39:25] [INFO ] Deduced a trap composed of 425 places in 241 ms of which 0 ms to minimize.
[2022-06-12 21:39:25] [INFO ] Trap strengthening (SAT) tested/added 33/32 trap constraints in 8237 ms
[2022-06-12 21:39:25] [INFO ] Computed and/alt/rep : 922/1792/922 causal constraints (skipped 1 transitions) in 56 ms.
[2022-06-12 21:39:42] [INFO ] Deduced a trap composed of 49 places in 253 ms of which 1 ms to minimize.
[2022-06-12 21:39:42] [INFO ] Deduced a trap composed of 73 places in 258 ms of which 1 ms to minimize.
[2022-06-12 21:39:43] [INFO ] Deduced a trap composed of 75 places in 255 ms of which 1 ms to minimize.
[2022-06-12 21:39:43] [INFO ] Deduced a trap composed of 313 places in 245 ms of which 0 ms to minimize.
[2022-06-12 21:39:43] [INFO ] Deduced a trap composed of 352 places in 204 ms of which 0 ms to minimize.
[2022-06-12 21:39:44] [INFO ] Deduced a trap composed of 372 places in 216 ms of which 1 ms to minimize.
[2022-06-12 21:39:44] [INFO ] Deduced a trap composed of 304 places in 238 ms of which 0 ms to minimize.
[2022-06-12 21:39:44] [INFO ] Deduced a trap composed of 365 places in 193 ms of which 1 ms to minimize.
[2022-06-12 21:39:44] [INFO ] Deduced a trap composed of 394 places in 224 ms of which 0 ms to minimize.
[2022-06-12 21:39:45] [INFO ] Deduced a trap composed of 403 places in 223 ms of which 0 ms to minimize.
[2022-06-12 21:39:45] [INFO ] Deduced a trap composed of 373 places in 197 ms of which 1 ms to minimize.
[2022-06-12 21:39:45] [INFO ] Deduced a trap composed of 396 places in 214 ms of which 1 ms to minimize.
[2022-06-12 21:39:46] [INFO ] Deduced a trap composed of 399 places in 233 ms of which 0 ms to minimize.
[2022-06-12 21:39:46] [INFO ] Deduced a trap composed of 429 places in 247 ms of which 1 ms to minimize.
[2022-06-12 21:39:46] [INFO ] Deduced a trap composed of 412 places in 240 ms of which 1 ms to minimize.
[2022-06-12 21:39:47] [INFO ] Deduced a trap composed of 411 places in 187 ms of which 1 ms to minimize.
[2022-06-12 21:39:47] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 5435 ms
[2022-06-12 21:39:47] [INFO ] Added : 871 causal constraints over 175 iterations in 22334 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 27 ms.
[2022-06-12 21:39:47] [INFO ] [Real]Absence check using 255 positive place invariants in 68 ms returned sat
[2022-06-12 21:39:47] [INFO ] [Real]Absence check using 255 positive and 2 generalized place invariants in 8 ms returned sat
[2022-06-12 21:39:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:39:48] [INFO ] [Real]Absence check using state equation in 391 ms returned sat
[2022-06-12 21:39:48] [INFO ] [Real]Added 243 Read/Feed constraints in 27 ms returned sat
[2022-06-12 21:39:48] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:39:48] [INFO ] [Nat]Absence check using 255 positive place invariants in 63 ms returned sat
[2022-06-12 21:39:48] [INFO ] [Nat]Absence check using 255 positive and 2 generalized place invariants in 6 ms returned sat
[2022-06-12 21:39:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:39:48] [INFO ] [Nat]Absence check using state equation in 338 ms returned sat
[2022-06-12 21:39:48] [INFO ] [Nat]Added 243 Read/Feed constraints in 39 ms returned sat
[2022-06-12 21:39:49] [INFO ] Deduced a trap composed of 9 places in 243 ms of which 0 ms to minimize.
[2022-06-12 21:39:49] [INFO ] Deduced a trap composed of 10 places in 227 ms of which 0 ms to minimize.
[2022-06-12 21:39:49] [INFO ] Deduced a trap composed of 10 places in 118 ms of which 1 ms to minimize.
[2022-06-12 21:39:49] [INFO ] Deduced a trap composed of 11 places in 133 ms of which 1 ms to minimize.
[2022-06-12 21:39:50] [INFO ] Deduced a trap composed of 9 places in 111 ms of which 1 ms to minimize.
[2022-06-12 21:39:50] [INFO ] Deduced a trap composed of 17 places in 130 ms of which 0 ms to minimize.
[2022-06-12 21:39:50] [INFO ] Deduced a trap composed of 19 places in 165 ms of which 0 ms to minimize.
[2022-06-12 21:39:50] [INFO ] Deduced a trap composed of 13 places in 111 ms of which 1 ms to minimize.
[2022-06-12 21:39:50] [INFO ] Deduced a trap composed of 64 places in 101 ms of which 0 ms to minimize.
[2022-06-12 21:39:50] [INFO ] Deduced a trap composed of 20 places in 115 ms of which 0 ms to minimize.
[2022-06-12 21:39:51] [INFO ] Deduced a trap composed of 46 places in 152 ms of which 0 ms to minimize.
[2022-06-12 21:39:51] [INFO ] Deduced a trap composed of 54 places in 106 ms of which 1 ms to minimize.
[2022-06-12 21:39:51] [INFO ] Deduced a trap composed of 73 places in 101 ms of which 0 ms to minimize.
[2022-06-12 21:39:51] [INFO ] Deduced a trap composed of 53 places in 108 ms of which 0 ms to minimize.
[2022-06-12 21:39:51] [INFO ] Deduced a trap composed of 105 places in 99 ms of which 0 ms to minimize.
[2022-06-12 21:39:51] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 2808 ms
[2022-06-12 21:39:51] [INFO ] Computed and/alt/rep : 922/1792/922 causal constraints (skipped 1 transitions) in 62 ms.
[2022-06-12 21:40:07] [INFO ] Added : 807 causal constraints over 162 iterations in 15590 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 20 ms.
Incomplete Parikh walk after 88700 steps, including 371 resets, run finished after 532 ms. (steps per millisecond=166 ) properties (out of 3) seen :0 could not realise parikh vector
Incomplete Parikh walk after 102900 steps, including 404 resets, run finished after 558 ms. (steps per millisecond=184 ) properties (out of 3) seen :1 could not realise parikh vector
FORMULA AutoFlight-PT-48b-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 98700 steps, including 386 resets, run finished after 513 ms. (steps per millisecond=192 ) properties (out of 2) seen :0 could not realise parikh vector
Support contains 71 out of 1122 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1122/1122 places, 927/927 transitions.
Drop transitions removed 106 transitions
Trivial Post-agglo rules discarded 106 transitions
Performed 106 trivial Post agglomeration. Transition count delta: 106
Iterating post reduction 0 with 106 rules applied. Total rules applied 106 place count 1122 transition count 821
Reduce places removed 106 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 111 rules applied. Total rules applied 217 place count 1016 transition count 816
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 222 place count 1011 transition count 816
Performed 57 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 57 Pre rules applied. Total rules applied 222 place count 1011 transition count 759
Deduced a syphon composed of 57 places in 4 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 3 with 114 rules applied. Total rules applied 336 place count 954 transition count 759
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 340 place count 950 transition count 755
Iterating global reduction 3 with 4 rules applied. Total rules applied 344 place count 950 transition count 755
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 344 place count 950 transition count 753
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 348 place count 948 transition count 753
Performed 86 Post agglomeration using F-continuation condition.Transition count delta: 86
Deduced a syphon composed of 86 places in 1 ms
Reduce places removed 86 places and 0 transitions.
Iterating global reduction 3 with 172 rules applied. Total rules applied 520 place count 862 transition count 667
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 524 place count 860 transition count 675
Free-agglomeration rule applied 31 times.
Iterating global reduction 3 with 31 rules applied. Total rules applied 555 place count 860 transition count 644
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 3 with 31 rules applied. Total rules applied 586 place count 829 transition count 644
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 587 place count 828 transition count 643
Applied a total of 587 rules in 250 ms. Remains 828 /1122 variables (removed 294) and now considering 643/927 (removed 284) transitions.
Finished structural reductions, in 1 iterations. Remains : 828/1122 places, 643/927 transitions.
[2022-06-12 21:40:09] [INFO ] Flatten gal took : 70 ms
[2022-06-12 21:40:09] [INFO ] Flatten gal took : 59 ms
[2022-06-12 21:40:09] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3279837341874777201.gal : 6 ms
[2022-06-12 21:40:09] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7240984312058946673.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/ReachabilityCardinality3279837341874777201.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality7240984312058946673.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/ReachabilityCardinality3279837341874777201.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality7240984312058946673.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality7240984312058946673.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 10
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :10 after 18
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :18 after 19
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :19 after 31
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :31 after 43
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :43 after 136
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :136 after 262441
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :262441 after 1.41718e+07
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1.41718e+07 after 1.62713e+07
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1.62713e+07 after 1.66799e+07
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :1.66799e+07 after 1.71874e+07
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :1.71874e+07 after 2.04703e+07
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :2.04703e+07 after 2.49415e+07
Detected timeout of ITS tools.
[2022-06-12 21:40:24] [INFO ] Flatten gal took : 73 ms
[2022-06-12 21:40:24] [INFO ] Applying decomposition
[2022-06-12 21:40:24] [INFO ] Flatten gal took : 56 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph16336907000423115930.txt, -o, /tmp/graph16336907000423115930.bin, -w, /tmp/graph16336907000423115930.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/graph16336907000423115930.bin, -l, -1, -v, -w, /tmp/graph16336907000423115930.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-12 21:40:24] [INFO ] Decomposing Gal with order
[2022-06-12 21:40:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-12 21:40:24] [INFO ] Removed a total of 1143 redundant transitions.
[2022-06-12 21:40:24] [INFO ] Flatten gal took : 69 ms
[2022-06-12 21:40:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 46 labels/synchronizations in 216 ms.
[2022-06-12 21:40:25] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15664194298845242485.gal : 10 ms
[2022-06-12 21:40:25] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8648375595344765487.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/ReachabilityCardinality15664194298845242485.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality8648375595344765487.prop, --nowitness], workingDir=/home/mcc/execution]
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality15664194298845242485.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality8648375595344765487.prop --nowitness
Loading property file /tmp/ReachabilityCardinality8648375595344765487.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 18
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :18 after 54
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :54 after 66
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :66 after 375
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :375 after 4997
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :4997 after 5762
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :5762 after 7228
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :7228 after 7813
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :7813 after 7813
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :7813 after 7813
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :7813 after 7813
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :7813 after 7813
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16881031259883354510
[2022-06-12 21:40:40] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16881031259883354510
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/ltsmin16881031259883354510]
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/ltsmin16881031259883354510] 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/ltsmin16881031259883354510] 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 8104 resets, run finished after 5758 ms. (steps per millisecond=173 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 711 resets, run finished after 4527 ms. (steps per millisecond=220 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 758 resets, run finished after 2821 ms. (steps per millisecond=354 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 2675697 steps, run timeout after 30001 ms. (steps per millisecond=89 ) properties seen :{}
Probabilistic random walk after 2675697 steps, saw 563303 distinct states, run finished after 30008 ms. (steps per millisecond=89 ) properties seen :{}
Running SMT prover for 2 properties.
// Phase 1: matrix 643 rows 828 cols
[2022-06-12 21:41:24] [INFO ] Computed 257 place invariants in 10 ms
[2022-06-12 21:41:24] [INFO ] [Real]Absence check using 255 positive place invariants in 74 ms returned sat
[2022-06-12 21:41:24] [INFO ] [Real]Absence check using 255 positive and 2 generalized place invariants in 9 ms returned sat
[2022-06-12 21:41:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:41:24] [INFO ] [Real]Absence check using state equation in 400 ms returned sat
[2022-06-12 21:41:24] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:41:25] [INFO ] [Nat]Absence check using 255 positive place invariants in 77 ms returned sat
[2022-06-12 21:41:25] [INFO ] [Nat]Absence check using 255 positive and 2 generalized place invariants in 7 ms returned sat
[2022-06-12 21:41:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:41:25] [INFO ] [Nat]Absence check using state equation in 511 ms returned sat
[2022-06-12 21:41:25] [INFO ] State equation strengthened by 342 read => feed constraints.
[2022-06-12 21:41:25] [INFO ] [Nat]Added 342 Read/Feed constraints in 42 ms returned sat
[2022-06-12 21:41:25] [INFO ] Deduced a trap composed of 10 places in 78 ms of which 1 ms to minimize.
[2022-06-12 21:41:25] [INFO ] Deduced a trap composed of 57 places in 84 ms of which 0 ms to minimize.
[2022-06-12 21:41:26] [INFO ] Deduced a trap composed of 42 places in 75 ms of which 0 ms to minimize.
[2022-06-12 21:41:26] [INFO ] Deduced a trap composed of 57 places in 47 ms of which 0 ms to minimize.
[2022-06-12 21:41:26] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 588 ms
[2022-06-12 21:41:26] [INFO ] Computed and/alt/rep : 500/1034/500 causal constraints (skipped 90 transitions) in 50 ms.
[2022-06-12 21:41:31] [INFO ] Added : 376 causal constraints over 76 iterations in 4846 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 15 ms.
[2022-06-12 21:41:31] [INFO ] [Real]Absence check using 255 positive place invariants in 44 ms returned sat
[2022-06-12 21:41:31] [INFO ] [Real]Absence check using 255 positive and 2 generalized place invariants in 11 ms returned sat
[2022-06-12 21:41:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:41:31] [INFO ] [Real]Absence check using state equation in 230 ms returned sat
[2022-06-12 21:41:31] [INFO ] [Real]Added 342 Read/Feed constraints in 31 ms returned sat
[2022-06-12 21:41:31] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:41:31] [INFO ] [Nat]Absence check using 255 positive place invariants in 56 ms returned sat
[2022-06-12 21:41:31] [INFO ] [Nat]Absence check using 255 positive and 2 generalized place invariants in 5 ms returned sat
[2022-06-12 21:41:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:41:32] [INFO ] [Nat]Absence check using state equation in 264 ms returned sat
[2022-06-12 21:41:32] [INFO ] [Nat]Added 342 Read/Feed constraints in 33 ms returned sat
[2022-06-12 21:41:32] [INFO ] Deduced a trap composed of 8 places in 130 ms of which 1 ms to minimize.
[2022-06-12 21:41:32] [INFO ] Deduced a trap composed of 8 places in 167 ms of which 1 ms to minimize.
[2022-06-12 21:41:32] [INFO ] Deduced a trap composed of 363 places in 145 ms of which 0 ms to minimize.
[2022-06-12 21:41:32] [INFO ] Deduced a trap composed of 365 places in 162 ms of which 1 ms to minimize.
[2022-06-12 21:41:32] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 773 ms
[2022-06-12 21:41:32] [INFO ] Computed and/alt/rep : 500/1034/500 causal constraints (skipped 90 transitions) in 34 ms.
[2022-06-12 21:41:37] [INFO ] Added : 334 causal constraints over 67 iterations in 4105 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 12 ms.
Incomplete Parikh walk after 74000 steps, including 710 resets, run finished after 575 ms. (steps per millisecond=128 ) properties (out of 2) seen :0 could not realise parikh vector
Incomplete Parikh walk after 68200 steps, including 771 resets, run finished after 452 ms. (steps per millisecond=150 ) properties (out of 2) seen :0 could not realise parikh vector
Support contains 71 out of 828 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 828/828 places, 643/643 transitions.
Applied a total of 0 rules in 24 ms. Remains 828 /828 variables (removed 0) and now considering 643/643 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 828/828 places, 643/643 transitions.
Starting structural reductions, iteration 0 : 828/828 places, 643/643 transitions.
Applied a total of 0 rules in 22 ms. Remains 828 /828 variables (removed 0) and now considering 643/643 (removed 0) transitions.
// Phase 1: matrix 643 rows 828 cols
[2022-06-12 21:41:38] [INFO ] Computed 257 place invariants in 6 ms
[2022-06-12 21:41:38] [INFO ] Implicit Places using invariants in 411 ms returned [624, 630, 641, 647, 653, 654, 660, 671, 672, 678, 690, 691, 706, 707, 711, 715, 722, 723, 730, 731, 738, 742, 755, 756, 763, 769, 780, 781, 795, 802, 813, 819, 820]
Discarding 33 places :
Implicit Place search using SMT only with invariants took 414 ms to find 33 implicit places.
[2022-06-12 21:41:38] [INFO ] Redundant transitions in 39 ms returned []
// Phase 1: matrix 643 rows 795 cols
[2022-06-12 21:41:38] [INFO ] Computed 224 place invariants in 6 ms
[2022-06-12 21:41:38] [INFO ] Dead Transitions using invariants and state equation in 330 ms returned []
Starting structural reductions, iteration 1 : 795/828 places, 643/643 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 765 transition count 613
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 765 transition count 613
Applied a total of 60 rules in 62 ms. Remains 765 /795 variables (removed 30) and now considering 613/643 (removed 30) transitions.
// Phase 1: matrix 613 rows 765 cols
[2022-06-12 21:41:39] [INFO ] Computed 224 place invariants in 4 ms
[2022-06-12 21:41:39] [INFO ] Implicit Places using invariants in 387 ms returned []
// Phase 1: matrix 613 rows 765 cols
[2022-06-12 21:41:39] [INFO ] Computed 224 place invariants in 10 ms
[2022-06-12 21:41:39] [INFO ] State equation strengthened by 342 read => feed constraints.
[2022-06-12 21:41:41] [INFO ] Implicit Places using invariants and state equation in 2259 ms returned []
Implicit Place search using SMT with State Equation took 2650 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 765/828 places, 613/643 transitions.
[2022-06-12 21:41:41] [INFO ] Flatten gal took : 35 ms
[2022-06-12 21:41:41] [INFO ] Flatten gal took : 34 ms
[2022-06-12 21:41:41] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5255230898536610914.gal : 4 ms
[2022-06-12 21:41:41] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3953377585566243807.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/ReachabilityCardinality5255230898536610914.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality3953377585566243807.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/ReachabilityCardinality5255230898536610914.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality3953377585566243807.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality3953377585566243807.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 10
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :10 after 18
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :18 after 19
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :19 after 31
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :31 after 44
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :44 after 271
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :271 after 524881
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :524881 after 1.81205e+07
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1.81205e+07 after 1.81619e+07
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1.81619e+07 after 1.82688e+07
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :1.82688e+07 after 1.87426e+07
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :1.87426e+07 after 1.95956e+07
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :1.95956e+07 after 2.97505e+07
Detected timeout of ITS tools.
[2022-06-12 21:41:56] [INFO ] Flatten gal took : 68 ms
[2022-06-12 21:41:56] [INFO ] Applying decomposition
[2022-06-12 21:41:56] [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/graph15448950987165776312.txt, -o, /tmp/graph15448950987165776312.bin, -w, /tmp/graph15448950987165776312.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/graph15448950987165776312.bin, -l, -1, -v, -w, /tmp/graph15448950987165776312.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-12 21:41:56] [INFO ] Decomposing Gal with order
[2022-06-12 21:41:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-12 21:41:57] [INFO ] Removed a total of 1061 redundant transitions.
[2022-06-12 21:41:57] [INFO ] Flatten gal took : 67 ms
[2022-06-12 21:41:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 64 labels/synchronizations in 174 ms.
[2022-06-12 21:41:57] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10379204099838631664.gal : 11 ms
[2022-06-12 21:41:57] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16470392868932952873.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/ReachabilityCardinality10379204099838631664.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality16470392868932952873.prop, --nowitness], workingDir=/home/mcc/execution]
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality10379204099838631664.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality16470392868932952873.prop --nowitness
Loading property file /tmp/ReachabilityCardinality16470392868932952873.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 891
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :891 after 2.83435e+07
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :2.83435e+07 after 2.83435e+08
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :2.83435e+08 after 2.29583e+09
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :2.29583e+09 after 5.67059e+10
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :5.67059e+10 after 3.39045e+11
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :3.39045e+11 after 1.73523e+12
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1.73523e+12 after 1.79744e+14
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1.79744e+14 after 2.14418e+15
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,1.39632e+28,2.51893,75200,3591,1029,117891,56442,1882,193201,271,175086,0
Total reachable state count : 13963164246721239216950345728
Verifying 2 reachability properties.
Reachability property AutoFlight-PT-48b-ReachabilityFireability-00 is true.
FORMULA AutoFlight-PT-48b-ReachabilityFireability-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AutoFlight-PT-48b-ReachabilityFireability-00,9.33298e+16,2.63238,75200,345,350,117891,56442,2009,193201,284,175086,28289
Reachability property AutoFlight-PT-48b-ReachabilityFireability-10 is true.
FORMULA AutoFlight-PT-48b-ReachabilityFireability-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AutoFlight-PT-48b-ReachabilityFireability-10,6.54295e+24,2.6338,75200,329,349,117891,56442,2009,193201,284,175086,28289
All properties solved without resorting to model-checking.
BK_STOP 1655070120215
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination ReachabilityFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="AutoFlight-PT-48b"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="gold2021"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool gold2021"
echo " Input is AutoFlight-PT-48b, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r010-tajo-165245701800192"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/AutoFlight-PT-48b.tgz
mv AutoFlight-PT-48b execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;