About the Execution of ITS-Tools for Parking-PT-864
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15754.830 | 3600000.00 | 3738869.00 | 62197.80 | TTFFFFFFFF?T??F? | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/local/x2003239/mcc2020-input.r111-csrt-158961257800554.qcow2', fmt=qcow2 size=4294967296 backing_file=/local/x2003239/mcc2020-input.qcow2 encryption=off 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 itstools
Input is Parking-PT-864, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r111-csrt-158961257800554
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 596K
-rw-r--r-- 1 mcc users 3.1K Apr 12 00:40 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K Apr 12 00:40 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 10 23:31 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 10 23:31 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 14 12:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Apr 14 12:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Apr 10 08:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Apr 10 08:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 9 12:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 12K Apr 9 12:40 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 10 22:21 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 10 22:21 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 427K Mar 24 05:37 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 Parking-PT-864-00
FORMULA_NAME Parking-PT-864-01
FORMULA_NAME Parking-PT-864-02
FORMULA_NAME Parking-PT-864-03
FORMULA_NAME Parking-PT-864-04
FORMULA_NAME Parking-PT-864-05
FORMULA_NAME Parking-PT-864-06
FORMULA_NAME Parking-PT-864-07
FORMULA_NAME Parking-PT-864-08
FORMULA_NAME Parking-PT-864-09
FORMULA_NAME Parking-PT-864-10
FORMULA_NAME Parking-PT-864-11
FORMULA_NAME Parking-PT-864-12
FORMULA_NAME Parking-PT-864-13
FORMULA_NAME Parking-PT-864-14
FORMULA_NAME Parking-PT-864-15
=== Now, execution of the tool begins
BK_START 1590001011623
[2020-05-20 18:56:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2020-05-20 18:56:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-20 18:56:54] [INFO ] Load time of PNML (sax parser for PT used): 155 ms
[2020-05-20 18:56:54] [INFO ] Transformed 1185 places.
[2020-05-20 18:56:54] [INFO ] Transformed 1697 transitions.
[2020-05-20 18:56:54] [INFO ] Found NUPN structural information;
[2020-05-20 18:56:54] [INFO ] Parsed PT model containing 1185 places and 1697 transitions in 218 ms.
Ensure Unique test removed 688 transitions
Reduce redundant transitions removed 688 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 38 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 386 resets, run finished after 1383 ms. (steps per millisecond=72 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1]
// Phase 1: matrix 1009 rows 1185 cols
[2020-05-20 18:56:55] [INFO ] Computed 280 place invariants in 50 ms
[2020-05-20 18:56:56] [INFO ] [Real]Absence check using 272 positive place invariants in 292 ms returned sat
[2020-05-20 18:56:56] [INFO ] [Real]Absence check using 272 positive and 8 generalized place invariants in 8 ms returned sat
[2020-05-20 18:56:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 18:56:59] [INFO ] [Real]Absence check using state equation in 3340 ms returned sat
[2020-05-20 18:56:59] [INFO ] State equation strengthened by 248 read => feed constraints.
[2020-05-20 18:57:00] [INFO ] [Real]Added 248 Read/Feed constraints in 39 ms returned sat
[2020-05-20 18:57:00] [INFO ] Computed and/alt/rep : 1008/4080/1008 causal constraints in 97 ms.
[2020-05-20 18:57:00] [INFO ] Solution in real domain found non-integer solution.
[2020-05-20 18:57:00] [INFO ] [Nat]Absence check using 272 positive place invariants in 249 ms returned sat
[2020-05-20 18:57:00] [INFO ] [Nat]Absence check using 272 positive and 8 generalized place invariants in 8 ms returned sat
[2020-05-20 18:57:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-20 18:57:04] [INFO ] [Nat]Absence check using state equation in 3697 ms returned sat
[2020-05-20 18:57:04] [INFO ] [Nat]Added 248 Read/Feed constraints in 81 ms returned sat
[2020-05-20 18:57:04] [INFO ] Deduced a trap composed of 60 places in 206 ms
[2020-05-20 18:57:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 349 ms
[2020-05-20 18:57:05] [INFO ] Computed and/alt/rep : 1008/4080/1008 causal constraints in 72 ms.
[2020-05-20 18:57:20] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (=> (> t820 0) (and (or (and (> t0 0) (< o0 o820)) (and (> t793 0) (< o793 o820))) (and (> t542 0) (< o542 o820))))") while checking expression at index 0
[2020-05-20 18:57:20] [INFO ] [Real]Absence check using 272 positive place invariants in 232 ms returned sat
[2020-05-20 18:57:20] [INFO ] [Real]Absence check using 272 positive and 8 generalized place invariants in 6 ms returned sat
[2020-05-20 18:57:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 18:57:23] [INFO ] [Real]Absence check using state equation in 2971 ms returned sat
[2020-05-20 18:57:23] [INFO ] [Real]Added 248 Read/Feed constraints in 49 ms returned sat
[2020-05-20 18:57:24] [INFO ] Computed and/alt/rep : 1008/4080/1008 causal constraints in 83 ms.
[2020-05-20 18:57:24] [INFO ] Solution in real domain found non-integer solution.
[2020-05-20 18:57:24] [INFO ] [Nat]Absence check using 272 positive place invariants in 208 ms returned sat
[2020-05-20 18:57:24] [INFO ] [Nat]Absence check using 272 positive and 8 generalized place invariants in 10 ms returned sat
[2020-05-20 18:57:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-20 18:57:27] [INFO ] [Nat]Absence check using state equation in 2799 ms returned sat
[2020-05-20 18:57:27] [INFO ] [Nat]Added 248 Read/Feed constraints in 39 ms returned sat
[2020-05-20 18:57:27] [INFO ] Computed and/alt/rep : 1008/4080/1008 causal constraints in 148 ms.
[2020-05-20 18:57:44] [INFO ] Added : 825 causal constraints over 165 iterations in 16692 ms. Result :(error "Solver has unexpectedly terminated")
[2020-05-20 18:57:44] [INFO ] [Real]Absence check using 272 positive place invariants in 194 ms returned sat
[2020-05-20 18:57:44] [INFO ] [Real]Absence check using 272 positive and 8 generalized place invariants in 21 ms returned sat
[2020-05-20 18:57:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 18:57:47] [INFO ] [Real]Absence check using state equation in 2846 ms returned sat
[2020-05-20 18:57:47] [INFO ] [Real]Added 248 Read/Feed constraints in 48 ms returned sat
[2020-05-20 18:57:47] [INFO ] Computed and/alt/rep : 1008/4080/1008 causal constraints in 83 ms.
[2020-05-20 18:57:48] [INFO ] Solution in real domain found non-integer solution.
[2020-05-20 18:57:48] [INFO ] [Nat]Absence check using 272 positive place invariants in 196 ms returned sat
[2020-05-20 18:57:48] [INFO ] [Nat]Absence check using 272 positive and 8 generalized place invariants in 15 ms returned sat
[2020-05-20 18:57:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-20 18:57:51] [INFO ] [Nat]Absence check using state equation in 2942 ms returned sat
[2020-05-20 18:57:51] [INFO ] [Nat]Added 248 Read/Feed constraints in 68 ms returned sat
[2020-05-20 18:57:51] [INFO ] Deduced a trap composed of 68 places in 103 ms
[2020-05-20 18:57:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 214 ms
[2020-05-20 18:57:51] [INFO ] Computed and/alt/rep : 1008/4080/1008 causal constraints in 173 ms.
[2020-05-20 18:58:08] [INFO ] Added : 735 causal constraints over 147 iterations in 16467 ms. Result :(error "Failed to check-sat")
[2020-05-20 18:58:08] [INFO ] [Real]Absence check using 272 positive place invariants in 302 ms returned sat
[2020-05-20 18:58:08] [INFO ] [Real]Absence check using 272 positive and 8 generalized place invariants in 14 ms returned sat
[2020-05-20 18:58:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 18:58:11] [INFO ] [Real]Absence check using state equation in 2757 ms returned sat
[2020-05-20 18:58:11] [INFO ] [Real]Added 248 Read/Feed constraints in 89 ms returned sat
[2020-05-20 18:58:11] [INFO ] Computed and/alt/rep : 1008/4080/1008 causal constraints in 72 ms.
[2020-05-20 18:58:11] [INFO ] Solution in real domain found non-integer solution.
[2020-05-20 18:58:12] [INFO ] [Nat]Absence check using 272 positive place invariants in 265 ms returned sat
[2020-05-20 18:58:12] [INFO ] [Nat]Absence check using 272 positive and 8 generalized place invariants in 10 ms returned sat
[2020-05-20 18:58:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-20 18:58:15] [INFO ] [Nat]Absence check using state equation in 3471 ms returned sat
[2020-05-20 18:58:15] [INFO ] [Nat]Added 248 Read/Feed constraints in 65 ms returned sat
[2020-05-20 18:58:16] [INFO ] Deduced a trap composed of 68 places in 91 ms
[2020-05-20 18:58:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 203 ms
[2020-05-20 18:58:16] [INFO ] Computed and/alt/rep : 1008/4080/1008 causal constraints in 181 ms.
[2020-05-20 18:58:32] [INFO ] Added : 665 causal constraints over 133 iterations in 15828 ms. Result :(error "Failed to check-sat")
[2020-05-20 18:58:32] [INFO ] [Real]Absence check using 272 positive place invariants in 289 ms returned sat
[2020-05-20 18:58:32] [INFO ] [Real]Absence check using 272 positive and 8 generalized place invariants in 9 ms returned sat
[2020-05-20 18:58:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 18:58:35] [INFO ] [Real]Absence check using state equation in 2690 ms returned sat
[2020-05-20 18:58:35] [INFO ] [Real]Added 248 Read/Feed constraints in 61 ms returned sat
[2020-05-20 18:58:35] [INFO ] Computed and/alt/rep : 1008/4080/1008 causal constraints in 45 ms.
[2020-05-20 18:58:35] [INFO ] Solution in real domain found non-integer solution.
[2020-05-20 18:58:35] [INFO ] [Nat]Absence check using 272 positive place invariants in 228 ms returned sat
[2020-05-20 18:58:35] [INFO ] [Nat]Absence check using 272 positive and 8 generalized place invariants in 9 ms returned sat
[2020-05-20 18:58:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-20 18:58:38] [INFO ] [Nat]Absence check using state equation in 2878 ms returned sat
[2020-05-20 18:58:38] [INFO ] [Nat]Added 248 Read/Feed constraints in 53 ms returned sat
[2020-05-20 18:58:38] [INFO ] Computed and/alt/rep : 1008/4080/1008 causal constraints in 69 ms.
[2020-05-20 18:58:55] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe (=> (> t790 0) (and (and (> t754 0) (< o754 o790)) (or (and (> t775 0) (< o775 o790)) (and (> t776 0) (< o776 o790)) (and (> t777 0) (< o777 o790)) (and (> t778 0) (< o778 o790)) (and (> t779 0) (< o779 o790)) (and (> t780 0) (< o780 o790)) (and (> t781 0) (< o781 o790)) (and (> t782 0) (< o782 o790)) (and (> t783 0) (< o783 o790)))))") while checking expression at index 4
[2020-05-20 18:58:56] [INFO ] [Real]Absence check using 272 positive place invariants in 256 ms returned sat
[2020-05-20 18:58:56] [INFO ] [Real]Absence check using 272 positive and 8 generalized place invariants in 7 ms returned sat
[2020-05-20 18:58:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 18:58:58] [INFO ] [Real]Absence check using state equation in 2759 ms returned sat
[2020-05-20 18:58:58] [INFO ] [Real]Added 248 Read/Feed constraints in 49 ms returned sat
[2020-05-20 18:58:58] [INFO ] Computed and/alt/rep : 1008/4080/1008 causal constraints in 53 ms.
[2020-05-20 18:58:59] [INFO ] Solution in real domain found non-integer solution.
[2020-05-20 18:58:59] [INFO ] [Nat]Absence check using 272 positive place invariants in 237 ms returned sat
[2020-05-20 18:58:59] [INFO ] [Nat]Absence check using 272 positive and 8 generalized place invariants in 10 ms returned sat
[2020-05-20 18:58:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-20 18:59:02] [INFO ] [Nat]Absence check using state equation in 3013 ms returned sat
[2020-05-20 18:59:02] [INFO ] [Nat]Added 248 Read/Feed constraints in 58 ms returned sat
[2020-05-20 18:59:02] [INFO ] Deduced a trap composed of 60 places in 104 ms
[2020-05-20 18:59:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 231 ms
[2020-05-20 18:59:02] [INFO ] Computed and/alt/rep : 1008/4080/1008 causal constraints in 90 ms.
[2020-05-20 18:59:19] [INFO ] Added : 705 causal constraints over 141 iterations in 16315 ms. Result :(error "Solver has unexpectedly terminated")
[2020-05-20 18:59:19] [INFO ] Initial state reduction rules for CTL removed 6 formulas.
[2020-05-20 18:59:19] [INFO ] Flatten gal took : 263 ms
FORMULA Parking-PT-864-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-864-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-864-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-864-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-864-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-864-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-20 18:59:19] [INFO ] Flatten gal took : 115 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-20 18:59:20] [INFO ] Applying decomposition
[2020-05-20 18:59:20] [INFO ] Flatten gal took : 197 ms
[2020-05-20 18:59:20] [INFO ] Input system was already deterministic with 1009 transitions.
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/convert-linux64, -i, /tmp/graph12845145405650749351.txt, -o, /tmp/graph12845145405650749351.bin, -w, /tmp/graph12845145405650749351.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/louvain-linux64, /tmp/graph12845145405650749351.bin, -l, -1, -v, -w, /tmp/graph12845145405650749351.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-20 18:59:21] [INFO ] Decomposing Gal with order
[2020-05-20 18:59:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-20 18:59:21] [INFO ] Removed a total of 48 redundant transitions.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 1009 rows 1185 cols
[2020-05-20 18:59:21] [INFO ] Computed 280 place invariants in 38 ms
inv : p0 + p35 + p36 = 1
inv : p0 + p25 + p26 = 1
inv : p0 + p45 + p46 = 1
inv : p0 + p5 + p6 = 1
inv : p0 + p95 + p96 = 1
inv : p0 + p85 + p86 = 1
inv : p0 + p55 + p56 = 1
inv : p0 + p15 + p16 = 1
inv : p0 + p135 + p136 = 1
inv : p0 + p1069 + p1070 = 1
inv : p0 + p65 + p66 = 1
inv : p0 + p75 + p76 = 1
inv : p0 + p1059 + p1060 = 1
inv : p0 + p343 + p344 + p345 + p346 + p347 + p348 + p349 + p350 + p351 + p352 + p353 + p354 + p355 + p356 + p357 + p358 + p359 + p360 + p361 + p362 + p363 + p364 + p365 + p366 + p367 + p368 + p369 + p370 + p371 + p372 + p373 + p374 = 1
inv : p0 + p125 + p126 = 1
inv : p0 + p929 + p930 = 1
inv : p0 + p105 + p106 = 1
inv : p0 + p265 + p266 = 1
inv : p0 + p1179 + p1180 = 1
inv : p0 + p385 + p386 = 1
inv : p0 + p525 + p526 = 1
inv : p0 + p375 + p376 = 1
inv : p0 + p659 + p660 = 1
inv : p0 + p1079 + p1080 = 1
inv : p0 + p939 + p940 = 1
inv : p0 + p665 + p666 = 1
inv : p0 + p275 + p276 = 1
inv : p0 + p799 + p800 = 1
inv : p0 + p795 + p796 = 1
inv : p0 + p785 + p786 = 1
inv : p0 + p539 + p540 = 1
inv : p0 + p529 + p530 = 1
inv : p0 + p519 + p520 = 1
inv : p0 + p925 + p926 = 1
inv : -8*p0 + p815 + p816 + p817 + p818 + p819 + p820 + p821 - p830 - p838 - p846 - p854 - p862 - p870 - p878 - p910 - p912 = -8
inv : p0 + p669 + p670 = 1
inv : p0 + p679 + p680 = 1
inv : p0 + p935 + p936 = 1
inv : p0 + p259 + p260 = 1
inv : p0 + p515 + p516 = 1
inv : p0 + p399 + p400 = 1
inv : p0 + p655 + p656 = 1
inv : 9*p0 + p1090 + p1098 + p1106 + p1114 + p1122 + p1130 + p1138 + p1146 + p1178 + p1180 = 9
inv : p0 + p109 + p110 = 1
inv : 9*p0 + p956 + p964 + p972 + p980 + p988 + p996 + p1004 + p1012 + p1044 + p1046 = 9
inv : p0 + p99 + p100 = 1
inv : p0 + p39 + p40 = 1
inv : p0 + p809 + p810 = 1
inv : 9*p0 + p152 + p160 + p168 + p176 + p184 + p192 + p200 + p208 + p240 + p242 = 9
inv : p0 + p1065 + p1066 = 1
inv : p0 + p1075 + p1076 = 1
inv : 9*p0 + p822 + p830 + p838 + p846 + p854 + p862 + p870 + p878 + p910 + p912 = 9
inv : p0 + p51 + p52 = 1
inv : -8*p0 + p145 + p146 + p147 + p148 + p149 + p150 + p151 - p160 - p168 - p176 - p184 - p192 - p200 - p208 - p240 - p242 = -8
inv : p0 + p389 + p390 = 1
inv : p0 + p121 + p122 = 1
inv : p0 + p249 + p250 = 1
inv : p0 + p923 + p924 = 1
inv : -8*p0 + p547 + p548 + p549 + p550 + p551 + p552 + p553 - p562 - p570 - p578 - p586 - p594 - p602 - p610 - p642 - p644 = -8
inv : p0 + p943 + p944 = 1
inv : p0 + p193 + p194 + p195 + p196 + p197 + p198 + p199 + p200 = 1
inv : p0 + p411 + p412 = 1
inv : p0 + p803 + p804 = 1
inv : 9*p0 + p286 + p294 + p302 + p310 + p318 + p326 + p334 + p342 + p374 + p376 = 9
inv : p0 + p813 + p814 = 1
inv : p0 + p131 + p132 = 1
inv : p0 + p1063 + p1064 = 1
inv : p0 + p957 + p958 + p959 + p960 + p961 + p962 + p963 + p964 = 1
inv : p0 + p673 + p674 = 1
inv : p0 + p41 + p42 = 1
inv : p0 + p271 + p272 = 1
inv : p0 + p783 + p784 = 1
inv : p0 + p737 + p738 + p739 + p740 + p741 + p742 + p743 + p744 = 1
inv : p0 + p823 + p824 + p825 + p826 + p827 + p828 + p829 + p830 = 1
inv : p0 + p89 + p90 = 1
inv : -8*p0 + p681 + p682 + p683 + p684 + p685 + p686 + p687 - p696 - p704 - p712 - p720 - p728 - p736 - p744 - p776 - p778 = -8
inv : p0 + p31 + p32 = 1
inv : p0 + p643 + p644 = 1
inv : p0 + p653 + p654 = 1
inv : p0 + p59 + p60 = 1
inv : p0 + p1 + p2 = 1
inv : p0 + p49 + p50 = 1
inv : p0 + p141 + p142 = 1
inv : p0 + p603 + p604 + p605 + p606 + p607 + p608 + p609 + p610 = 1
inv : p0 + p1073 + p1074 = 1
inv : p0 + p403 + p404 = 1
inv : p0 + p793 + p794 = 1
inv : p0 + p1055 + p1056 = 1
inv : -8*p0 + p279 + p280 + p281 + p282 + p283 + p284 + p285 - p294 - p302 - p310 - p318 - p326 - p334 - p342 - p374 - p376 = -8
inv : p0 + p933 + p934 = 1
inv : p0 + p201 + p202 + p203 + p204 + p205 + p206 + p207 + p208 = 1
inv : p0 + p543 + p544 = 1
inv : p0 + p377 + p378 + p379 + p380 = 1
inv : p0 + p509 + p510 = 1
inv : p0 + p253 + p254 = 1
inv : p0 + p1139 + p1140 + p1141 + p1142 + p1143 + p1144 + p1145 + p1146 = 1
inv : p0 + p103 + p104 = 1
inv : p0 + p113 + p114 = 1
inv : p0 + p649 + p650 = 1
inv : p0 + p965 + p966 + p967 + p968 + p969 + p970 + p971 + p972 = 1
inv : p0 + p117 + p118 = 1
inv : p0 + p1045 + p1046 = 1
inv : p0 + p93 + p94 = 1
inv : p0 + p393 + p394 = 1
inv : p0 + p137 + p138 = 1
inv : p0 + p789 + p790 = 1
inv : p0 + p587 + p588 + p589 + p590 + p591 + p592 + p593 + p594 = 1
inv : p0 + p267 + p268 = 1
inv : p0 + p533 + p534 = 1
inv : p0 + p1131 + p1132 + p1133 + p1134 + p1135 + p1136 + p1137 + p1138 = 1
inv : p0 + p69 + p70 = 1
inv : p0 + p79 + p80 = 1
inv : p0 + p277 + p278 = 1
inv : p0 + p523 + p524 = 1
inv : p0 + p21 + p22 = 1
inv : p0 + p919 + p920 = 1
inv : p0 + p11 + p12 = 1
inv : p0 + p407 + p408 = 1
inv : p0 + p663 + p664 = 1
inv : -8*p0 + p413 + p414 + p415 + p416 + p417 + p418 + p419 - p428 - p436 - p444 - p452 - p460 - p468 - p476 - p508 - p510 = -8
inv : p0 + p595 + p596 + p597 + p598 + p599 + p600 + p601 + p602 = 1
inv : p0 + p383 + p384 = 1
inv : p0 + p127 + p128 = 1
inv : p0 + p477 + p478 + p479 + p480 + p481 + p482 + p483 + p484 + p485 + p486 + p487 + p488 + p489 + p490 + p491 + p492 + p493 + p494 + p495 + p496 + p497 + p498 + p499 + p500 + p501 + p502 + p503 + p504 + p505 + p506 + p507 + p508 = 1
inv : p0 + p973 + p974 + p975 + p976 + p977 + p978 + p979 + p980 = 1
inv : p0 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 = 1
inv : p0 + p1123 + p1124 + p1125 + p1126 + p1127 + p1128 + p1129 + p1130 = 1
inv : p0 + p667 + p668 = 1
inv : p0 + p437 + p438 + p439 + p440 + p441 + p442 + p443 + p444 = 1
inv : p0 + p779 + p780 + p781 + p782 = 1
inv : p0 + p657 + p658 = 1
inv : p0 + p611 + p612 + p613 + p614 + p615 + p616 + p617 + p618 + p619 + p620 + p621 + p622 + p623 + p624 + p625 + p626 + p627 + p628 + p629 + p630 + p631 + p632 + p633 + p634 + p635 + p636 + p637 + p638 + p639 + p640 + p641 + p642 = 1
inv : p0 + p713 + p714 + p715 + p716 + p717 + p718 + p719 + p720 = 1
inv : p0 + p847 + p848 + p849 + p850 + p851 + p852 + p853 + p854 = 1
inv : p0 + p797 + p798 = 1
inv : p0 + p807 + p808 = 1
inv : p0 + p295 + p296 + p297 + p298 + p299 + p300 + p301 + p302 = 1
inv : p0 + p387 + p388 = 1
inv : p0 + p777 + p778 = 1
inv : p0 + p855 + p856 + p857 + p858 + p859 + p860 + p861 + p862 = 1
inv : p0 + p989 + p990 + p991 + p992 + p993 + p994 + p995 + p996 = 1
inv : p0 + p917 + p918 = 1
inv : p0 + p527 + p528 = 1
inv : p0 + p1115 + p1116 + p1117 + p1118 + p1119 + p1120 + p1121 + p1122 = 1
inv : p0 + p445 + p446 + p447 + p448 + p449 + p450 + p451 + p452 = 1
inv : p0 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 = 1
inv : p0 + p247 + p248 = 1
inv : p0 + p429 + p430 + p431 + p432 + p433 + p434 + p435 + p436 = 1
inv : p0 + p563 + p564 + p565 + p566 + p567 + p568 + p569 + p570 = 1
inv : p0 + p287 + p288 + p289 + p290 + p291 + p292 + p293 + p294 = 1
inv : p0 + p1047 + p1048 + p1049 + p1050 = 1
inv : p0 + p981 + p982 + p983 + p984 + p985 + p986 + p987 + p988 = 1
inv : p0 + p107 + p108 = 1
inv : p0 + p579 + p580 + p581 + p582 + p583 + p584 + p585 + p586 = 1
inv : p0 + p1147 + p1148 + p1149 + p1150 + p1151 + p1152 + p1153 + p1154 + p1155 + p1156 + p1157 + p1158 + p1159 + p1160 + p1161 + p1162 + p1163 + p1164 + p1165 + p1166 + p1167 + p1168 + p1169 + p1170 + p1171 + p1172 + p1173 + p1174 + p1175 + p1176 + p1177 + p1178 = 1
inv : p0 + p257 + p258 = 1
inv : p0 + p77 + p78 = 1
inv : p0 + p787 + p788 = 1
inv : p0 + p13 + p14 = 1
inv : p0 + p311 + p312 + p313 + p314 + p315 + p316 + p317 + p318 = 1
inv : p0 + p37 + p38 = 1
inv : p0 + p397 + p398 = 1
inv : p0 + p7 + p8 = 1
inv : -8*p0 + p949 + p950 + p951 + p952 + p953 + p954 + p955 - p964 - p972 - p980 - p988 - p996 - p1004 - p1012 - p1044 - p1046 = -8
inv : p0 + p645 + p646 + p647 + p648 = 1
inv : p0 + p83 + p84 = 1
inv : p0 + p927 + p928 = 1
inv : p0 + p537 + p538 = 1
inv : p0 + p677 + p678 = 1
inv : p0 + p1067 + p1068 = 1
inv : p0 + p453 + p454 + p455 + p456 + p457 + p458 + p459 + p460 = 1
inv : p0 + p729 + p730 + p731 + p732 + p733 + p734 + p735 + p736 = 1
inv : p0 + p831 + p832 + p833 + p834 + p835 + p836 + p837 + p838 = 1
inv : p0 + p133 + p134 = 1
inv : p0 + p143 + p144 = 1
inv : 9*p0 + p420 + p428 + p436 + p444 + p452 + p460 + p468 + p476 + p508 + p510 = 9
inv : p0 + p1005 + p1006 + p1007 + p1008 + p1009 + p1010 + p1011 + p1012 = 1
inv : p0 + p273 + p274 = 1
inv : p0 + p421 + p422 + p423 + p424 + p425 + p426 + p427 + p428 = 1
inv : p0 + p263 + p264 = 1
inv : p0 + p27 + p28 = 1
inv : p0 + p17 + p18 = 1
inv : p0 + p123 + p124 = 1
inv : p0 + p3 + p4 = 1
inv : p0 + p87 + p88 = 1
inv : p0 + p911 + p912 = 1
inv : p0 + p53 + p54 = 1
inv : p0 + p689 + p690 + p691 + p692 + p693 + p694 + p695 + p696 = 1
inv : p0 + p1077 + p1078 = 1
inv : p0 + p73 + p74 = 1
inv : p0 + p185 + p186 + p187 + p188 + p189 + p190 + p191 + p192 = 1
inv : p0 + p721 + p722 + p723 + p724 + p725 + p726 + p727 + p728 = 1
inv : p0 + p1051 + p1052 = 1
inv : p0 + p937 + p938 = 1
inv : p0 + p997 + p998 + p999 + p1000 + p1001 + p1002 + p1003 + p1004 = 1
inv : p0 + p947 + p948 = 1
inv : p0 + p97 + p98 = 1
inv : p0 + p461 + p462 + p463 + p464 + p465 + p466 + p467 + p468 = 1
inv : p0 + p913 + p914 + p915 + p916 = 1
inv : p0 + p63 + p64 = 1
inv : p0 + p303 + p304 + p305 + p306 + p307 + p308 + p309 + p310 = 1
inv : 9*p0 + p688 + p696 + p704 + p712 + p720 + p728 + p736 + p744 + p776 + p778 = 9
inv : p0 + p517 + p518 = 1
inv : p0 + p571 + p572 + p573 + p574 + p575 + p576 + p577 + p578 = 1
inv : p0 + p839 + p840 + p841 + p842 + p843 + p844 + p845 + p846 = 1
inv : p0 + p1107 + p1108 + p1109 + p1110 + p1111 + p1112 + p1113 + p1114 = 1
inv : 9*p0 + p554 + p562 + p570 + p578 + p586 + p594 + p602 + p610 + p642 + p644 = 9
inv : p0 + p745 + p746 + p747 + p748 + p749 + p750 + p751 + p752 + p753 + p754 + p755 + p756 + p757 + p758 + p759 + p760 + p761 + p762 + p763 + p764 + p765 + p766 + p767 + p768 + p769 + p770 + p771 + p772 + p773 + p774 + p775 + p776 = 1
inv : p0 + p381 + p382 = 1
inv : p0 + p261 + p262 = 1
inv : p0 + p401 + p402 = 1
inv : p0 + p251 + p252 = 1
inv : p0 + p1053 + p1054 = 1
inv : p0 + p391 + p392 = 1
inv : p0 + p241 + p242 = 1
inv : p0 + p1013 + p1014 + p1015 + p1016 + p1017 + p1018 + p1019 + p1020 + p1021 + p1022 + p1023 + p1024 + p1025 + p1026 + p1027 + p1028 + p1029 + p1030 + p1031 + p1032 + p1033 + p1034 + p1035 + p1036 + p1037 + p1038 + p1039 + p1040 + p1041 + p1042 + p1043 + p1044 = 1
inv : p0 + p521 + p522 = 1
inv : p0 + p541 + p542 = 1
inv : p0 + p111 + p112 = 1
inv : p0 + p9 + p10 = 1
inv : p0 + p61 + p62 = 1
inv : p0 + p29 + p30 = 1
inv : p0 + p1091 + p1092 + p1093 + p1094 + p1095 + p1096 + p1097 + p1098 = 1
inv : p0 + p661 + p662 = 1
inv : p0 + p119 + p120 = 1
inv : p0 + p209 + p210 + p211 + p212 + p213 + p214 + p215 + p216 + p217 + p218 + p219 + p220 + p221 + p222 + p223 + p224 + p225 + p226 + p227 + p228 + p229 + p230 + p231 + p232 + p233 + p234 + p235 + p236 + p237 + p238 + p239 + p240 = 1
inv : p0 + p71 + p72 = 1
inv : p0 + p1099 + p1100 + p1101 + p1102 + p1103 + p1104 + p1105 + p1106 = 1
inv : p0 + p243 + p244 + p245 + p246 = 1
inv : p0 + p129 + p130 = 1
inv : p0 + p945 + p946 = 1
inv : p0 + p921 + p922 = 1
inv : p0 + p871 + p872 + p873 + p874 + p875 + p876 + p877 + p878 = 1
inv : p0 + p101 + p102 = 1
inv : p0 + p269 + p270 = 1
inv : p0 + p531 + p532 = 1
inv : p0 + p19 + p20 = 1
inv : p0 + p335 + p336 + p337 + p338 + p339 + p340 + p341 + p342 = 1
inv : p0 + p811 + p812 = 1
inv : p0 + p409 + p410 = 1
inv : p0 + p469 + p470 + p471 + p472 + p473 + p474 + p475 + p476 = 1
inv : p0 + p671 + p672 = 1
inv : p0 + p805 + p806 = 1
inv : p0 + p1071 + p1072 = 1
inv : p0 + p1061 + p1062 = 1
inv : p0 + p1081 + p1082 = 1
inv : p0 + p555 + p556 + p557 + p558 + p559 + p560 + p561 + p562 = 1
inv : p0 + p177 + p178 + p179 + p180 + p181 + p182 + p183 + p184 = 1
inv : p0 + p675 + p676 = 1
inv : p0 + p863 + p864 + p865 + p866 + p867 + p868 + p869 + p870 = 1
inv : p0 + p43 + p44 = 1
inv : p0 + p931 + p932 = 1
inv : p0 + p33 + p34 = 1
inv : p0 + p941 + p942 = 1
inv : p0 + p67 + p68 = 1
inv : p0 + p545 + p546 = 1
inv : p0 + p697 + p698 + p699 + p700 + p701 + p702 + p703 + p704 = 1
inv : p0 + p511 + p512 + p513 + p514 = 1
inv : p0 + p47 + p48 = 1
inv : p0 + p23 + p24 = 1
inv : p0 + p801 + p802 = 1
inv : p0 + p1181 + p1182 + p1183 + p1184 = 1
inv : p0 + p1057 + p1058 = 1
inv : p0 + p319 + p320 + p321 + p322 + p323 + p324 + p325 + p326 = 1
inv : p0 + p405 + p406 = 1
inv : p0 + p395 + p396 = 1
inv : p0 + p651 + p652 = 1
inv : p0 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + p176 = 1
inv : p0 + p791 + p792 = 1
inv : p0 + p139 + p140 = 1
inv : p0 + p91 + p92 = 1
inv : p0 + p81 + p82 = 1
inv : p0 + p535 + p536 = 1
inv : p0 + p327 + p328 + p329 + p330 + p331 + p332 + p333 + p334 = 1
inv : p0 + p57 + p58 = 1
inv : p0 + p255 + p256 = 1
inv : -8*p0 + p1083 + p1084 + p1085 + p1086 + p1087 + p1088 + p1089 - p1098 - p1106 - p1114 - p1122 - p1130 - p1138 - p1146 - p1178 - p1180 = -8
inv : p0 + p879 + p880 + p881 + p882 + p883 + p884 + p885 + p886 + p887 + p888 + p889 + p890 + p891 + p892 + p893 + p894 + p895 + p896 + p897 + p898 + p899 + p900 + p901 + p902 + p903 + p904 + p905 + p906 + p907 + p908 + p909 + p910 = 1
inv : p0 + p115 + p116 = 1
inv : p0 + p705 + p706 + p707 + p708 + p709 + p710 + p711 + p712 = 1
Total of 280 invariants.
[2020-05-20 18:59:21] [INFO ] Computed 280 place invariants in 43 ms
[2020-05-20 18:59:21] [INFO ] Flatten gal took : 163 ms
[2020-05-20 18:59:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 31 ms.
[2020-05-20 18:59:21] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 29 ms
[2020-05-20 18:59:21] [INFO ] Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /home/mcc/execution/LTLFireability.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLFireability.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64 --gc-threshold 2000000 -i /home/mcc/execution/LTLFireability.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLFireability.ltl -c -stutter-deadlock
Read 10 LTL properties
Checking formula 0 : !((!(G((F(G("(i13.i1.i1.u376.p1118==1)")))||(("(i13.i1.i1.u376.p1118!=1)")U(F("((i1.i3.i0.u26.p51==1)&&(i9.i0.i1.u305.p898==1))")))))))
Formula 0 simplified : G(FG"(i13.i1.i1.u376.p1118==1)" | ("(i13.i1.i1.u376.p1118!=1)" U F"((i1.i3.i0.u26.p51==1)&&(i9.i0.i1.u305.p898==1))"))
built 40 ordering constraints for composite.
built 22 ordering constraints for composite.
built 9 ordering constraints for composite.
built 5 ordering constraints for composite.
built 6 ordering constraints for composite.
built 9 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 9 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 23 ordering constraints for composite.
built 35 ordering constraints for composite.
built 5 ordering constraints for composite.
built 6 ordering constraints for composite.
built 8 ordering constraints for composite.
built 8 ordering constraints for composite.
built 5 ordering constraints for composite.
built 8 ordering constraints for composite.
built 14 ordering constraints for composite.
built 46 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 73 ordering constraints for composite.
built 42 ordering constraints for composite.
built 19 ordering constraints for composite.
built 11 ordering constraints for composite.
built 8 ordering constraints for composite.
built 8 ordering constraints for composite.
built 16 ordering constraints for composite.
built 5 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 17 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 71 ordering constraints for composite.
built 36 ordering constraints for composite.
built 8 ordering constraints for composite.
built 5 ordering constraints for composite.
built 6 ordering constraints for composite.
built 10 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 11 ordering constraints for composite.
built 6 ordering constraints for composite.
built 8 ordering constraints for composite.
built 14 ordering constraints for composite.
built 8 ordering constraints for composite.
built 11 ordering constraints for composite.
built 72 ordering constraints for composite.
built 46 ordering constraints for composite.
built 31 ordering constraints for composite.
built 8 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 6 ordering constraints for composite.
built 10 ordering constraints for composite.
built 14 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 8 ordering constraints for composite.
built 14 ordering constraints for composite.
built 5 ordering constraints for composite.
built 8 ordering constraints for composite.
built 6 ordering constraints for composite.
built 74 ordering constraints for composite.
built 25 ordering constraints for composite.
built 10 ordering constraints for composite.
built 8 ordering constraints for composite.
built 5 ordering constraints for composite.
built 17 ordering constraints for composite.
built 7 ordering constraints for composite.
built 8 ordering constraints for composite.
built 8 ordering constraints for composite.
built 28 ordering constraints for composite.
built 11 ordering constraints for composite.
built 8 ordering constraints for composite.
built 8 ordering constraints for composite.
built 38 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 48 ordering constraints for composite.
built 70 ordering constraints for composite.
built 23 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 33 ordering constraints for composite.
built 5 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 17 ordering constraints for composite.
built 11 ordering constraints for composite.
built 5 ordering constraints for composite.
built 48 ordering constraints for composite.
built 20 ordering constraints for composite.
built 10 ordering constraints for composite.
[2020-05-20 18:59:29] [INFO ] Proved 1185 variables to be positive in 7530 ms
[2020-05-20 18:59:29] [INFO ] Computing symmetric may disable matrix : 1009 transitions.
[2020-05-20 18:59:29] [INFO ] Computation of disable matrix completed :0/1009 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-20 18:59:29] [INFO ] Computation of Complete disable matrix. took 101 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-20 18:59:29] [INFO ] Computing symmetric may enable matrix : 1009 transitions.
[2020-05-20 18:59:29] [INFO ] Computation of Complete enable matrix. took 83 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-20 18:59:34] [INFO ] Computing symmetric co enabling matrix : 1009 transitions.
[2020-05-20 18:59:35] [INFO ] Computation of co-enabling matrix(0/1009) took 824 ms. Total solver calls (SAT/UNSAT): 1008(0/1008)
[2020-05-20 18:59:38] [INFO ] Computation of co-enabling matrix(89/1009) took 3851 ms. Total solver calls (SAT/UNSAT): 1659(220/1439)
[2020-05-20 18:59:41] [INFO ] Computation of co-enabling matrix(155/1009) took 6908 ms. Total solver calls (SAT/UNSAT): 2057(334/1723)
[2020-05-20 18:59:44] [INFO ] Computation of co-enabling matrix(208/1009) took 9946 ms. Total solver calls (SAT/UNSAT): 2377(477/1900)
[2020-05-20 18:59:47] [INFO ] Computation of co-enabling matrix(228/1009) took 13036 ms. Total solver calls (SAT/UNSAT): 2553(518/2035)
[2020-05-20 18:59:50] [INFO ] Computation of co-enabling matrix(293/1009) took 16079 ms. Total solver calls (SAT/UNSAT): 2866(653/2213)
[2020-05-20 18:59:53] [INFO ] Computation of co-enabling matrix(378/1009) took 19148 ms. Total solver calls (SAT/UNSAT): 3577(1013/2564)
[2020-05-20 18:59:56] [INFO ] Computation of co-enabling matrix(444/1009) took 22158 ms. Total solver calls (SAT/UNSAT): 4465(1426/3039)
[2020-05-20 18:59:59] [INFO ] Computation of co-enabling matrix(493/1009) took 25250 ms. Total solver calls (SAT/UNSAT): 5472(1560/3912)
[2020-05-20 19:00:02] [INFO ] Computation of co-enabling matrix(558/1009) took 28321 ms. Total solver calls (SAT/UNSAT): 7106(1560/5546)
[2020-05-20 19:00:05] [INFO ] Computation of co-enabling matrix(618/1009) took 31489 ms. Total solver calls (SAT/UNSAT): 7888(1647/6241)
[2020-05-20 19:00:08] [INFO ] Computation of co-enabling matrix(698/1009) took 34507 ms. Total solver calls (SAT/UNSAT): 8479(1866/6613)
[2020-05-20 19:00:11] [INFO ] Computation of co-enabling matrix(785/1009) took 37603 ms. Total solver calls (SAT/UNSAT): 9211(2043/7168)
[2020-05-20 19:00:14] [INFO ] Computation of co-enabling matrix(881/1009) took 40614 ms. Total solver calls (SAT/UNSAT): 9929(2244/7685)
[2020-05-20 19:00:17] [INFO ] Computation of co-enabling matrix(971/1009) took 43631 ms. Total solver calls (SAT/UNSAT): 10621(2496/8125)
[2020-05-20 19:00:19] [INFO ] Computation of Finished co-enabling matrix. took 44974 ms. Total solver calls (SAT/UNSAT): 10936(2568/8368)
[2020-05-20 19:00:19] [INFO ] Computing Do-Not-Accords matrix : 1009 transitions.
[2020-05-20 19:00:20] [INFO ] Computation of Completed DNA matrix. took 756 ms. Total solver calls (SAT/UNSAT): 72(0/72)
[2020-05-20 19:00:20] [INFO ] Built C files in 59945ms conformant to PINS in folder :/home/mcc/execution
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit//lts_install_dir//include, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/home/mcc/execution]
Compilation finished in 13603 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
Link finished in 102 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, !( [](( <>([]((LTLAP0==true)))) || ( ((LTLAP1==true))U(<>((LTLAP2==true)))) )) , --buchi-type=spotba], workingDir=/home/mcc/execution]
/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc: error while loading shared libraries: libltdl.so.7: cannot open shared object file: No such file or directory
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, !( [](( <>([]((LTLAP0==true)))) || ( ((LTLAP1==true))U(<>((LTLAP2==true)))) )) , --buchi-type=spotba], workingDir=/home/mcc/execution]
127
java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, !( [](( <>([]((LTLAP0==true)))) || ( ((LTLAP1==true))U(<>((LTLAP2==true)))) )) , --buchi-type=spotba], workingDir=/home/mcc/execution]
127
at fr.lip6.move.gal.application.LTSminRunner.checkProperty(LTSminRunner.java:170)
at fr.lip6.move.gal.application.LTSminRunner.access$10(LTSminRunner.java:124)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:834)
Reverse transition relation is NOT exact ! Due to transitions t1422, t1584, i2.t1692, i2.t1691, i2.i0.t1689, i2.i0.t1694, i2.i0.i7.t1695, i2.i0.i7.t1693, i2.i0.i7.t1690, i2.i0.i7.t1688, i2.i0.i7.u99.t774, i2.i0.i7.u99.t776, i5.t1641, i5.t1640, i5.t1639, i5.t1638, i5.t1637, i5.t1636, i5.t1635, i5.t1634, i5.u142.t664, i5.u142.t666, i6.t1587, i6.t1586, i6.t1585, i6.t1583, i6.t1582, i6.t1581, i6.t1580, i6.u183.t554, i6.u183.t556, i7.t1533, i7.t1532, i7.t1531, i7.t1530, i7.t1529, i7.t1528, i7.t1527, i7.t1526, i7.u226.t444, i7.u226.t446, i8.t1479, i8.t1478, i8.t1477, i8.t1476, i8.t1475, i8.t1474, i8.t1473, i8.t1472, i8.u269.t334, i8.u269.t336, i10.t1425, i10.t1424, i10.t1423, i10.t1421, i10.t1420, i10.t1419, i10.t1418, i10.u310.t224, i10.u310.t226, i12.i1.t1365, i12.i1.t1367, i12.i1.t1368, i12.i1.t1370, i12.i1.i6.t1371, i12.i1.i6.t1369, i12.i1.i6.t1366, i12.i1.i6.t1364, i12.i1.i6.u353.t114, i12.i1.i6.u353.t116, i13.t1314, i13.t1313, i13.i1.t1311, i13.i1.t1316, i13.i1.i6.t1317, i13.i1.i6.t1315, i13.i1.i6.t1312, i13.i1.i6.t1310, i13.i1.i6.u396.t4, i13.i1.i6.u396.t6, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/929/80/1009
Computing Next relation with stutter on 5.35201e+12 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
36737 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,367.554,4419192,1,0,4.22634e+06,258380,7071,3.99234e+07,718,1.85183e+06,882707
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Parking-PT-864-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((G(!(X((G("((i8.u254.p740==1)||(i7.u209.p598==1))"))||(G("(i8.u254.p741==1)")))))))
Formula 1 simplified : !G!X(G"((i8.u254.p740==1)||(i7.u209.p598==1))" | G"(i8.u254.p741==1)")
Computing Next relation with stutter on 5.35201e+12 deadlock states
5 unique states visited
5 strongly connected components in search stack
6 transitions explored
5 items max in DFS search stack
2768 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,395.245,4419192,1,0,4.22634e+06,258380,8300,3.99234e+07,906,1.85183e+06,1111233
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA Parking-PT-864-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((X(G(F(!(F((X(G((G("((i5.u110.p268==1)&&(i5.u123.p321==1))"))||("((i5.u110.p268==1)&&(i5.u123.p321==1))"))))||(F("(i2.i0.i7.u76.p164==1)")))))))))
Formula 2 simplified : !XGF!F(XG("((i5.u110.p268==1)&&(i5.u123.p321==1))" | G"((i5.u110.p268==1)&&(i5.u123.p321==1))") | F"(i2.i0.i7.u76.p164==1)")
Computing Next relation with stutter on 5.35201e+12 deadlock states
3 unique states visited
3 strongly connected components in search stack
5 transitions explored
3 items max in DFS search stack
3342 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,428.674,4419348,1,0,4.22634e+06,258380,8347,3.99234e+07,907,1.85183e+06,1552062
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA Parking-PT-864-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !(((X("((i6.u166.p456!=1)||(i1.i1.i0.u20.p40!=1))"))U(X(X(!((F(X(X("(i8.u269.p779==1)"))))U("(i8.u269.p779==1)")))))))
Formula 3 simplified : !(X"((i6.u166.p456!=1)||(i1.i1.i0.u20.p40!=1))" U XX!(FXX"(i8.u269.p779==1)" U "(i8.u269.p779==1)"))
Computing Next relation with stutter on 5.35201e+12 deadlock states
15 unique states visited
10 strongly connected components in search stack
16 transitions explored
10 items max in DFS search stack
8869 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,517.374,4420272,1,0,4.22634e+06,258380,8435,3.99234e+07,909,1.85183e+06,2682936
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA Parking-PT-864-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !(((F(!(G(X(F("(i5.u125.p331==1)"))))))&&(X("((i2.i0.i3.u63.p125!=1)||(i2.i0.i3.u96.p235!=1))"))))
Formula 4 simplified : !(F!GXF"(i5.u125.p331==1)" & X"((i2.i0.i3.u63.p125!=1)||(i2.i0.i3.u96.p235!=1))")
Computing Next relation with stutter on 5.35201e+12 deadlock states
Detected timeout of ITS tools.
[2020-05-20 19:20:10] [INFO ] Applying decomposition
[2020-05-20 19:20:10] [INFO ] Flatten gal took : 50 ms
[2020-05-20 19:20:10] [INFO ] Decomposing Gal with order
[2020-05-20 19:20:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-20 19:20:10] [INFO ] Removed a total of 256 redundant transitions.
[2020-05-20 19:20:10] [INFO ] Flatten gal took : 72 ms
[2020-05-20 19:20:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 64 labels/synchronizations in 42 ms.
[2020-05-20 19:20:10] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 11 ms
[2020-05-20 19:20:10] [INFO ] Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /home/mcc/execution/LTLFireability.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLFireability.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64 --gc-threshold 2000000 -i /home/mcc/execution/LTLFireability.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLFireability.ltl -c -stutter-deadlock
Read 6 LTL properties
Checking formula 0 : !(((F(!(G(X(F("(u106.p331==1)"))))))&&(X("((u63.p125!=1)||(u81.p235!=1))"))))
Formula 0 simplified : !(F!GXF"(u106.p331==1)" & X"((u63.p125!=1)||(u81.p235!=1))")
built 505 ordering constraints for composite.
Reverse transition relation is NOT exact ! Due to transitions t1310, t1311, t1312, t1313, t1314, t1315, t1316, t1317, t1364, t1365, t1366, t1367, t1368, t1369, t1370, t1371, t1418, t1419, t1420, t1421, t1422, t1423, t1424, t1425, t1472, t1473, t1474, t1475, t1476, t1477, t1478, t1479, t1526, t1527, t1528, t1529, t1530, t1531, t1532, t1533, t1580, t1581, t1582, t1583, t1584, t1585, t1586, t1587, t1634, t1635, t1636, t1637, t1638, t1639, t1640, t1641, t1688, t1689, t1690, t1691, t1692, t1693, t1694, t1695, u83.t774, u83.t776, u110.t664, u110.t666, u137.t554, u137.t556, u164.t444, u164.t446, u191.t334, u191.t336, u218.t224, u218.t226, u245.t114, u245.t116, u272.t4, u272.t6, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/897/80/977
Computing Next relation with stutter on 5.35201e+12 deadlock states
4 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
17247 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,172.63,2554412,1,0,5.65541e+06,109834,5705,9.49479e+06,450,334149,1935659
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Parking-PT-864-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((X(((G("(u235.p952==1)"))&&("(u38.p76==1)"))&&("(u216.p882==1)"))))
Formula 1 simplified : !X("(u38.p76==1)" & "(u216.p882==1)" & G"(u235.p952==1)")
Computing Next relation with stutter on 5.35201e+12 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
283 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,175.463,2554776,1,0,5.65541e+06,109834,9657,9.49479e+06,497,334149,2779976
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA Parking-PT-864-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((F("((u139.p518==1)&&(u162.p619==1))")))
Formula 2 simplified : !F"((u139.p518==1)&&(u162.p619==1))"
Computing Next relation with stutter on 5.35201e+12 deadlock states
Detected timeout of ITS tools.
[2020-05-20 19:41:01] [INFO ] Flatten gal took : 960 ms
[2020-05-20 19:41:03] [INFO ] Input system was already deterministic with 1009 transitions.
[2020-05-20 19:41:03] [INFO ] Transformed 1185 places.
[2020-05-20 19:41:03] [INFO ] Transformed 1009 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit//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//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
[2020-05-20 19:41:03] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 18 ms
[2020-05-20 19:41:03] [INFO ] Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 9 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /home/mcc/execution/LTLFireability.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLFireability.ltl, -c, -stutter-deadlock, --load-order, /home/mcc/execution/model.ord, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64 --gc-threshold 2000000 -i /home/mcc/execution/LTLFireability.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLFireability.ltl -c -stutter-deadlock --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Read 4 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F("((p518==1)&&(p619==1))")))
Formula 0 simplified : !F"((p518==1)&&(p619==1))"
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLFireability -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6
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="Parking-PT-864"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
# 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 itstools"
echo " Input is Parking-PT-864, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r111-csrt-158961257800554"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Parking-PT-864.tgz
mv Parking-PT-864 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;