About the Execution of ITS-Tools for FMS-PT-50000
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 330.831 | 11498.00 | 21294.00 | 198.80 | FTFFFTTFFFFTTFFF | 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.r083-tall-162048875900837.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 FMS-PT-50000, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r083-tall-162048875900837
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 412K
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 137K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.6K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 90K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.1K Mar 28 16:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 28 16:09 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 16:09 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Mar 23 10:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 23 10:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 22 18:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 22 18:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 22 09:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 22 09:11 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 6 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 16K 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 FMS-PT-50000-00
FORMULA_NAME FMS-PT-50000-01
FORMULA_NAME FMS-PT-50000-02
FORMULA_NAME FMS-PT-50000-03
FORMULA_NAME FMS-PT-50000-04
FORMULA_NAME FMS-PT-50000-05
FORMULA_NAME FMS-PT-50000-06
FORMULA_NAME FMS-PT-50000-07
FORMULA_NAME FMS-PT-50000-08
FORMULA_NAME FMS-PT-50000-09
FORMULA_NAME FMS-PT-50000-10
FORMULA_NAME FMS-PT-50000-11
FORMULA_NAME FMS-PT-50000-12
FORMULA_NAME FMS-PT-50000-13
FORMULA_NAME FMS-PT-50000-14
FORMULA_NAME FMS-PT-50000-15
=== Now, execution of the tool begins
BK_START 1620674222950
Running Version 0
[2021-05-10 19:17:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-10 19:17:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-10 19:17:04] [INFO ] Load time of PNML (sax parser for PT used): 24 ms
[2021-05-10 19:17:04] [INFO ] Transformed 22 places.
[2021-05-10 19:17:04] [INFO ] Transformed 20 transitions.
[2021-05-10 19:17:04] [INFO ] Parsed PT model containing 22 places and 20 transitions in 63 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
[2021-05-10 19:17:04] [INFO ] Initial state test concluded for 2 properties.
FORMULA FMS-PT-50000-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 19 out of 22 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 8 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 19:17:04] [INFO ] Computed 6 place invariants in 5 ms
[2021-05-10 19:17:04] [INFO ] Implicit Places using invariants in 64 ms returned []
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 19:17:04] [INFO ] Computed 6 place invariants in 7 ms
[2021-05-10 19:17:04] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 133 ms to find 0 implicit places.
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 19:17:04] [INFO ] Computed 6 place invariants in 9 ms
[2021-05-10 19:17:04] [INFO ] Dead Transitions using invariants and state equation in 35 ms returned []
Finished structural reductions, in 1 iterations. Remains : 22/22 places, 20/20 transitions.
[2021-05-10 19:17:05] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2021-05-10 19:17:05] [INFO ] Flatten gal took : 19 ms
FORMULA FMS-PT-50000-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-10 19:17:05] [INFO ] Flatten gal took : 4 ms
[2021-05-10 19:17:05] [INFO ] Input system was already deterministic with 20 transitions.
Incomplete random walk after 100003 steps, including 1 resets, run finished after 46 ms. (steps per millisecond=2173 ) properties (out of 17) seen :1
Running SMT prover for 16 properties.
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 19:17:05] [INFO ] Computed 6 place invariants in 2 ms
[2021-05-10 19:17:05] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2021-05-10 19:17:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-10 19:17:05] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2021-05-10 19:17:05] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-10 19:17:05] [INFO ] Added : 6 causal constraints over 2 iterations in 18 ms. Result :sat
[2021-05-10 19:17:05] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2021-05-10 19:17:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-10 19:17:05] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2021-05-10 19:17:05] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-10 19:17:05] [INFO ] Added : 2 causal constraints over 1 iterations in 12 ms. Result :sat
[2021-05-10 19:17:05] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2021-05-10 19:17:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-10 19:17:05] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2021-05-10 19:17:05] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-10 19:17:05] [INFO ] Added : 2 causal constraints over 1 iterations in 8 ms. Result :sat
[2021-05-10 19:17:05] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2021-05-10 19:17:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-10 19:17:05] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2021-05-10 19:17:05] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-10 19:17:05] [INFO ] Added : 0 causal constraints over 0 iterations in 5 ms. Result :sat
[2021-05-10 19:17:05] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2021-05-10 19:17:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-10 19:17:05] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2021-05-10 19:17:05] [INFO ] Solution in real domain found non-integer solution.
[2021-05-10 19:17:05] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-10 19:17:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-10 19:17:05] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2021-05-10 19:17:05] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-10 19:17:05] [INFO ] Added : 3 causal constraints over 1 iterations in 12 ms. Result :sat
[2021-05-10 19:17:05] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-10 19:17:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-10 19:17:05] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2021-05-10 19:17:05] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-10 19:17:05] [INFO ] Added : 2 causal constraints over 1 iterations in 10 ms. Result :sat
[2021-05-10 19:17:05] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-10 19:17:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-10 19:17:05] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2021-05-10 19:17:05] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-10 19:17:05] [INFO ] Added : 1 causal constraints over 1 iterations in 6 ms. Result :sat
[2021-05-10 19:17:05] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-10 19:17:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-10 19:17:05] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2021-05-10 19:17:05] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-10 19:17:05] [INFO ] Added : 0 causal constraints over 0 iterations in 5 ms. Result :sat
[2021-05-10 19:17:05] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2021-05-10 19:17:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-10 19:17:05] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2021-05-10 19:17:05] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-10 19:17:05] [INFO ] Added : 10 causal constraints over 2 iterations in 15 ms. Result :sat
[2021-05-10 19:17:05] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-10 19:17:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-10 19:17:05] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2021-05-10 19:17:05] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints (skipped 0 transitions) in 6 ms.
[2021-05-10 19:17:05] [INFO ] Added : 1 causal constraints over 1 iterations in 12 ms. Result :sat
[2021-05-10 19:17:05] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-10 19:17:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-10 19:17:05] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2021-05-10 19:17:05] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-10 19:17:05] [INFO ] Added : 3 causal constraints over 1 iterations in 7 ms. Result :sat
[2021-05-10 19:17:05] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2021-05-10 19:17:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-10 19:17:05] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2021-05-10 19:17:05] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-10 19:17:05] [INFO ] Added : 3 causal constraints over 1 iterations in 5 ms. Result :sat
[2021-05-10 19:17:05] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-10 19:17:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-10 19:17:05] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2021-05-10 19:17:05] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-10 19:17:05] [INFO ] Added : 0 causal constraints over 0 iterations in 4 ms. Result :sat
[2021-05-10 19:17:05] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-10 19:17:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-10 19:17:05] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2021-05-10 19:17:05] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-10 19:17:05] [INFO ] Added : 0 causal constraints over 0 iterations in 4 ms. Result :sat
[2021-05-10 19:17:05] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-10 19:17:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-10 19:17:05] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2021-05-10 19:17:05] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-10 19:17:05] [INFO ] Added : 9 causal constraints over 2 iterations in 8 ms. Result :sat
[2021-05-10 19:17:05] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-10 19:17:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-10 19:17:05] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2021-05-10 19:17:05] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-10 19:17:05] [INFO ] Added : 8 causal constraints over 2 iterations in 7 ms. Result :sat
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 22 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 22/22 places, 20/20 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 22 transition count 15
Reduce places removed 8 places and 0 transitions.
Graph (trivial) has 11 edges and 14 vertex of which 9 / 14 are part of one of the 3 SCC in 2 ms
Free SCC test removed 6 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 11 rules applied. Total rules applied 16 place count 8 transition count 13
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 10 rules applied. Total rules applied 26 place count 5 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 27 place count 4 transition count 6
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 29 place count 4 transition count 4
Applied a total of 29 rules in 9 ms. Remains 4 /22 variables (removed 18) and now considering 4/20 (removed 16) transitions.
// Phase 1: matrix 4 rows 4 cols
[2021-05-10 19:17:05] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-10 19:17:05] [INFO ] Implicit Places using invariants in 8 ms returned []
// Phase 1: matrix 4 rows 4 cols
[2021-05-10 19:17:05] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-10 19:17:05] [INFO ] Implicit Places using invariants and state equation in 9 ms returned []
Implicit Place search using SMT with State Equation took 18 ms to find 0 implicit places.
[2021-05-10 19:17:05] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 4 rows 4 cols
[2021-05-10 19:17:05] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-10 19:17:05] [INFO ] Dead Transitions using invariants and state equation in 8 ms returned []
Finished structural reductions, in 1 iterations. Remains : 4/22 places, 4/20 transitions.
Stuttering acceptance computed with spot in 115 ms :[(NOT p0)]
Running random walk in product with property : FMS-PT-50000-00 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s0 1) (GEQ s2 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA FMS-PT-50000-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-50000-00 finished in 190 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(p0)||(F(p1)&&G(p2))))], workingDir=/home/mcc/execution]
Support contains 3 out of 22 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 19:17:05] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-10 19:17:05] [INFO ] Implicit Places using invariants in 35 ms returned []
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 19:17:05] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-10 19:17:05] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 19:17:05] [INFO ] Computed 6 place invariants in 4 ms
[2021-05-10 19:17:05] [INFO ] Dead Transitions using invariants and state equation in 25 ms returned []
Finished structural reductions, in 1 iterations. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 189 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p2) (NOT p0)), (NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), true]
Running random walk in product with property : FMS-PT-50000-01 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 6}], [{ cond=(AND p1 p2 (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=1 dest: 5}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=1 dest: 6}], [{ cond=(AND p2 (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 6}], [{ cond=p2, acceptance={} source=3 dest: 3}, { cond=(NOT p2), acceptance={} source=3 dest: 6}], [{ cond=(NOT p2), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=4 dest: 1}, { cond=(AND p1 p2), acceptance={} source=4 dest: 2}], [{ cond=(AND p1 p2), acceptance={0} source=5 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={0} source=5 dest: 5}, { cond=(NOT p2), acceptance={0} source=5 dest: 6}], [{ cond=true, acceptance={0} source=6 dest: 6}]], initial=4, aps=[p0:(OR (LT s0 1) (GEQ s3 1)), p1:(GEQ s0 1), p2:(GEQ s9 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 210 ms.
Product exploration explored 100000 steps with 50000 reset in 141 ms.
Knowledge obtained : [p0, (NOT p1), p2]
Stuttering acceptance computed with spot in 164 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p2) (NOT p0)), (NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), true]
Product exploration explored 100000 steps with 50000 reset in 108 ms.
Product exploration explored 100000 steps with 50000 reset in 97 ms.
Applying partial POR strategy [true, true, true, true, false, true, true]
Stuttering acceptance computed with spot in 167 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p2) (NOT p0)), (NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), true]
Support contains 3 out of 22 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 22/22 places, 20/20 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 22 transition count 20
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 3 place count 22 transition count 20
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 22 transition count 20
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 6 place count 22 transition count 20
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 22 transition count 22
Deduced a syphon composed of 7 places in 0 ms
Applied a total of 7 rules in 6 ms. Remains 22 /22 variables (removed 0) and now considering 22/20 (removed -2) transitions.
[2021-05-10 19:17:07] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 22 rows 22 cols
[2021-05-10 19:17:07] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-10 19:17:07] [INFO ] Dead Transitions using invariants and state equation in 38 ms returned []
Finished structural reductions, in 1 iterations. Remains : 22/22 places, 22/20 transitions.
Product exploration explored 100000 steps with 50000 reset in 265 ms.
Product exploration explored 100000 steps with 50000 reset in 213 ms.
[2021-05-10 19:17:07] [INFO ] Flatten gal took : 3 ms
[2021-05-10 19:17:07] [INFO ] Flatten gal took : 2 ms
[2021-05-10 19:17:07] [INFO ] Time to serialize gal into /tmp/LTL15593689591795542908.gal : 1 ms
[2021-05-10 19:17:07] [INFO ] Time to serialize properties into /tmp/LTL7021976628738132542.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/LTL15593689591795542908.gal, -t, CGAL, -LTL, /tmp/LTL7021976628738132542.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/LTL15593689591795542908.gal -t CGAL -LTL /tmp/LTL7021976628738132542.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((X("((P1d<1)||(P12>=1))"))||((F("(P1d>=1)"))&&(G("(P2>=1)")))))
Formula 0 simplified : !(X"((P1d<1)||(P12>=1))" | (F"(P1d>=1)" & G"(P2>=1)"))
terminate called after throwing an instance of 'char const*'
ITS-tools command line returned an error code 134
[2021-05-10 19:17:07] [INFO ] Flatten gal took : 3 ms
[2021-05-10 19:17:07] [INFO ] Applying decomposition
[2021-05-10 19:17:07] [INFO ] Flatten gal took : 2 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/graph6944310283227643621.txt, -o, /tmp/graph6944310283227643621.bin, -w, /tmp/graph6944310283227643621.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/graph6944310283227643621.bin, -l, -1, -v, -w, /tmp/graph6944310283227643621.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-10 19:17:07] [INFO ] Decomposing Gal with order
[2021-05-10 19:17:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-10 19:17:07] [INFO ] Removed a total of 1 redundant transitions.
[2021-05-10 19:17:07] [INFO ] Flatten gal took : 24 ms
[2021-05-10 19:17:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2021-05-10 19:17:07] [INFO ] Time to serialize gal into /tmp/LTL2898689727069484420.gal : 1 ms
[2021-05-10 19:17:07] [INFO ] Time to serialize properties into /tmp/LTL10604325403051960687.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/LTL2898689727069484420.gal, -t, CGAL, -LTL, /tmp/LTL10604325403051960687.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/LTL2898689727069484420.gal -t CGAL -LTL /tmp/LTL10604325403051960687.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !(((X("((i0.u0.P1d<1)||(i2.u5.P12>=1))"))||((F("(i0.u0.P1d>=1)"))&&(G("(i1.u3.P2>=1)")))))
Formula 0 simplified : !(X"((i0.u0.P1d<1)||(i2.u5.P12>=1))" | (F"(i0.u0.P1d>=1)" & G"(i1.u3.P2>=1)"))
terminate called after throwing an instance of 'char const*'
ITS-tools command line returned an error code 134
Built C files in :
/tmp/ltsmin7882133153048347289
[2021-05-10 19:17:07] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7882133153048347289
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/ltsmin7882133153048347289]
Compilation finished in 196 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin7882133153048347289]
Link finished in 39 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, (X((LTLAPp0==true))||(<>((LTLAPp1==true))&&[]((LTLAPp2==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin7882133153048347289]
LTSmin run took 177 ms.
FORMULA FMS-PT-50000-01 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property FMS-PT-50000-01 finished in 2512 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 22 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 19:17:08] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-10 19:17:08] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 19:17:08] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-10 19:17:08] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 35 ms to find 0 implicit places.
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 19:17:08] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-10 19:17:08] [INFO ] Dead Transitions using invariants and state equation in 22 ms returned []
Finished structural reductions, in 1 iterations. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 60 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : FMS-PT-50000-02 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s10 1) (GEQ s17 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 7 steps with 0 reset in 0 ms.
FORMULA FMS-PT-50000-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-50000-02 finished in 128 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)||X((G(p1) U (p2&&G(p1))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 22 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 19:17:08] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-10 19:17:08] [INFO ] Implicit Places using invariants in 12 ms returned []
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 19:17:08] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-10 19:17:08] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 34 ms to find 0 implicit places.
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 19:17:08] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-10 19:17:08] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
Finished structural reductions, in 1 iterations. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 259 ms :[true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (OR (NOT p2) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : FMS-PT-50000-03 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 5}, { cond=p0, acceptance={} source=1 dest: 6}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(AND p0 p1), acceptance={} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 0}, { cond=(AND p2 p1), acceptance={0} source=5 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 0}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=6 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=6 dest: 3}, { cond=(AND p0 p2 p1), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=6 dest: 5}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=6 dest: 6}]], initial=1, aps=[p0:(OR (LT s0 1) (AND (GEQ s5 1) (GEQ s7 1))), p1:(GEQ s19 1), p2:(GEQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, 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 32 steps with 0 reset in 0 ms.
FORMULA FMS-PT-50000-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-50000-03 finished in 321 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 22 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 22/22 places, 20/20 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 22 transition count 15
Reduce places removed 8 places and 0 transitions.
Graph (trivial) has 11 edges and 14 vertex of which 9 / 14 are part of one of the 3 SCC in 0 ms
Free SCC test removed 6 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 11 rules applied. Total rules applied 16 place count 8 transition count 13
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 10 rules applied. Total rules applied 26 place count 5 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 27 place count 4 transition count 6
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 29 place count 4 transition count 4
Applied a total of 29 rules in 2 ms. Remains 4 /22 variables (removed 18) and now considering 4/20 (removed 16) transitions.
// Phase 1: matrix 4 rows 4 cols
[2021-05-10 19:17:08] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-10 19:17:08] [INFO ] Implicit Places using invariants in 7 ms returned []
// Phase 1: matrix 4 rows 4 cols
[2021-05-10 19:17:08] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-10 19:17:08] [INFO ] Implicit Places using invariants and state equation in 8 ms returned []
Implicit Place search using SMT with State Equation took 15 ms to find 0 implicit places.
[2021-05-10 19:17:08] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 4 rows 4 cols
[2021-05-10 19:17:08] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-10 19:17:08] [INFO ] Dead Transitions using invariants and state equation in 9 ms returned []
Finished structural reductions, in 1 iterations. Remains : 4/22 places, 4/20 transitions.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FMS-PT-50000-04 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s0 1) (GEQ s2 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FMS-PT-50000-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-50000-04 finished in 88 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(X(((p0&&F(p1)) U X(!p1))))))], workingDir=/home/mcc/execution]
Support contains 2 out of 22 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 19:17:08] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-10 19:17:08] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 19:17:08] [INFO ] Computed 6 place invariants in 2 ms
[2021-05-10 19:17:08] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 19:17:08] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-10 19:17:08] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
Finished structural reductions, in 1 iterations. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 169 ms :[p1, p1, p1, p1, p1, true, p1]
Running random walk in product with property : FMS-PT-50000-05 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 2}], [{ cond=p1, acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={} source=3 dest: 0}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=true, acceptance={} source=6 dest: 4}]], initial=6, aps=[p0:(LT s11 1), p1:(LT s4 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 20000 reset in 131 ms.
Product exploration explored 100000 steps with 20000 reset in 109 ms.
Knowledge obtained : [p0, (NOT p1)]
Stuttering acceptance computed with spot in 161 ms :[p1, p1, p1, p1, p1, true, p1]
Product exploration explored 100000 steps with 20000 reset in 85 ms.
Product exploration explored 100000 steps with 20000 reset in 95 ms.
Applying partial POR strategy [false, false, true, false, false, true, false]
Stuttering acceptance computed with spot in 160 ms :[p1, p1, p1, p1, p1, true, p1]
Support contains 2 out of 22 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 22/22 places, 20/20 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 22 transition count 20
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 4 place count 22 transition count 20
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 7 place count 22 transition count 20
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 21 transition count 19
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 21 transition count 19
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 21 transition count 20
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 21 transition count 22
Deduced a syphon composed of 9 places in 0 ms
Applied a total of 12 rules in 6 ms. Remains 21 /22 variables (removed 1) and now considering 22/20 (removed -2) transitions.
[2021-05-10 19:17:10] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 22 rows 21 cols
[2021-05-10 19:17:10] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-10 19:17:10] [INFO ] Dead Transitions using invariants and state equation in 18 ms returned []
Finished structural reductions, in 1 iterations. Remains : 21/22 places, 22/20 transitions.
Product exploration explored 100000 steps with 20000 reset in 108 ms.
Product exploration explored 100000 steps with 20000 reset in 103 ms.
[2021-05-10 19:17:10] [INFO ] Flatten gal took : 2 ms
[2021-05-10 19:17:10] [INFO ] Flatten gal took : 2 ms
[2021-05-10 19:17:10] [INFO ] Time to serialize gal into /tmp/LTL16535291876909093298.gal : 1 ms
[2021-05-10 19:17:10] [INFO ] Time to serialize properties into /tmp/LTL4325639347009806359.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/LTL16535291876909093298.gal, -t, CGAL, -LTL, /tmp/LTL4325639347009806359.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/LTL16535291876909093298.gal -t CGAL -LTL /tmp/LTL4325639347009806359.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X(X((("(P2M2<1)")&&(F("(P1<1)")))U(X("(P1>=1)")))))))
Formula 0 simplified : !XXX(("(P2M2<1)" & F"(P1<1)") U X"(P1>=1)")
terminate called after throwing an instance of 'char const*'
ITS-tools command line returned an error code 134
[2021-05-10 19:17:10] [INFO ] Flatten gal took : 2 ms
[2021-05-10 19:17:10] [INFO ] Applying decomposition
[2021-05-10 19:17:10] [INFO ] Flatten gal took : 1 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/graph13082987542364178938.txt, -o, /tmp/graph13082987542364178938.bin, -w, /tmp/graph13082987542364178938.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/graph13082987542364178938.bin, -l, -1, -v, -w, /tmp/graph13082987542364178938.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-10 19:17:10] [INFO ] Decomposing Gal with order
[2021-05-10 19:17:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-10 19:17:10] [INFO ] Removed a total of 1 redundant transitions.
[2021-05-10 19:17:10] [INFO ] Flatten gal took : 3 ms
[2021-05-10 19:17:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-10 19:17:10] [INFO ] Time to serialize gal into /tmp/LTL2686266920540418806.gal : 0 ms
[2021-05-10 19:17:10] [INFO ] Time to serialize properties into /tmp/LTL7785316562135683773.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/LTL2686266920540418806.gal, -t, CGAL, -LTL, /tmp/LTL7785316562135683773.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/LTL2686266920540418806.gal -t CGAL -LTL /tmp/LTL7785316562135683773.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(X(X((("(i1.u5.P2M2<1)")&&(F("(i0.u2.P1<1)")))U(X("(i0.u2.P1>=1)")))))))
Formula 0 simplified : !XXX(("(i1.u5.P2M2<1)" & F"(i0.u2.P1<1)") U X"(i0.u2.P1>=1)")
terminate called after throwing an instance of 'char const*'
ITS-tools command line returned an error code 134
Built C files in :
/tmp/ltsmin14210313800016098966
[2021-05-10 19:17:10] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14210313800016098966
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/ltsmin14210313800016098966]
Compilation finished in 129 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin14210313800016098966]
Link finished in 39 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(X(X((((LTLAPp0==true)&&<>((LTLAPp1==true))) U X(!(LTLAPp1==true)))))), --buchi-type=spotba], workingDir=/tmp/ltsmin14210313800016098966]
LTSmin run took 227 ms.
FORMULA FMS-PT-50000-05 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property FMS-PT-50000-05 finished in 1838 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G((!p0&&(X(p1)||G(p2))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 22 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 19:17:10] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-10 19:17:10] [INFO ] Implicit Places using invariants in 16 ms returned []
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 19:17:10] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-10 19:17:10] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 19:17:10] [INFO ] Computed 6 place invariants in 8 ms
[2021-05-10 19:17:10] [INFO ] Dead Transitions using invariants and state equation in 22 ms returned []
Finished structural reductions, in 1 iterations. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 122 ms :[(OR p0 (AND (NOT p1) (NOT p2))), (OR p0 (AND (NOT p1) (NOT p2))), (OR p0 (AND (NOT p1) (NOT p2))), (OR p0 (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : FMS-PT-50000-07 automaton TGBA [mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p2 (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 2}, { cond=(AND p2 (NOT p0) p1), acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=(AND p2 (NOT p0) p1), acceptance={} source=2 dest: 2}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={0} source=3 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=3 dest: 1}, { cond=(AND p2 (NOT p0)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s10 1) (GEQ s17 1)), p2:(LT s14 1), p1:(GEQ s19 1)], 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]]
Product exploration explored 100000 steps with 0 reset in 158 ms.
Stack based approach found an accepted trace after 325 steps with 0 reset with depth 326 and stack size 326 in 1 ms.
FORMULA FMS-PT-50000-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-50000-07 finished in 354 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(p0)&&F(p1)))], workingDir=/home/mcc/execution]
Support contains 3 out of 22 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 19:17:11] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-10 19:17:11] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 19:17:11] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-10 19:17:11] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 19:17:11] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-10 19:17:11] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
Finished structural reductions, in 1 iterations. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 81 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), true]
Running random walk in product with property : FMS-PT-50000-08 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(GEQ s16 1), p0:(AND (GEQ s2 1) (GEQ s18 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FMS-PT-50000-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-50000-08 finished in 149 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0 U p1)))], workingDir=/home/mcc/execution]
Support contains 2 out of 22 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 19:17:11] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-10 19:17:11] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 19:17:11] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-10 19:17:11] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 19:17:11] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-10 19:17:11] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
Finished structural reductions, in 1 iterations. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 59 ms :[(NOT p1), (NOT p1), true]
Running random walk in product with property : FMS-PT-50000-09 automaton TGBA [mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(AND (GEQ s0 1) (GEQ s16 1)), p0:(GEQ s16 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA FMS-PT-50000-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-50000-09 finished in 119 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(!p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 22 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 22/22 places, 20/20 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 22 transition count 16
Reduce places removed 6 places and 0 transitions.
Graph (trivial) has 10 edges and 16 vertex of which 6 / 16 are part of one of the 2 SCC in 0 ms
Free SCC test removed 4 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 9 rules applied. Total rules applied 13 place count 12 transition count 14
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 8 rules applied. Total rules applied 21 place count 9 transition count 9
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 22 place count 8 transition count 9
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 22 place count 8 transition count 7
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 5 rules applied. Total rules applied 27 place count 5 transition count 7
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 28 place count 5 transition count 6
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 28 place count 5 transition count 5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 31 place count 3 transition count 5
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 32 place count 3 transition count 4
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 34 place count 2 transition count 3
Applied a total of 34 rules in 5 ms. Remains 2 /22 variables (removed 20) and now considering 3/20 (removed 17) transitions.
// Phase 1: matrix 3 rows 2 cols
[2021-05-10 19:17:11] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-10 19:17:11] [INFO ] Implicit Places using invariants in 6 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2021-05-10 19:17:11] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-10 19:17:11] [INFO ] Implicit Places using invariants and state equation in 6 ms returned []
Implicit Place search using SMT with State Equation took 13 ms to find 0 implicit places.
[2021-05-10 19:17:11] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2021-05-10 19:17:11] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-10 19:17:11] [INFO ] Dead Transitions using invariants and state equation in 6 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2/22 places, 3/20 transitions.
Stuttering acceptance computed with spot in 48 ms :[p0, p0]
Running random walk in product with property : FMS-PT-50000-10 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA FMS-PT-50000-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-50000-10 finished in 83 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(p0))], workingDir=/home/mcc/execution]
Support contains 1 out of 22 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 19:17:11] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-10 19:17:11] [INFO ] Implicit Places using invariants in 12 ms returned []
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 19:17:11] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-10 19:17:11] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 33 ms to find 0 implicit places.
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 19:17:11] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-10 19:17:11] [INFO ] Dead Transitions using invariants and state equation in 17 ms returned []
Finished structural reductions, in 1 iterations. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : FMS-PT-50000-11 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(LT s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 75 ms.
Product exploration explored 100000 steps with 50000 reset in 88 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 53 ms :[(NOT p0), (NOT p0), true]
Product exploration explored 100000 steps with 50000 reset in 77 ms.
Product exploration explored 100000 steps with 50000 reset in 89 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0), true]
Support contains 1 out of 22 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 22/22 places, 20/20 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 22 transition count 20
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 4 Pre rules applied. Total rules applied 5 place count 22 transition count 20
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 9 place count 22 transition count 20
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 21 transition count 19
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 21 transition count 19
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 10 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 13 place count 21 transition count 19
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 11 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 21 transition count 22
Deduced a syphon composed of 11 places in 0 ms
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 16 place count 21 transition count 20
Deduced a syphon composed of 11 places in 0 ms
Applied a total of 16 rules in 4 ms. Remains 21 /22 variables (removed 1) and now considering 20/20 (removed 0) transitions.
[2021-05-10 19:17:12] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-10 19:17:12] [INFO ] Flow matrix only has 19 transitions (discarded 1 similar events)
// Phase 1: matrix 19 rows 21 cols
[2021-05-10 19:17:12] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-10 19:17:12] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
Finished structural reductions, in 1 iterations. Remains : 21/22 places, 20/20 transitions.
Product exploration explored 100000 steps with 50000 reset in 169 ms.
Product exploration explored 100000 steps with 50000 reset in 207 ms.
[2021-05-10 19:17:12] [INFO ] Flatten gal took : 2 ms
[2021-05-10 19:17:12] [INFO ] Flatten gal took : 2 ms
[2021-05-10 19:17:12] [INFO ] Time to serialize gal into /tmp/LTL5642355675352602290.gal : 1 ms
[2021-05-10 19:17:12] [INFO ] Time to serialize properties into /tmp/LTL7594501082492027061.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/LTL5642355675352602290.gal, -t, CGAL, -LTL, /tmp/LTL7594501082492027061.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/LTL5642355675352602290.gal -t CGAL -LTL /tmp/LTL7594501082492027061.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X("(P1s<1)")))
Formula 0 simplified : !X"(P1s<1)"
terminate called after throwing an instance of 'char const*'
ITS-tools command line returned an error code 134
[2021-05-10 19:17:12] [INFO ] Flatten gal took : 2 ms
[2021-05-10 19:17:12] [INFO ] Applying decomposition
[2021-05-10 19:17:12] [INFO ] Flatten gal took : 1 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/graph16033189709731961666.txt, -o, /tmp/graph16033189709731961666.bin, -w, /tmp/graph16033189709731961666.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/graph16033189709731961666.bin, -l, -1, -v, -w, /tmp/graph16033189709731961666.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-10 19:17:12] [INFO ] Decomposing Gal with order
[2021-05-10 19:17:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-10 19:17:12] [INFO ] Removed a total of 1 redundant transitions.
[2021-05-10 19:17:12] [INFO ] Flatten gal took : 3 ms
[2021-05-10 19:17:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2021-05-10 19:17:12] [INFO ] Time to serialize gal into /tmp/LTL6900899348701012439.gal : 1 ms
[2021-05-10 19:17:12] [INFO ] Time to serialize properties into /tmp/LTL9934296996984257865.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/LTL6900899348701012439.gal, -t, CGAL, -LTL, /tmp/LTL9934296996984257865.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/LTL6900899348701012439.gal -t CGAL -LTL /tmp/LTL9934296996984257865.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X("(i0.u0.P1s<1)")))
Formula 0 simplified : !X"(i0.u0.P1s<1)"
terminate called after throwing an instance of 'char const*'
ITS-tools command line returned an error code 134
Built C files in :
/tmp/ltsmin7062975644886303619
[2021-05-10 19:17:12] [INFO ] Built C files in 0ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7062975644886303619
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/ltsmin7062975644886303619]
Compilation finished in 137 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin7062975644886303619]
Link finished in 33 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X((LTLAPp0==true)), --buchi-type=spotba], workingDir=/tmp/ltsmin7062975644886303619]
LTSmin run took 131 ms.
FORMULA FMS-PT-50000-11 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property FMS-PT-50000-11 finished in 1402 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 22 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 22/22 places, 20/20 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 22 transition count 14
Reduce places removed 9 places and 0 transitions.
Graph (trivial) has 10 edges and 13 vertex of which 6 / 13 are part of one of the 2 SCC in 0 ms
Free SCC test removed 4 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 12 rules applied. Total rules applied 18 place count 9 transition count 12
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 7 rules applied. Total rules applied 25 place count 7 transition count 7
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 26 place count 6 transition count 7
Applied a total of 26 rules in 2 ms. Remains 6 /22 variables (removed 16) and now considering 7/20 (removed 13) transitions.
[2021-05-10 19:17:12] [INFO ] Flow matrix only has 6 transitions (discarded 1 similar events)
// Phase 1: matrix 6 rows 6 cols
[2021-05-10 19:17:12] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-10 19:17:12] [INFO ] Implicit Places using invariants in 8 ms returned []
[2021-05-10 19:17:12] [INFO ] Flow matrix only has 6 transitions (discarded 1 similar events)
// Phase 1: matrix 6 rows 6 cols
[2021-05-10 19:17:12] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-10 19:17:12] [INFO ] Implicit Places using invariants and state equation in 10 ms returned []
Implicit Place search using SMT with State Equation took 18 ms to find 0 implicit places.
[2021-05-10 19:17:12] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-10 19:17:12] [INFO ] Flow matrix only has 6 transitions (discarded 1 similar events)
// Phase 1: matrix 6 rows 6 cols
[2021-05-10 19:17:12] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-10 19:17:12] [INFO ] Dead Transitions using invariants and state equation in 8 ms returned []
Finished structural reductions, in 1 iterations. Remains : 6/22 places, 7/20 transitions.
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Running random walk in product with property : FMS-PT-50000-13 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(LT s5 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FMS-PT-50000-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-50000-13 finished in 63 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(((p0&&X(X(X(p1))))||G(p1)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 22 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 19:17:12] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-10 19:17:12] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 19:17:12] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-10 19:17:12] [INFO ] Implicit Places using invariants and state equation in 14 ms returned []
Implicit Place search using SMT with State Equation took 34 ms to find 0 implicit places.
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 19:17:12] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-10 19:17:12] [INFO ] Dead Transitions using invariants and state equation in 13 ms returned []
Finished structural reductions, in 1 iterations. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 233 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : FMS-PT-50000-14 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 2}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 3}, { cond=(AND p0 p1), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 5}, { cond=(AND p0 p1), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 6}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 6}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 7}, { cond=(AND p0 p1), acceptance={} source=4 dest: 7}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 8}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 8}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=5 dest: 5}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=5 dest: 6}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=6 dest: 7}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=6 dest: 8}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=7 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=7 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=8 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=8 dest: 2}]], initial=0, aps=[p0:(LT s12 1), p1:(OR (LT s5 1) (LT s7 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 3090 reset in 130 ms.
Stack based approach found an accepted trace after 174 steps with 7 reset with depth 45 and stack size 45 in 1 ms.
FORMULA FMS-PT-50000-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-50000-14 finished in 427 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(((p0&&X(X(p1))) U p2)))], workingDir=/home/mcc/execution]
Support contains 4 out of 22 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 19:17:13] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-10 19:17:13] [INFO ] Implicit Places using invariants in 12 ms returned []
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 19:17:13] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-10 19:17:13] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 34 ms to find 0 implicit places.
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 19:17:13] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-10 19:17:13] [INFO ] Dead Transitions using invariants and state equation in 16 ms returned []
Finished structural reductions, in 1 iterations. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 92 ms :[(NOT p2), true, (OR (NOT p2) (NOT p1)), (NOT p1)]
Running random walk in product with property : FMS-PT-50000-15 automaton TGBA [mat=[[{ cond=(OR p2 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={0} source=2 dest: 2}, { cond=(OR p2 p0), acceptance={0} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}]], initial=0, aps=[p2:(GEQ s16 1), p0:(LT s11 1), p1:(OR (LT s13 1) (LT s15 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 29 steps with 7 reset in 0 ms.
FORMULA FMS-PT-50000-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-50000-15 finished in 158 ms.
All properties solved without resorting to model-checking.
BK_STOP 1620674234448
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FMS-PT-50000"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is FMS-PT-50000, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r083-tall-162048875900837"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FMS-PT-50000.tgz
mv FMS-PT-50000 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;