About the Execution of ITS-Tools for DES-PT-30b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 9420.812 | 3600000.00 | 8050591.00 | 33205.00 | FFTFF?FFFTTFTFFT | 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.r064-tall-162038396700108.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is DES-PT-30b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r064-tall-162038396700108
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 492K
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 127K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 97K May 5 16:58 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.2K Mar 28 15:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 28 15:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 15:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 15:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Mar 23 03:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 23 03:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 22 12:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 22 12:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 4 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 103K May 5 16:51 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 DES-PT-30b-00
FORMULA_NAME DES-PT-30b-01
FORMULA_NAME DES-PT-30b-02
FORMULA_NAME DES-PT-30b-03
FORMULA_NAME DES-PT-30b-04
FORMULA_NAME DES-PT-30b-05
FORMULA_NAME DES-PT-30b-06
FORMULA_NAME DES-PT-30b-07
FORMULA_NAME DES-PT-30b-08
FORMULA_NAME DES-PT-30b-09
FORMULA_NAME DES-PT-30b-10
FORMULA_NAME DES-PT-30b-11
FORMULA_NAME DES-PT-30b-12
FORMULA_NAME DES-PT-30b-13
FORMULA_NAME DES-PT-30b-14
FORMULA_NAME DES-PT-30b-15
=== Now, execution of the tool begins
BK_START 1620473746138
Running Version 0
[2021-05-08 11:35:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -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-05-08 11:35:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-08 11:35:47] [INFO ] Load time of PNML (sax parser for PT used): 63 ms
[2021-05-08 11:35:47] [INFO ] Transformed 399 places.
[2021-05-08 11:35:47] [INFO ] Transformed 350 transitions.
[2021-05-08 11:35:47] [INFO ] Found NUPN structural information;
[2021-05-08 11:35:47] [INFO ] Parsed PT model containing 399 places and 350 transitions in 107 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2021-05-08 11:35:47] [INFO ] Initial state test concluded for 1 properties.
FORMULA DES-PT-30b-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-30b-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-30b-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 39 out of 399 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 399/399 places, 350/350 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 396 transition count 350
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 26 place count 373 transition count 327
Iterating global reduction 1 with 23 rules applied. Total rules applied 49 place count 373 transition count 327
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 63 place count 359 transition count 313
Iterating global reduction 1 with 14 rules applied. Total rules applied 77 place count 359 transition count 313
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 87 place count 359 transition count 303
Applied a total of 87 rules in 83 ms. Remains 359 /399 variables (removed 40) and now considering 303/350 (removed 47) transitions.
// Phase 1: matrix 303 rows 359 cols
[2021-05-08 11:35:47] [INFO ] Computed 62 place invariants in 41 ms
[2021-05-08 11:35:48] [INFO ] Implicit Places using invariants in 308 ms returned []
// Phase 1: matrix 303 rows 359 cols
[2021-05-08 11:35:48] [INFO ] Computed 62 place invariants in 20 ms
[2021-05-08 11:35:48] [INFO ] Implicit Places using invariants and state equation in 392 ms returned []
Implicit Place search using SMT with State Equation took 727 ms to find 0 implicit places.
// Phase 1: matrix 303 rows 359 cols
[2021-05-08 11:35:48] [INFO ] Computed 62 place invariants in 8 ms
[2021-05-08 11:35:48] [INFO ] Dead Transitions using invariants and state equation in 156 ms returned []
Finished structural reductions, in 1 iterations. Remains : 359/399 places, 303/350 transitions.
[2021-05-08 11:35:49] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2021-05-08 11:35:49] [INFO ] Flatten gal took : 54 ms
FORMULA DES-PT-30b-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-30b-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-08 11:35:49] [INFO ] Flatten gal took : 25 ms
[2021-05-08 11:35:49] [INFO ] Input system was already deterministic with 303 transitions.
Incomplete random walk after 100000 steps, including 875 resets, run finished after 398 ms. (steps per millisecond=251 ) properties (out of 20) seen :13
Running SMT prover for 7 properties.
// Phase 1: matrix 303 rows 359 cols
[2021-05-08 11:35:49] [INFO ] Computed 62 place invariants in 8 ms
[2021-05-08 11:35:49] [INFO ] [Real]Absence check using 33 positive place invariants in 13 ms returned sat
[2021-05-08 11:35:49] [INFO ] [Real]Absence check using 33 positive and 29 generalized place invariants in 14 ms returned sat
[2021-05-08 11:35:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 11:35:49] [INFO ] [Real]Absence check using state equation in 113 ms returned sat
[2021-05-08 11:35:49] [INFO ] Computed and/alt/rep : 297/620/297 causal constraints (skipped 5 transitions) in 19 ms.
[2021-05-08 11:35:49] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 11:35:49] [INFO ] [Nat]Absence check using 33 positive place invariants in 9 ms returned sat
[2021-05-08 11:35:49] [INFO ] [Nat]Absence check using 33 positive and 29 generalized place invariants in 12 ms returned sat
[2021-05-08 11:35:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 11:35:50] [INFO ] [Nat]Absence check using state equation in 114 ms returned sat
[2021-05-08 11:35:50] [INFO ] Computed and/alt/rep : 297/620/297 causal constraints (skipped 5 transitions) in 18 ms.
[2021-05-08 11:35:51] [INFO ] Deduced a trap composed of 25 places in 93 ms of which 4 ms to minimize.
[2021-05-08 11:35:51] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 2 ms to minimize.
[2021-05-08 11:35:51] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
[2021-05-08 11:35:51] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 1 ms to minimize.
[2021-05-08 11:35:51] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 1 ms to minimize.
[2021-05-08 11:35:51] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 0 ms to minimize.
[2021-05-08 11:35:51] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 0 ms to minimize.
[2021-05-08 11:35:51] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 1 ms to minimize.
[2021-05-08 11:35:51] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 5 ms to minimize.
[2021-05-08 11:35:51] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 660 ms
[2021-05-08 11:35:51] [INFO ] Added : 202 causal constraints over 42 iterations in 1688 ms. Result :sat
[2021-05-08 11:35:51] [INFO ] [Real]Absence check using 33 positive place invariants in 9 ms returned sat
[2021-05-08 11:35:51] [INFO ] [Real]Absence check using 33 positive and 29 generalized place invariants in 15 ms returned sat
[2021-05-08 11:35:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 11:35:51] [INFO ] [Real]Absence check using state equation in 107 ms returned sat
[2021-05-08 11:35:51] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 11:35:51] [INFO ] [Nat]Absence check using 33 positive place invariants in 11 ms returned sat
[2021-05-08 11:35:52] [INFO ] [Nat]Absence check using 33 positive and 29 generalized place invariants in 20 ms returned sat
[2021-05-08 11:35:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 11:35:52] [INFO ] [Nat]Absence check using state equation in 103 ms returned sat
[2021-05-08 11:35:52] [INFO ] Computed and/alt/rep : 297/620/297 causal constraints (skipped 5 transitions) in 17 ms.
[2021-05-08 11:35:53] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 1 ms to minimize.
[2021-05-08 11:35:53] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 0 ms to minimize.
[2021-05-08 11:35:53] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 1 ms to minimize.
[2021-05-08 11:35:53] [INFO ] Deduced a trap composed of 38 places in 57 ms of which 0 ms to minimize.
[2021-05-08 11:35:53] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 1 ms to minimize.
[2021-05-08 11:35:53] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 1 ms to minimize.
[2021-05-08 11:35:53] [INFO ] Deduced a trap composed of 30 places in 50 ms of which 0 ms to minimize.
[2021-05-08 11:35:53] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 570 ms
[2021-05-08 11:35:53] [INFO ] Added : 234 causal constraints over 47 iterations in 1623 ms. Result :sat
[2021-05-08 11:35:53] [INFO ] [Real]Absence check using 33 positive place invariants in 8 ms returned sat
[2021-05-08 11:35:53] [INFO ] [Real]Absence check using 33 positive and 29 generalized place invariants in 12 ms returned sat
[2021-05-08 11:35:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 11:35:53] [INFO ] [Real]Absence check using state equation in 97 ms returned sat
[2021-05-08 11:35:53] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 11:35:53] [INFO ] [Nat]Absence check using 33 positive place invariants in 7 ms returned unsat
[2021-05-08 11:35:53] [INFO ] [Real]Absence check using 33 positive place invariants in 8 ms returned sat
[2021-05-08 11:35:54] [INFO ] [Real]Absence check using 33 positive and 29 generalized place invariants in 12 ms returned sat
[2021-05-08 11:35:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 11:35:54] [INFO ] [Real]Absence check using state equation in 101 ms returned sat
[2021-05-08 11:35:54] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 11:35:54] [INFO ] [Nat]Absence check using 33 positive place invariants in 8 ms returned sat
[2021-05-08 11:35:54] [INFO ] [Nat]Absence check using 33 positive and 29 generalized place invariants in 13 ms returned sat
[2021-05-08 11:35:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 11:35:54] [INFO ] [Nat]Absence check using state equation in 119 ms returned sat
[2021-05-08 11:35:54] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 0 ms to minimize.
[2021-05-08 11:35:54] [INFO ] Deduced a trap composed of 32 places in 26 ms of which 1 ms to minimize.
[2021-05-08 11:35:54] [INFO ] Deduced a trap composed of 36 places in 26 ms of which 1 ms to minimize.
[2021-05-08 11:35:54] [INFO ] Deduced a trap composed of 39 places in 26 ms of which 0 ms to minimize.
[2021-05-08 11:35:54] [INFO ] Deduced a trap composed of 44 places in 26 ms of which 0 ms to minimize.
[2021-05-08 11:35:54] [INFO ] Deduced a trap composed of 47 places in 26 ms of which 1 ms to minimize.
[2021-05-08 11:35:54] [INFO ] Deduced a trap composed of 45 places in 26 ms of which 0 ms to minimize.
[2021-05-08 11:35:54] [INFO ] Deduced a trap composed of 43 places in 25 ms of which 0 ms to minimize.
[2021-05-08 11:35:54] [INFO ] Deduced a trap composed of 36 places in 24 ms of which 0 ms to minimize.
[2021-05-08 11:35:54] [INFO ] Deduced a trap composed of 30 places in 24 ms of which 0 ms to minimize.
[2021-05-08 11:35:54] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 413 ms
[2021-05-08 11:35:54] [INFO ] Computed and/alt/rep : 297/620/297 causal constraints (skipped 5 transitions) in 14 ms.
[2021-05-08 11:35:55] [INFO ] Deduced a trap composed of 17 places in 16 ms of which 0 ms to minimize.
[2021-05-08 11:35:55] [INFO ] Deduced a trap composed of 16 places in 16 ms of which 0 ms to minimize.
[2021-05-08 11:35:55] [INFO ] Deduced a trap composed of 11 places in 13 ms of which 0 ms to minimize.
[2021-05-08 11:35:55] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 126 ms
[2021-05-08 11:35:55] [INFO ] Added : 236 causal constraints over 48 iterations in 1105 ms. Result :sat
[2021-05-08 11:35:55] [INFO ] [Real]Absence check using 33 positive place invariants in 7 ms returned sat
[2021-05-08 11:35:55] [INFO ] [Real]Absence check using 33 positive and 29 generalized place invariants in 12 ms returned sat
[2021-05-08 11:35:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 11:35:55] [INFO ] [Real]Absence check using state equation in 96 ms returned sat
[2021-05-08 11:35:55] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 11:35:56] [INFO ] [Nat]Absence check using 33 positive place invariants in 8 ms returned sat
[2021-05-08 11:35:56] [INFO ] [Nat]Absence check using 33 positive and 29 generalized place invariants in 12 ms returned sat
[2021-05-08 11:35:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 11:35:56] [INFO ] [Nat]Absence check using state equation in 109 ms returned sat
[2021-05-08 11:35:56] [INFO ] Deduced a trap composed of 11 places in 87 ms of which 1 ms to minimize.
[2021-05-08 11:35:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 99 ms
[2021-05-08 11:35:56] [INFO ] [Real]Absence check using 33 positive place invariants in 8 ms returned sat
[2021-05-08 11:35:56] [INFO ] [Real]Absence check using 33 positive and 29 generalized place invariants in 13 ms returned sat
[2021-05-08 11:35:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 11:35:56] [INFO ] [Real]Absence check using state equation in 107 ms returned sat
[2021-05-08 11:35:56] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 11:35:56] [INFO ] [Nat]Absence check using 33 positive place invariants in 20 ms returned sat
[2021-05-08 11:35:56] [INFO ] [Nat]Absence check using 33 positive and 29 generalized place invariants in 12 ms returned sat
[2021-05-08 11:35:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 11:35:56] [INFO ] [Nat]Absence check using state equation in 87 ms returned sat
[2021-05-08 11:35:56] [INFO ] Computed and/alt/rep : 297/620/297 causal constraints (skipped 5 transitions) in 17 ms.
[2021-05-08 11:35:57] [INFO ] Deduced a trap composed of 33 places in 30 ms of which 0 ms to minimize.
[2021-05-08 11:35:57] [INFO ] Deduced a trap composed of 36 places in 30 ms of which 0 ms to minimize.
[2021-05-08 11:35:57] [INFO ] Deduced a trap composed of 35 places in 30 ms of which 0 ms to minimize.
[2021-05-08 11:35:57] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 162 ms
[2021-05-08 11:35:57] [INFO ] Added : 205 causal constraints over 41 iterations in 1076 ms. Result :sat
[2021-05-08 11:35:57] [INFO ] [Real]Absence check using 33 positive place invariants in 8 ms returned sat
[2021-05-08 11:35:57] [INFO ] [Real]Absence check using 33 positive and 29 generalized place invariants in 13 ms returned sat
[2021-05-08 11:35:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 11:35:57] [INFO ] [Real]Absence check using state equation in 121 ms returned sat
[2021-05-08 11:35:57] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 11:35:57] [INFO ] [Nat]Absence check using 33 positive place invariants in 8 ms returned sat
[2021-05-08 11:35:57] [INFO ] [Nat]Absence check using 33 positive and 29 generalized place invariants in 12 ms returned sat
[2021-05-08 11:35:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 11:35:58] [INFO ] [Nat]Absence check using state equation in 123 ms returned sat
[2021-05-08 11:35:58] [INFO ] Computed and/alt/rep : 297/620/297 causal constraints (skipped 5 transitions) in 17 ms.
[2021-05-08 11:35:59] [INFO ] Added : 288 causal constraints over 58 iterations in 1373 ms. Result :sat
Successfully simplified 2 atomic propositions for a total of 11 simplifications.
[2021-05-08 11:35:59] [INFO ] Initial state test concluded for 1 properties.
FORMULA DES-PT-30b-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((X(p1)&&p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 359 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 359/359 places, 303/303 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 354 transition count 298
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 354 transition count 298
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 13 place count 354 transition count 295
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 353 transition count 294
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 353 transition count 294
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 16 place count 353 transition count 293
Applied a total of 16 rules in 35 ms. Remains 353 /359 variables (removed 6) and now considering 293/303 (removed 10) transitions.
// Phase 1: matrix 293 rows 353 cols
[2021-05-08 11:35:59] [INFO ] Computed 62 place invariants in 4 ms
[2021-05-08 11:35:59] [INFO ] Implicit Places using invariants in 143 ms returned []
// Phase 1: matrix 293 rows 353 cols
[2021-05-08 11:35:59] [INFO ] Computed 62 place invariants in 4 ms
[2021-05-08 11:35:59] [INFO ] Implicit Places using invariants and state equation in 327 ms returned []
Implicit Place search using SMT with State Equation took 473 ms to find 0 implicit places.
// Phase 1: matrix 293 rows 353 cols
[2021-05-08 11:35:59] [INFO ] Computed 62 place invariants in 4 ms
[2021-05-08 11:36:00] [INFO ] Dead Transitions using invariants and state equation in 140 ms returned []
Finished structural reductions, in 1 iterations. Remains : 353/359 places, 293/303 transitions.
Stuttering acceptance computed with spot in 203 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true]
Running random walk in product with property : DES-PT-30b-01 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(OR (EQ s76 0) (EQ s287 1)), p0:(AND (EQ s287 0) (EQ s76 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, 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 1 steps with 0 reset in 1 ms.
FORMULA DES-PT-30b-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-30b-01 finished in 891 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0) U p1))], workingDir=/home/mcc/execution]
Support contains 3 out of 359 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 359/359 places, 303/303 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 358 transition count 286
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 33 place count 342 transition count 285
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 33 place count 342 transition count 273
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 57 place count 330 transition count 273
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 60 place count 327 transition count 270
Iterating global reduction 2 with 3 rules applied. Total rules applied 63 place count 327 transition count 270
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 65 place count 327 transition count 268
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 65 place count 327 transition count 267
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 67 place count 326 transition count 267
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 68 place count 325 transition count 266
Iterating global reduction 3 with 1 rules applied. Total rules applied 69 place count 325 transition count 266
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 70 place count 325 transition count 265
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Deduced a syphon composed of 77 places in 0 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 4 with 154 rules applied. Total rules applied 224 place count 248 transition count 188
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 226 place count 247 transition count 188
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 227 place count 246 transition count 187
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 228 place count 245 transition count 187
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 229 place count 244 transition count 186
Applied a total of 229 rules in 110 ms. Remains 244 /359 variables (removed 115) and now considering 186/303 (removed 117) transitions.
// Phase 1: matrix 186 rows 244 cols
[2021-05-08 11:36:00] [INFO ] Computed 61 place invariants in 4 ms
[2021-05-08 11:36:00] [INFO ] Implicit Places using invariants in 127 ms returned []
// Phase 1: matrix 186 rows 244 cols
[2021-05-08 11:36:00] [INFO ] Computed 61 place invariants in 3 ms
[2021-05-08 11:36:00] [INFO ] Implicit Places using invariants and state equation in 238 ms returned []
Implicit Place search using SMT with State Equation took 367 ms to find 0 implicit places.
[2021-05-08 11:36:00] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 186 rows 244 cols
[2021-05-08 11:36:00] [INFO ] Computed 61 place invariants in 3 ms
[2021-05-08 11:36:00] [INFO ] Dead Transitions using invariants and state equation in 99 ms returned []
Finished structural reductions, in 1 iterations. Remains : 244/359 places, 186/303 transitions.
Stuttering acceptance computed with spot in 57 ms :[(NOT p1), true, (NOT p0)]
Running random walk in product with property : DES-PT-30b-02 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: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(EQ s170 0), p0:(OR (EQ s130 0) (EQ s5 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]]
Initial state of product has no viable successors after 0 steps with 0 reset in 1 ms.
FORMULA DES-PT-30b-02 TRUE TECHNIQUES STRUCTURAL INITIAL_STATE
Treatment of property DES-PT-30b-02 finished in 653 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 359 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 359/359 places, 303/303 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 358 transition count 285
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 35 place count 341 transition count 284
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 35 place count 341 transition count 273
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 57 place count 330 transition count 273
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 60 place count 327 transition count 270
Iterating global reduction 2 with 3 rules applied. Total rules applied 63 place count 327 transition count 270
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 65 place count 327 transition count 268
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 65 place count 327 transition count 267
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 67 place count 326 transition count 267
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 68 place count 325 transition count 266
Iterating global reduction 3 with 1 rules applied. Total rules applied 69 place count 325 transition count 266
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 70 place count 325 transition count 265
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Deduced a syphon composed of 77 places in 1 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 4 with 154 rules applied. Total rules applied 224 place count 248 transition count 188
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 4 with 4 rules applied. Total rules applied 228 place count 246 transition count 190
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 229 place count 245 transition count 189
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 230 place count 244 transition count 189
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 231 place count 243 transition count 188
Applied a total of 231 rules in 93 ms. Remains 243 /359 variables (removed 116) and now considering 188/303 (removed 115) transitions.
// Phase 1: matrix 188 rows 243 cols
[2021-05-08 11:36:01] [INFO ] Computed 61 place invariants in 2 ms
[2021-05-08 11:36:01] [INFO ] Implicit Places using invariants in 125 ms returned []
// Phase 1: matrix 188 rows 243 cols
[2021-05-08 11:36:01] [INFO ] Computed 61 place invariants in 3 ms
[2021-05-08 11:36:01] [INFO ] Implicit Places using invariants and state equation in 247 ms returned []
Implicit Place search using SMT with State Equation took 375 ms to find 0 implicit places.
[2021-05-08 11:36:01] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 188 rows 243 cols
[2021-05-08 11:36:01] [INFO ] Computed 61 place invariants in 3 ms
[2021-05-08 11:36:01] [INFO ] Dead Transitions using invariants and state equation in 98 ms returned []
Finished structural reductions, in 1 iterations. Remains : 243/359 places, 188/303 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-30b-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s139 0) (EQ s173 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 5159 reset in 337 ms.
Product exploration explored 100000 steps with 5139 reset in 301 ms.
Graph (complete) has 782 edges and 243 vertex of which 239 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 44 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 5060 reset in 236 ms.
Product exploration explored 100000 steps with 5146 reset in 250 ms.
[2021-05-08 11:36:02] [INFO ] Flatten gal took : 18 ms
[2021-05-08 11:36:02] [INFO ] Flatten gal took : 17 ms
[2021-05-08 11:36:02] [INFO ] Time to serialize gal into /tmp/LTL16065874938744967583.gal : 8 ms
[2021-05-08 11:36:02] [INFO ] Time to serialize properties into /tmp/LTL11794322205636932641.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/LTL16065874938744967583.gal, -t, CGAL, -LTL, /tmp/LTL11794322205636932641.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/LTL16065874938744967583.gal -t CGAL -LTL /tmp/LTL11794322205636932641.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G(F("((p202==0)||(p285==1))"))))
Formula 0 simplified : !GF"((p202==0)||(p285==1))"
Detected timeout of ITS tools.
[2021-05-08 11:36:17] [INFO ] Flatten gal took : 16 ms
[2021-05-08 11:36:17] [INFO ] Applying decomposition
[2021-05-08 11:36:17] [INFO ] Flatten gal took : 15 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/graph16683657607413502100.txt, -o, /tmp/graph16683657607413502100.bin, -w, /tmp/graph16683657607413502100.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/graph16683657607413502100.bin, -l, -1, -v, -w, /tmp/graph16683657607413502100.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-08 11:36:18] [INFO ] Decomposing Gal with order
[2021-05-08 11:36:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-08 11:36:18] [INFO ] Removed a total of 47 redundant transitions.
[2021-05-08 11:36:18] [INFO ] Flatten gal took : 42 ms
[2021-05-08 11:36:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 17 labels/synchronizations in 6 ms.
[2021-05-08 11:36:18] [INFO ] Time to serialize gal into /tmp/LTL2191681831250177583.gal : 5 ms
[2021-05-08 11:36:18] [INFO ] Time to serialize properties into /tmp/LTL9756477108487263083.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/LTL2191681831250177583.gal, -t, CGAL, -LTL, /tmp/LTL9756477108487263083.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/LTL2191681831250177583.gal -t CGAL -LTL /tmp/LTL9756477108487263083.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((G(F("((i1.i0.u6.p202==0)||(i7.i1.u18.p285==1))"))))
Formula 0 simplified : !GF"((i1.i0.u6.p202==0)||(i7.i1.u18.p285==1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10566571769171717905
[2021-05-08 11:36:33] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10566571769171717905
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/ltsmin10566571769171717905]
Compilation finished in 963 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin10566571769171717905]
Link finished in 38 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, [](<>((LTLAPp0==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin10566571769171717905]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DES-PT-30b-03 finished in 47190 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0) U X((X(p2)&&p1))))], workingDir=/home/mcc/execution]
Support contains 4 out of 359 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 359/359 places, 303/303 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 355 transition count 299
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 355 transition count 299
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 11 place count 355 transition count 296
Applied a total of 11 rules in 11 ms. Remains 355 /359 variables (removed 4) and now considering 296/303 (removed 7) transitions.
// Phase 1: matrix 296 rows 355 cols
[2021-05-08 11:36:48] [INFO ] Computed 62 place invariants in 4 ms
[2021-05-08 11:36:48] [INFO ] Implicit Places using invariants in 151 ms returned []
// Phase 1: matrix 296 rows 355 cols
[2021-05-08 11:36:48] [INFO ] Computed 62 place invariants in 4 ms
[2021-05-08 11:36:48] [INFO ] Implicit Places using invariants and state equation in 341 ms returned []
Implicit Place search using SMT with State Equation took 494 ms to find 0 implicit places.
// Phase 1: matrix 296 rows 355 cols
[2021-05-08 11:36:48] [INFO ] Computed 62 place invariants in 4 ms
[2021-05-08 11:36:48] [INFO ] Dead Transitions using invariants and state equation in 147 ms returned []
Finished structural reductions, in 1 iterations. Remains : 355/359 places, 296/303 transitions.
Stuttering acceptance computed with spot in 161 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), true, (NOT p2), (NOT p0), (NOT p2)]
Running random walk in product with property : DES-PT-30b-04 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}, { cond=p1, acceptance={} source=1 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 5}, { cond=(AND p0 p1), acceptance={0} source=2 dest: 6}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 3}], [{ cond=(NOT p0), acceptance={} source=5 dest: 3}, { cond=p0, acceptance={} source=5 dest: 5}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=6 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=6 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={0} source=6 dest: 5}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(OR (EQ s331 0) (EQ s140 1)), p1:(AND (NEQ s49 0) (NEQ s301 1)), p2:(AND (NEQ s49 0) (NEQ s301 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 7453 steps with 66 reset in 18 ms.
FORMULA DES-PT-30b-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-30b-04 finished in 848 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 359 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 359/359 places, 303/303 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 358 transition count 285
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 35 place count 341 transition count 284
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 35 place count 341 transition count 272
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 59 place count 329 transition count 272
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 61 place count 327 transition count 270
Iterating global reduction 2 with 2 rules applied. Total rules applied 63 place count 327 transition count 270
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 65 place count 327 transition count 268
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 65 place count 327 transition count 267
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 67 place count 326 transition count 267
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Deduced a syphon composed of 77 places in 1 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 3 with 154 rules applied. Total rules applied 221 place count 249 transition count 190
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 225 place count 247 transition count 195
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 226 place count 246 transition count 194
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 227 place count 245 transition count 194
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 228 place count 244 transition count 193
Applied a total of 228 rules in 54 ms. Remains 244 /359 variables (removed 115) and now considering 193/303 (removed 110) transitions.
// Phase 1: matrix 193 rows 244 cols
[2021-05-08 11:36:49] [INFO ] Computed 61 place invariants in 3 ms
[2021-05-08 11:36:49] [INFO ] Implicit Places using invariants in 125 ms returned []
// Phase 1: matrix 193 rows 244 cols
[2021-05-08 11:36:49] [INFO ] Computed 61 place invariants in 5 ms
[2021-05-08 11:36:49] [INFO ] Implicit Places using invariants and state equation in 241 ms returned []
Implicit Place search using SMT with State Equation took 366 ms to find 0 implicit places.
[2021-05-08 11:36:49] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 193 rows 244 cols
[2021-05-08 11:36:49] [INFO ] Computed 61 place invariants in 3 ms
[2021-05-08 11:36:49] [INFO ] Dead Transitions using invariants and state equation in 102 ms returned []
Finished structural reductions, in 1 iterations. Remains : 244/359 places, 193/303 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-30b-05 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s225 0) (EQ s127 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 5303 reset in 235 ms.
Product exploration explored 100000 steps with 5360 reset in 295 ms.
Graph (complete) has 820 edges and 244 vertex of which 240 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 42 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 5267 reset in 245 ms.
Product exploration explored 100000 steps with 5308 reset in 261 ms.
[2021-05-08 11:36:50] [INFO ] Flatten gal took : 18 ms
[2021-05-08 11:36:50] [INFO ] Flatten gal took : 14 ms
[2021-05-08 11:36:50] [INFO ] Time to serialize gal into /tmp/LTL5026164962667985258.gal : 2 ms
[2021-05-08 11:36:50] [INFO ] Time to serialize properties into /tmp/LTL12090297205934449595.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/LTL5026164962667985258.gal, -t, CGAL, -LTL, /tmp/LTL12090297205934449595.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/LTL5026164962667985258.gal -t CGAL -LTL /tmp/LTL12090297205934449595.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G(F("((p370==0)||(p146==1))"))))
Formula 0 simplified : !GF"((p370==0)||(p146==1))"
Detected timeout of ITS tools.
[2021-05-08 11:37:05] [INFO ] Flatten gal took : 13 ms
[2021-05-08 11:37:05] [INFO ] Applying decomposition
[2021-05-08 11:37:05] [INFO ] Flatten gal took : 13 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/graph10425907245643297449.txt, -o, /tmp/graph10425907245643297449.bin, -w, /tmp/graph10425907245643297449.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/graph10425907245643297449.bin, -l, -1, -v, -w, /tmp/graph10425907245643297449.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-08 11:37:05] [INFO ] Decomposing Gal with order
[2021-05-08 11:37:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-08 11:37:05] [INFO ] Removed a total of 63 redundant transitions.
[2021-05-08 11:37:05] [INFO ] Flatten gal took : 21 ms
[2021-05-08 11:37:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 20 labels/synchronizations in 2 ms.
[2021-05-08 11:37:05] [INFO ] Time to serialize gal into /tmp/LTL9898865064745562161.gal : 2 ms
[2021-05-08 11:37:05] [INFO ] Time to serialize properties into /tmp/LTL8068306073742347509.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/LTL9898865064745562161.gal, -t, CGAL, -LTL, /tmp/LTL8068306073742347509.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/LTL9898865064745562161.gal -t CGAL -LTL /tmp/LTL8068306073742347509.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((G(F("((i0.u43.p370==0)||(i0.u1.p146==1))"))))
Formula 0 simplified : !GF"((i0.u43.p370==0)||(i0.u1.p146==1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6844337100162610029
[2021-05-08 11:37:20] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6844337100162610029
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/ltsmin6844337100162610029]
Compilation finished in 933 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin6844337100162610029]
Link finished in 31 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, [](<>((LTLAPp0==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin6844337100162610029]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DES-PT-30b-05 finished in 46897 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((X(X(G(p1)))||p0)))], workingDir=/home/mcc/execution]
Support contains 4 out of 359 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 359/359 places, 303/303 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 355 transition count 299
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 355 transition count 299
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 10 place count 355 transition count 297
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 354 transition count 296
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 354 transition count 296
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 354 transition count 295
Applied a total of 13 rules in 17 ms. Remains 354 /359 variables (removed 5) and now considering 295/303 (removed 8) transitions.
// Phase 1: matrix 295 rows 354 cols
[2021-05-08 11:37:35] [INFO ] Computed 62 place invariants in 3 ms
[2021-05-08 11:37:36] [INFO ] Implicit Places using invariants in 139 ms returned []
// Phase 1: matrix 295 rows 354 cols
[2021-05-08 11:37:36] [INFO ] Computed 62 place invariants in 3 ms
[2021-05-08 11:37:36] [INFO ] Implicit Places using invariants and state equation in 318 ms returned []
Implicit Place search using SMT with State Equation took 457 ms to find 0 implicit places.
// Phase 1: matrix 295 rows 354 cols
[2021-05-08 11:37:36] [INFO ] Computed 62 place invariants in 3 ms
[2021-05-08 11:37:36] [INFO ] Dead Transitions using invariants and state equation in 152 ms returned []
Finished structural reductions, in 1 iterations. Remains : 354/359 places, 295/303 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), true, (NOT p1)]
Running random walk in product with property : DES-PT-30b-08 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(OR (EQ s281 0) (EQ s195 1)), p1:(AND (EQ s102 0) (EQ s311 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 63 steps with 0 reset in 0 ms.
FORMULA DES-PT-30b-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-30b-08 finished in 707 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X((p0 U p1))))], workingDir=/home/mcc/execution]
Support contains 4 out of 359 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 359/359 places, 303/303 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 355 transition count 299
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 355 transition count 299
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 10 place count 355 transition count 297
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 354 transition count 296
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 354 transition count 296
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 354 transition count 295
Applied a total of 13 rules in 17 ms. Remains 354 /359 variables (removed 5) and now considering 295/303 (removed 8) transitions.
// Phase 1: matrix 295 rows 354 cols
[2021-05-08 11:37:36] [INFO ] Computed 62 place invariants in 3 ms
[2021-05-08 11:37:36] [INFO ] Implicit Places using invariants in 145 ms returned []
// Phase 1: matrix 295 rows 354 cols
[2021-05-08 11:37:36] [INFO ] Computed 62 place invariants in 4 ms
[2021-05-08 11:37:37] [INFO ] Implicit Places using invariants and state equation in 336 ms returned []
Implicit Place search using SMT with State Equation took 483 ms to find 0 implicit places.
// Phase 1: matrix 295 rows 354 cols
[2021-05-08 11:37:37] [INFO ] Computed 62 place invariants in 4 ms
[2021-05-08 11:37:37] [INFO ] Dead Transitions using invariants and state equation in 135 ms returned []
Finished structural reductions, in 1 iterations. Remains : 354/359 places, 295/303 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : DES-PT-30b-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}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=3, aps=[p1:(OR (EQ s67 0) (EQ s145 1)), p0:(OR (EQ s78 0) (EQ s303 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, null][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 239 ms.
Product exploration explored 100000 steps with 33333 reset in 254 ms.
Graph (complete) has 768 edges and 354 vertex of which 348 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Knowledge obtained : [p1, p0]
Stuttering acceptance computed with spot in 69 ms :[(NOT p1), (NOT p1), true, (NOT p1)]
Product exploration explored 100000 steps with 33333 reset in 235 ms.
Product exploration explored 100000 steps with 33333 reset in 241 ms.
Applying partial POR strategy [true, false, true, false]
Stuttering acceptance computed with spot in 71 ms :[(NOT p1), (NOT p1), true, (NOT p1)]
Support contains 4 out of 354 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 354/354 places, 295/295 transitions.
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 354 transition count 295
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 9 Pre rules applied. Total rules applied 16 place count 354 transition count 325
Deduced a syphon composed of 25 places in 0 ms
Iterating global reduction 1 with 9 rules applied. Total rules applied 25 place count 354 transition count 325
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 30 place count 349 transition count 320
Deduced a syphon composed of 20 places in 1 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 35 place count 349 transition count 320
Performed 79 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 99 places in 0 ms
Iterating global reduction 1 with 79 rules applied. Total rules applied 114 place count 349 transition count 323
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 125 place count 338 transition count 312
Deduced a syphon composed of 88 places in 1 ms
Iterating global reduction 1 with 11 rules applied. Total rules applied 136 place count 338 transition count 312
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 93 places in 0 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 141 place count 338 transition count 332
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 143 place count 336 transition count 326
Deduced a syphon composed of 91 places in 1 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 145 place count 336 transition count 326
Deduced a syphon composed of 91 places in 0 ms
Applied a total of 145 rules in 65 ms. Remains 336 /354 variables (removed 18) and now considering 326/295 (removed -31) transitions.
[2021-05-08 11:37:38] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 326 rows 336 cols
[2021-05-08 11:37:38] [INFO ] Computed 62 place invariants in 7 ms
[2021-05-08 11:37:38] [INFO ] Dead Transitions using invariants and state equation in 155 ms returned []
Finished structural reductions, in 1 iterations. Remains : 336/354 places, 326/295 transitions.
Product exploration explored 100000 steps with 33333 reset in 946 ms.
Product exploration explored 100000 steps with 33333 reset in 890 ms.
[2021-05-08 11:37:40] [INFO ] Flatten gal took : 12 ms
[2021-05-08 11:37:40] [INFO ] Flatten gal took : 12 ms
[2021-05-08 11:37:40] [INFO ] Time to serialize gal into /tmp/LTL14141512917743288335.gal : 2 ms
[2021-05-08 11:37:40] [INFO ] Time to serialize properties into /tmp/LTL1117574742466923781.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/LTL14141512917743288335.gal, -t, CGAL, -LTL, /tmp/LTL1117574742466923781.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/LTL14141512917743288335.gal -t CGAL -LTL /tmp/LTL1117574742466923781.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X(("((p79==0)||(p343==1))")U("((p68==0)||(p156==1))")))))
Formula 0 simplified : !XX("((p79==0)||(p343==1))" U "((p68==0)||(p156==1))")
Detected timeout of ITS tools.
[2021-05-08 11:37:55] [INFO ] Flatten gal took : 11 ms
[2021-05-08 11:37:55] [INFO ] Applying decomposition
[2021-05-08 11:37:55] [INFO ] Flatten gal took : 13 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/graph6940800598017872227.txt, -o, /tmp/graph6940800598017872227.bin, -w, /tmp/graph6940800598017872227.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/graph6940800598017872227.bin, -l, -1, -v, -w, /tmp/graph6940800598017872227.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-08 11:37:55] [INFO ] Decomposing Gal with order
[2021-05-08 11:37:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-08 11:37:55] [INFO ] Removed a total of 14 redundant transitions.
[2021-05-08 11:37:55] [INFO ] Flatten gal took : 23 ms
[2021-05-08 11:37:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 4 ms.
[2021-05-08 11:37:55] [INFO ] Time to serialize gal into /tmp/LTL18179259758695826439.gal : 3 ms
[2021-05-08 11:37:55] [INFO ] Time to serialize properties into /tmp/LTL11961676194890307229.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/LTL18179259758695826439.gal, -t, CGAL, -LTL, /tmp/LTL11961676194890307229.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/LTL18179259758695826439.gal -t CGAL -LTL /tmp/LTL11961676194890307229.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(X(("((u32.p79==0)||(i7.u61.p343==1))")U("((u32.p68==0)||(i4.u10.p156==1))")))))
Formula 0 simplified : !XX("((u32.p79==0)||(i7.u61.p343==1))" U "((u32.p68==0)||(i4.u10.p156==1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16209161341700815267
[2021-05-08 11:38:10] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16209161341700815267
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/ltsmin16209161341700815267]
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/ltsmin16209161341700815267] 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/ltsmin16209161341700815267] 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 DES-PT-30b-09 finished in 35247 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 359 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 359/359 places, 303/303 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 354 transition count 298
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 354 transition count 298
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 13 place count 354 transition count 295
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 353 transition count 294
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 353 transition count 294
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 16 place count 353 transition count 293
Applied a total of 16 rules in 45 ms. Remains 353 /359 variables (removed 6) and now considering 293/303 (removed 10) transitions.
// Phase 1: matrix 293 rows 353 cols
[2021-05-08 11:38:11] [INFO ] Computed 62 place invariants in 3 ms
[2021-05-08 11:38:12] [INFO ] Implicit Places using invariants in 150 ms returned []
// Phase 1: matrix 293 rows 353 cols
[2021-05-08 11:38:12] [INFO ] Computed 62 place invariants in 3 ms
[2021-05-08 11:38:12] [INFO ] Implicit Places using invariants and state equation in 324 ms returned []
Implicit Place search using SMT with State Equation took 476 ms to find 0 implicit places.
// Phase 1: matrix 293 rows 353 cols
[2021-05-08 11:38:12] [INFO ] Computed 62 place invariants in 4 ms
[2021-05-08 11:38:12] [INFO ] Dead Transitions using invariants and state equation in 143 ms returned []
Finished structural reductions, in 1 iterations. Remains : 353/359 places, 293/303 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-30b-11 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s163 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]]
Stuttering criterion allowed to conclude after 105 steps with 0 reset in 0 ms.
FORMULA DES-PT-30b-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-30b-11 finished in 715 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((X(p0) U ((p1&&X(p0))||X(G(p0)))) U (G((X(p0) U ((p1&&X(p0))||X(G(p0)))))||(p2&&(X(p0) U ((p1&&X(p0))||X(G(p0))))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 359 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 359/359 places, 303/303 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 355 transition count 299
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 355 transition count 299
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 11 place count 355 transition count 296
Applied a total of 11 rules in 11 ms. Remains 355 /359 variables (removed 4) and now considering 296/303 (removed 7) transitions.
// Phase 1: matrix 296 rows 355 cols
[2021-05-08 11:38:12] [INFO ] Computed 62 place invariants in 4 ms
[2021-05-08 11:38:12] [INFO ] Implicit Places using invariants in 143 ms returned []
// Phase 1: matrix 296 rows 355 cols
[2021-05-08 11:38:12] [INFO ] Computed 62 place invariants in 4 ms
[2021-05-08 11:38:13] [INFO ] Implicit Places using invariants and state equation in 329 ms returned []
Implicit Place search using SMT with State Equation took 474 ms to find 0 implicit places.
// Phase 1: matrix 296 rows 355 cols
[2021-05-08 11:38:13] [INFO ] Computed 62 place invariants in 4 ms
[2021-05-08 11:38:13] [INFO ] Dead Transitions using invariants and state equation in 144 ms returned []
Finished structural reductions, in 1 iterations. Remains : 355/359 places, 296/303 transitions.
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0), (NOT p0), true]
Running random walk in product with property : DES-PT-30b-13 automaton TGBA [mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 0}, { cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(OR (NEQ s207 0) (NEQ s141 1)), p1:(NEQ s163 1), p0:(AND (NEQ s187 0) (NEQ s8 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DES-PT-30b-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-30b-13 finished in 722 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((G(p0)&&X(p1)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 359 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 359/359 places, 303/303 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 354 transition count 298
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 354 transition count 298
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 13 place count 354 transition count 295
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 353 transition count 294
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 353 transition count 294
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 16 place count 353 transition count 293
Applied a total of 16 rules in 11 ms. Remains 353 /359 variables (removed 6) and now considering 293/303 (removed 10) transitions.
// Phase 1: matrix 293 rows 353 cols
[2021-05-08 11:38:13] [INFO ] Computed 62 place invariants in 3 ms
[2021-05-08 11:38:13] [INFO ] Implicit Places using invariants in 135 ms returned []
// Phase 1: matrix 293 rows 353 cols
[2021-05-08 11:38:13] [INFO ] Computed 62 place invariants in 3 ms
[2021-05-08 11:38:13] [INFO ] Implicit Places using invariants and state equation in 329 ms returned []
Implicit Place search using SMT with State Equation took 466 ms to find 0 implicit places.
// Phase 1: matrix 293 rows 353 cols
[2021-05-08 11:38:13] [INFO ] Computed 62 place invariants in 3 ms
[2021-05-08 11:38:13] [INFO ] Dead Transitions using invariants and state equation in 146 ms returned []
Finished structural reductions, in 1 iterations. Remains : 353/359 places, 293/303 transitions.
Stuttering acceptance computed with spot in 97 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : DES-PT-30b-14 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=p0, acceptance={0} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s245 0) (EQ s211 1)), p1:(OR (EQ s159 0) (EQ s31 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 98 steps with 0 reset in 1 ms.
FORMULA DES-PT-30b-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-30b-14 finished in 732 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin7400376353773987677
[2021-05-08 11:38:14] [INFO ] Applying decomposition
[2021-05-08 11:38:14] [INFO ] Computing symmetric may disable matrix : 303 transitions.
[2021-05-08 11:38:14] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-08 11:38:14] [INFO ] Computing symmetric may enable matrix : 303 transitions.
[2021-05-08 11:38:14] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-08 11:38:14] [INFO ] Flatten gal took : 11 ms
[2021-05-08 11:38:14] [INFO ] Computing Do-Not-Accords matrix : 303 transitions.
[2021-05-08 11:38:14] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-08 11:38:14] [INFO ] Built C files in 43ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7400376353773987677
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/ltsmin7400376353773987677]
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/graph8298326033890395672.txt, -o, /tmp/graph8298326033890395672.bin, -w, /tmp/graph8298326033890395672.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/graph8298326033890395672.bin, -l, -1, -v, -w, /tmp/graph8298326033890395672.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-08 11:38:14] [INFO ] Decomposing Gal with order
[2021-05-08 11:38:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-08 11:38:14] [INFO ] Removed a total of 17 redundant transitions.
[2021-05-08 11:38:14] [INFO ] Flatten gal took : 18 ms
[2021-05-08 11:38:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 5 labels/synchronizations in 2 ms.
[2021-05-08 11:38:14] [INFO ] Time to serialize gal into /tmp/LTLCardinality8655025932880965222.gal : 3 ms
[2021-05-08 11:38:14] [INFO ] Time to serialize properties into /tmp/LTLCardinality10580467445633500629.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/LTLCardinality8655025932880965222.gal, -t, CGAL, -LTL, /tmp/LTLCardinality10580467445633500629.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/LTLCardinality8655025932880965222.gal -t CGAL -LTL /tmp/LTLCardinality10580467445633500629.ltl -c -stutter-deadlock
Read 3 LTL properties
Checking formula 0 : !((G(F("((i4.u23.p202==0)||(i9.u45.p285==1))"))))
Formula 0 simplified : !GF"((i4.u23.p202==0)||(i9.u45.p285==1))"
Compilation finished in 1495 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin7400376353773987677]
Link finished in 35 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, [](<>((LTLAPp0==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin7400376353773987677]
LTSmin run took 30876 ms.
FORMULA DES-PT-30b-03 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, [](<>((LTLAPp1==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin7400376353773987677]
Reverse transition relation is NOT exact ! Due to transitions t0, t58, t154, t258, t305, t306, t339, u33.t83, i1.t141, i1.u10.t229, i1.u10.t230, i1.u10.t231, i1.u10.t232, i1.u10.t233, i1.u10.t234, i1.u10.t235, i1.u10.t236, i1.u10.t237, i1.u10.t238, i1.u10.t239, i1.u10.t240, i1.u10.t241, i1.u10.t242, i1.u10.t243, i1.u10.t244, i1.u10.t245, i1.u10.t246, i1.u10.t247, i1.u10.t248, i1.u10.t249, i1.u10.t250, i1.u10.t251, i1.u10.t252, i1.u10.t253, i1.u10.t254, i1.u10.t255, i1.u10.t256, i1.u10.t257, i2.t160, i2.u8.t156, i2.u8.t158, i3.u7.t165, i3.u7.t166, i3.u12.t137, i3.u14.t130, i4.t337, i4.t114, i4.t99, i4.u18.t118, i4.u20.t112, i4.u25.t1, i4.u25.t109, i4.u22.t104, i4.u22.t348, i5.u30.t98, i7.t80, i8.t54, i8.i0.i0.u60.t52, i8.i0.i0.u67.t41, i8.i0.i1.u59.t55, i8.i1.i0.t56, i8.i1.i0.u58.t57, i8.i1.i1.u57.t59, i9.t66, i9.t64, i9.t62, i9.t60, i9.u42.t76, i9.u56.t61, i9.u55.t63, i9.u53.t67, i9.u52.t68, i9.u54.t65, i10.t316, i10.t10, i10.t9, i10.u38.t78, i10.u68.t38, i10.u74.t27, i11.u77.t17, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/219/80/299
Computing Next relation with stutter on 1.59967e+08 deadlock states
WARNING : LTSmin timed out (>327 s) on command CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, [](<>((LTLAPp1==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin7400376353773987677]
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(X(((LTLAPp2==true) U (LTLAPp3==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin7400376353773987677]
LTSmin run took 496 ms.
FORMULA DES-PT-30b-09 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Retrying LTSmin with larger timeout 2616 s
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, [](<>((LTLAPp1==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin7400376353773987677]
Detected timeout of ITS tools.
[2021-05-08 11:59:02] [INFO ] Applying decomposition
[2021-05-08 11:59:02] [INFO ] Flatten gal took : 27 ms
[2021-05-08 11:59:02] [INFO ] Decomposing Gal with order
[2021-05-08 11:59:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-08 11:59:02] [INFO ] Removed a total of 126 redundant transitions.
[2021-05-08 11:59:02] [INFO ] Flatten gal took : 80 ms
[2021-05-08 11:59:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 422 labels/synchronizations in 36 ms.
[2021-05-08 11:59:02] [INFO ] Time to serialize gal into /tmp/LTLCardinality14879858878847491162.gal : 3 ms
[2021-05-08 11:59:02] [INFO ] Time to serialize properties into /tmp/LTLCardinality2953721400587363845.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/LTLCardinality14879858878847491162.gal, -t, CGAL, -LTL, /tmp/LTLCardinality2953721400587363845.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/LTLCardinality14879858878847491162.gal -t CGAL -LTL /tmp/LTLCardinality2953721400587363845.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((G(F("((i1.i1.i0.i1.i0.i1.u99.p370==0)||(i1.i0.i0.i0.i0.i0.i0.u16.p146==1))"))))
Formula 0 simplified : !GF"((i1.i1.i0.i1.i0.i1.u99.p370==0)||(i1.i0.i0.i0.i0.i0.i0.u16.p146==1))"
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.002: Loading model from ./gal.so
pins2lts-mc-linux64( 1/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.008: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.007: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.007: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.010: Initializing POR dependencies: labels 307, guards 303
pins2lts-mc-linux64( 1/ 8), 0.010: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.029: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.038: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.042: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.045: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.139: LTL layer: formula: [](<>((LTLAPp1==true)))
pins2lts-mc-linux64( 3/ 8), 0.139: "[](<>((LTLAPp1==true)))" is not a file, parsing as formula...
pins2lts-mc-linux64( 3/ 8), 0.139: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 0.335: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.497: Forcing use of the an ignoring proviso (cndfs)
pins2lts-mc-linux64( 0/ 8), 0.524: There are 309 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.524: State length is 360, there are 306 groups
pins2lts-mc-linux64( 0/ 8), 0.524: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.524: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.524: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.524: Visible groups: 4 / 306, labels: 1 / 309
pins2lts-mc-linux64( 0/ 8), 0.524: POR cycle proviso: cndfs (ltl)
pins2lts-mc-linux64( 0/ 8), 0.524: Global bits: 2, count bits: 2, local bits: 0
pins2lts-mc-linux64( 2/ 8), 0.604: [Blue] ~93 levels ~960 states ~1248 transitions
pins2lts-mc-linux64( 7/ 8), 0.615: [Blue] ~132 levels ~1920 states ~2624 transitions
pins2lts-mc-linux64( 0/ 8), 0.630: [Blue] ~216 levels ~3840 states ~4440 transitions
pins2lts-mc-linux64( 0/ 8), 0.653: [Blue] ~216 levels ~7680 states ~8640 transitions
pins2lts-mc-linux64( 2/ 8), 0.711: [Blue] ~120 levels ~15360 states ~22736 transitions
pins2lts-mc-linux64( 0/ 8), 0.805: [Blue] ~216 levels ~30720 states ~33960 transitions
pins2lts-mc-linux64( 4/ 8), 1.025: [Blue] ~161 levels ~61440 states ~88872 transitions
pins2lts-mc-linux64( 0/ 8), 1.413: [Blue] ~332 levels ~122880 states ~136024 transitions
pins2lts-mc-linux64( 3/ 8), 2.252: [Blue] ~4082 levels ~245760 states ~324232 transitions
pins2lts-mc-linux64( 3/ 8), 3.939: [Blue] ~4441 levels ~491520 states ~607592 transitions
pins2lts-mc-linux64( 3/ 8), 7.313: [Blue] ~4502 levels ~983040 states ~1163056 transitions
pins2lts-mc-linux64( 3/ 8), 13.979: [Blue] ~4552 levels ~1966080 states ~2394480 transitions
pins2lts-mc-linux64( 3/ 8), 27.676: [Blue] ~4979 levels ~3932160 states ~4759736 transitions
pins2lts-mc-linux64( 3/ 8), 55.381: [Blue] ~5456 levels ~7864320 states ~9497896 transitions
pins2lts-mc-linux64( 3/ 8), 110.672: [Blue] ~7003 levels ~15728640 states ~19079864 transitions
pins2lts-mc-linux64( 3/ 8), 221.545: [Blue] ~9992 levels ~31457280 states ~38163304 transitions
pins2lts-mc-linux64( 5/ 8), 501.521: [Blue] ~890 levels ~62914560 states ~83041264 transitions
pins2lts-mc-linux64( 4/ 8), 1015.198: [Blue] ~1879 levels ~125829120 states ~174819200 transitions
pins2lts-mc-linux64( 1/ 8), 1200.774: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 1200.790:
pins2lts-mc-linux64( 0/ 8), 1200.790: Explored 135085738 states 175624715 transitions, fanout: 1.300
pins2lts-mc-linux64( 0/ 8), 1200.790: Total exploration time 1200.260 sec (1200.240 sec minimum, 1200.249 sec on average)
pins2lts-mc-linux64( 0/ 8), 1200.790: States per second: 112547, Transitions per second: 146322
pins2lts-mc-linux64( 0/ 8), 1200.790:
pins2lts-mc-linux64( 0/ 8), 1200.790: State space has 134217254 states, 5316524 are accepting
pins2lts-mc-linux64( 0/ 8), 1200.790: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 1200.790: blue states: 135085738 (100.65%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 1200.790: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 1200.790: all-red states: 5316524 (3.96%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 1200.790:
pins2lts-mc-linux64( 0/ 8), 1200.790: Total memory used for local state coloring: 24.2MB
pins2lts-mc-linux64( 0/ 8), 1200.790:
pins2lts-mc-linux64( 0/ 8), 1200.790: Queue width: 8B, total height: 1582872, memory: 12.08MB
pins2lts-mc-linux64( 0/ 8), 1200.790: Tree memory: 1101.9MB, 8.6 B/state, compr.: 0.6%
pins2lts-mc-linux64( 0/ 8), 1200.790: Tree fill ratio (roots/leafs): 99.0%/30.0%
pins2lts-mc-linux64( 0/ 8), 1200.790: Stored 307 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 1200.790: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 1200.790: Est. total memory use: 1114.0MB (~1036.1MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, [](<>((LTLAPp1==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin7400376353773987677]
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, [](<>((LTLAPp1==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin7400376353773987677]
255
at fr.lip6.move.gal.application.LTSminRunner.checkProperty(LTSminRunner.java:214)
at fr.lip6.move.gal.application.LTSminRunner.access$10(LTSminRunner.java:165)
at fr.lip6.move.gal.application.LTSminRunner$1.checkProperties(LTSminRunner.java:154)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:102)
at java.base/java.lang.Thread.run(Thread.java:834)
Detected timeout of ITS tools.
[2021-05-08 12:19:51] [INFO ] Flatten gal took : 10 ms
[2021-05-08 12:19:51] [INFO ] Input system was already deterministic with 303 transitions.
[2021-05-08 12:19:51] [INFO ] Transformed 359 places.
[2021-05-08 12:19:51] [INFO ] Transformed 303 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-05-08 12:19:51] [INFO ] Time to serialize gal into /tmp/LTLCardinality13351716915177391819.gal : 1 ms
[2021-05-08 12:19:51] [INFO ] Time to serialize properties into /tmp/LTLCardinality4088897691432735183.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/LTLCardinality13351716915177391819.gal, -t, CGAL, -LTL, /tmp/LTLCardinality4088897691432735183.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/LTLCardinality13351716915177391819.gal -t CGAL -LTL /tmp/LTLCardinality4088897691432735183.ltl -c -stutter-deadlock --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(F("((p370==0)||(p146==1))"))))
Formula 0 simplified : !GF"((p370==0)||(p146==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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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="DES-PT-30b"
export BK_EXAMINATION="LTLCardinality"
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 DES-PT-30b, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r064-tall-162038396700108"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-30b.tgz
mv DES-PT-30b execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;