About the Execution of ITS-Tools for ShieldPPPt-PT-050B
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16246.688 | 3600000.00 | 3292215.00 | 334033.10 | F?FFFFFTFFFF??F? | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2021-input.r216-tall-162098205800907.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2021-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is ShieldPPPt-PT-050B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r216-tall-162098205800907
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 108K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 88K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Mar 28 16:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 28 16:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 28 16:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 16:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 27 12:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 27 12:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 25 18:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 25 18:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 08:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 08:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:52 equiv_col
-rw-r--r-- 1 mcc users 5 May 5 16:52 instance
-rw-r--r-- 1 mcc users 6 May 5 16:52 iscolored
-rw-r--r-- 1 mcc users 955K May 5 16:52 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 ShieldPPPt-PT-050B-00
FORMULA_NAME ShieldPPPt-PT-050B-01
FORMULA_NAME ShieldPPPt-PT-050B-02
FORMULA_NAME ShieldPPPt-PT-050B-03
FORMULA_NAME ShieldPPPt-PT-050B-04
FORMULA_NAME ShieldPPPt-PT-050B-05
FORMULA_NAME ShieldPPPt-PT-050B-06
FORMULA_NAME ShieldPPPt-PT-050B-07
FORMULA_NAME ShieldPPPt-PT-050B-08
FORMULA_NAME ShieldPPPt-PT-050B-09
FORMULA_NAME ShieldPPPt-PT-050B-10
FORMULA_NAME ShieldPPPt-PT-050B-11
FORMULA_NAME ShieldPPPt-PT-050B-12
FORMULA_NAME ShieldPPPt-PT-050B-13
FORMULA_NAME ShieldPPPt-PT-050B-14
FORMULA_NAME ShieldPPPt-PT-050B-15
=== Now, execution of the tool begins
BK_START 1622944965013
Running Version 0
[2021-06-06 02:02:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -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]
[2021-06-06 02:02:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-06-06 02:02:46] [INFO ] Load time of PNML (sax parser for PT used): 172 ms
[2021-06-06 02:02:46] [INFO ] Transformed 3903 places.
[2021-06-06 02:02:47] [INFO ] Transformed 3553 transitions.
[2021-06-06 02:02:47] [INFO ] Found NUPN structural information;
[2021-06-06 02:02:47] [INFO ] Parsed PT model containing 3903 places and 3553 transitions in 408 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
[2021-06-06 02:02:47] [INFO ] Initial state test concluded for 1 properties.
Support contains 40 out of 3903 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3903/3903 places, 3553/3553 transitions.
Discarding 541 places :
Symmetric choice reduction at 0 with 541 rule applications. Total rules 541 place count 3362 transition count 3012
Iterating global reduction 0 with 541 rules applied. Total rules applied 1082 place count 3362 transition count 3012
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1083 place count 3361 transition count 3011
Iterating global reduction 0 with 1 rules applied. Total rules applied 1084 place count 3361 transition count 3011
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1085 place count 3360 transition count 3010
Iterating global reduction 0 with 1 rules applied. Total rules applied 1086 place count 3360 transition count 3010
Applied a total of 1086 rules in 1944 ms. Remains 3360 /3903 variables (removed 543) and now considering 3010/3553 (removed 543) transitions.
// Phase 1: matrix 3010 rows 3360 cols
[2021-06-06 02:02:49] [INFO ] Computed 551 place invariants in 52 ms
[2021-06-06 02:02:50] [INFO ] Implicit Places using invariants in 1347 ms returned []
// Phase 1: matrix 3010 rows 3360 cols
[2021-06-06 02:02:50] [INFO ] Computed 551 place invariants in 14 ms
[2021-06-06 02:02:54] [INFO ] Implicit Places using invariants and state equation in 3605 ms returned []
Implicit Place search using SMT with State Equation took 4979 ms to find 0 implicit places.
// Phase 1: matrix 3010 rows 3360 cols
[2021-06-06 02:02:54] [INFO ] Computed 551 place invariants in 11 ms
[2021-06-06 02:02:56] [INFO ] Dead Transitions using invariants and state equation in 1964 ms returned []
Finished structural reductions, in 1 iterations. Remains : 3360/3903 places, 3010/3553 transitions.
[2021-06-06 02:02:56] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2021-06-06 02:02:56] [INFO ] Flatten gal took : 296 ms
FORMULA ShieldPPPt-PT-050B-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-050B-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-06-06 02:02:56] [INFO ] Flatten gal took : 136 ms
[2021-06-06 02:02:57] [INFO ] Input system was already deterministic with 3010 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 1144 ms. (steps per millisecond=87 ) properties (out of 25) seen :15
Running SMT prover for 10 properties.
// Phase 1: matrix 3010 rows 3360 cols
[2021-06-06 02:02:58] [INFO ] Computed 551 place invariants in 16 ms
[2021-06-06 02:02:58] [INFO ] [Real]Absence check using 551 positive place invariants in 228 ms returned sat
[2021-06-06 02:02:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 02:03:00] [INFO ] [Real]Absence check using state equation in 1493 ms returned sat
[2021-06-06 02:03:00] [INFO ] Solution in real domain found non-integer solution.
[2021-06-06 02:03:01] [INFO ] [Nat]Absence check using 551 positive place invariants in 244 ms returned sat
[2021-06-06 02:03:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-06-06 02:03:02] [INFO ] [Nat]Absence check using state equation in 1505 ms returned sat
[2021-06-06 02:03:03] [INFO ] Deduced a trap composed of 17 places in 1014 ms of which 15 ms to minimize.
[2021-06-06 02:03:04] [INFO ] Deduced a trap composed of 23 places in 806 ms of which 6 ms to minimize.
[2021-06-06 02:03:05] [INFO ] Deduced a trap composed of 18 places in 815 ms of which 4 ms to minimize.
[2021-06-06 02:03:06] [INFO ] Deduced a trap composed of 26 places in 793 ms of which 14 ms to minimize.
[2021-06-06 02:03:07] [INFO ] Deduced a trap composed of 25 places in 895 ms of which 5 ms to minimize.
[2021-06-06 02:03:08] [INFO ] Deduced a trap composed of 17 places in 865 ms of which 5 ms to minimize.
[2021-06-06 02:03:09] [INFO ] Deduced a trap composed of 28 places in 803 ms of which 2 ms to minimize.
[2021-06-06 02:03:10] [INFO ] Deduced a trap composed of 26 places in 769 ms of which 2 ms to minimize.
[2021-06-06 02:03:11] [INFO ] Deduced a trap composed of 35 places in 796 ms of which 1 ms to minimize.
[2021-06-06 02:03:12] [INFO ] Deduced a trap composed of 24 places in 757 ms of which 2 ms to minimize.
[2021-06-06 02:03:13] [INFO ] Deduced a trap composed of 25 places in 757 ms of which 2 ms to minimize.
[2021-06-06 02:03:14] [INFO ] Deduced a trap composed of 34 places in 725 ms of which 1 ms to minimize.
[2021-06-06 02:03:14] [INFO ] Deduced a trap composed of 23 places in 768 ms of which 1 ms to minimize.
[2021-06-06 02:03:15] [INFO ] Deduced a trap composed of 36 places in 714 ms of which 2 ms to minimize.
[2021-06-06 02:03:16] [INFO ] Deduced a trap composed of 39 places in 716 ms of which 1 ms to minimize.
[2021-06-06 02:03:17] [INFO ] Deduced a trap composed of 28 places in 696 ms of which 1 ms to minimize.
[2021-06-06 02:03:18] [INFO ] Deduced a trap composed of 25 places in 703 ms of which 1 ms to minimize.
[2021-06-06 02:03:19] [INFO ] Deduced a trap composed of 22 places in 714 ms of which 5 ms to minimize.
[2021-06-06 02:03:19] [INFO ] Deduced a trap composed of 26 places in 743 ms of which 2 ms to minimize.
[2021-06-06 02:03:20] [INFO ] Deduced a trap composed of 26 places in 677 ms of which 2 ms to minimize.
[2021-06-06 02:03:22] [INFO ] Deduced a trap composed of 18 places in 2101 ms of which 3 ms to minimize.
[2021-06-06 02:03:22] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
[2021-06-06 02:03:23] [INFO ] [Real]Absence check using 551 positive place invariants in 252 ms returned sat
[2021-06-06 02:03:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 02:03:24] [INFO ] [Real]Absence check using state equation in 1479 ms returned sat
[2021-06-06 02:03:25] [INFO ] Deduced a trap composed of 24 places in 775 ms of which 2 ms to minimize.
[2021-06-06 02:03:26] [INFO ] Deduced a trap composed of 17 places in 840 ms of which 2 ms to minimize.
[2021-06-06 02:03:27] [INFO ] Deduced a trap composed of 25 places in 821 ms of which 1 ms to minimize.
[2021-06-06 02:03:28] [INFO ] Deduced a trap composed of 19 places in 773 ms of which 5 ms to minimize.
[2021-06-06 02:03:29] [INFO ] Deduced a trap composed of 21 places in 758 ms of which 1 ms to minimize.
[2021-06-06 02:03:30] [INFO ] Deduced a trap composed of 27 places in 750 ms of which 2 ms to minimize.
[2021-06-06 02:03:31] [INFO ] Deduced a trap composed of 29 places in 730 ms of which 2 ms to minimize.
[2021-06-06 02:03:32] [INFO ] Deduced a trap composed of 44 places in 727 ms of which 2 ms to minimize.
[2021-06-06 02:03:32] [INFO ] Deduced a trap composed of 23 places in 724 ms of which 1 ms to minimize.
[2021-06-06 02:03:33] [INFO ] Deduced a trap composed of 22 places in 673 ms of which 2 ms to minimize.
[2021-06-06 02:03:34] [INFO ] Deduced a trap composed of 24 places in 663 ms of which 2 ms to minimize.
[2021-06-06 02:03:35] [INFO ] Deduced a trap composed of 19 places in 699 ms of which 2 ms to minimize.
[2021-06-06 02:03:36] [INFO ] Deduced a trap composed of 16 places in 726 ms of which 10 ms to minimize.
[2021-06-06 02:03:36] [INFO ] Deduced a trap composed of 28 places in 700 ms of which 2 ms to minimize.
[2021-06-06 02:03:37] [INFO ] Deduced a trap composed of 16 places in 673 ms of which 1 ms to minimize.
[2021-06-06 02:03:38] [INFO ] Deduced a trap composed of 26 places in 683 ms of which 1 ms to minimize.
[2021-06-06 02:03:39] [INFO ] Deduced a trap composed of 26 places in 666 ms of which 2 ms to minimize.
[2021-06-06 02:03:40] [INFO ] Deduced a trap composed of 18 places in 649 ms of which 2 ms to minimize.
[2021-06-06 02:03:40] [INFO ] Deduced a trap composed of 32 places in 659 ms of which 4 ms to minimize.
[2021-06-06 02:03:41] [INFO ] Deduced a trap composed of 30 places in 618 ms of which 1 ms to minimize.
[2021-06-06 02:03:42] [INFO ] Deduced a trap composed of 29 places in 626 ms of which 2 ms to minimize.
[2021-06-06 02:03:43] [INFO ] Deduced a trap composed of 25 places in 619 ms of which 1 ms to minimize.
[2021-06-06 02:03:43] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
[2021-06-06 02:03:43] [INFO ] [Real]Absence check using 551 positive place invariants in 228 ms returned sat
[2021-06-06 02:03:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 02:03:45] [INFO ] [Real]Absence check using state equation in 1644 ms returned sat
[2021-06-06 02:03:46] [INFO ] Deduced a trap composed of 30 places in 771 ms of which 1 ms to minimize.
[2021-06-06 02:03:47] [INFO ] Deduced a trap composed of 17 places in 818 ms of which 2 ms to minimize.
[2021-06-06 02:03:48] [INFO ] Deduced a trap composed of 29 places in 764 ms of which 5 ms to minimize.
[2021-06-06 02:03:48] [INFO ] Deduced a trap composed of 30 places in 804 ms of which 2 ms to minimize.
[2021-06-06 02:03:49] [INFO ] Deduced a trap composed of 26 places in 791 ms of which 1 ms to minimize.
[2021-06-06 02:03:50] [INFO ] Deduced a trap composed of 33 places in 783 ms of which 2 ms to minimize.
[2021-06-06 02:03:51] [INFO ] Deduced a trap composed of 16 places in 781 ms of which 1 ms to minimize.
[2021-06-06 02:03:52] [INFO ] Deduced a trap composed of 38 places in 746 ms of which 2 ms to minimize.
[2021-06-06 02:03:53] [INFO ] Deduced a trap composed of 45 places in 736 ms of which 1 ms to minimize.
[2021-06-06 02:03:54] [INFO ] Deduced a trap composed of 25 places in 735 ms of which 2 ms to minimize.
[2021-06-06 02:03:55] [INFO ] Deduced a trap composed of 21 places in 732 ms of which 2 ms to minimize.
[2021-06-06 02:03:55] [INFO ] Deduced a trap composed of 51 places in 727 ms of which 2 ms to minimize.
[2021-06-06 02:03:56] [INFO ] Deduced a trap composed of 41 places in 754 ms of which 14 ms to minimize.
[2021-06-06 02:03:57] [INFO ] Deduced a trap composed of 28 places in 722 ms of which 2 ms to minimize.
[2021-06-06 02:03:58] [INFO ] Deduced a trap composed of 19 places in 676 ms of which 2 ms to minimize.
[2021-06-06 02:03:59] [INFO ] Deduced a trap composed of 18 places in 690 ms of which 1 ms to minimize.
[2021-06-06 02:04:00] [INFO ] Deduced a trap composed of 37 places in 659 ms of which 1 ms to minimize.
[2021-06-06 02:04:00] [INFO ] Deduced a trap composed of 18 places in 640 ms of which 1 ms to minimize.
[2021-06-06 02:04:01] [INFO ] Deduced a trap composed of 51 places in 637 ms of which 2 ms to minimize.
[2021-06-06 02:04:02] [INFO ] Deduced a trap composed of 29 places in 617 ms of which 1 ms to minimize.
[2021-06-06 02:04:03] [INFO ] Deduced a trap composed of 53 places in 617 ms of which 3 ms to minimize.
[2021-06-06 02:04:05] [INFO ] Deduced a trap composed of 18 places in 2179 ms of which 3 ms to minimize.
[2021-06-06 02:04:05] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
[2021-06-06 02:04:05] [INFO ] [Real]Absence check using 551 positive place invariants in 217 ms returned sat
[2021-06-06 02:04:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 02:04:07] [INFO ] [Real]Absence check using state equation in 1643 ms returned sat
[2021-06-06 02:04:08] [INFO ] Deduced a trap composed of 26 places in 884 ms of which 5 ms to minimize.
[2021-06-06 02:04:09] [INFO ] Deduced a trap composed of 19 places in 868 ms of which 6 ms to minimize.
[2021-06-06 02:04:10] [INFO ] Deduced a trap composed of 31 places in 832 ms of which 6 ms to minimize.
[2021-06-06 02:04:11] [INFO ] Deduced a trap composed of 27 places in 821 ms of which 2 ms to minimize.
[2021-06-06 02:04:12] [INFO ] Deduced a trap composed of 18 places in 773 ms of which 1 ms to minimize.
[2021-06-06 02:04:13] [INFO ] Deduced a trap composed of 20 places in 810 ms of which 2 ms to minimize.
[2021-06-06 02:04:14] [INFO ] Deduced a trap composed of 30 places in 815 ms of which 2 ms to minimize.
[2021-06-06 02:04:15] [INFO ] Deduced a trap composed of 44 places in 771 ms of which 1 ms to minimize.
[2021-06-06 02:04:15] [INFO ] Deduced a trap composed of 31 places in 779 ms of which 1 ms to minimize.
[2021-06-06 02:04:16] [INFO ] Deduced a trap composed of 44 places in 756 ms of which 2 ms to minimize.
[2021-06-06 02:04:17] [INFO ] Deduced a trap composed of 46 places in 807 ms of which 2 ms to minimize.
[2021-06-06 02:04:18] [INFO ] Deduced a trap composed of 40 places in 797 ms of which 2 ms to minimize.
[2021-06-06 02:04:19] [INFO ] Deduced a trap composed of 58 places in 771 ms of which 2 ms to minimize.
[2021-06-06 02:04:20] [INFO ] Deduced a trap composed of 46 places in 717 ms of which 2 ms to minimize.
[2021-06-06 02:04:21] [INFO ] Deduced a trap composed of 27 places in 673 ms of which 1 ms to minimize.
[2021-06-06 02:04:22] [INFO ] Deduced a trap composed of 24 places in 674 ms of which 2 ms to minimize.
[2021-06-06 02:04:22] [INFO ] Deduced a trap composed of 43 places in 663 ms of which 2 ms to minimize.
[2021-06-06 02:04:23] [INFO ] Deduced a trap composed of 29 places in 693 ms of which 2 ms to minimize.
[2021-06-06 02:04:24] [INFO ] Deduced a trap composed of 25 places in 668 ms of which 2 ms to minimize.
[2021-06-06 02:04:25] [INFO ] Deduced a trap composed of 17 places in 644 ms of which 1 ms to minimize.
[2021-06-06 02:04:25] [INFO ] Deduced a trap composed of 26 places in 642 ms of which 2 ms to minimize.
[2021-06-06 02:04:25] [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
[2021-06-06 02:04:26] [INFO ] [Real]Absence check using 551 positive place invariants in 212 ms returned sat
[2021-06-06 02:04:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 02:04:28] [INFO ] [Real]Absence check using state equation in 1545 ms returned sat
[2021-06-06 02:04:28] [INFO ] Deduced a trap composed of 18 places in 795 ms of which 1 ms to minimize.
[2021-06-06 02:04:29] [INFO ] Deduced a trap composed of 28 places in 794 ms of which 2 ms to minimize.
[2021-06-06 02:04:30] [INFO ] Deduced a trap composed of 19 places in 803 ms of which 2 ms to minimize.
[2021-06-06 02:04:31] [INFO ] Deduced a trap composed of 24 places in 788 ms of which 2 ms to minimize.
[2021-06-06 02:04:32] [INFO ] Deduced a trap composed of 21 places in 728 ms of which 2 ms to minimize.
[2021-06-06 02:04:33] [INFO ] Deduced a trap composed of 17 places in 730 ms of which 2 ms to minimize.
[2021-06-06 02:04:34] [INFO ] Deduced a trap composed of 25 places in 758 ms of which 1 ms to minimize.
[2021-06-06 02:04:35] [INFO ] Deduced a trap composed of 17 places in 738 ms of which 2 ms to minimize.
[2021-06-06 02:04:36] [INFO ] Deduced a trap composed of 24 places in 738 ms of which 2 ms to minimize.
[2021-06-06 02:04:36] [INFO ] Deduced a trap composed of 29 places in 699 ms of which 1 ms to minimize.
[2021-06-06 02:04:37] [INFO ] Deduced a trap composed of 30 places in 714 ms of which 2 ms to minimize.
[2021-06-06 02:04:38] [INFO ] Deduced a trap composed of 24 places in 682 ms of which 1 ms to minimize.
[2021-06-06 02:04:39] [INFO ] Deduced a trap composed of 18 places in 707 ms of which 2 ms to minimize.
[2021-06-06 02:04:40] [INFO ] Deduced a trap composed of 23 places in 682 ms of which 1 ms to minimize.
[2021-06-06 02:04:40] [INFO ] Deduced a trap composed of 18 places in 655 ms of which 1 ms to minimize.
[2021-06-06 02:04:41] [INFO ] Deduced a trap composed of 25 places in 677 ms of which 2 ms to minimize.
[2021-06-06 02:04:42] [INFO ] Deduced a trap composed of 25 places in 658 ms of which 1 ms to minimize.
[2021-06-06 02:04:43] [INFO ] Deduced a trap composed of 27 places in 668 ms of which 2 ms to minimize.
[2021-06-06 02:04:43] [INFO ] Deduced a trap composed of 34 places in 639 ms of which 1 ms to minimize.
[2021-06-06 02:04:44] [INFO ] Deduced a trap composed of 32 places in 648 ms of which 1 ms to minimize.
[2021-06-06 02:04:45] [INFO ] Deduced a trap composed of 25 places in 625 ms of which 2 ms to minimize.
[2021-06-06 02:04:46] [INFO ] Deduced a trap composed of 30 places in 606 ms of which 2 ms to minimize.
[2021-06-06 02:04:46] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 4
[2021-06-06 02:04:46] [INFO ] [Real]Absence check using 551 positive place invariants in 214 ms returned sat
[2021-06-06 02:04:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 02:04:48] [INFO ] [Real]Absence check using state equation in 1578 ms returned sat
[2021-06-06 02:04:49] [INFO ] Deduced a trap composed of 17 places in 812 ms of which 2 ms to minimize.
[2021-06-06 02:04:50] [INFO ] Deduced a trap composed of 22 places in 803 ms of which 2 ms to minimize.
[2021-06-06 02:04:51] [INFO ] Deduced a trap composed of 28 places in 774 ms of which 2 ms to minimize.
[2021-06-06 02:04:52] [INFO ] Deduced a trap composed of 31 places in 809 ms of which 2 ms to minimize.
[2021-06-06 02:04:52] [INFO ] Deduced a trap composed of 25 places in 792 ms of which 1 ms to minimize.
[2021-06-06 02:04:53] [INFO ] Deduced a trap composed of 29 places in 772 ms of which 2 ms to minimize.
[2021-06-06 02:04:54] [INFO ] Deduced a trap composed of 28 places in 769 ms of which 2 ms to minimize.
[2021-06-06 02:04:55] [INFO ] Deduced a trap composed of 20 places in 784 ms of which 2 ms to minimize.
[2021-06-06 02:04:56] [INFO ] Deduced a trap composed of 29 places in 777 ms of which 2 ms to minimize.
[2021-06-06 02:04:57] [INFO ] Deduced a trap composed of 20 places in 752 ms of which 2 ms to minimize.
[2021-06-06 02:04:58] [INFO ] Deduced a trap composed of 28 places in 746 ms of which 2 ms to minimize.
[2021-06-06 02:04:59] [INFO ] Deduced a trap composed of 28 places in 743 ms of which 1 ms to minimize.
[2021-06-06 02:04:59] [INFO ] Deduced a trap composed of 24 places in 722 ms of which 1 ms to minimize.
[2021-06-06 02:05:00] [INFO ] Deduced a trap composed of 26 places in 723 ms of which 8 ms to minimize.
[2021-06-06 02:05:01] [INFO ] Deduced a trap composed of 31 places in 688 ms of which 2 ms to minimize.
[2021-06-06 02:05:02] [INFO ] Deduced a trap composed of 33 places in 677 ms of which 1 ms to minimize.
[2021-06-06 02:05:03] [INFO ] Deduced a trap composed of 33 places in 673 ms of which 2 ms to minimize.
[2021-06-06 02:05:03] [INFO ] Deduced a trap composed of 36 places in 668 ms of which 1 ms to minimize.
[2021-06-06 02:05:04] [INFO ] Deduced a trap composed of 30 places in 669 ms of which 2 ms to minimize.
[2021-06-06 02:05:05] [INFO ] Deduced a trap composed of 27 places in 663 ms of which 2 ms to minimize.
[2021-06-06 02:05:06] [INFO ] Deduced a trap composed of 24 places in 654 ms of which 1 ms to minimize.
[2021-06-06 02:05:06] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 5
[2021-06-06 02:05:06] [INFO ] [Real]Absence check using 551 positive place invariants in 208 ms returned sat
[2021-06-06 02:05:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 02:05:08] [INFO ] [Real]Absence check using state equation in 1585 ms returned sat
[2021-06-06 02:05:09] [INFO ] Deduced a trap composed of 18 places in 745 ms of which 2 ms to minimize.
[2021-06-06 02:05:10] [INFO ] Deduced a trap composed of 21 places in 738 ms of which 1 ms to minimize.
[2021-06-06 02:05:11] [INFO ] Deduced a trap composed of 24 places in 764 ms of which 2 ms to minimize.
[2021-06-06 02:05:11] [INFO ] Deduced a trap composed of 19 places in 751 ms of which 2 ms to minimize.
[2021-06-06 02:05:12] [INFO ] Deduced a trap composed of 27 places in 747 ms of which 2 ms to minimize.
[2021-06-06 02:05:13] [INFO ] Deduced a trap composed of 26 places in 705 ms of which 2 ms to minimize.
[2021-06-06 02:05:14] [INFO ] Deduced a trap composed of 23 places in 695 ms of which 2 ms to minimize.
[2021-06-06 02:05:15] [INFO ] Deduced a trap composed of 17 places in 671 ms of which 1 ms to minimize.
[2021-06-06 02:05:16] [INFO ] Deduced a trap composed of 26 places in 711 ms of which 2 ms to minimize.
[2021-06-06 02:05:16] [INFO ] Deduced a trap composed of 26 places in 640 ms of which 2 ms to minimize.
[2021-06-06 02:05:17] [INFO ] Deduced a trap composed of 26 places in 629 ms of which 2 ms to minimize.
[2021-06-06 02:05:18] [INFO ] Deduced a trap composed of 20 places in 629 ms of which 2 ms to minimize.
[2021-06-06 02:05:19] [INFO ] Deduced a trap composed of 17 places in 655 ms of which 1 ms to minimize.
[2021-06-06 02:05:19] [INFO ] Deduced a trap composed of 29 places in 636 ms of which 2 ms to minimize.
[2021-06-06 02:05:20] [INFO ] Deduced a trap composed of 23 places in 618 ms of which 1 ms to minimize.
[2021-06-06 02:05:21] [INFO ] Deduced a trap composed of 30 places in 609 ms of which 1 ms to minimize.
[2021-06-06 02:05:22] [INFO ] Deduced a trap composed of 29 places in 618 ms of which 1 ms to minimize.
[2021-06-06 02:05:22] [INFO ] Deduced a trap composed of 28 places in 615 ms of which 2 ms to minimize.
[2021-06-06 02:05:23] [INFO ] Deduced a trap composed of 31 places in 606 ms of which 2 ms to minimize.
[2021-06-06 02:05:24] [INFO ] Deduced a trap composed of 30 places in 585 ms of which 1 ms to minimize.
[2021-06-06 02:05:24] [INFO ] Deduced a trap composed of 27 places in 596 ms of which 2 ms to minimize.
[2021-06-06 02:05:25] [INFO ] Deduced a trap composed of 31 places in 605 ms of which 2 ms to minimize.
[2021-06-06 02:05:26] [INFO ] Deduced a trap composed of 31 places in 557 ms of which 1 ms to minimize.
[2021-06-06 02:05:26] [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
[2021-06-06 02:05:26] [INFO ] [Real]Absence check using 551 positive place invariants in 211 ms returned sat
[2021-06-06 02:05:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 02:05:28] [INFO ] [Real]Absence check using state equation in 1596 ms returned sat
[2021-06-06 02:05:29] [INFO ] Deduced a trap composed of 25 places in 815 ms of which 2 ms to minimize.
[2021-06-06 02:05:30] [INFO ] Deduced a trap composed of 23 places in 802 ms of which 2 ms to minimize.
[2021-06-06 02:05:31] [INFO ] Deduced a trap composed of 22 places in 849 ms of which 2 ms to minimize.
[2021-06-06 02:05:32] [INFO ] Deduced a trap composed of 19 places in 793 ms of which 2 ms to minimize.
[2021-06-06 02:05:33] [INFO ] Deduced a trap composed of 22 places in 834 ms of which 2 ms to minimize.
[2021-06-06 02:05:34] [INFO ] Deduced a trap composed of 20 places in 813 ms of which 1 ms to minimize.
[2021-06-06 02:05:35] [INFO ] Deduced a trap composed of 27 places in 794 ms of which 2 ms to minimize.
[2021-06-06 02:05:35] [INFO ] Deduced a trap composed of 16 places in 751 ms of which 1 ms to minimize.
[2021-06-06 02:05:36] [INFO ] Deduced a trap composed of 17 places in 809 ms of which 1 ms to minimize.
[2021-06-06 02:05:37] [INFO ] Deduced a trap composed of 30 places in 721 ms of which 2 ms to minimize.
[2021-06-06 02:05:38] [INFO ] Deduced a trap composed of 27 places in 719 ms of which 1 ms to minimize.
[2021-06-06 02:05:39] [INFO ] Deduced a trap composed of 18 places in 734 ms of which 1 ms to minimize.
[2021-06-06 02:05:40] [INFO ] Deduced a trap composed of 28 places in 706 ms of which 1 ms to minimize.
[2021-06-06 02:05:41] [INFO ] Deduced a trap composed of 26 places in 716 ms of which 2 ms to minimize.
[2021-06-06 02:05:41] [INFO ] Deduced a trap composed of 25 places in 716 ms of which 2 ms to minimize.
[2021-06-06 02:05:42] [INFO ] Deduced a trap composed of 25 places in 682 ms of which 2 ms to minimize.
[2021-06-06 02:05:43] [INFO ] Deduced a trap composed of 26 places in 672 ms of which 1 ms to minimize.
[2021-06-06 02:05:44] [INFO ] Deduced a trap composed of 42 places in 664 ms of which 1 ms to minimize.
[2021-06-06 02:05:45] [INFO ] Deduced a trap composed of 19 places in 641 ms of which 1 ms to minimize.
[2021-06-06 02:05:45] [INFO ] Deduced a trap composed of 41 places in 649 ms of which 2 ms to minimize.
[2021-06-06 02:05:46] [INFO ] Deduced a trap composed of 30 places in 653 ms of which 2 ms to minimize.
[2021-06-06 02:05:46] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 7
[2021-06-06 02:05:47] [INFO ] [Real]Absence check using 551 positive place invariants in 222 ms returned sat
[2021-06-06 02:05:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 02:05:48] [INFO ] [Real]Absence check using state equation in 1609 ms returned sat
[2021-06-06 02:05:49] [INFO ] Deduced a trap composed of 24 places in 813 ms of which 2 ms to minimize.
[2021-06-06 02:05:50] [INFO ] Deduced a trap composed of 20 places in 803 ms of which 2 ms to minimize.
[2021-06-06 02:05:51] [INFO ] Deduced a trap composed of 18 places in 786 ms of which 2 ms to minimize.
[2021-06-06 02:05:52] [INFO ] Deduced a trap composed of 25 places in 811 ms of which 2 ms to minimize.
[2021-06-06 02:05:53] [INFO ] Deduced a trap composed of 16 places in 783 ms of which 1 ms to minimize.
[2021-06-06 02:05:54] [INFO ] Deduced a trap composed of 31 places in 782 ms of which 2 ms to minimize.
[2021-06-06 02:05:55] [INFO ] Deduced a trap composed of 32 places in 750 ms of which 2 ms to minimize.
[2021-06-06 02:05:56] [INFO ] Deduced a trap composed of 17 places in 747 ms of which 2 ms to minimize.
[2021-06-06 02:05:57] [INFO ] Deduced a trap composed of 24 places in 772 ms of which 2 ms to minimize.
[2021-06-06 02:05:57] [INFO ] Deduced a trap composed of 32 places in 768 ms of which 2 ms to minimize.
[2021-06-06 02:05:58] [INFO ] Deduced a trap composed of 29 places in 681 ms of which 1 ms to minimize.
[2021-06-06 02:05:59] [INFO ] Deduced a trap composed of 30 places in 709 ms of which 2 ms to minimize.
[2021-06-06 02:06:00] [INFO ] Deduced a trap composed of 43 places in 701 ms of which 1 ms to minimize.
[2021-06-06 02:06:01] [INFO ] Deduced a trap composed of 20 places in 658 ms of which 1 ms to minimize.
[2021-06-06 02:06:01] [INFO ] Deduced a trap composed of 20 places in 644 ms of which 1 ms to minimize.
[2021-06-06 02:06:02] [INFO ] Deduced a trap composed of 26 places in 633 ms of which 2 ms to minimize.
[2021-06-06 02:06:03] [INFO ] Deduced a trap composed of 28 places in 639 ms of which 2 ms to minimize.
[2021-06-06 02:06:04] [INFO ] Deduced a trap composed of 30 places in 604 ms of which 2 ms to minimize.
[2021-06-06 02:06:04] [INFO ] Deduced a trap composed of 30 places in 607 ms of which 2 ms to minimize.
[2021-06-06 02:06:05] [INFO ] Deduced a trap composed of 34 places in 596 ms of which 2 ms to minimize.
[2021-06-06 02:06:06] [INFO ] Deduced a trap composed of 22 places in 590 ms of which 2 ms to minimize.
[2021-06-06 02:06:06] [INFO ] Deduced a trap composed of 36 places in 574 ms of which 1 ms to minimize.
[2021-06-06 02:06:06] [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 8
[2021-06-06 02:06:07] [INFO ] [Real]Absence check using 551 positive place invariants in 214 ms returned sat
[2021-06-06 02:06:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 02:06:09] [INFO ] [Real]Absence check using state equation in 1601 ms returned sat
[2021-06-06 02:06:10] [INFO ] Deduced a trap composed of 23 places in 827 ms of which 2 ms to minimize.
[2021-06-06 02:06:11] [INFO ] Deduced a trap composed of 20 places in 812 ms of which 2 ms to minimize.
[2021-06-06 02:06:11] [INFO ] Deduced a trap composed of 20 places in 785 ms of which 1 ms to minimize.
[2021-06-06 02:06:12] [INFO ] Deduced a trap composed of 17 places in 786 ms of which 2 ms to minimize.
[2021-06-06 02:06:13] [INFO ] Deduced a trap composed of 22 places in 789 ms of which 1 ms to minimize.
[2021-06-06 02:06:14] [INFO ] Deduced a trap composed of 22 places in 780 ms of which 2 ms to minimize.
[2021-06-06 02:06:15] [INFO ] Deduced a trap composed of 30 places in 773 ms of which 2 ms to minimize.
[2021-06-06 02:06:16] [INFO ] Deduced a trap composed of 18 places in 765 ms of which 2 ms to minimize.
[2021-06-06 02:06:17] [INFO ] Deduced a trap composed of 21 places in 765 ms of which 2 ms to minimize.
[2021-06-06 02:06:18] [INFO ] Deduced a trap composed of 25 places in 729 ms of which 2 ms to minimize.
[2021-06-06 02:06:18] [INFO ] Deduced a trap composed of 25 places in 710 ms of which 2 ms to minimize.
[2021-06-06 02:06:19] [INFO ] Deduced a trap composed of 19 places in 729 ms of which 1 ms to minimize.
[2021-06-06 02:06:20] [INFO ] Deduced a trap composed of 25 places in 738 ms of which 2 ms to minimize.
[2021-06-06 02:06:21] [INFO ] Deduced a trap composed of 18 places in 719 ms of which 1 ms to minimize.
[2021-06-06 02:06:22] [INFO ] Deduced a trap composed of 28 places in 737 ms of which 2 ms to minimize.
[2021-06-06 02:06:23] [INFO ] Deduced a trap composed of 19 places in 704 ms of which 1 ms to minimize.
[2021-06-06 02:06:24] [INFO ] Deduced a trap composed of 24 places in 696 ms of which 2 ms to minimize.
[2021-06-06 02:06:24] [INFO ] Deduced a trap composed of 27 places in 675 ms of which 2 ms to minimize.
[2021-06-06 02:06:25] [INFO ] Deduced a trap composed of 28 places in 672 ms of which 2 ms to minimize.
[2021-06-06 02:06:26] [INFO ] Deduced a trap composed of 26 places in 656 ms of which 2 ms to minimize.
[2021-06-06 02:06:27] [INFO ] Deduced a trap composed of 30 places in 641 ms of which 2 ms to minimize.
[2021-06-06 02:06:27] [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 9
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G(p0) U p1)))], workingDir=/home/mcc/execution]
Support contains 2 out of 3360 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3360/3360 places, 3010/3010 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 3352 transition count 3002
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 3352 transition count 3002
Applied a total of 16 rules in 531 ms. Remains 3352 /3360 variables (removed 8) and now considering 3002/3010 (removed 8) transitions.
// Phase 1: matrix 3002 rows 3352 cols
[2021-06-06 02:06:27] [INFO ] Computed 551 place invariants in 20 ms
[2021-06-06 02:06:29] [INFO ] Implicit Places using invariants in 1270 ms returned []
// Phase 1: matrix 3002 rows 3352 cols
[2021-06-06 02:06:29] [INFO ] Computed 551 place invariants in 8 ms
[2021-06-06 02:06:32] [INFO ] Implicit Places using invariants and state equation in 3605 ms returned []
Implicit Place search using SMT with State Equation took 4877 ms to find 0 implicit places.
// Phase 1: matrix 3002 rows 3352 cols
[2021-06-06 02:06:32] [INFO ] Computed 551 place invariants in 23 ms
[2021-06-06 02:06:34] [INFO ] Dead Transitions using invariants and state equation in 2202 ms returned []
Finished structural reductions, in 1 iterations. Remains : 3352/3360 places, 3002/3010 transitions.
Stuttering acceptance computed with spot in 291 ms :[(NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-050B-00 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s687 1), p0:(EQ s3288 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA ShieldPPPt-PT-050B-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-050B-00 finished in 8011 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((p0&&G(((p1&&F(p2))||F(p3)))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 3360 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3360/3360 places, 3010/3010 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 3351 transition count 3001
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 3351 transition count 3001
Applied a total of 18 rules in 443 ms. Remains 3351 /3360 variables (removed 9) and now considering 3001/3010 (removed 9) transitions.
// Phase 1: matrix 3001 rows 3351 cols
[2021-06-06 02:06:35] [INFO ] Computed 551 place invariants in 9 ms
[2021-06-06 02:06:36] [INFO ] Implicit Places using invariants in 1183 ms returned []
// Phase 1: matrix 3001 rows 3351 cols
[2021-06-06 02:06:36] [INFO ] Computed 551 place invariants in 10 ms
[2021-06-06 02:06:40] [INFO ] Implicit Places using invariants and state equation in 3598 ms returned []
Implicit Place search using SMT with State Equation took 4783 ms to find 0 implicit places.
// Phase 1: matrix 3001 rows 3351 cols
[2021-06-06 02:06:40] [INFO ] Computed 551 place invariants in 26 ms
[2021-06-06 02:06:42] [INFO ] Dead Transitions using invariants and state equation in 2319 ms returned []
Finished structural reductions, in 1 iterations. Remains : 3351/3360 places, 3001/3010 transitions.
Stuttering acceptance computed with spot in 292 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p3) (NOT p2)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3)))]
Running random walk in product with property : ShieldPPPt-PT-050B-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p3)), acceptance={} source=1 dest: 3}, { cond=(AND p0 p1 (NOT p2) (NOT p3)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p3)), acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p2) (NOT p3)), acceptance={} source=2 dest: 4}], [{ cond=(OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), acceptance={0} source=3 dest: 3}, { cond=(AND p0 p1 (NOT p2) (NOT p3)), acceptance={} source=3 dest: 4}, { cond=(AND p0 p1 (NOT p3)), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={0} source=5 dest: 3}, { cond=(AND p1 (NOT p2) (NOT p3)), acceptance={} source=5 dest: 4}, { cond=(AND p1 (NOT p3)), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(OR (EQ s2176 0) (EQ s2208 0)), p1:(EQ s2223 1), p3:(NEQ s15 1), p2:(EQ s507 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 8 reset in 1020 ms.
Product exploration explored 100000 steps with 2 reset in 1380 ms.
Knowledge obtained : [p0, (NOT p1), p3, (NOT p2)]
Stuttering acceptance computed with spot in 253 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p3) (NOT p2)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3)))]
Product exploration explored 100000 steps with 3 reset in 850 ms.
Product exploration explored 100000 steps with 5 reset in 1063 ms.
Applying partial POR strategy [false, true, true, true, true, true]
Stuttering acceptance computed with spot in 256 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p3) (NOT p2)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3)))]
Support contains 5 out of 3351 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 3351/3351 places, 3001/3001 transitions.
Performed 696 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 696 rules applied. Total rules applied 696 place count 3351 transition count 3001
Performed 253 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 253 Pre rules applied. Total rules applied 696 place count 3351 transition count 3201
Deduced a syphon composed of 949 places in 6 ms
Iterating global reduction 1 with 253 rules applied. Total rules applied 949 place count 3351 transition count 3201
Performed 943 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1892 places in 14 ms
Iterating global reduction 1 with 943 rules applied. Total rules applied 1892 place count 3351 transition count 3201
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 1893 place count 3351 transition count 3200
Renaming transitions due to excessive name length > 1024 char.
Discarding 350 places :
Symmetric choice reduction at 2 with 350 rule applications. Total rules 2243 place count 3001 transition count 2850
Deduced a syphon composed of 1542 places in 6 ms
Iterating global reduction 2 with 350 rules applied. Total rules applied 2593 place count 3001 transition count 2850
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1543 places in 17 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 2594 place count 3001 transition count 2850
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 2596 place count 2999 transition count 2848
Deduced a syphon composed of 1541 places in 6 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 2598 place count 2999 transition count 2848
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -430
Deduced a syphon composed of 1642 places in 7 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 2699 place count 2999 transition count 3278
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 2800 place count 2898 transition count 3076
Deduced a syphon composed of 1541 places in 10 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 2901 place count 2898 transition count 3076
Performed 98 Post agglomeration using F-continuation condition.Transition count delta: -415
Deduced a syphon composed of 1639 places in 5 ms
Iterating global reduction 2 with 98 rules applied. Total rules applied 2999 place count 2898 transition count 3491
Discarding 98 places :
Symmetric choice reduction at 2 with 98 rule applications. Total rules 3097 place count 2800 transition count 3295
Deduced a syphon composed of 1541 places in 4 ms
Iterating global reduction 2 with 98 rules applied. Total rules applied 3195 place count 2800 transition count 3295
Deduced a syphon composed of 1541 places in 4 ms
Applied a total of 3195 rules in 2906 ms. Remains 2800 /3351 variables (removed 551) and now considering 3295/3001 (removed -294) transitions.
[2021-06-06 02:06:51] [INFO ] Redundant transitions in 210 ms returned []
// Phase 1: matrix 3295 rows 2800 cols
[2021-06-06 02:06:51] [INFO ] Computed 551 place invariants in 28 ms
[2021-06-06 02:06:53] [INFO ] Dead Transitions using invariants and state equation in 1966 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2800/3351 places, 3295/3001 transitions.
Product exploration explored 100000 steps with 7 reset in 1133 ms.
Product exploration explored 100000 steps with 2 reset in 1462 ms.
[2021-06-06 02:06:56] [INFO ] Flatten gal took : 92 ms
[2021-06-06 02:06:56] [INFO ] Flatten gal took : 82 ms
[2021-06-06 02:06:56] [INFO ] Time to serialize gal into /tmp/LTL9869744499458661600.gal : 47 ms
[2021-06-06 02:06:56] [INFO ] Time to serialize properties into /tmp/LTL7725493089429740377.ltl : 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-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL9869744499458661600.gal, -t, CGAL, -LTL, /tmp/LTL7725493089429740377.ltl, -c, -stutter-deadlock, --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.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL9869744499458661600.gal -t CGAL -LTL /tmp/LTL7725493089429740377.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F((G((("(p2583==1)")&&(F("(p581==1)")))||(F("(p15!=1)"))))&&("((p2528==0)||(p2564==0))")))))
Formula 0 simplified : !XF("((p2528==0)||(p2564==0))" & G(("(p2583==1)" & F"(p581==1)") | F"(p15!=1)"))
Detected timeout of ITS tools.
[2021-06-06 02:07:11] [INFO ] Flatten gal took : 86 ms
[2021-06-06 02:07:11] [INFO ] Applying decomposition
[2021-06-06 02:07:11] [INFO ] Flatten gal took : 82 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/graph11956587423563921903.txt, -o, /tmp/graph11956587423563921903.bin, -w, /tmp/graph11956587423563921903.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/graph11956587423563921903.bin, -l, -1, -v, -w, /tmp/graph11956587423563921903.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-06-06 02:07:11] [INFO ] Decomposing Gal with order
[2021-06-06 02:07:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-06-06 02:07:12] [INFO ] Removed a total of 501 redundant transitions.
[2021-06-06 02:07:12] [INFO ] Flatten gal took : 219 ms
[2021-06-06 02:07:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 14 ms.
[2021-06-06 02:07:12] [INFO ] Time to serialize gal into /tmp/LTL8611510812070876092.gal : 28 ms
[2021-06-06 02:07:12] [INFO ] Time to serialize properties into /tmp/LTL15400954113534493046.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL8611510812070876092.gal, -t, CGAL, -LTL, /tmp/LTL15400954113534493046.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.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL8611510812070876092.gal -t CGAL -LTL /tmp/LTL15400954113534493046.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(F((G((("(i33.u803.p2583==1)")&&(F("(i8.u186.p581==1)")))||(F("(i35.u6.p15!=1)"))))&&("((i33.u787.p2528==0)||(i33.u797.p2564==0))")))))
Formula 0 simplified : !XF("((i33.u787.p2528==0)||(i33.u797.p2564==0))" & G(("(i33.u803.p2583==1)" & F"(i8.u186.p581==1)") | F"(i35.u6.p15!=1)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11053007555548707028
[2021-06-06 02:07:27] [INFO ] Built C files in 51ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11053007555548707028
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/ltsmin11053007555548707028]
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/ltsmin11053007555548707028] 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/ltsmin11053007555548707028] 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)
Treatment of property ShieldPPPt-PT-050B-01 finished in 53628 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)||G(p1)))], workingDir=/home/mcc/execution]
Support contains 2 out of 3360 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3360/3360 places, 3010/3010 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 700 transitions
Trivial Post-agglo rules discarded 700 transitions
Performed 700 trivial Post agglomeration. Transition count delta: 700
Iterating post reduction 0 with 700 rules applied. Total rules applied 700 place count 3359 transition count 2309
Reduce places removed 700 places and 0 transitions.
Iterating post reduction 1 with 700 rules applied. Total rules applied 1400 place count 2659 transition count 2309
Performed 396 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 396 Pre rules applied. Total rules applied 1400 place count 2659 transition count 1913
Deduced a syphon composed of 396 places in 9 ms
Reduce places removed 396 places and 0 transitions.
Iterating global reduction 2 with 792 rules applied. Total rules applied 2192 place count 2263 transition count 1913
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 2200 place count 2255 transition count 1905
Iterating global reduction 2 with 8 rules applied. Total rules applied 2208 place count 2255 transition count 1905
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 2208 place count 2255 transition count 1899
Deduced a syphon composed of 6 places in 4 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 2220 place count 2249 transition count 1899
Performed 843 Post agglomeration using F-continuation condition.Transition count delta: 843
Deduced a syphon composed of 843 places in 2 ms
Reduce places removed 843 places and 0 transitions.
Iterating global reduction 2 with 1686 rules applied. Total rules applied 3906 place count 1406 transition count 1056
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3907 place count 1406 transition count 1055
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3909 place count 1405 transition count 1054
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 2 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 4111 place count 1304 transition count 1054
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 4207 place count 1256 transition count 1054
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 4208 place count 1256 transition count 1054
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 4209 place count 1255 transition count 1053
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 4210 place count 1254 transition count 1053
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 4210 place count 1254 transition count 1051
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 4214 place count 1252 transition count 1051
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 4215 place count 1251 transition count 1050
Applied a total of 4215 rules in 924 ms. Remains 1251 /3360 variables (removed 2109) and now considering 1050/3010 (removed 1960) transitions.
// Phase 1: matrix 1050 rows 1251 cols
[2021-06-06 02:07:29] [INFO ] Computed 550 place invariants in 2 ms
[2021-06-06 02:07:30] [INFO ] Implicit Places using invariants in 801 ms returned [1234, 1238]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 804 ms to find 2 implicit places.
[2021-06-06 02:07:30] [INFO ] Redundant transitions in 37 ms returned []
// Phase 1: matrix 1050 rows 1249 cols
[2021-06-06 02:07:30] [INFO ] Computed 548 place invariants in 12 ms
[2021-06-06 02:07:31] [INFO ] Dead Transitions using invariants and state equation in 781 ms returned []
Starting structural reductions, iteration 1 : 1249/3360 places, 1050/3010 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1247 transition count 1048
Applied a total of 4 rules in 85 ms. Remains 1247 /1249 variables (removed 2) and now considering 1048/1050 (removed 2) transitions.
// Phase 1: matrix 1048 rows 1247 cols
[2021-06-06 02:07:31] [INFO ] Computed 548 place invariants in 2 ms
[2021-06-06 02:07:32] [INFO ] Implicit Places using invariants in 656 ms returned []
// Phase 1: matrix 1048 rows 1247 cols
[2021-06-06 02:07:32] [INFO ] Computed 548 place invariants in 2 ms
[2021-06-06 02:07:32] [INFO ] State equation strengthened by 77 read => feed constraints.
[2021-06-06 02:07:34] [INFO ] Implicit Places using invariants and state equation in 2079 ms returned []
Implicit Place search using SMT with State Equation took 2738 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 1247/3360 places, 1048/3010 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPt-PT-050B-02 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(EQ s1 1), p1:(EQ s675 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 19364 reset in 974 ms.
Stack based approach found an accepted trace after 102 steps with 16 reset with depth 4 and stack size 4 in 1 ms.
FORMULA ShieldPPPt-PT-050B-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-050B-02 finished in 6465 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G((((p0 U p1)||G(p2)) U p3))))], workingDir=/home/mcc/execution]
Support contains 4 out of 3360 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3360/3360 places, 3010/3010 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 3352 transition count 3002
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 3352 transition count 3002
Applied a total of 16 rules in 661 ms. Remains 3352 /3360 variables (removed 8) and now considering 3002/3010 (removed 8) transitions.
// Phase 1: matrix 3002 rows 3352 cols
[2021-06-06 02:07:36] [INFO ] Computed 551 place invariants in 12 ms
[2021-06-06 02:07:37] [INFO ] Implicit Places using invariants in 1231 ms returned []
// Phase 1: matrix 3002 rows 3352 cols
[2021-06-06 02:07:37] [INFO ] Computed 551 place invariants in 8 ms
[2021-06-06 02:07:40] [INFO ] Implicit Places using invariants and state equation in 3540 ms returned []
Implicit Place search using SMT with State Equation took 4774 ms to find 0 implicit places.
// Phase 1: matrix 3002 rows 3352 cols
[2021-06-06 02:07:40] [INFO ] Computed 551 place invariants in 8 ms
[2021-06-06 02:07:42] [INFO ] Dead Transitions using invariants and state equation in 2213 ms returned []
Finished structural reductions, in 1 iterations. Remains : 3352/3360 places, 3002/3010 transitions.
Stuttering acceptance computed with spot in 258 ms :[(NOT p3), (NOT p3), true, (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p3)]
Running random walk in product with property : ShieldPPPt-PT-050B-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR p3 p1 p0 p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p3) (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p3) (NOT p1) p0 (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p3) (NOT p1) (NOT p0) p2), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p3) (NOT p1) p0 p2), acceptance={} source=1 dest: 5}, { cond=(OR (AND (NOT p3) p1) (AND (NOT p3) p0) (AND (NOT p3) p2)), acceptance={} source=1 dest: 6}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 2}, { cond=p2, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p3) (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=6 dest: 2}, { cond=(AND (NOT p3) (NOT p1) p0 (NOT p2)), acceptance={0} source=6 dest: 3}, { cond=(AND (NOT p3) (NOT p1) (NOT p0) p2), acceptance={0} source=6 dest: 4}, { cond=(AND (NOT p3) (NOT p1) p0 p2), acceptance={0} source=6 dest: 5}, { cond=(OR (AND (NOT p3) p1) (AND (NOT p3) p0) (AND (NOT p3) p2)), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p3:(AND (EQ s1617 1) (EQ s2774 1) (EQ s2799 1)), p1:(OR (AND (EQ s2774 1) (EQ s2799 1)) (EQ s1358 1)), p0:(OR (EQ s2774 0) (EQ s2799 0)), p2:(EQ s1358 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 9 reset in 945 ms.
Stack based approach found an accepted trace after 1884 steps with 0 reset with depth 1885 and stack size 1885 in 19 ms.
FORMULA ShieldPPPt-PT-050B-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-050B-03 finished in 8935 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((p0 U (G(p0)||(p0&&G(p1)))))))], workingDir=/home/mcc/execution]
Support contains 2 out of 3360 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3360/3360 places, 3010/3010 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 700 transitions
Trivial Post-agglo rules discarded 700 transitions
Performed 700 trivial Post agglomeration. Transition count delta: 700
Iterating post reduction 0 with 700 rules applied. Total rules applied 700 place count 3359 transition count 2309
Reduce places removed 700 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 701 rules applied. Total rules applied 1401 place count 2659 transition count 2308
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1402 place count 2658 transition count 2308
Performed 395 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 395 Pre rules applied. Total rules applied 1402 place count 2658 transition count 1913
Deduced a syphon composed of 395 places in 3 ms
Reduce places removed 395 places and 0 transitions.
Iterating global reduction 3 with 790 rules applied. Total rules applied 2192 place count 2263 transition count 1913
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 2200 place count 2255 transition count 1905
Iterating global reduction 3 with 8 rules applied. Total rules applied 2208 place count 2255 transition count 1905
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 2208 place count 2255 transition count 1899
Deduced a syphon composed of 6 places in 3 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 2220 place count 2249 transition count 1899
Performed 844 Post agglomeration using F-continuation condition.Transition count delta: 844
Deduced a syphon composed of 844 places in 1 ms
Reduce places removed 844 places and 0 transitions.
Iterating global reduction 3 with 1688 rules applied. Total rules applied 3908 place count 1405 transition count 1055
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3909 place count 1405 transition count 1054
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3911 place count 1404 transition count 1053
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 2 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 4113 place count 1303 transition count 1053
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 48 places in 5 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 4 with 96 rules applied. Total rules applied 4209 place count 1255 transition count 1053
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 4210 place count 1254 transition count 1052
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 4211 place count 1253 transition count 1052
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 4211 place count 1253 transition count 1050
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 4215 place count 1251 transition count 1050
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 4216 place count 1250 transition count 1049
Applied a total of 4216 rules in 740 ms. Remains 1250 /3360 variables (removed 2110) and now considering 1049/3010 (removed 1961) transitions.
// Phase 1: matrix 1049 rows 1250 cols
[2021-06-06 02:07:45] [INFO ] Computed 550 place invariants in 2 ms
[2021-06-06 02:07:45] [INFO ] Implicit Places using invariants in 621 ms returned [1233, 1237]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 624 ms to find 2 implicit places.
[2021-06-06 02:07:45] [INFO ] Redundant transitions in 17 ms returned []
// Phase 1: matrix 1049 rows 1248 cols
[2021-06-06 02:07:45] [INFO ] Computed 548 place invariants in 3 ms
[2021-06-06 02:07:46] [INFO ] Dead Transitions using invariants and state equation in 589 ms returned []
Starting structural reductions, iteration 1 : 1248/3360 places, 1049/3010 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1246 transition count 1047
Applied a total of 4 rules in 59 ms. Remains 1246 /1248 variables (removed 2) and now considering 1047/1049 (removed 2) transitions.
// Phase 1: matrix 1047 rows 1246 cols
[2021-06-06 02:07:46] [INFO ] Computed 548 place invariants in 4 ms
[2021-06-06 02:07:46] [INFO ] Implicit Places using invariants in 646 ms returned []
// Phase 1: matrix 1047 rows 1246 cols
[2021-06-06 02:07:46] [INFO ] Computed 548 place invariants in 4 ms
[2021-06-06 02:07:48] [INFO ] Implicit Places using invariants and state equation in 1358 ms returned []
Implicit Place search using SMT with State Equation took 2007 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 1246/3360 places, 1047/3010 transitions.
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldPPPt-PT-050B-05 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={1} source=2 dest: 2}, { cond=(AND p1 p0), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(EQ s715 1), p0:(NEQ s1199 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 911 ms.
Stack based approach found an accepted trace after 154 steps with 0 reset with depth 155 and stack size 154 in 2 ms.
FORMULA ShieldPPPt-PT-050B-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-050B-05 finished in 5084 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 3360 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3360/3360 places, 3010/3010 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 3352 transition count 3002
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 3352 transition count 3002
Applied a total of 16 rules in 634 ms. Remains 3352 /3360 variables (removed 8) and now considering 3002/3010 (removed 8) transitions.
// Phase 1: matrix 3002 rows 3352 cols
[2021-06-06 02:07:49] [INFO ] Computed 551 place invariants in 15 ms
[2021-06-06 02:07:51] [INFO ] Implicit Places using invariants in 1260 ms returned []
// Phase 1: matrix 3002 rows 3352 cols
[2021-06-06 02:07:51] [INFO ] Computed 551 place invariants in 11 ms
[2021-06-06 02:07:54] [INFO ] Implicit Places using invariants and state equation in 3462 ms returned []
Implicit Place search using SMT with State Equation took 4724 ms to find 0 implicit places.
// Phase 1: matrix 3002 rows 3352 cols
[2021-06-06 02:07:54] [INFO ] Computed 551 place invariants in 8 ms
[2021-06-06 02:07:57] [INFO ] Dead Transitions using invariants and state equation in 2353 ms returned []
Finished structural reductions, in 1 iterations. Remains : 3352/3360 places, 3002/3010 transitions.
Stuttering acceptance computed with spot in 81 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-050B-06 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(NEQ s3058 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldPPPt-PT-050B-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-050B-06 finished in 7836 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(G(p0))))], workingDir=/home/mcc/execution]
Support contains 2 out of 3360 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3360/3360 places, 3010/3010 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 3353 transition count 3003
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 3353 transition count 3003
Applied a total of 14 rules in 634 ms. Remains 3353 /3360 variables (removed 7) and now considering 3003/3010 (removed 7) transitions.
// Phase 1: matrix 3003 rows 3353 cols
[2021-06-06 02:07:57] [INFO ] Computed 551 place invariants in 9 ms
[2021-06-06 02:07:59] [INFO ] Implicit Places using invariants in 1265 ms returned []
// Phase 1: matrix 3003 rows 3353 cols
[2021-06-06 02:07:59] [INFO ] Computed 551 place invariants in 19 ms
[2021-06-06 02:08:02] [INFO ] Implicit Places using invariants and state equation in 3684 ms returned []
Implicit Place search using SMT with State Equation took 4951 ms to find 0 implicit places.
// Phase 1: matrix 3003 rows 3353 cols
[2021-06-06 02:08:02] [INFO ] Computed 551 place invariants in 7 ms
[2021-06-06 02:08:04] [INFO ] Dead Transitions using invariants and state equation in 2174 ms returned []
Finished structural reductions, in 1 iterations. Remains : 3353/3360 places, 3003/3010 transitions.
Stuttering acceptance computed with spot in 127 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-050B-08 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (EQ s819 1) (EQ s1356 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ShieldPPPt-PT-050B-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-050B-08 finished in 7922 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0 U p1)))], workingDir=/home/mcc/execution]
Support contains 2 out of 3360 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3360/3360 places, 3010/3010 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 3353 transition count 3003
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 3353 transition count 3003
Applied a total of 14 rules in 653 ms. Remains 3353 /3360 variables (removed 7) and now considering 3003/3010 (removed 7) transitions.
// Phase 1: matrix 3003 rows 3353 cols
[2021-06-06 02:08:05] [INFO ] Computed 551 place invariants in 13 ms
[2021-06-06 02:08:06] [INFO ] Implicit Places using invariants in 1182 ms returned []
// Phase 1: matrix 3003 rows 3353 cols
[2021-06-06 02:08:06] [INFO ] Computed 551 place invariants in 8 ms
[2021-06-06 02:08:10] [INFO ] Implicit Places using invariants and state equation in 3659 ms returned []
Implicit Place search using SMT with State Equation took 4847 ms to find 0 implicit places.
// Phase 1: matrix 3003 rows 3353 cols
[2021-06-06 02:08:10] [INFO ] Computed 551 place invariants in 13 ms
[2021-06-06 02:08:12] [INFO ] Dead Transitions using invariants and state equation in 2270 ms returned []
Finished structural reductions, in 1 iterations. Remains : 3353/3360 places, 3003/3010 transitions.
Stuttering acceptance computed with spot in 95 ms :[(NOT p1), (NOT p1), true]
Running random walk in product with property : ShieldPPPt-PT-050B-09 automaton TGBA [mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(EQ s1416 1), p0:(EQ s3083 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldPPPt-PT-050B-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-050B-09 finished in 7900 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 3360 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3360/3360 places, 3010/3010 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 700 transitions
Trivial Post-agglo rules discarded 700 transitions
Performed 700 trivial Post agglomeration. Transition count delta: 700
Iterating post reduction 0 with 700 rules applied. Total rules applied 700 place count 3359 transition count 2309
Reduce places removed 700 places and 0 transitions.
Iterating post reduction 1 with 700 rules applied. Total rules applied 1400 place count 2659 transition count 2309
Performed 396 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 396 Pre rules applied. Total rules applied 1400 place count 2659 transition count 1913
Deduced a syphon composed of 396 places in 3 ms
Reduce places removed 396 places and 0 transitions.
Iterating global reduction 2 with 792 rules applied. Total rules applied 2192 place count 2263 transition count 1913
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 2200 place count 2255 transition count 1905
Iterating global reduction 2 with 8 rules applied. Total rules applied 2208 place count 2255 transition count 1905
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 2208 place count 2255 transition count 1899
Deduced a syphon composed of 6 places in 3 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 2220 place count 2249 transition count 1899
Performed 846 Post agglomeration using F-continuation condition.Transition count delta: 846
Deduced a syphon composed of 846 places in 2 ms
Reduce places removed 846 places and 0 transitions.
Iterating global reduction 2 with 1692 rules applied. Total rules applied 3912 place count 1403 transition count 1053
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3913 place count 1403 transition count 1052
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3915 place count 1402 transition count 1051
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 2 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 4117 place count 1301 transition count 1051
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 47 places in 2 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 4211 place count 1254 transition count 1051
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 4212 place count 1253 transition count 1050
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 4213 place count 1252 transition count 1050
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 4213 place count 1252 transition count 1048
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 4217 place count 1250 transition count 1048
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 4218 place count 1249 transition count 1047
Applied a total of 4218 rules in 775 ms. Remains 1249 /3360 variables (removed 2111) and now considering 1047/3010 (removed 1963) transitions.
// Phase 1: matrix 1047 rows 1249 cols
[2021-06-06 02:08:13] [INFO ] Computed 550 place invariants in 3 ms
[2021-06-06 02:08:14] [INFO ] Implicit Places using invariants in 696 ms returned [1232, 1236]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 697 ms to find 2 implicit places.
[2021-06-06 02:08:14] [INFO ] Redundant transitions in 9 ms returned []
// Phase 1: matrix 1047 rows 1247 cols
[2021-06-06 02:08:14] [INFO ] Computed 548 place invariants in 2 ms
[2021-06-06 02:08:15] [INFO ] Dead Transitions using invariants and state equation in 579 ms returned []
Starting structural reductions, iteration 1 : 1247/3360 places, 1047/3010 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1245 transition count 1045
Applied a total of 4 rules in 62 ms. Remains 1245 /1247 variables (removed 2) and now considering 1045/1047 (removed 2) transitions.
// Phase 1: matrix 1045 rows 1245 cols
[2021-06-06 02:08:15] [INFO ] Computed 548 place invariants in 2 ms
[2021-06-06 02:08:15] [INFO ] Implicit Places using invariants in 698 ms returned []
// Phase 1: matrix 1045 rows 1245 cols
[2021-06-06 02:08:15] [INFO ] Computed 548 place invariants in 4 ms
[2021-06-06 02:08:17] [INFO ] Implicit Places using invariants and state equation in 1451 ms returned []
Implicit Place search using SMT with State Equation took 2151 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 1245/3360 places, 1045/3010 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-050B-10 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s1126 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 928 ms.
Stack based approach found an accepted trace after 2 steps with 0 reset with depth 3 and stack size 3 in 1 ms.
FORMULA ShieldPPPt-PT-050B-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-050B-10 finished in 5270 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(F(p0))))], workingDir=/home/mcc/execution]
Support contains 2 out of 3360 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3360/3360 places, 3010/3010 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 3351 transition count 3001
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 3351 transition count 3001
Applied a total of 18 rules in 610 ms. Remains 3351 /3360 variables (removed 9) and now considering 3001/3010 (removed 9) transitions.
// Phase 1: matrix 3001 rows 3351 cols
[2021-06-06 02:08:18] [INFO ] Computed 551 place invariants in 9 ms
[2021-06-06 02:08:20] [INFO ] Implicit Places using invariants in 1217 ms returned []
// Phase 1: matrix 3001 rows 3351 cols
[2021-06-06 02:08:20] [INFO ] Computed 551 place invariants in 9 ms
[2021-06-06 02:08:23] [INFO ] Implicit Places using invariants and state equation in 3709 ms returned []
Implicit Place search using SMT with State Equation took 4928 ms to find 0 implicit places.
// Phase 1: matrix 3001 rows 3351 cols
[2021-06-06 02:08:23] [INFO ] Computed 551 place invariants in 17 ms
[2021-06-06 02:08:26] [INFO ] Dead Transitions using invariants and state equation in 2292 ms returned []
Finished structural reductions, in 1 iterations. Remains : 3351/3360 places, 3001/3010 transitions.
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-050B-11 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (EQ s1329 1) (EQ s1331 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 990 ms.
Stack based approach found an accepted trace after 1646 steps with 0 reset with depth 1647 and stack size 1647 in 17 ms.
FORMULA ShieldPPPt-PT-050B-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-050B-11 finished in 8967 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 3360 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3360/3360 places, 3010/3010 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 3351 transition count 3001
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 3351 transition count 3001
Applied a total of 18 rules in 652 ms. Remains 3351 /3360 variables (removed 9) and now considering 3001/3010 (removed 9) transitions.
// Phase 1: matrix 3001 rows 3351 cols
[2021-06-06 02:08:27] [INFO ] Computed 551 place invariants in 14 ms
[2021-06-06 02:08:29] [INFO ] Implicit Places using invariants in 1275 ms returned []
// Phase 1: matrix 3001 rows 3351 cols
[2021-06-06 02:08:29] [INFO ] Computed 551 place invariants in 9 ms
[2021-06-06 02:08:32] [INFO ] Implicit Places using invariants and state equation in 3677 ms returned []
Implicit Place search using SMT with State Equation took 4954 ms to find 0 implicit places.
// Phase 1: matrix 3001 rows 3351 cols
[2021-06-06 02:08:32] [INFO ] Computed 551 place invariants in 15 ms
[2021-06-06 02:08:35] [INFO ] Dead Transitions using invariants and state equation in 2292 ms returned []
Finished structural reductions, in 1 iterations. Remains : 3351/3360 places, 3001/3010 transitions.
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-050B-12 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(NEQ s2682 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 1652 ms.
Product exploration explored 100000 steps with 50000 reset in 1674 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 50000 reset in 1654 ms.
Product exploration explored 100000 steps with 50000 reset in 1653 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 3351 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 3351/3351 places, 3001/3001 transitions.
Performed 699 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 699 rules applied. Total rules applied 699 place count 3351 transition count 3001
Performed 250 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 250 Pre rules applied. Total rules applied 699 place count 3351 transition count 3201
Deduced a syphon composed of 949 places in 6 ms
Iterating global reduction 1 with 250 rules applied. Total rules applied 949 place count 3351 transition count 3201
Performed 950 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1899 places in 7 ms
Iterating global reduction 1 with 950 rules applied. Total rules applied 1899 place count 3351 transition count 3202
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 1900 place count 3351 transition count 3201
Renaming transitions due to excessive name length > 1024 char.
Discarding 351 places :
Symmetric choice reduction at 2 with 351 rule applications. Total rules 2251 place count 3000 transition count 2850
Deduced a syphon composed of 1548 places in 5 ms
Iterating global reduction 2 with 351 rules applied. Total rules applied 2602 place count 3000 transition count 2850
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1549 places in 6 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 2603 place count 3000 transition count 2850
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 2605 place count 2998 transition count 2848
Deduced a syphon composed of 1547 places in 5 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 2607 place count 2998 transition count 2848
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -430
Deduced a syphon composed of 1648 places in 5 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 2708 place count 2998 transition count 3278
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 2809 place count 2897 transition count 3076
Deduced a syphon composed of 1547 places in 5 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 2910 place count 2897 transition count 3076
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: -410
Deduced a syphon composed of 1644 places in 4 ms
Iterating global reduction 2 with 97 rules applied. Total rules applied 3007 place count 2897 transition count 3486
Discarding 97 places :
Symmetric choice reduction at 2 with 97 rule applications. Total rules 3104 place count 2800 transition count 3292
Deduced a syphon composed of 1547 places in 4 ms
Iterating global reduction 2 with 97 rules applied. Total rules applied 3201 place count 2800 transition count 3292
Deduced a syphon composed of 1547 places in 4 ms
Applied a total of 3201 rules in 1716 ms. Remains 2800 /3351 variables (removed 551) and now considering 3292/3001 (removed -291) transitions.
[2021-06-06 02:08:43] [INFO ] Redundant transitions in 79 ms returned []
// Phase 1: matrix 3292 rows 2800 cols
[2021-06-06 02:08:44] [INFO ] Computed 551 place invariants in 34 ms
[2021-06-06 02:08:46] [INFO ] Dead Transitions using invariants and state equation in 2030 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2800/3351 places, 3292/3001 transitions.
Product exploration explored 100000 steps with 50000 reset in 9613 ms.
Product exploration explored 100000 steps with 50000 reset in 9658 ms.
[2021-06-06 02:09:05] [INFO ] Flatten gal took : 76 ms
[2021-06-06 02:09:05] [INFO ] Flatten gal took : 78 ms
[2021-06-06 02:09:05] [INFO ] Time to serialize gal into /tmp/LTL8370882034171835464.gal : 10 ms
[2021-06-06 02:09:05] [INFO ] Time to serialize properties into /tmp/LTL13114694915853902838.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL8370882034171835464.gal, -t, CGAL, -LTL, /tmp/LTL13114694915853902838.ltl, -c, -stutter-deadlock, --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.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL8370882034171835464.gal -t CGAL -LTL /tmp/LTL13114694915853902838.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F("(p3117!=1)"))))
Formula 0 simplified : !XF"(p3117!=1)"
Detected timeout of ITS tools.
[2021-06-06 02:09:20] [INFO ] Flatten gal took : 72 ms
[2021-06-06 02:09:20] [INFO ] Applying decomposition
[2021-06-06 02:09:20] [INFO ] Flatten gal took : 72 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/graph13868098395775235267.txt, -o, /tmp/graph13868098395775235267.bin, -w, /tmp/graph13868098395775235267.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/graph13868098395775235267.bin, -l, -1, -v, -w, /tmp/graph13868098395775235267.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-06-06 02:09:21] [INFO ] Decomposing Gal with order
[2021-06-06 02:09:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-06-06 02:09:21] [INFO ] Removed a total of 502 redundant transitions.
[2021-06-06 02:09:21] [INFO ] Flatten gal took : 144 ms
[2021-06-06 02:09:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 14 ms.
[2021-06-06 02:09:21] [INFO ] Time to serialize gal into /tmp/LTL1067178919028897515.gal : 23 ms
[2021-06-06 02:09:21] [INFO ] Time to serialize properties into /tmp/LTL8355533515241199680.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL1067178919028897515.gal, -t, CGAL, -LTL, /tmp/LTL8355533515241199680.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.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1067178919028897515.gal -t CGAL -LTL /tmp/LTL8355533515241199680.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(F("(i0.u960.p3117!=1)"))))
Formula 0 simplified : !XF"(i0.u960.p3117!=1)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6298121412150954233
[2021-06-06 02:09:36] [INFO ] Built C files in 41ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6298121412150954233
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/ltsmin6298121412150954233]
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/ltsmin6298121412150954233] 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/ltsmin6298121412150954233] 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)
Treatment of property ShieldPPPt-PT-050B-12 finished in 70493 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 3 out of 3360 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3360/3360 places, 3010/3010 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 698 transitions
Trivial Post-agglo rules discarded 698 transitions
Performed 698 trivial Post agglomeration. Transition count delta: 698
Iterating post reduction 0 with 698 rules applied. Total rules applied 698 place count 3359 transition count 2311
Reduce places removed 698 places and 0 transitions.
Iterating post reduction 1 with 698 rules applied. Total rules applied 1396 place count 2661 transition count 2311
Performed 398 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 398 Pre rules applied. Total rules applied 1396 place count 2661 transition count 1913
Deduced a syphon composed of 398 places in 3 ms
Reduce places removed 398 places and 0 transitions.
Iterating global reduction 2 with 796 rules applied. Total rules applied 2192 place count 2263 transition count 1913
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 2200 place count 2255 transition count 1905
Iterating global reduction 2 with 8 rules applied. Total rules applied 2208 place count 2255 transition count 1905
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 2208 place count 2255 transition count 1899
Deduced a syphon composed of 6 places in 3 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 2220 place count 2249 transition count 1899
Performed 843 Post agglomeration using F-continuation condition.Transition count delta: 843
Deduced a syphon composed of 843 places in 1 ms
Reduce places removed 843 places and 0 transitions.
Iterating global reduction 2 with 1686 rules applied. Total rules applied 3906 place count 1406 transition count 1056
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3907 place count 1406 transition count 1055
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3909 place count 1405 transition count 1054
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 4111 place count 1304 transition count 1054
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 48 places in 2 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 4207 place count 1256 transition count 1054
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 4208 place count 1255 transition count 1053
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 4209 place count 1254 transition count 1053
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 4209 place count 1254 transition count 1051
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 4213 place count 1252 transition count 1051
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 4214 place count 1251 transition count 1050
Applied a total of 4214 rules in 742 ms. Remains 1251 /3360 variables (removed 2109) and now considering 1050/3010 (removed 1960) transitions.
// Phase 1: matrix 1050 rows 1251 cols
[2021-06-06 02:09:38] [INFO ] Computed 550 place invariants in 4 ms
[2021-06-06 02:09:39] [INFO ] Implicit Places using invariants in 696 ms returned [1234, 1238]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 698 ms to find 2 implicit places.
[2021-06-06 02:09:39] [INFO ] Redundant transitions in 11 ms returned []
// Phase 1: matrix 1050 rows 1249 cols
[2021-06-06 02:09:39] [INFO ] Computed 548 place invariants in 2 ms
[2021-06-06 02:09:39] [INFO ] Dead Transitions using invariants and state equation in 577 ms returned []
Starting structural reductions, iteration 1 : 1249/3360 places, 1050/3010 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1247 transition count 1048
Applied a total of 4 rules in 61 ms. Remains 1247 /1249 variables (removed 2) and now considering 1048/1050 (removed 2) transitions.
// Phase 1: matrix 1048 rows 1247 cols
[2021-06-06 02:09:39] [INFO ] Computed 548 place invariants in 4 ms
[2021-06-06 02:09:40] [INFO ] Implicit Places using invariants in 647 ms returned []
// Phase 1: matrix 1048 rows 1247 cols
[2021-06-06 02:09:40] [INFO ] Computed 548 place invariants in 1 ms
[2021-06-06 02:09:41] [INFO ] State equation strengthened by 7 read => feed constraints.
[2021-06-06 02:09:41] [INFO ] Implicit Places using invariants and state equation in 1354 ms returned []
Implicit Place search using SMT with State Equation took 2011 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 1247/3360 places, 1048/3010 transitions.
Stuttering acceptance computed with spot in 40 ms :[true, (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-050B-13 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(OR (NEQ s967 1) (NEQ s1002 1) (NEQ s303 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 902 ms.
Product exploration explored 100000 steps with 0 reset in 1094 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 49 ms :[true, (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 859 ms.
Product exploration explored 100000 steps with 0 reset in 1066 ms.
[2021-06-06 02:09:46] [INFO ] Flatten gal took : 71 ms
[2021-06-06 02:09:46] [INFO ] Flatten gal took : 71 ms
[2021-06-06 02:09:46] [INFO ] Time to serialize gal into /tmp/LTL13807033178535909355.gal : 18 ms
[2021-06-06 02:09:46] [INFO ] Time to serialize properties into /tmp/LTL16724876286836382993.ltl : 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-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL13807033178535909355.gal, -t, CGAL, -LTL, /tmp/LTL16724876286836382993.ltl, -c, -stutter-deadlock, --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.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL13807033178535909355.gal -t CGAL -LTL /tmp/LTL16724876286836382993.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G("(((p3004!=1)||(p3114!=1))||(p979!=1))")))
Formula 0 simplified : !G"(((p3004!=1)||(p3114!=1))||(p979!=1))"
Detected timeout of ITS tools.
[2021-06-06 02:10:01] [INFO ] Flatten gal took : 30 ms
[2021-06-06 02:10:01] [INFO ] Applying decomposition
[2021-06-06 02:10:01] [INFO ] Flatten gal took : 46 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/graph10077367142210978695.txt, -o, /tmp/graph10077367142210978695.bin, -w, /tmp/graph10077367142210978695.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/graph10077367142210978695.bin, -l, -1, -v, -w, /tmp/graph10077367142210978695.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-06-06 02:10:01] [INFO ] Decomposing Gal with order
[2021-06-06 02:10:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-06-06 02:10:01] [INFO ] Removed a total of 306 redundant transitions.
[2021-06-06 02:10:01] [INFO ] Flatten gal took : 132 ms
[2021-06-06 02:10:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 296 labels/synchronizations in 19 ms.
[2021-06-06 02:10:01] [INFO ] Time to serialize gal into /tmp/LTL4199425177472532498.gal : 32 ms
[2021-06-06 02:10:01] [INFO ] Time to serialize properties into /tmp/LTL18019561062511225423.ltl : 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-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL4199425177472532498.gal, -t, CGAL, -LTL, /tmp/LTL18019561062511225423.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.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL4199425177472532498.gal -t CGAL -LTL /tmp/LTL18019561062511225423.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((G("(((i21.i0.i1.u313.p3004!=1)||(i21.i1.i1.u322.p3114!=1))||(i6.u98.p979!=1))")))
Formula 0 simplified : !G"(((i21.i0.i1.u313.p3004!=1)||(i21.i1.i1.u322.p3114!=1))||(i6.u98.p979!=1))"
Reverse transition relation is NOT exact ! Due to transitions i0.i0.t0, i0.i0.t1, i0.i0.t2, i0.i0.i1.u1.t802, i0.i1.t3, i0.i1.t4, i0.i1.t5, i0.i1.i2.u10.t807, i1.i0.t6, i1.i0.t7, i1.i0.t8, i1.i0.i2.u18.t812, i1.i1.t9, i1.i1.t10, i1.i1.t11, i1.i1.i1.u26.t817, i2.i0.t12, i2.i0.t13, i2.i0.t14, i2.i0.i2.u34.t822, i2.i1.t15, i2.i1.t16, i2.i1.t17, i2.i1.i1.u42.t827, i3.i0.t18, i3.i0.t19, i3.i0.t20, i3.i0.i2.u50.t832, i3.i1.t21, i3.i1.t22, i3.i1.t23, i3.i1.i1.u58.t837, i4.i0.t24, i4.i0.t25, i4.i0.t26, i4.i0.i2.u66.t842, i4.i1.t27, i4.i1.t28, i4.i1.t29, i4.i1.i1.u74.t847, i5.i0.t30, i5.i0.t31, i5.i0.t32, i5.i0.i1.u82.t852, i5.i1.t33, i5.i1.t34, i5.i1.t35, i5.i1.i2.u90.t857, i6.t864, i6.t38, i6.t37, i6.t36, i6.u99.t863, i7.i0.t39, i7.i0.t40, i7.i0.t41, i7.i0.i2.u107.t870, i7.i1.t42, i7.i1.t43, i7.i1.t44, i7.i1.i1.u115.t875, i8.i0.t45, i8.i0.t46, i8.i0.t47, i8.i0.i2.u123.t880, i8.i1.t48, i8.i1.t49, i8.i1.t50, i8.i1.i2.u131.t885, i9.i0.t51, i9.i0.t52, i9.i0.t53, i9.i0.i2.u139.t890, i9.i1.t54, i9.i1.t55, i9.i1.t56, i9.i1.i2.u147.t894, i10.i0.t57, i10.i0.t58, i10.i0.t59, i10.i0.i2.u155.t899, i10.i1.t60, i10.i1.t61, i10.i1.t62, i10.i1.i1.u163.t905, i11.t65, i11.t64, i11.t63, i11.u171.t910, i12.i0.t66, i12.i0.t67, i12.i0.t68, i12.i0.i2.u179.t915, i12.i1.t69, i12.i1.t70, i12.i1.t71, i12.i1.i2.u187.t920, i13.i0.t72, i13.i0.t73, i13.i0.t74, i13.i0.i2.u195.t925, i13.i1.t75, i13.i1.t76, i13.i1.t77, i13.i1.i2.u203.t930, i14.i0.t78, i14.i0.t79, i14.i0.t80, i14.i0.i2.u211.t935, i14.i1.t81, i14.i1.t82, i14.i1.t83, i14.i1.i1.u219.t940, i15.t86, i15.t85, i15.t84, i15.u227.t945, i16.i0.t87, i16.i0.t88, i16.i0.t89, i16.i0.i1.u235.t950, i16.i1.t90, i16.i1.t91, i16.i1.t92, i16.i1.i1.u243.t955, i17.t95, i17.t94, i17.t93, i17.u251.t960, i18.i0.t96, i18.i0.t97, i18.i0.t98, i18.i0.i2.u259.t965, i18.i1.t99, i18.i1.t100, i18.i1.t101, i18.i1.i2.u267.t970, i19.i0.t102, i19.i0.t103, i19.i0.t104, i19.i0.i1.u275.t975, i19.i1.t105, i19.i1.t106, i19.i1.t107, i19.i1.i2.u283.t980, i20.i0.t108, i20.i0.t109, i20.i0.t110, i20.i0.i1.u291.t985, i20.i1.t111, i20.i1.t112, i20.i1.t113, i20.i1.i2.u299.t990, i21.i0.t991, i21.i1.t117, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/693/155/848
Computing Next relation with stutter on 3.73747e+82 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4265389783350001053
[2021-06-06 02:10:16] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4265389783350001053
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/ltsmin4265389783350001053]
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/ltsmin4265389783350001053] 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/ltsmin4265389783350001053] 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)
Treatment of property ShieldPPPt-PT-050B-13 finished in 40171 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 3360 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3360/3360 places, 3010/3010 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 701 transitions
Trivial Post-agglo rules discarded 701 transitions
Performed 701 trivial Post agglomeration. Transition count delta: 701
Iterating post reduction 0 with 701 rules applied. Total rules applied 701 place count 3359 transition count 2308
Reduce places removed 701 places and 0 transitions.
Iterating post reduction 1 with 701 rules applied. Total rules applied 1402 place count 2658 transition count 2308
Performed 396 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 396 Pre rules applied. Total rules applied 1402 place count 2658 transition count 1912
Deduced a syphon composed of 396 places in 3 ms
Reduce places removed 396 places and 0 transitions.
Iterating global reduction 2 with 792 rules applied. Total rules applied 2194 place count 2262 transition count 1912
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 2202 place count 2254 transition count 1904
Iterating global reduction 2 with 8 rules applied. Total rules applied 2210 place count 2254 transition count 1904
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 2210 place count 2254 transition count 1898
Deduced a syphon composed of 6 places in 3 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 2222 place count 2248 transition count 1898
Performed 844 Post agglomeration using F-continuation condition.Transition count delta: 844
Deduced a syphon composed of 844 places in 1 ms
Reduce places removed 844 places and 0 transitions.
Iterating global reduction 2 with 1688 rules applied. Total rules applied 3910 place count 1404 transition count 1054
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3911 place count 1404 transition count 1053
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3913 place count 1403 transition count 1052
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 4115 place count 1302 transition count 1052
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 48 places in 2 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 4211 place count 1254 transition count 1052
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 4212 place count 1253 transition count 1051
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 4213 place count 1252 transition count 1051
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 4213 place count 1252 transition count 1049
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 4217 place count 1250 transition count 1049
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 4218 place count 1249 transition count 1048
Applied a total of 4218 rules in 711 ms. Remains 1249 /3360 variables (removed 2111) and now considering 1048/3010 (removed 1962) transitions.
// Phase 1: matrix 1048 rows 1249 cols
[2021-06-06 02:10:18] [INFO ] Computed 550 place invariants in 3 ms
[2021-06-06 02:10:19] [INFO ] Implicit Places using invariants in 619 ms returned [1232, 1236]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 621 ms to find 2 implicit places.
[2021-06-06 02:10:19] [INFO ] Redundant transitions in 9 ms returned []
// Phase 1: matrix 1048 rows 1247 cols
[2021-06-06 02:10:19] [INFO ] Computed 548 place invariants in 2 ms
[2021-06-06 02:10:19] [INFO ] Dead Transitions using invariants and state equation in 585 ms returned []
Starting structural reductions, iteration 1 : 1247/3360 places, 1048/3010 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1245 transition count 1046
Applied a total of 4 rules in 60 ms. Remains 1245 /1247 variables (removed 2) and now considering 1046/1048 (removed 2) transitions.
// Phase 1: matrix 1046 rows 1245 cols
[2021-06-06 02:10:19] [INFO ] Computed 548 place invariants in 1 ms
[2021-06-06 02:10:20] [INFO ] Implicit Places using invariants in 717 ms returned []
// Phase 1: matrix 1046 rows 1245 cols
[2021-06-06 02:10:20] [INFO ] Computed 548 place invariants in 2 ms
[2021-06-06 02:10:21] [INFO ] State equation strengthened by 3 read => feed constraints.
[2021-06-06 02:10:22] [INFO ] Implicit Places using invariants and state equation in 1495 ms returned []
Implicit Place search using SMT with State Equation took 2214 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 1245/3360 places, 1046/3010 transitions.
Stuttering acceptance computed with spot in 135 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-050B-14 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s353 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 770 ms.
Stack based approach found an accepted trace after 524 steps with 0 reset with depth 525 and stack size 525 in 5 ms.
FORMULA ShieldPPPt-PT-050B-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-050B-14 finished in 5134 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(F(p0)) U p1))], workingDir=/home/mcc/execution]
Support contains 2 out of 3360 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3360/3360 places, 3010/3010 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 700 transitions
Trivial Post-agglo rules discarded 700 transitions
Performed 700 trivial Post agglomeration. Transition count delta: 700
Iterating post reduction 0 with 700 rules applied. Total rules applied 700 place count 3359 transition count 2309
Reduce places removed 700 places and 0 transitions.
Iterating post reduction 1 with 700 rules applied. Total rules applied 1400 place count 2659 transition count 2309
Performed 395 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 395 Pre rules applied. Total rules applied 1400 place count 2659 transition count 1914
Deduced a syphon composed of 395 places in 3 ms
Reduce places removed 395 places and 0 transitions.
Iterating global reduction 2 with 790 rules applied. Total rules applied 2190 place count 2264 transition count 1914
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 2198 place count 2256 transition count 1906
Iterating global reduction 2 with 8 rules applied. Total rules applied 2206 place count 2256 transition count 1906
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 2206 place count 2256 transition count 1900
Deduced a syphon composed of 6 places in 3 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 2218 place count 2250 transition count 1900
Performed 845 Post agglomeration using F-continuation condition.Transition count delta: 845
Deduced a syphon composed of 845 places in 1 ms
Reduce places removed 845 places and 0 transitions.
Iterating global reduction 2 with 1690 rules applied. Total rules applied 3908 place count 1405 transition count 1055
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3909 place count 1405 transition count 1054
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3911 place count 1404 transition count 1053
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 4113 place count 1303 transition count 1053
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 47 places in 2 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 4207 place count 1256 transition count 1053
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 4208 place count 1255 transition count 1052
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 4209 place count 1254 transition count 1052
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 4209 place count 1254 transition count 1050
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 4213 place count 1252 transition count 1050
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 4214 place count 1251 transition count 1049
Applied a total of 4214 rules in 794 ms. Remains 1251 /3360 variables (removed 2109) and now considering 1049/3010 (removed 1961) transitions.
// Phase 1: matrix 1049 rows 1251 cols
[2021-06-06 02:10:23] [INFO ] Computed 550 place invariants in 4 ms
[2021-06-06 02:10:24] [INFO ] Implicit Places using invariants in 676 ms returned [1234, 1238]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 677 ms to find 2 implicit places.
[2021-06-06 02:10:24] [INFO ] Redundant transitions in 10 ms returned []
// Phase 1: matrix 1049 rows 1249 cols
[2021-06-06 02:10:24] [INFO ] Computed 548 place invariants in 4 ms
[2021-06-06 02:10:25] [INFO ] Dead Transitions using invariants and state equation in 581 ms returned []
Starting structural reductions, iteration 1 : 1249/3360 places, 1049/3010 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1247 transition count 1047
Applied a total of 4 rules in 60 ms. Remains 1247 /1249 variables (removed 2) and now considering 1047/1049 (removed 2) transitions.
// Phase 1: matrix 1047 rows 1247 cols
[2021-06-06 02:10:25] [INFO ] Computed 548 place invariants in 2 ms
[2021-06-06 02:10:25] [INFO ] Implicit Places using invariants in 641 ms returned []
// Phase 1: matrix 1047 rows 1247 cols
[2021-06-06 02:10:25] [INFO ] Computed 548 place invariants in 1 ms
[2021-06-06 02:10:27] [INFO ] Implicit Places using invariants and state equation in 1369 ms returned []
Implicit Place search using SMT with State Equation took 2013 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 1247/3360 places, 1047/3010 transitions.
Stuttering acceptance computed with spot in 146 ms :[(NOT p1), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-050B-15 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 1}, { cond=(NOT p1), acceptance={0} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s776 1) (EQ s1205 1)), p0:(NEQ s1205 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 777 ms.
Product exploration explored 100000 steps with 0 reset in 987 ms.
Knowledge obtained : [(NOT p1), p0]
Stuttering acceptance computed with spot in 123 ms :[(NOT p1), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1 reset in 770 ms.
Product exploration explored 100000 steps with 0 reset in 1036 ms.
[2021-06-06 02:10:31] [INFO ] Flatten gal took : 33 ms
[2021-06-06 02:10:31] [INFO ] Flatten gal took : 33 ms
[2021-06-06 02:10:31] [INFO ] Time to serialize gal into /tmp/LTL14262293047811198546.gal : 4 ms
[2021-06-06 02:10:31] [INFO ] Time to serialize properties into /tmp/LTL1057422119766468203.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL14262293047811198546.gal, -t, CGAL, -LTL, /tmp/LTL1057422119766468203.ltl, -c, -stutter-deadlock, --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.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL14262293047811198546.gal -t CGAL -LTL /tmp/LTL1057422119766468203.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((G(F("(p3755!=1)")))U("((p2424==1)&&(p3755==1))")))
Formula 0 simplified : !(GF"(p3755!=1)" U "((p2424==1)&&(p3755==1))")
Detected timeout of ITS tools.
[2021-06-06 02:10:46] [INFO ] Flatten gal took : 29 ms
[2021-06-06 02:10:46] [INFO ] Applying decomposition
[2021-06-06 02:10:46] [INFO ] Flatten gal took : 29 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/graph10045119916948026318.txt, -o, /tmp/graph10045119916948026318.bin, -w, /tmp/graph10045119916948026318.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/graph10045119916948026318.bin, -l, -1, -v, -w, /tmp/graph10045119916948026318.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-06-06 02:10:46] [INFO ] Decomposing Gal with order
[2021-06-06 02:10:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-06-06 02:10:46] [INFO ] Removed a total of 305 redundant transitions.
[2021-06-06 02:10:46] [INFO ] Flatten gal took : 61 ms
[2021-06-06 02:10:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 296 labels/synchronizations in 11 ms.
[2021-06-06 02:10:46] [INFO ] Time to serialize gal into /tmp/LTL8441295159317241683.gal : 11 ms
[2021-06-06 02:10:46] [INFO ] Time to serialize properties into /tmp/LTL3276958551832124309.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL8441295159317241683.gal, -t, CGAL, -LTL, /tmp/LTL3276958551832124309.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.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL8441295159317241683.gal -t CGAL -LTL /tmp/LTL3276958551832124309.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !(((G(F("(i27.i0.i2.u387.p3755!=1)")))U("((i16.i1.i0.u249.p2424==1)&&(i27.i0.i2.u387.p3755==1))")))
Formula 0 simplified : !(GF"(i27.i0.i2.u387.p3755!=1)" U "((i16.i1.i0.u249.p2424==1)&&(i27.i0.i2.u387.p3755==1))")
Reverse transition relation is NOT exact ! Due to transitions i0.i0.t0, i0.i0.t1, i0.i0.t2, i0.i0.i2.u1.t802, i0.i1.t3, i0.i1.t4, i0.i1.t5, i0.i1.i2.u10.t807, i1.i0.t6, i1.i0.t7, i1.i0.t8, i1.i0.i2.u18.t812, i1.i1.t9, i1.i1.t10, i1.i1.t11, i1.i1.i1.u26.t817, i2.i0.t12, i2.i0.t13, i2.i0.t14, i2.i0.i2.u34.t822, i2.i1.t15, i2.i1.t16, i2.i1.t17, i2.i1.i2.u42.t827, i3.t20, i3.t19, i3.t18, i3.u50.t832, i4.i0.t21, i4.i0.t22, i4.i0.t23, i4.i0.i2.u58.t837, i4.i1.t24, i4.i1.t25, i4.i1.t26, i4.i1.i2.u66.t842, i5.i0.t27, i5.i0.t28, i5.i0.t29, i5.i0.i1.u74.t847, i5.i1.t30, i5.i1.t31, i5.i1.t32, i5.i1.i2.u82.t852, i6.i0.t33, i6.i0.t34, i6.i0.t35, i6.i0.i2.u90.t857, i6.i1.t36, i6.i1.t37, i6.i1.t38, i6.i1.i2.u98.t862, i7.t41, i7.t40, i7.t39, i7.u106.t867, i8.i0.t42, i8.i0.t43, i8.i0.t44, i8.i0.i2.u114.t872, i8.i1.t45, i8.i1.t46, i8.i1.t47, i8.i1.i2.u122.t877, i9.i0.t48, i9.i0.t49, i9.i0.t50, i9.i0.i2.u130.t882, i9.i1.t51, i9.i1.t52, i9.i1.t53, i9.i1.i2.u138.t887, i10.i0.t54, i10.i0.t55, i10.i0.t56, i10.i0.i1.u146.t891, i10.i1.t57, i10.i1.t58, i10.i1.t59, i10.i1.i2.u154.t896, i11.t62, i11.t61, i11.t60, i11.u162.t902, i12.i0.t63, i12.i0.t64, i12.i0.t65, i12.i0.i2.u170.t907, i12.i1.t66, i12.i1.t67, i12.i1.t68, i12.i1.i1.u178.t912, i13.i0.t69, i13.i0.t70, i13.i0.t71, i13.i0.i2.u186.t917, i13.i1.t72, i13.i1.t73, i13.i1.t74, i13.i1.i2.u194.t922, i14.i0.t75, i14.i0.t76, i14.i0.t77, i14.i0.i2.u202.t927, i14.i1.t78, i14.i1.t79, i14.i1.t80, i14.i1.i1.u210.t932, i15.i0.t81, i15.i0.t82, i15.i0.t83, i15.i0.i2.u218.t937, i15.i1.t84, i15.i1.t85, i15.i1.t86, i15.i1.i2.u226.t942, i16.i0.t87, i16.i0.t88, i16.i0.t89, i16.i0.i2.u234.t947, i16.i1.t91, i16.i1.i0.t90, i16.i1.i0.u249.t954, i16.i1.i1.t92, i16.i1.i1.u242.t952, i17.i0.t93, i17.i0.t94, i17.i0.t95, i17.i0.i2.u251.t959, i17.i1.t96, i17.i1.t97, i17.i1.t98, i17.i1.i2.u259.t964, i18.t101, i18.t100, i18.t99, i18.u267.t969, i19.i0.t102, i19.i0.t103, i19.i0.t104, i19.i0.i2.u275.t974, i19.i1.t105, i19.i1.t106, i19.i1.t107, i19.i1.i2.u283.t979, i20.i0.t108, i20.i0.t109, i20.i0.t110, i20.i0.i2.u291.t984, i20.i1.t111, i20.i1.t112, i20.i1.t113, i20.i1.i2.u299.t989, i21.t116, i21.t115, i21.t114, i21.u307.t994, i22.i0.t117, i22.i0.t118, i22.i0.t119, i22.i0.i2.u315.t999, i22.i1.t120, i22.i1.t121, i22.i1.t122, i22.i1.i2.u323.t1004, i23.i0.t123, i23.i0.t124, i23.i0.t125, i23.i0.i1.u331.t1009, i23.i1.t126, i23.i1.t127, i23.i1.t128, i23.i1.i2.u339.t1014, i24.t131, i24.t130, i24.t129, i24.u347.t1019, i25.i0.t132, i25.i0.t133, i25.i0.t134, i25.i0.i2.u355.t1024, i25.i1.t135, i25.i1.t136, i25.i1.t137, i25.i1.i2.u363.t1029, i26.i0.t138, i26.i0.t139, i26.i0.t140, i26.i0.i2.u371.t1034, i26.i1.t141, i26.i1.t142, i26.i1.t143, i26.i1.i2.u379.t1039, i27.i0.t149, i27.i0.i2.t1040, i27.i1.i1.t785_t783_t777_t1050_t148, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/651/196/847
Computing Next relation with stutter on 3.73747e+82 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1376876554006630870
[2021-06-06 02:11:01] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1376876554006630870
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/ltsmin1376876554006630870]
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/ltsmin1376876554006630870] 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/ltsmin1376876554006630870] 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)
Treatment of property ShieldPPPt-PT-050B-15 finished in 39603 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin7747371382310129366
[2021-06-06 02:11:02] [INFO ] Too many transitions (3010) to apply POR reductions. Disabling POR matrices.
[2021-06-06 02:11:02] [INFO ] Applying decomposition
[2021-06-06 02:11:02] [INFO ] Flatten gal took : 69 ms
[2021-06-06 02:11:02] [INFO ] Built C files in 126ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7747371382310129366
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/ltsmin7747371382310129366]
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/graph3643477094175697334.txt, -o, /tmp/graph3643477094175697334.bin, -w, /tmp/graph3643477094175697334.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/graph3643477094175697334.bin, -l, -1, -v, -w, /tmp/graph3643477094175697334.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-06-06 02:11:03] [INFO ] Decomposing Gal with order
[2021-06-06 02:11:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-06-06 02:11:03] [INFO ] Removed a total of 492 redundant transitions.
[2021-06-06 02:11:03] [INFO ] Flatten gal took : 127 ms
[2021-06-06 02:11:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 9 ms.
[2021-06-06 02:11:03] [INFO ] Time to serialize gal into /tmp/LTLFireability8552666516447390840.gal : 22 ms
[2021-06-06 02:11:03] [INFO ] Time to serialize properties into /tmp/LTLFireability6089709616932372894.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTLFireability8552666516447390840.gal, -t, CGAL, -LTL, /tmp/LTLFireability6089709616932372894.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.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireability8552666516447390840.gal -t CGAL -LTL /tmp/LTLFireability6089709616932372894.ltl -c -stutter-deadlock
Read 4 LTL properties
Checking formula 0 : !((X(F(("((i35.i3.i0.u777.p2528==0)||(i35.i3.i2.u788.p2564==0))")&&(G((("(i35.i2.i2.u794.p2583==1)")&&(F("(i9.u181.p581==1)")))||(F("(i35.i0.i0.u6.p15!=1)"))))))))
Formula 0 simplified : !XF("((i35.i3.i0.u777.p2528==0)||(i35.i3.i2.u788.p2564==0))" & G(("(i35.i2.i2.u794.p2583==1)" & F"(i9.u181.p581==1)") | F"(i35.i0.i0.u6.p15!=1)"))
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/ltsmin7747371382310129366] killed by timeout after 25 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/ltsmin7747371382310129366] killed by timeout after 25 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Detected timeout of ITS tools.
[2021-06-06 02:33:54] [INFO ] Applying decomposition
[2021-06-06 02:33:55] [INFO ] Flatten gal took : 615 ms
[2021-06-06 02:33:55] [INFO ] Decomposing Gal with order
[2021-06-06 02:33:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-06-06 02:33:57] [INFO ] Removed a total of 147 redundant transitions.
[2021-06-06 02:33:57] [INFO ] Flatten gal took : 644 ms
[2021-06-06 02:34:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 574 labels/synchronizations in 296 ms.
[2021-06-06 02:34:01] [INFO ] Time to serialize gal into /tmp/LTLFireability9010497791416846405.gal : 77 ms
[2021-06-06 02:34:01] [INFO ] Time to serialize properties into /tmp/LTLFireability1183609918777303139.ltl : 9 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-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTLFireability9010497791416846405.gal, -t, CGAL, -LTL, /tmp/LTLFireability1183609918777303139.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.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireability9010497791416846405.gal -t CGAL -LTL /tmp/LTLFireability1183609918777303139.ltl -c -stutter-deadlock
Read 4 LTL properties
Checking formula 0 : !((X(F(("((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.i0.i0.i0.i1.u1398.p2528==0)||(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u741.p2564==0))")&&(G((("(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u743.p2583==1)")&&(F("(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u197.p581==1)")))||(F("(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u1491.p15!=1)"))))))))
Formula 0 simplified : !XF("((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.i0.i0.i0.i1.u1398.p2528==0)||(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u741.p2564==0))" & G(("(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u743.p2583==1)" & F"(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u197.p581==1)") | F"(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u1491.p15!=1)"))
Detected timeout of ITS tools.
[2021-06-06 02:56:48] [INFO ] Flatten gal took : 628 ms
[2021-06-06 02:56:57] [INFO ] Input system was already deterministic with 3010 transitions.
[2021-06-06 02:56:58] [INFO ] Transformed 3360 places.
[2021-06-06 02:56:58] [INFO ] Transformed 3010 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2021-06-06 02:56:59] [INFO ] Time to serialize gal into /tmp/LTLFireability12623241145409560165.gal : 28 ms
[2021-06-06 02:56:59] [INFO ] Time to serialize properties into /tmp/LTLFireability14131196673250202303.ltl : 4 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-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTLFireability12623241145409560165.gal, -t, CGAL, -LTL, /tmp/LTLFireability14131196673250202303.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.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireability12623241145409560165.gal -t CGAL -LTL /tmp/LTLFireability14131196673250202303.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 : !((X(F(("((p2528==0)||(p2564==0))")&&(G((("(p2583==1)")&&(F("(p581==1)")))||(F("(p15!=1)"))))))))
Formula 0 simplified : !XF("((p2528==0)||(p2564==0))" & G(("(p2583==1)" & F"(p581==1)") | F"(p15!=1)"))
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -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 LTLFireability -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="ShieldPPPt-PT-050B"
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"
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 itstools"
echo " Input is ShieldPPPt-PT-050B, 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 r216-tall-162098205800907"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPt-PT-050B.tgz
mv ShieldPPPt-PT-050B 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 ;