About the Execution of ITS-Tools for JoinFreeModules-PT-0200
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 10881.995 | 3600000.00 | 7873962.00 | 7563.50 | TFFTTFFFTFFTF?FF | 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.r121-tall-162075407000444.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 JoinFreeModules-PT-0200, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r121-tall-162075407000444
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 105K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 111K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Mar 28 16:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 16:17 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 28 16:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:17 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Mar 26 06:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 26 06:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 24 10:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K Mar 24 10:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 5 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 1.2M 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 JoinFreeModules-PT-0200-00
FORMULA_NAME JoinFreeModules-PT-0200-01
FORMULA_NAME JoinFreeModules-PT-0200-02
FORMULA_NAME JoinFreeModules-PT-0200-03
FORMULA_NAME JoinFreeModules-PT-0200-04
FORMULA_NAME JoinFreeModules-PT-0200-05
FORMULA_NAME JoinFreeModules-PT-0200-06
FORMULA_NAME JoinFreeModules-PT-0200-07
FORMULA_NAME JoinFreeModules-PT-0200-08
FORMULA_NAME JoinFreeModules-PT-0200-09
FORMULA_NAME JoinFreeModules-PT-0200-10
FORMULA_NAME JoinFreeModules-PT-0200-11
FORMULA_NAME JoinFreeModules-PT-0200-12
FORMULA_NAME JoinFreeModules-PT-0200-13
FORMULA_NAME JoinFreeModules-PT-0200-14
FORMULA_NAME JoinFreeModules-PT-0200-15
=== Now, execution of the tool begins
BK_START 1620845512136
Running Version 0
[2021-05-12 18:51:53] [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-12 18:51:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-12 18:51:53] [INFO ] Load time of PNML (sax parser for PT used): 160 ms
[2021-05-12 18:51:53] [INFO ] Transformed 1001 places.
[2021-05-12 18:51:53] [INFO ] Transformed 1601 transitions.
[2021-05-12 18:51:53] [INFO ] Parsed PT model containing 1001 places and 1601 transitions in 207 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2021-05-12 18:51:53] [INFO ] Initial state test concluded for 5 properties.
Reduce places removed 1 places and 0 transitions.
FORMULA JoinFreeModules-PT-0200-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0200-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0200-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0200-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 52 out of 1000 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1000/1000 places, 1601/1601 transitions.
Applied a total of 0 rules in 90 ms. Remains 1000 /1000 variables (removed 0) and now considering 1601/1601 (removed 0) transitions.
// Phase 1: matrix 1601 rows 1000 cols
[2021-05-12 18:51:54] [INFO ] Computed 200 place invariants in 29 ms
[2021-05-12 18:51:55] [INFO ] Dead Transitions using invariants and state equation in 966 ms returned []
// Phase 1: matrix 1601 rows 1000 cols
[2021-05-12 18:51:55] [INFO ] Computed 200 place invariants in 7 ms
[2021-05-12 18:51:55] [INFO ] Implicit Places using invariants in 165 ms returned []
// Phase 1: matrix 1601 rows 1000 cols
[2021-05-12 18:51:55] [INFO ] Computed 200 place invariants in 9 ms
[2021-05-12 18:51:55] [INFO ] Implicit Places using invariants and state equation in 603 ms returned []
Implicit Place search using SMT with State Equation took 770 ms to find 0 implicit places.
// Phase 1: matrix 1601 rows 1000 cols
[2021-05-12 18:51:55] [INFO ] Computed 200 place invariants in 6 ms
[2021-05-12 18:51:56] [INFO ] Dead Transitions using invariants and state equation in 623 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1000/1000 places, 1601/1601 transitions.
[2021-05-12 18:51:56] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2021-05-12 18:51:56] [INFO ] Flatten gal took : 134 ms
FORMULA JoinFreeModules-PT-0200-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-12 18:51:56] [INFO ] Flatten gal took : 71 ms
[2021-05-12 18:51:56] [INFO ] Input system was already deterministic with 1601 transitions.
Incomplete random walk after 100038 steps, including 2 resets, run finished after 987 ms. (steps per millisecond=101 ) properties (out of 26) seen :19
Running SMT prover for 7 properties.
// Phase 1: matrix 1601 rows 1000 cols
[2021-05-12 18:51:57] [INFO ] Computed 200 place invariants in 6 ms
[2021-05-12 18:51:58] [INFO ] [Real]Absence check using 200 positive place invariants in 34 ms returned sat
[2021-05-12 18:51:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 18:51:58] [INFO ] [Real]Absence check using state equation in 408 ms returned sat
[2021-05-12 18:51:58] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 18:51:58] [INFO ] [Nat]Absence check using 200 positive place invariants in 42 ms returned sat
[2021-05-12 18:51:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 18:52:00] [INFO ] [Nat]Absence check using state equation in 1478 ms returned sat
[2021-05-12 18:52:00] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 3 ms to minimize.
[2021-05-12 18:52:00] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2021-05-12 18:52:00] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2021-05-12 18:52:00] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2021-05-12 18:52:00] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 2 ms to minimize.
[2021-05-12 18:52:01] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2021-05-12 18:52:01] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2021-05-12 18:52:01] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
[2021-05-12 18:52:01] [INFO ] Deduced a trap composed of 3 places in 9 ms of which 0 ms to minimize.
[2021-05-12 18:52:01] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1020 ms
[2021-05-12 18:52:01] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 117 ms.
[2021-05-12 18:52:13] [INFO ] Added : 315 causal constraints over 63 iterations in 11715 ms. Result :sat
[2021-05-12 18:52:13] [INFO ] [Real]Absence check using 200 positive place invariants in 38 ms returned sat
[2021-05-12 18:52:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 18:52:13] [INFO ] [Real]Absence check using state equation in 407 ms returned sat
[2021-05-12 18:52:13] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 18:52:13] [INFO ] [Nat]Absence check using 200 positive place invariants in 33 ms returned sat
[2021-05-12 18:52:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 18:52:15] [INFO ] [Nat]Absence check using state equation in 2140 ms returned sat
[2021-05-12 18:52:16] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2021-05-12 18:52:16] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2021-05-12 18:52:16] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2021-05-12 18:52:16] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2021-05-12 18:52:16] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2021-05-12 18:52:16] [INFO ] Deduced a trap composed of 3 places in 11 ms of which 0 ms to minimize.
[2021-05-12 18:52:16] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2021-05-12 18:52:16] [INFO ] Deduced a trap composed of 3 places in 11 ms of which 0 ms to minimize.
[2021-05-12 18:52:16] [INFO ] Deduced a trap composed of 3 places in 10 ms of which 1 ms to minimize.
[2021-05-12 18:52:16] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2021-05-12 18:52:16] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2021-05-12 18:52:16] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2021-05-12 18:52:17] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1036 ms
[2021-05-12 18:52:17] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 78 ms.
[2021-05-12 18:52:33] [INFO ] Added : 590 causal constraints over 118 iterations in 16707 ms. Result :unknown
[2021-05-12 18:52:33] [INFO ] [Real]Absence check using 200 positive place invariants in 32 ms returned sat
[2021-05-12 18:52:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 18:52:34] [INFO ] [Real]Absence check using state equation in 365 ms returned sat
[2021-05-12 18:52:34] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 18:52:34] [INFO ] [Nat]Absence check using 200 positive place invariants in 33 ms returned sat
[2021-05-12 18:52:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 18:52:35] [INFO ] [Nat]Absence check using state equation in 1305 ms returned sat
[2021-05-12 18:52:35] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 1 ms to minimize.
[2021-05-12 18:52:35] [INFO ] Deduced a trap composed of 3 places in 12 ms of which 0 ms to minimize.
[2021-05-12 18:52:35] [INFO ] Deduced a trap composed of 3 places in 11 ms of which 1 ms to minimize.
[2021-05-12 18:52:36] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2021-05-12 18:52:36] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2021-05-12 18:52:36] [INFO ] Deduced a trap composed of 3 places in 10 ms of which 0 ms to minimize.
[2021-05-12 18:52:36] [INFO ] Deduced a trap composed of 3 places in 9 ms of which 1 ms to minimize.
[2021-05-12 18:52:36] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 494 ms
[2021-05-12 18:52:36] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 77 ms.
[2021-05-12 18:52:49] [INFO ] Added : 380 causal constraints over 76 iterations in 13417 ms. Result :unknown
[2021-05-12 18:52:49] [INFO ] [Real]Absence check using 200 positive place invariants in 31 ms returned sat
[2021-05-12 18:52:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 18:52:50] [INFO ] [Real]Absence check using state equation in 370 ms returned sat
[2021-05-12 18:52:50] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 18:52:50] [INFO ] [Nat]Absence check using 200 positive place invariants in 33 ms returned sat
[2021-05-12 18:52:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 18:52:51] [INFO ] [Nat]Absence check using state equation in 1390 ms returned sat
[2021-05-12 18:52:51] [INFO ] Deduced a trap composed of 3 places in 12 ms of which 0 ms to minimize.
[2021-05-12 18:52:51] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 0 ms to minimize.
[2021-05-12 18:52:51] [INFO ] Deduced a trap composed of 3 places in 10 ms of which 0 ms to minimize.
[2021-05-12 18:52:52] [INFO ] Deduced a trap composed of 4 places in 12 ms of which 0 ms to minimize.
[2021-05-12 18:52:52] [INFO ] Deduced a trap composed of 4 places in 10 ms of which 1 ms to minimize.
[2021-05-12 18:52:52] [INFO ] Deduced a trap composed of 3 places in 10 ms of which 1 ms to minimize.
[2021-05-12 18:52:52] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 5 ms to minimize.
[2021-05-12 18:52:52] [INFO ] Deduced a trap composed of 3 places in 9 ms of which 0 ms to minimize.
[2021-05-12 18:52:52] [INFO ] Deduced a trap composed of 4 places in 9 ms of which 0 ms to minimize.
[2021-05-12 18:52:52] [INFO ] Deduced a trap composed of 3 places in 6 ms of which 0 ms to minimize.
[2021-05-12 18:52:52] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2021-05-12 18:52:52] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 826 ms
[2021-05-12 18:52:52] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 73 ms.
[2021-05-12 18:53:04] [INFO ] Added : 315 causal constraints over 63 iterations in 11847 ms. Result :unknown
[2021-05-12 18:53:04] [INFO ] [Real]Absence check using 200 positive place invariants in 32 ms returned sat
[2021-05-12 18:53:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 18:53:04] [INFO ] [Real]Absence check using state equation in 371 ms returned sat
[2021-05-12 18:53:05] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 18:53:05] [INFO ] [Nat]Absence check using 200 positive place invariants in 32 ms returned sat
[2021-05-12 18:53:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 18:53:06] [INFO ] [Nat]Absence check using state equation in 1460 ms returned sat
[2021-05-12 18:53:06] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2021-05-12 18:53:06] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
[2021-05-12 18:53:06] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 1 ms to minimize.
[2021-05-12 18:53:06] [INFO ] Deduced a trap composed of 3 places in 12 ms of which 0 ms to minimize.
[2021-05-12 18:53:06] [INFO ] Deduced a trap composed of 3 places in 12 ms of which 0 ms to minimize.
[2021-05-12 18:53:07] [INFO ] Deduced a trap composed of 3 places in 12 ms of which 1 ms to minimize.
[2021-05-12 18:53:07] [INFO ] Deduced a trap composed of 3 places in 11 ms of which 0 ms to minimize.
[2021-05-12 18:53:07] [INFO ] Deduced a trap composed of 3 places in 11 ms of which 0 ms to minimize.
[2021-05-12 18:53:07] [INFO ] Deduced a trap composed of 3 places in 11 ms of which 0 ms to minimize.
[2021-05-12 18:53:07] [INFO ] Deduced a trap composed of 3 places in 8 ms of which 1 ms to minimize.
[2021-05-12 18:53:07] [INFO ] Deduced a trap composed of 3 places in 8 ms of which 0 ms to minimize.
[2021-05-12 18:53:07] [INFO ] Deduced a trap composed of 3 places in 8 ms of which 1 ms to minimize.
[2021-05-12 18:53:07] [INFO ] Deduced a trap composed of 3 places in 6 ms of which 0 ms to minimize.
[2021-05-12 18:53:07] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 993 ms
[2021-05-12 18:53:07] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 73 ms.
[2021-05-12 18:53:19] [INFO ] Deduced a trap composed of 3 places in 12 ms of which 1 ms to minimize.
[2021-05-12 18:53:19] [INFO ] Deduced a trap composed of 3 places in 9 ms of which 0 ms to minimize.
[2021-05-12 18:53:19] [INFO ] Deduced a trap composed of 3 places in 9 ms of which 0 ms to minimize.
[2021-05-12 18:53:19] [INFO ] Deduced a trap composed of 3 places in 9 ms of which 0 ms to minimize.
[2021-05-12 18:53:20] [INFO ] Deduced a trap composed of 3 places in 9 ms of which 1 ms to minimize.
[2021-05-12 18:53:20] [INFO ] Deduced a trap composed of 3 places in 8 ms of which 0 ms to minimize.
[2021-05-12 18:53:20] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2021-05-12 18:53:20] [INFO ] Deduced a trap composed of 3 places in 6 ms of which 0 ms to minimize.
[2021-05-12 18:53:20] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 867 ms
[2021-05-12 18:53:20] [INFO ] Added : 648 causal constraints over 131 iterations in 13012 ms. Result :sat
[2021-05-12 18:53:20] [INFO ] [Real]Absence check using 200 positive place invariants in 32 ms returned sat
[2021-05-12 18:53:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 18:53:21] [INFO ] [Real]Absence check using state equation in 362 ms returned sat
[2021-05-12 18:53:21] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 18:53:21] [INFO ] [Nat]Absence check using 200 positive place invariants in 32 ms returned sat
[2021-05-12 18:53:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 18:53:22] [INFO ] [Nat]Absence check using state equation in 1377 ms returned sat
[2021-05-12 18:53:22] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
[2021-05-12 18:53:22] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
[2021-05-12 18:53:22] [INFO ] Deduced a trap composed of 3 places in 12 ms of which 0 ms to minimize.
[2021-05-12 18:53:22] [INFO ] Deduced a trap composed of 3 places in 12 ms of which 0 ms to minimize.
[2021-05-12 18:53:22] [INFO ] Deduced a trap composed of 3 places in 12 ms of which 0 ms to minimize.
[2021-05-12 18:53:22] [INFO ] Deduced a trap composed of 3 places in 11 ms of which 0 ms to minimize.
[2021-05-12 18:53:23] [INFO ] Deduced a trap composed of 3 places in 10 ms of which 0 ms to minimize.
[2021-05-12 18:53:23] [INFO ] Deduced a trap composed of 3 places in 9 ms of which 0 ms to minimize.
[2021-05-12 18:53:23] [INFO ] Deduced a trap composed of 3 places in 8 ms of which 1 ms to minimize.
[2021-05-12 18:53:23] [INFO ] Deduced a trap composed of 3 places in 8 ms of which 0 ms to minimize.
[2021-05-12 18:53:23] [INFO ] Deduced a trap composed of 3 places in 8 ms of which 0 ms to minimize.
[2021-05-12 18:53:23] [INFO ] Deduced a trap composed of 3 places in 6 ms of which 0 ms to minimize.
[2021-05-12 18:53:23] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 790 ms
[2021-05-12 18:53:23] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 77 ms.
[2021-05-12 18:53:39] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2021-05-12 18:53:39] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 1 ms to minimize.
[2021-05-12 18:53:39] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
[2021-05-12 18:53:39] [INFO ] Deduced a trap composed of 3 places in 12 ms of which 1 ms to minimize.
[2021-05-12 18:53:39] [INFO ] Deduced a trap composed of 3 places in 11 ms of which 1 ms to minimize.
[2021-05-12 18:53:40] [INFO ] Deduced a trap composed of 3 places in 11 ms of which 0 ms to minimize.
[2021-05-12 18:53:40] [INFO ] Deduced a trap composed of 3 places in 10 ms of which 0 ms to minimize.
[2021-05-12 18:53:40] [INFO ] Deduced a trap composed of 3 places in 11 ms of which 0 ms to minimize.
[2021-05-12 18:53:40] [INFO ] Deduced a trap composed of 3 places in 10 ms of which 0 ms to minimize.
[2021-05-12 18:53:40] [INFO ] Deduced a trap composed of 3 places in 10 ms of which 1 ms to minimize.
[2021-05-12 18:53:40] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
[2021-05-12 18:53:40] [INFO ] Deduced a trap composed of 3 places in 7 ms of which 1 ms to minimize.
[2021-05-12 18:53:40] [INFO ] Deduced a trap composed of 3 places in 7 ms of which 0 ms to minimize.
[2021-05-12 18:53:41] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1517 ms
[2021-05-12 18:53:41] [INFO ] Added : 711 causal constraints over 143 iterations in 17722 ms. Result :sat
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G((p0&&F(p1)&&F(G(p2))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 1000 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1000/1000 places, 1601/1601 transitions.
Applied a total of 0 rules in 24 ms. Remains 1000 /1000 variables (removed 0) and now considering 1601/1601 (removed 0) transitions.
// Phase 1: matrix 1601 rows 1000 cols
[2021-05-12 18:53:41] [INFO ] Computed 200 place invariants in 5 ms
[2021-05-12 18:53:41] [INFO ] Dead Transitions using invariants and state equation in 661 ms returned []
// Phase 1: matrix 1601 rows 1000 cols
[2021-05-12 18:53:41] [INFO ] Computed 200 place invariants in 5 ms
[2021-05-12 18:53:42] [INFO ] Implicit Places using invariants in 145 ms returned []
// Phase 1: matrix 1601 rows 1000 cols
[2021-05-12 18:53:42] [INFO ] Computed 200 place invariants in 4 ms
[2021-05-12 18:53:42] [INFO ] Implicit Places using invariants and state equation in 518 ms returned []
Implicit Place search using SMT with State Equation took 674 ms to find 0 implicit places.
// Phase 1: matrix 1601 rows 1000 cols
[2021-05-12 18:53:42] [INFO ] Computed 200 place invariants in 4 ms
[2021-05-12 18:53:43] [INFO ] Dead Transitions using invariants and state equation in 612 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1000/1000 places, 1601/1601 transitions.
Stuttering acceptance computed with spot in 226 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), true, (NOT p1), (NOT p2)]
Running random walk in product with property : JoinFreeModules-PT-0200-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}, { cond=p2, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(GT 1 s809), p1:(LEQ 2 s492), p2:(OR (GT 1 s392) (GT 2 s43))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 86 steps with 0 reset in 10 ms.
FORMULA JoinFreeModules-PT-0200-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0200-01 finished in 2326 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)&&F(p1)))], workingDir=/home/mcc/execution]
Support contains 2 out of 1000 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1000/1000 places, 1601/1601 transitions.
Applied a total of 0 rules in 96 ms. Remains 1000 /1000 variables (removed 0) and now considering 1601/1601 (removed 0) transitions.
// Phase 1: matrix 1601 rows 1000 cols
[2021-05-12 18:53:43] [INFO ] Computed 200 place invariants in 6 ms
[2021-05-12 18:53:44] [INFO ] Dead Transitions using invariants and state equation in 649 ms returned []
// Phase 1: matrix 1601 rows 1000 cols
[2021-05-12 18:53:44] [INFO ] Computed 200 place invariants in 4 ms
[2021-05-12 18:53:44] [INFO ] Implicit Places using invariants in 136 ms returned []
// Phase 1: matrix 1601 rows 1000 cols
[2021-05-12 18:53:44] [INFO ] Computed 200 place invariants in 3 ms
[2021-05-12 18:53:44] [INFO ] Implicit Places using invariants and state equation in 494 ms returned []
Implicit Place search using SMT with State Equation took 637 ms to find 0 implicit places.
[2021-05-12 18:53:44] [INFO ] Redundant transitions in 110 ms returned []
// Phase 1: matrix 1601 rows 1000 cols
[2021-05-12 18:53:44] [INFO ] Computed 200 place invariants in 3 ms
[2021-05-12 18:53:45] [INFO ] Dead Transitions using invariants and state equation in 613 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1000/1000 places, 1601/1601 transitions.
Stuttering acceptance computed with spot in 53 ms :[(NOT p0), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : JoinFreeModules-PT-0200-02 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 p1), acceptance={0} source=2 dest: 0}, { cond=(NOT p0), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=2, aps=[p0:(LEQ 1 s847), p1:(GT 3 s135)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration timeout after 87990 steps with 0 reset in 10002 ms.
Product exploration timeout after 84940 steps with 0 reset in 10001 ms.
Knowledge obtained : [p0, p1]
Stuttering acceptance computed with spot in 53 ms :[(NOT p0), true, (OR (NOT p1) (NOT p0))]
Product exploration timeout after 89400 steps with 0 reset in 10001 ms.
Product exploration timeout after 85310 steps with 0 reset in 10001 ms.
[2021-05-12 18:54:25] [INFO ] Flatten gal took : 59 ms
[2021-05-12 18:54:25] [INFO ] Flatten gal took : 51 ms
[2021-05-12 18:54:26] [INFO ] Time to serialize gal into /tmp/LTL3613936080441448001.gal : 18 ms
[2021-05-12 18:54:26] [INFO ] Time to serialize properties into /tmp/LTL12829110355069266821.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/LTL3613936080441448001.gal, -t, CGAL, -LTL, /tmp/LTL12829110355069266821.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/LTL3613936080441448001.gal -t CGAL -LTL /tmp/LTL12829110355069266821.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((G("(p848>=1)"))&&(F("(p136<3)"))))
Formula 0 simplified : !(G"(p848>=1)" & F"(p136<3)")
Detected timeout of ITS tools.
[2021-05-12 18:54:41] [INFO ] Flatten gal took : 74 ms
[2021-05-12 18:54:41] [INFO ] Applying decomposition
[2021-05-12 18:54:41] [INFO ] Flatten gal took : 48 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/graph9865854958319376540.txt, -o, /tmp/graph9865854958319376540.bin, -w, /tmp/graph9865854958319376540.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/graph9865854958319376540.bin, -l, -1, -v, -w, /tmp/graph9865854958319376540.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-12 18:54:41] [INFO ] Decomposing Gal with order
[2021-05-12 18:54:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-12 18:54:41] [INFO ] Flatten gal took : 117 ms
[2021-05-12 18:54:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 42 ms.
[2021-05-12 18:54:41] [INFO ] Time to serialize gal into /tmp/LTL13513317273674814963.gal : 10 ms
[2021-05-12 18:54:41] [INFO ] Time to serialize properties into /tmp/LTL5728130362415983969.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/LTL13513317273674814963.gal, -t, CGAL, -LTL, /tmp/LTL5728130362415983969.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/LTL13513317273674814963.gal -t CGAL -LTL /tmp/LTL5728130362415983969.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !(((G("(u169.p848>=1)"))&&(F("(u27.p136<3)"))))
Formula 0 simplified : !(G"(u169.p848>=1)" & F"(u27.p136<3)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7246065791770879133
[2021-05-12 18:54:56] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7246065791770879133
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/ltsmin7246065791770879133]
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/ltsmin7246065791770879133] 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/ltsmin7246065791770879133] 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 JoinFreeModules-PT-0200-02 finished in 74439 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(((F(p0) U p1)||G(p2)))))], workingDir=/home/mcc/execution]
Support contains 5 out of 1000 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 1000/1000 places, 1601/1601 transitions.
Applied a total of 0 rules in 52 ms. Remains 1000 /1000 variables (removed 0) and now considering 1601/1601 (removed 0) transitions.
// Phase 1: matrix 1601 rows 1000 cols
[2021-05-12 18:54:58] [INFO ] Computed 200 place invariants in 3 ms
[2021-05-12 18:54:58] [INFO ] Dead Transitions using invariants and state equation in 874 ms returned []
// Phase 1: matrix 1601 rows 1000 cols
[2021-05-12 18:54:58] [INFO ] Computed 200 place invariants in 3 ms
[2021-05-12 18:54:59] [INFO ] Implicit Places using invariants in 144 ms returned []
// Phase 1: matrix 1601 rows 1000 cols
[2021-05-12 18:54:59] [INFO ] Computed 200 place invariants in 17 ms
[2021-05-12 18:54:59] [INFO ] Implicit Places using invariants and state equation in 520 ms returned []
Implicit Place search using SMT with State Equation took 681 ms to find 0 implicit places.
[2021-05-12 18:54:59] [INFO ] Redundant transitions in 94 ms returned []
// Phase 1: matrix 1601 rows 1000 cols
[2021-05-12 18:54:59] [INFO ] Computed 200 place invariants in 3 ms
[2021-05-12 18:55:00] [INFO ] Dead Transitions using invariants and state equation in 628 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1000/1000 places, 1601/1601 transitions.
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : JoinFreeModules-PT-0200-05 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={} source=1 dest: 1}]], initial=0, aps=[p2:(AND (GT s602 s476) (GT s964 s530)), p1:(LEQ 2 s55)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 22 reset in 8656 ms.
Stack based approach found an accepted trace after 11619 steps with 1 reset with depth 7473 and stack size 7471 in 1020 ms.
FORMULA JoinFreeModules-PT-0200-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0200-05 finished in 12179 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G((p0||X(p1)))||G(p2))))], workingDir=/home/mcc/execution]
Support contains 7 out of 1000 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1000/1000 places, 1601/1601 transitions.
Applied a total of 0 rules in 13 ms. Remains 1000 /1000 variables (removed 0) and now considering 1601/1601 (removed 0) transitions.
// Phase 1: matrix 1601 rows 1000 cols
[2021-05-12 18:55:10] [INFO ] Computed 200 place invariants in 3 ms
[2021-05-12 18:55:10] [INFO ] Dead Transitions using invariants and state equation in 620 ms returned []
// Phase 1: matrix 1601 rows 1000 cols
[2021-05-12 18:55:10] [INFO ] Computed 200 place invariants in 3 ms
[2021-05-12 18:55:10] [INFO ] Implicit Places using invariants in 135 ms returned []
// Phase 1: matrix 1601 rows 1000 cols
[2021-05-12 18:55:10] [INFO ] Computed 200 place invariants in 3 ms
[2021-05-12 18:55:11] [INFO ] Implicit Places using invariants and state equation in 500 ms returned []
Implicit Place search using SMT with State Equation took 636 ms to find 0 implicit places.
// Phase 1: matrix 1601 rows 1000 cols
[2021-05-12 18:55:11] [INFO ] Computed 200 place invariants in 9 ms
[2021-05-12 18:55:12] [INFO ] Dead Transitions using invariants and state equation in 629 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1000/1000 places, 1601/1601 transitions.
Stuttering acceptance computed with spot in 219 ms :[(NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), true, (NOT p2)]
Running random walk in product with property : JoinFreeModules-PT-0200-06 automaton TGBA [mat=[[{ cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={} source=0 dest: 4}, { cond=(NOT p1), acceptance={} source=0 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 p2 p1), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 5}, { cond=(AND p2 (NOT p1)), acceptance={} source=1 dest: 6}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 1}, { cond=(AND p0 p2), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p2), acceptance={} source=6 dest: 5}, { cond=p2, acceptance={} source=6 dest: 6}]], initial=2, aps=[p0:(LEQ 1 s879), p1:(OR (LEQ s926 s466) (LEQ s559 s3)), p2:(LEQ s660 s731)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, 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 1758 steps with 0 reset in 109 ms.
FORMULA JoinFreeModules-PT-0200-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0200-06 finished in 2246 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0 U G(p1))))], workingDir=/home/mcc/execution]
Support contains 5 out of 1000 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1000/1000 places, 1601/1601 transitions.
Applied a total of 0 rules in 13 ms. Remains 1000 /1000 variables (removed 0) and now considering 1601/1601 (removed 0) transitions.
// Phase 1: matrix 1601 rows 1000 cols
[2021-05-12 18:55:12] [INFO ] Computed 200 place invariants in 2 ms
[2021-05-12 18:55:12] [INFO ] Dead Transitions using invariants and state equation in 619 ms returned []
// Phase 1: matrix 1601 rows 1000 cols
[2021-05-12 18:55:12] [INFO ] Computed 200 place invariants in 3 ms
[2021-05-12 18:55:13] [INFO ] Implicit Places using invariants in 146 ms returned []
// Phase 1: matrix 1601 rows 1000 cols
[2021-05-12 18:55:13] [INFO ] Computed 200 place invariants in 2 ms
[2021-05-12 18:55:13] [INFO ] Implicit Places using invariants and state equation in 498 ms returned []
Implicit Place search using SMT with State Equation took 645 ms to find 0 implicit places.
// Phase 1: matrix 1601 rows 1000 cols
[2021-05-12 18:55:13] [INFO ] Computed 200 place invariants in 11 ms
[2021-05-12 18:55:14] [INFO ] Dead Transitions using invariants and state equation in 630 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1000/1000 places, 1601/1601 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : JoinFreeModules-PT-0200-07 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (LEQ s686 s273) (LEQ 2 s398)), p0:(LEQ s619 s767)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA JoinFreeModules-PT-0200-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0200-07 finished in 2009 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 1000 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1000/1000 places, 1601/1601 transitions.
Applied a total of 0 rules in 13 ms. Remains 1000 /1000 variables (removed 0) and now considering 1601/1601 (removed 0) transitions.
// Phase 1: matrix 1601 rows 1000 cols
[2021-05-12 18:55:14] [INFO ] Computed 200 place invariants in 3 ms
[2021-05-12 18:55:14] [INFO ] Dead Transitions using invariants and state equation in 618 ms returned []
// Phase 1: matrix 1601 rows 1000 cols
[2021-05-12 18:55:14] [INFO ] Computed 200 place invariants in 14 ms
[2021-05-12 18:55:15] [INFO ] Implicit Places using invariants in 157 ms returned []
// Phase 1: matrix 1601 rows 1000 cols
[2021-05-12 18:55:15] [INFO ] Computed 200 place invariants in 3 ms
[2021-05-12 18:55:15] [INFO ] Implicit Places using invariants and state equation in 499 ms returned []
Implicit Place search using SMT with State Equation took 658 ms to find 0 implicit places.
// Phase 1: matrix 1601 rows 1000 cols
[2021-05-12 18:55:15] [INFO ] Computed 200 place invariants in 3 ms
[2021-05-12 18:55:16] [INFO ] Dead Transitions using invariants and state equation in 610 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1000/1000 places, 1601/1601 transitions.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : JoinFreeModules-PT-0200-09 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT s323 s496)], 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 0 steps with 0 reset in 0 ms.
FORMULA JoinFreeModules-PT-0200-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0200-09 finished in 1958 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(((p0||F(G(p1))) U p1)))], workingDir=/home/mcc/execution]
Support contains 3 out of 1000 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1000/1000 places, 1601/1601 transitions.
Applied a total of 0 rules in 12 ms. Remains 1000 /1000 variables (removed 0) and now considering 1601/1601 (removed 0) transitions.
// Phase 1: matrix 1601 rows 1000 cols
[2021-05-12 18:55:16] [INFO ] Computed 200 place invariants in 2 ms
[2021-05-12 18:55:16] [INFO ] Dead Transitions using invariants and state equation in 622 ms returned []
// Phase 1: matrix 1601 rows 1000 cols
[2021-05-12 18:55:16] [INFO ] Computed 200 place invariants in 2 ms
[2021-05-12 18:55:17] [INFO ] Implicit Places using invariants in 145 ms returned []
// Phase 1: matrix 1601 rows 1000 cols
[2021-05-12 18:55:17] [INFO ] Computed 200 place invariants in 5 ms
[2021-05-12 18:55:17] [INFO ] Implicit Places using invariants and state equation in 505 ms returned []
Implicit Place search using SMT with State Equation took 650 ms to find 0 implicit places.
// Phase 1: matrix 1601 rows 1000 cols
[2021-05-12 18:55:17] [INFO ] Computed 200 place invariants in 2 ms
[2021-05-12 18:55:18] [INFO ] Dead Transitions using invariants and state equation in 612 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1000/1000 places, 1601/1601 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : JoinFreeModules-PT-0200-10 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(LEQ s537 s880), p0:(GT 2 s969)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA JoinFreeModules-PT-0200-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0200-10 finished in 1992 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X((p0&&F(p1)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 1000 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1000/1000 places, 1601/1601 transitions.
Applied a total of 0 rules in 12 ms. Remains 1000 /1000 variables (removed 0) and now considering 1601/1601 (removed 0) transitions.
// Phase 1: matrix 1601 rows 1000 cols
[2021-05-12 18:55:18] [INFO ] Computed 200 place invariants in 3 ms
[2021-05-12 18:55:18] [INFO ] Dead Transitions using invariants and state equation in 606 ms returned []
// Phase 1: matrix 1601 rows 1000 cols
[2021-05-12 18:55:18] [INFO ] Computed 200 place invariants in 2 ms
[2021-05-12 18:55:19] [INFO ] Implicit Places using invariants in 133 ms returned []
// Phase 1: matrix 1601 rows 1000 cols
[2021-05-12 18:55:19] [INFO ] Computed 200 place invariants in 2 ms
[2021-05-12 18:55:19] [INFO ] Implicit Places using invariants and state equation in 497 ms returned []
Implicit Place search using SMT with State Equation took 632 ms to find 0 implicit places.
// Phase 1: matrix 1601 rows 1000 cols
[2021-05-12 18:55:19] [INFO ] Computed 200 place invariants in 2 ms
[2021-05-12 18:55:20] [INFO ] Dead Transitions using invariants and state equation in 632 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1000/1000 places, 1601/1601 transitions.
Stuttering acceptance computed with spot in 100 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : JoinFreeModules-PT-0200-12 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), 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}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=4, aps=[p1:(LEQ s46 s235), p0:(LEQ 1 s62)], 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, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 3316 ms.
Product exploration explored 100000 steps with 33333 reset in 3481 ms.
Knowledge obtained : [p1, p0]
Stuttering acceptance computed with spot in 121 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true, (OR (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 33333 reset in 3204 ms.
Product exploration explored 100000 steps with 33333 reset in 3437 ms.
Applying partial POR strategy [true, true, false, true, false]
Stuttering acceptance computed with spot in 120 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true, (OR (NOT p1) (NOT p0))]
Support contains 3 out of 1000 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 1000/1000 places, 1601/1601 transitions.
Applied a total of 0 rules in 74 ms. Remains 1000 /1000 variables (removed 0) and now considering 1601/1601 (removed 0) transitions.
// Phase 1: matrix 1601 rows 1000 cols
[2021-05-12 18:55:34] [INFO ] Computed 200 place invariants in 3 ms
[2021-05-12 18:55:34] [INFO ] Dead Transitions using invariants and state equation in 672 ms returned []
[2021-05-12 18:55:34] [INFO ] Redundant transitions in 28 ms returned []
// Phase 1: matrix 1601 rows 1000 cols
[2021-05-12 18:55:34] [INFO ] Computed 200 place invariants in 2 ms
[2021-05-12 18:55:35] [INFO ] Dead Transitions using invariants and state equation in 605 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1000/1000 places, 1601/1601 transitions.
Product exploration explored 100000 steps with 33333 reset in 9889 ms.
Product exploration timeout after 99520 steps with 33173 reset in 10001 ms.
[2021-05-12 18:55:55] [INFO ] Flatten gal took : 52 ms
[2021-05-12 18:55:55] [INFO ] Flatten gal took : 35 ms
[2021-05-12 18:55:55] [INFO ] Time to serialize gal into /tmp/LTL17731082687164516372.gal : 7 ms
[2021-05-12 18:55:55] [INFO ] Time to serialize properties into /tmp/LTL15918114708208848744.ltl : 10 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/LTL17731082687164516372.gal, -t, CGAL, -LTL, /tmp/LTL15918114708208848744.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/LTL17731082687164516372.gal -t CGAL -LTL /tmp/LTL15918114708208848744.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X(("(p63>=1)")&&(F("(p47<=p236)"))))))
Formula 0 simplified : !XX("(p63>=1)" & F"(p47<=p236)")
Detected timeout of ITS tools.
[2021-05-12 18:56:10] [INFO ] Flatten gal took : 35 ms
[2021-05-12 18:56:10] [INFO ] Applying decomposition
[2021-05-12 18:56:10] [INFO ] Flatten gal took : 36 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/graph14593397408865631580.txt, -o, /tmp/graph14593397408865631580.bin, -w, /tmp/graph14593397408865631580.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/graph14593397408865631580.bin, -l, -1, -v, -w, /tmp/graph14593397408865631580.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-12 18:56:10] [INFO ] Decomposing Gal with order
[2021-05-12 18:56:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-12 18:56:10] [INFO ] Removed a total of 1 redundant transitions.
[2021-05-12 18:56:10] [INFO ] Flatten gal took : 83 ms
[2021-05-12 18:56:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 21 ms.
[2021-05-12 18:56:11] [INFO ] Time to serialize gal into /tmp/LTL9724608968208811045.gal : 9 ms
[2021-05-12 18:56:11] [INFO ] Time to serialize properties into /tmp/LTL10498387888889068773.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/LTL9724608968208811045.gal, -t, CGAL, -LTL, /tmp/LTL10498387888889068773.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/LTL9724608968208811045.gal -t CGAL -LTL /tmp/LTL10498387888889068773.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X(("(gu12.p63>=1)")&&(F("(gu47.p47<=gu47.p236)"))))))
Formula 0 simplified : !XX("(gu12.p63>=1)" & F"(gu47.p47<=gu47.p236)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17904963554159766520
[2021-05-12 18:56:26] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17904963554159766520
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/ltsmin17904963554159766520]
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/ltsmin17904963554159766520] 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/ltsmin17904963554159766520] 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 JoinFreeModules-PT-0200-12 finished in 68789 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(G((p0||X(p1))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 1000 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1000/1000 places, 1601/1601 transitions.
Applied a total of 0 rules in 15 ms. Remains 1000 /1000 variables (removed 0) and now considering 1601/1601 (removed 0) transitions.
// Phase 1: matrix 1601 rows 1000 cols
[2021-05-12 18:56:27] [INFO ] Computed 200 place invariants in 2 ms
[2021-05-12 18:56:27] [INFO ] Dead Transitions using invariants and state equation in 625 ms returned []
// Phase 1: matrix 1601 rows 1000 cols
[2021-05-12 18:56:27] [INFO ] Computed 200 place invariants in 3 ms
[2021-05-12 18:56:27] [INFO ] Implicit Places using invariants in 164 ms returned []
// Phase 1: matrix 1601 rows 1000 cols
[2021-05-12 18:56:27] [INFO ] Computed 200 place invariants in 7 ms
[2021-05-12 18:56:28] [INFO ] Implicit Places using invariants and state equation in 530 ms returned []
Implicit Place search using SMT with State Equation took 696 ms to find 0 implicit places.
// Phase 1: matrix 1601 rows 1000 cols
[2021-05-12 18:56:28] [INFO ] Computed 200 place invariants in 2 ms
[2021-05-12 18:56:29] [INFO ] Dead Transitions using invariants and state equation in 907 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1000/1000 places, 1601/1601 transitions.
Stuttering acceptance computed with spot in 109 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), true]
Running random walk in product with property : JoinFreeModules-PT-0200-13 automaton TGBA [mat=[[{ cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p0:(LEQ s826 s435), p1:(LEQ s901 s882)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration timeout after 93440 steps with 0 reset in 10001 ms.
Product exploration timeout after 89620 steps with 0 reset in 10002 ms.
Knowledge obtained : [p0, p1]
Stuttering acceptance computed with spot in 99 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), true]
Product exploration timeout after 93580 steps with 0 reset in 10001 ms.
Product exploration timeout after 89910 steps with 0 reset in 10001 ms.
[2021-05-12 18:57:09] [INFO ] Flatten gal took : 43 ms
[2021-05-12 18:57:09] [INFO ] Flatten gal took : 37 ms
[2021-05-12 18:57:09] [INFO ] Time to serialize gal into /tmp/LTL12104574309229466496.gal : 5 ms
[2021-05-12 18:57:09] [INFO ] Time to serialize properties into /tmp/LTL5438361342050524304.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/LTL12104574309229466496.gal, -t, CGAL, -LTL, /tmp/LTL5438361342050524304.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/LTL12104574309229466496.gal -t CGAL -LTL /tmp/LTL5438361342050524304.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X(G(("(p827<=p436)")||(X("(p902<=p883)")))))))
Formula 0 simplified : !XXG("(p827<=p436)" | X"(p902<=p883)")
Detected timeout of ITS tools.
[2021-05-12 18:57:24] [INFO ] Flatten gal took : 36 ms
[2021-05-12 18:57:24] [INFO ] Applying decomposition
[2021-05-12 18:57:24] [INFO ] Flatten gal took : 36 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/graph12942066630347477189.txt, -o, /tmp/graph12942066630347477189.bin, -w, /tmp/graph12942066630347477189.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/graph12942066630347477189.bin, -l, -1, -v, -w, /tmp/graph12942066630347477189.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-12 18:57:24] [INFO ] Decomposing Gal with order
[2021-05-12 18:57:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-12 18:57:25] [INFO ] Removed a total of 2 redundant transitions.
[2021-05-12 18:57:25] [INFO ] Flatten gal took : 50 ms
[2021-05-12 18:57:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 26 ms.
[2021-05-12 18:57:25] [INFO ] Time to serialize gal into /tmp/LTL4241992539654836322.gal : 5 ms
[2021-05-12 18:57:25] [INFO ] Time to serialize properties into /tmp/LTL12247280480954075211.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/LTL4241992539654836322.gal, -t, CGAL, -LTL, /tmp/LTL12247280480954075211.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/LTL4241992539654836322.gal -t CGAL -LTL /tmp/LTL12247280480954075211.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X(G(("(gu165.p827<=gu165.p436)")||(X("(gu182.p902<=gu182.p883)")))))))
Formula 0 simplified : !XXG("(gu165.p827<=gu165.p436)" | X"(gu182.p902<=gu182.p883)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7941635654004685063
[2021-05-12 18:57:40] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7941635654004685063
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/ltsmin7941635654004685063]
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/ltsmin7941635654004685063] 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/ltsmin7941635654004685063] 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 JoinFreeModules-PT-0200-13 finished in 74097 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((F(G(p0))&&G(p1))))], workingDir=/home/mcc/execution]
Support contains 3 out of 1000 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1000/1000 places, 1601/1601 transitions.
Applied a total of 0 rules in 40 ms. Remains 1000 /1000 variables (removed 0) and now considering 1601/1601 (removed 0) transitions.
// Phase 1: matrix 1601 rows 1000 cols
[2021-05-12 18:57:41] [INFO ] Computed 200 place invariants in 2 ms
[2021-05-12 18:57:41] [INFO ] Dead Transitions using invariants and state equation in 629 ms returned []
// Phase 1: matrix 1601 rows 1000 cols
[2021-05-12 18:57:41] [INFO ] Computed 200 place invariants in 3 ms
[2021-05-12 18:57:42] [INFO ] Implicit Places using invariants in 137 ms returned []
// Phase 1: matrix 1601 rows 1000 cols
[2021-05-12 18:57:42] [INFO ] Computed 200 place invariants in 2 ms
[2021-05-12 18:57:42] [INFO ] Implicit Places using invariants and state equation in 512 ms returned []
Implicit Place search using SMT with State Equation took 654 ms to find 0 implicit places.
[2021-05-12 18:57:42] [INFO ] Redundant transitions in 18 ms returned []
// Phase 1: matrix 1601 rows 1000 cols
[2021-05-12 18:57:42] [INFO ] Computed 200 place invariants in 2 ms
[2021-05-12 18:57:43] [INFO ] Dead Transitions using invariants and state equation in 613 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1000/1000 places, 1601/1601 transitions.
Stuttering acceptance computed with spot in 99 ms :[(OR (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : JoinFreeModules-PT-0200-14 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(LEQ 1 s133), p0:(AND (LEQ 3 s165) (LEQ 1 s619))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA JoinFreeModules-PT-0200-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0200-14 finished in 2085 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G((p0 U (p1||X(F(p2)))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 1000 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1000/1000 places, 1601/1601 transitions.
Applied a total of 0 rules in 13 ms. Remains 1000 /1000 variables (removed 0) and now considering 1601/1601 (removed 0) transitions.
// Phase 1: matrix 1601 rows 1000 cols
[2021-05-12 18:57:43] [INFO ] Computed 200 place invariants in 2 ms
[2021-05-12 18:57:43] [INFO ] Dead Transitions using invariants and state equation in 629 ms returned []
// Phase 1: matrix 1601 rows 1000 cols
[2021-05-12 18:57:43] [INFO ] Computed 200 place invariants in 2 ms
[2021-05-12 18:57:44] [INFO ] Implicit Places using invariants in 132 ms returned []
// Phase 1: matrix 1601 rows 1000 cols
[2021-05-12 18:57:44] [INFO ] Computed 200 place invariants in 3 ms
[2021-05-12 18:57:44] [INFO ] Implicit Places using invariants and state equation in 509 ms returned []
Implicit Place search using SMT with State Equation took 648 ms to find 0 implicit places.
// Phase 1: matrix 1601 rows 1000 cols
[2021-05-12 18:57:44] [INFO ] Computed 200 place invariants in 3 ms
[2021-05-12 18:57:45] [INFO ] Dead Transitions using invariants and state equation in 616 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1000/1000 places, 1601/1601 transitions.
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : JoinFreeModules-PT-0200-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(GT 2 s241), p0:(LEQ s386 s975), p2:(GT 3 s495)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 146 reset in 5531 ms.
Stack based approach found an accepted trace after 12898 steps with 16 reset with depth 2496 and stack size 2495 in 735 ms.
FORMULA JoinFreeModules-PT-0200-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0200-15 finished in 8285 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin9305809007729065663
[2021-05-12 18:57:51] [INFO ] Too many transitions (1601) to apply POR reductions. Disabling POR matrices.
[2021-05-12 18:57:51] [INFO ] Applying decomposition
[2021-05-12 18:57:51] [INFO ] Built C files in 52ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9305809007729065663
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/ltsmin9305809007729065663]
[2021-05-12 18:57:51] [INFO ] Flatten gal took : 70 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/graph11494320997172622547.txt, -o, /tmp/graph11494320997172622547.bin, -w, /tmp/graph11494320997172622547.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/graph11494320997172622547.bin, -l, -1, -v, -w, /tmp/graph11494320997172622547.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-12 18:57:51] [INFO ] Decomposing Gal with order
[2021-05-12 18:57:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-12 18:57:52] [INFO ] Removed a total of 3 redundant transitions.
[2021-05-12 18:57:52] [INFO ] Flatten gal took : 161 ms
[2021-05-12 18:57:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 29 ms.
[2021-05-12 18:57:52] [INFO ] Time to serialize gal into /tmp/LTLCardinality368765211998309390.gal : 19 ms
[2021-05-12 18:57:52] [INFO ] Time to serialize properties into /tmp/LTLCardinality4689518124261246848.ltl : 10 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/LTLCardinality368765211998309390.gal, -t, CGAL, -LTL, /tmp/LTLCardinality4689518124261246848.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/LTLCardinality368765211998309390.gal -t CGAL -LTL /tmp/LTLCardinality4689518124261246848.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 3 LTL properties
Checking formula 0 : !(((G("(gu171.p848>=1)"))&&(F("(gu28.p136<3)"))))
Formula 0 simplified : !(G"(gu171.p848>=1)" & F"(gu28.p136<3)")
Compilation finished in 13224 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin9305809007729065663]
Link finished in 56 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))&&<>((LTLAPp1==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin9305809007729065663]
LTSmin run took 129064 ms.
FORMULA JoinFreeModules-PT-0200-02 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, --when, --ltl, X(X(((LTLAPp2==true)&&<>((LTLAPp3==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin9305809007729065663]
LTSmin run took 8505 ms.
FORMULA JoinFreeModules-PT-0200-12 FALSE TECHNIQUES 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, --when, --ltl, X(X([](((LTLAPp4==true)||X((LTLAPp5==true)))))), --buchi-type=spotba], workingDir=/tmp/ltsmin9305809007729065663]
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, --when, --ltl, X(X([](((LTLAPp4==true)||X((LTLAPp5==true)))))), --buchi-type=spotba], workingDir=/tmp/ltsmin9305809007729065663]
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, --when, --ltl, X(X([](((LTLAPp4==true)||X((LTLAPp5==true)))))), --buchi-type=spotba], workingDir=/tmp/ltsmin9305809007729065663]
Detected timeout of ITS tools.
[2021-05-12 19:19:51] [INFO ] Flatten gal took : 68 ms
[2021-05-12 19:19:51] [INFO ] Time to serialize gal into /tmp/LTLCardinality9971247250954083112.gal : 12 ms
[2021-05-12 19:19:51] [INFO ] Time to serialize properties into /tmp/LTLCardinality6460762258764028122.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/LTLCardinality9971247250954083112.gal, -t, CGAL, -LTL, /tmp/LTLCardinality6460762258764028122.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/LTLCardinality9971247250954083112.gal -t CGAL -LTL /tmp/LTLCardinality6460762258764028122.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X(G(("(p827<=p436)")||(X("(p902<=p883)")))))))
Formula 0 simplified : !XXG("(p827<=p436)" | X"(p902<=p883)")
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 2/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.026: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.026: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.026: 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( 4/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.026: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.026: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.003: 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( 4/ 8), 0.283: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.307: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.283: LTL layer: formula: X(X([](((LTLAPp4==true)||X((LTLAPp5==true))))))
pins2lts-mc-linux64( 4/ 8), 0.284: "X(X([](((LTLAPp4==true)||X((LTLAPp5==true))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 5/ 8), 0.286: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.286: Using Spin LTL semantics
pins2lts-mc-linux64( 2/ 8), 0.300: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.293: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.296: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.296: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.324: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.329: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.736: DFS-FIFO for weak LTL, using special progress label 1608
pins2lts-mc-linux64( 0/ 8), 0.736: There are 1609 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.736: State length is 1001, there are 1609 groups
pins2lts-mc-linux64( 0/ 8), 0.736: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.736: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.736: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.736: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 2/ 8), 2.119: ~1 levels ~960 states ~384480 transitions
pins2lts-mc-linux64( 3/ 8), 3.416: ~1 levels ~1920 states ~769744 transitions
pins2lts-mc-linux64( 1/ 8), 5.935: ~1 levels ~3840 states ~1539024 transitions
pins2lts-mc-linux64( 1/ 8), 11.014: ~1 levels ~7680 states ~3077872 transitions
pins2lts-mc-linux64( 0/ 8), 21.035: ~1 levels ~15360 states ~6160720 transitions
pins2lts-mc-linux64( 0/ 8), 42.096: ~1 levels ~30720 states ~12325512 transitions
pins2lts-mc-linux64( 7/ 8), 81.924: ~1 levels ~61440 states ~24636480 transitions
pins2lts-mc-linux64( 7/ 8), 163.826: ~1 levels ~122880 states ~49265632 transitions
pins2lts-mc-linux64( 7/ 8), 329.216: ~1 levels ~245760 states ~98574544 transitions
pins2lts-mc-linux64( 7/ 8), 665.493: ~1 levels ~491520 states ~197187192 transitions
pins2lts-mc-linux64( 6/ 8), 990.507: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 995.558:
pins2lts-mc-linux64( 0/ 8), 995.558: mean standard work distribution: 0.9% (states) 0.9% (transitions)
pins2lts-mc-linux64( 0/ 8), 995.558:
pins2lts-mc-linux64( 0/ 8), 995.558: Explored 716793 states 287707036 transitions, fanout: 401.381
pins2lts-mc-linux64( 0/ 8), 995.558: Total exploration time 994.820 sec (989.950 sec minimum, 991.979 sec on average)
pins2lts-mc-linux64( 0/ 8), 995.558: States per second: 721, Transitions per second: 289205
pins2lts-mc-linux64( 0/ 8), 995.558:
pins2lts-mc-linux64( 0/ 8), 995.558: Progress states detected: 134216134
pins2lts-mc-linux64( 0/ 8), 995.558: Redundant explorations: -99.4659
pins2lts-mc-linux64( 0/ 8), 995.558:
pins2lts-mc-linux64( 0/ 8), 995.558: Queue width: 8B, total height: 144326972, memory: 1101.13MB
pins2lts-mc-linux64( 0/ 8), 995.558: Tree memory: 1197.5MB, 9.4 B/state, compr.: 0.2%
pins2lts-mc-linux64( 0/ 8), 995.558: Tree fill ratio (roots/leafs): 100.0%/67.0%
pins2lts-mc-linux64( 0/ 8), 995.558: Stored 1628 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 995.558: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 995.558: Est. total memory use: 2298.6MB (~2125.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, --when, --ltl, X(X([](((LTLAPp4==true)||X((LTLAPp5==true)))))), --buchi-type=spotba], workingDir=/tmp/ltsmin9305809007729065663]
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, --when, --ltl, X(X([](((LTLAPp4==true)||X((LTLAPp5==true)))))), --buchi-type=spotba], workingDir=/tmp/ltsmin9305809007729065663]
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-12 19:41:51] [INFO ] Flatten gal took : 33 ms
[2021-05-12 19:41:51] [INFO ] Input system was already deterministic with 1601 transitions.
[2021-05-12 19:41:51] [INFO ] Transformed 1000 places.
[2021-05-12 19:41:51] [INFO ] Transformed 1601 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-12 19:41:51] [INFO ] Time to serialize gal into /tmp/LTLCardinality7261297567173942763.gal : 11 ms
[2021-05-12 19:41:51] [INFO ] Time to serialize properties into /tmp/LTLCardinality8661522967749539153.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/LTLCardinality7261297567173942763.gal, -t, CGAL, -LTL, /tmp/LTLCardinality8661522967749539153.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/LTLCardinality7261297567173942763.gal -t CGAL -LTL /tmp/LTLCardinality8661522967749539153.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 : !((X(X(G(("(p827<=p436)")||(X("(p902<=p883)")))))))
Formula 0 simplified : !XXG("(p827<=p436)" | X"(p902<=p883)")
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="JoinFreeModules-PT-0200"
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 JoinFreeModules-PT-0200, 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 r121-tall-162075407000444"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/JoinFreeModules-PT-0200.tgz
mv JoinFreeModules-PT-0200 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 ;