About the Execution of ITS-Tools for ShieldIIPt-PT-040A
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16247.100 | 1519127.00 | 1393897.00 | 295485.10 | FFFFTFTFFTFTTFTT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2021-input.r216-tall-162098205100468.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 ShieldIIPt-PT-040A, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r216-tall-162098205100468
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 576K
-rw-r--r-- 1 mcc users 9.6K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 109K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Mar 28 16:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 28 16:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Mar 27 12:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 27 12:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 25 18:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 25 18:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 08:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 08:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:52 equiv_col
-rw-r--r-- 1 mcc users 5 May 5 16:52 instance
-rw-r--r-- 1 mcc users 6 May 5 16:52 iscolored
-rw-r--r-- 1 mcc users 212K May 5 16:52 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME ShieldIIPt-PT-040A-00
FORMULA_NAME ShieldIIPt-PT-040A-01
FORMULA_NAME ShieldIIPt-PT-040A-02
FORMULA_NAME ShieldIIPt-PT-040A-03
FORMULA_NAME ShieldIIPt-PT-040A-04
FORMULA_NAME ShieldIIPt-PT-040A-05
FORMULA_NAME ShieldIIPt-PT-040A-06
FORMULA_NAME ShieldIIPt-PT-040A-07
FORMULA_NAME ShieldIIPt-PT-040A-08
FORMULA_NAME ShieldIIPt-PT-040A-09
FORMULA_NAME ShieldIIPt-PT-040A-10
FORMULA_NAME ShieldIIPt-PT-040A-11
FORMULA_NAME ShieldIIPt-PT-040A-12
FORMULA_NAME ShieldIIPt-PT-040A-13
FORMULA_NAME ShieldIIPt-PT-040A-14
FORMULA_NAME ShieldIIPt-PT-040A-15
=== Now, execution of the tool begins
BK_START 1621108342579
Running Version 0
[2021-05-15 19:52:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-15 19:52:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-15 19:52:25] [INFO ] Load time of PNML (sax parser for PT used): 104 ms
[2021-05-15 19:52:25] [INFO ] Transformed 763 places.
[2021-05-15 19:52:25] [INFO ] Transformed 563 transitions.
[2021-05-15 19:52:25] [INFO ] Found NUPN structural information;
[2021-05-15 19:52:25] [INFO ] Parsed PT model containing 763 places and 563 transitions in 174 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2021-05-15 19:52:25] [INFO ] Initial state test concluded for 4 properties.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
FORMULA ShieldIIPt-PT-040A-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-040A-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-040A-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-040A-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-040A-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-040A-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-040A-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-040A-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-040A-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 29 out of 763 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 763/763 places, 562/562 transitions.
Applied a total of 0 rules in 73 ms. Remains 763 /763 variables (removed 0) and now considering 562/562 (removed 0) transitions.
// Phase 1: matrix 562 rows 763 cols
[2021-05-15 19:52:25] [INFO ] Computed 361 place invariants in 26 ms
[2021-05-15 19:52:26] [INFO ] Implicit Places using invariants in 695 ms returned []
// Phase 1: matrix 562 rows 763 cols
[2021-05-15 19:52:26] [INFO ] Computed 361 place invariants in 9 ms
[2021-05-15 19:52:27] [INFO ] Implicit Places using invariants and state equation in 819 ms returned []
Implicit Place search using SMT with State Equation took 1544 ms to find 0 implicit places.
// Phase 1: matrix 562 rows 763 cols
[2021-05-15 19:52:27] [INFO ] Computed 361 place invariants in 13 ms
[2021-05-15 19:52:27] [INFO ] Dead Transitions using invariants and state equation in 390 ms returned []
Finished structural reductions, in 1 iterations. Remains : 763/763 places, 562/562 transitions.
[2021-05-15 19:52:27] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2021-05-15 19:52:27] [INFO ] Flatten gal took : 172 ms
FORMULA ShieldIIPt-PT-040A-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-040A-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-15 19:52:27] [INFO ] Flatten gal took : 101 ms
[2021-05-15 19:52:28] [INFO ] Input system was already deterministic with 562 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 977 ms. (steps per millisecond=102 ) properties (out of 12) seen :3
Running SMT prover for 9 properties.
// Phase 1: matrix 562 rows 763 cols
[2021-05-15 19:52:29] [INFO ] Computed 361 place invariants in 7 ms
[2021-05-15 19:52:29] [INFO ] [Real]Absence check using 361 positive place invariants in 53 ms returned sat
[2021-05-15 19:52:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 19:52:29] [INFO ] [Real]Absence check using state equation in 188 ms returned sat
[2021-05-15 19:52:29] [INFO ] Solution in real domain found non-integer solution.
[2021-05-15 19:52:29] [INFO ] [Nat]Absence check using 361 positive place invariants in 55 ms returned sat
[2021-05-15 19:52:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-15 19:52:29] [INFO ] [Nat]Absence check using state equation in 198 ms returned sat
[2021-05-15 19:52:29] [INFO ] Computed and/alt/rep : 561/1999/561 causal constraints (skipped 0 transitions) in 49 ms.
[2021-05-15 19:52:38] [INFO ] Added : 543 causal constraints over 112 iterations in 8529 ms. Result :sat
[2021-05-15 19:52:38] [INFO ] [Real]Absence check using 361 positive place invariants in 58 ms returned sat
[2021-05-15 19:52:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 19:52:38] [INFO ] [Real]Absence check using state equation in 186 ms returned sat
[2021-05-15 19:52:38] [INFO ] Computed and/alt/rep : 561/1999/561 causal constraints (skipped 0 transitions) in 48 ms.
[2021-05-15 19:52:38] [INFO ] Solution in real domain found non-integer solution.
[2021-05-15 19:52:39] [INFO ] [Nat]Absence check using 361 positive place invariants in 53 ms returned sat
[2021-05-15 19:52:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-15 19:52:39] [INFO ] [Nat]Absence check using state equation in 183 ms returned sat
[2021-05-15 19:52:39] [INFO ] Computed and/alt/rep : 561/1999/561 causal constraints (skipped 0 transitions) in 32 ms.
[2021-05-15 19:52:47] [INFO ] Added : 549 causal constraints over 116 iterations in 8357 ms. Result :sat
[2021-05-15 19:52:47] [INFO ] [Real]Absence check using 361 positive place invariants in 52 ms returned sat
[2021-05-15 19:52:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 19:52:48] [INFO ] [Real]Absence check using state equation in 185 ms returned sat
[2021-05-15 19:52:48] [INFO ] Solution in real domain found non-integer solution.
[2021-05-15 19:52:48] [INFO ] [Nat]Absence check using 361 positive place invariants in 53 ms returned sat
[2021-05-15 19:52:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-15 19:52:48] [INFO ] [Nat]Absence check using state equation in 184 ms returned sat
[2021-05-15 19:52:48] [INFO ] Computed and/alt/rep : 561/1999/561 causal constraints (skipped 0 transitions) in 31 ms.
[2021-05-15 19:52:56] [INFO ] Added : 550 causal constraints over 112 iterations in 8279 ms. Result :sat
[2021-05-15 19:52:56] [INFO ] [Real]Absence check using 361 positive place invariants in 54 ms returned sat
[2021-05-15 19:52:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 19:52:57] [INFO ] [Real]Absence check using state equation in 190 ms returned sat
[2021-05-15 19:52:57] [INFO ] Solution in real domain found non-integer solution.
[2021-05-15 19:52:57] [INFO ] [Nat]Absence check using 361 positive place invariants in 53 ms returned sat
[2021-05-15 19:52:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-15 19:52:57] [INFO ] [Nat]Absence check using state equation in 202 ms returned sat
[2021-05-15 19:52:57] [INFO ] Computed and/alt/rep : 561/1999/561 causal constraints (skipped 0 transitions) in 31 ms.
[2021-05-15 19:53:03] [INFO ] Added : 551 causal constraints over 111 iterations in 6527 ms. Result :sat
[2021-05-15 19:53:04] [INFO ] [Real]Absence check using 361 positive place invariants in 55 ms returned sat
[2021-05-15 19:53:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 19:53:04] [INFO ] [Real]Absence check using state equation in 191 ms returned sat
[2021-05-15 19:53:04] [INFO ] Solution in real domain found non-integer solution.
[2021-05-15 19:53:04] [INFO ] [Real]Absence check using 361 positive place invariants in 64 ms returned sat
[2021-05-15 19:53:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 19:53:04] [INFO ] [Real]Absence check using state equation in 191 ms returned sat
[2021-05-15 19:53:04] [INFO ] Solution in real domain found non-integer solution.
[2021-05-15 19:53:05] [INFO ] [Nat]Absence check using 361 positive place invariants in 53 ms returned sat
[2021-05-15 19:53:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-15 19:53:05] [INFO ] [Nat]Absence check using state equation in 184 ms returned sat
[2021-05-15 19:53:05] [INFO ] Computed and/alt/rep : 561/1999/561 causal constraints (skipped 0 transitions) in 28 ms.
[2021-05-15 19:53:12] [INFO ] Added : 547 causal constraints over 114 iterations in 7239 ms. Result :sat
[2021-05-15 19:53:12] [INFO ] [Real]Absence check using 361 positive place invariants in 51 ms returned sat
[2021-05-15 19:53:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 19:53:12] [INFO ] [Real]Absence check using state equation in 187 ms returned sat
[2021-05-15 19:53:12] [INFO ] Solution in real domain found non-integer solution.
[2021-05-15 19:53:12] [INFO ] [Nat]Absence check using 361 positive place invariants in 55 ms returned sat
[2021-05-15 19:53:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-15 19:53:13] [INFO ] [Nat]Absence check using state equation in 198 ms returned sat
[2021-05-15 19:53:13] [INFO ] Computed and/alt/rep : 561/1999/561 causal constraints (skipped 0 transitions) in 29 ms.
[2021-05-15 19:53:21] [INFO ] Added : 556 causal constraints over 114 iterations in 7919 ms. Result :sat
[2021-05-15 19:53:21] [INFO ] [Real]Absence check using 361 positive place invariants in 51 ms returned sat
[2021-05-15 19:53:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 19:53:21] [INFO ] [Real]Absence check using state equation in 187 ms returned sat
[2021-05-15 19:53:21] [INFO ] Solution in real domain found non-integer solution.
[2021-05-15 19:53:21] [INFO ] [Nat]Absence check using 361 positive place invariants in 54 ms returned sat
[2021-05-15 19:53:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-15 19:53:21] [INFO ] [Nat]Absence check using state equation in 191 ms returned sat
[2021-05-15 19:53:21] [INFO ] Computed and/alt/rep : 561/1999/561 causal constraints (skipped 0 transitions) in 28 ms.
[2021-05-15 19:53:29] [INFO ] Added : 548 causal constraints over 111 iterations in 7934 ms. Result :sat
[2021-05-15 19:53:29] [INFO ] [Real]Absence check using 361 positive place invariants in 54 ms returned sat
[2021-05-15 19:53:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 19:53:30] [INFO ] [Real]Absence check using state equation in 189 ms returned sat
[2021-05-15 19:53:30] [INFO ] Solution in real domain found non-integer solution.
[2021-05-15 19:53:30] [INFO ] [Nat]Absence check using 361 positive place invariants in 54 ms returned sat
[2021-05-15 19:53:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-15 19:53:30] [INFO ] [Nat]Absence check using state equation in 191 ms returned sat
[2021-05-15 19:53:30] [INFO ] Computed and/alt/rep : 561/1999/561 causal constraints (skipped 0 transitions) in 29 ms.
[2021-05-15 19:53:38] [INFO ] Added : 548 causal constraints over 111 iterations in 7847 ms. Result :sat
Successfully simplified 1 atomic propositions for a total of 5 simplifications.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(((p1 U (X(p2)||G(p1)))&&p0))))], workingDir=/home/mcc/execution]
Support contains 3 out of 763 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 763/763 places, 562/562 transitions.
Applied a total of 0 rules in 32 ms. Remains 763 /763 variables (removed 0) and now considering 562/562 (removed 0) transitions.
// Phase 1: matrix 562 rows 763 cols
[2021-05-15 19:53:38] [INFO ] Computed 361 place invariants in 3 ms
[2021-05-15 19:53:38] [INFO ] Implicit Places using invariants in 407 ms returned []
// Phase 1: matrix 562 rows 763 cols
[2021-05-15 19:53:38] [INFO ] Computed 361 place invariants in 2 ms
[2021-05-15 19:53:39] [INFO ] Implicit Places using invariants and state equation in 715 ms returned []
Implicit Place search using SMT with State Equation took 1131 ms to find 0 implicit places.
// Phase 1: matrix 562 rows 763 cols
[2021-05-15 19:53:39] [INFO ] Computed 361 place invariants in 5 ms
[2021-05-15 19:53:40] [INFO ] Dead Transitions using invariants and state equation in 384 ms returned []
Finished structural reductions, in 1 iterations. Remains : 763/763 places, 562/562 transitions.
Stuttering acceptance computed with spot in 179 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : ShieldIIPt-PT-040A-01 automaton TGBA [mat=[[{ cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=0 dest: 0}, { cond=(OR (AND p1 (NOT p2)) (NOT p0)), acceptance={0} source=0 dest: 1}, { cond=(AND p1 p0 p2), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 0}, { cond=(AND p1 p0), acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p1:(AND (NEQ s672 0) (NEQ s97 1)), p0:(AND (NEQ s672 0) (NEQ s97 1)), p2:(NEQ s218 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 0 reset in 788 ms.
Stack based approach found an accepted trace after 284 steps with 0 reset with depth 285 and stack size 285 in 4 ms.
FORMULA ShieldIIPt-PT-040A-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-040A-01 finished in 2575 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G(F(p0)) U p1)))], workingDir=/home/mcc/execution]
Support contains 3 out of 763 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 763/763 places, 562/562 transitions.
Applied a total of 0 rules in 13 ms. Remains 763 /763 variables (removed 0) and now considering 562/562 (removed 0) transitions.
// Phase 1: matrix 562 rows 763 cols
[2021-05-15 19:53:41] [INFO ] Computed 361 place invariants in 2 ms
[2021-05-15 19:53:41] [INFO ] Implicit Places using invariants in 389 ms returned []
// Phase 1: matrix 562 rows 763 cols
[2021-05-15 19:53:41] [INFO ] Computed 361 place invariants in 2 ms
[2021-05-15 19:53:42] [INFO ] Implicit Places using invariants and state equation in 715 ms returned []
Implicit Place search using SMT with State Equation took 1115 ms to find 0 implicit places.
// Phase 1: matrix 562 rows 763 cols
[2021-05-15 19:53:42] [INFO ] Computed 361 place invariants in 1 ms
[2021-05-15 19:53:42] [INFO ] Dead Transitions using invariants and state equation in 365 ms returned []
Finished structural reductions, in 1 iterations. Remains : 763/763 places, 562/562 transitions.
Stuttering acceptance computed with spot in 3871 ms :[(NOT p1), (NOT p1), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-040A-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 2}, { cond=(NOT p1), acceptance={0} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(NEQ s122 0), p0:(OR (EQ s160 0) (EQ s698 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]]
Product exploration explored 100000 steps with 0 reset in 666 ms.
Product exploration explored 100000 steps with 0 reset in 906 ms.
Knowledge obtained : [(NOT p1), p0]
Stuttering acceptance computed with spot in 93 ms :[(NOT p1), (NOT p1), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 649 ms.
Product exploration explored 100000 steps with 0 reset in 847 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 93 ms :[(NOT p1), (NOT p1), (NOT p0), (NOT p0)]
Support contains 3 out of 763 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 763/763 places, 562/562 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 763 transition count 562
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 763 transition count 562
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 2 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 763 transition count 562
Deduced a syphon composed of 2 places in 2 ms
Applied a total of 2 rules in 173 ms. Remains 763 /763 variables (removed 0) and now considering 562/562 (removed 0) transitions.
[2021-05-15 19:53:50] [INFO ] Redundant transitions in 36 ms returned []
// Phase 1: matrix 562 rows 763 cols
[2021-05-15 19:53:50] [INFO ] Computed 361 place invariants in 2 ms
[2021-05-15 19:53:50] [INFO ] Dead Transitions using invariants and state equation in 374 ms returned []
Finished structural reductions, in 1 iterations. Remains : 763/763 places, 562/562 transitions.
Product exploration explored 100000 steps with 0 reset in 773 ms.
Product exploration explored 100000 steps with 0 reset in 868 ms.
[2021-05-15 19:53:52] [INFO ] Flatten gal took : 48 ms
[2021-05-15 19:53:52] [INFO ] Flatten gal took : 48 ms
[2021-05-15 19:53:52] [INFO ] Time to serialize gal into /tmp/LTL4265856221401100558.gal : 26 ms
[2021-05-15 19:53:52] [INFO ] Time to serialize properties into /tmp/LTL3085561213711081604.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/LTL4265856221401100558.gal, -t, CGAL, -LTL, /tmp/LTL3085561213711081604.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/LTL4265856221401100558.gal -t CGAL -LTL /tmp/LTL3085561213711081604.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X((G(F("((p160==0)||(p698==1))")))U("(p122==1)"))))
Formula 0 simplified : !X(GF"((p160==0)||(p698==1))" U "(p122==1)")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2021-05-15 19:54:07] [INFO ] Flatten gal took : 51 ms
[2021-05-15 19:54:07] [INFO ] Applying decomposition
[2021-05-15 19:54:07] [INFO ] Flatten gal took : 40 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/graph6307423030540365176.txt, -o, /tmp/graph6307423030540365176.bin, -w, /tmp/graph6307423030540365176.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/graph6307423030540365176.bin, -l, -1, -v, -w, /tmp/graph6307423030540365176.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-15 19:54:07] [INFO ] Decomposing Gal with order
[2021-05-15 19:54:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-15 19:54:07] [INFO ] Removed a total of 120 redundant transitions.
[2021-05-15 19:54:07] [INFO ] Flatten gal took : 92 ms
[2021-05-15 19:54:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 36 ms.
[2021-05-15 19:54:07] [INFO ] Time to serialize gal into /tmp/LTL15077451072393219207.gal : 14 ms
[2021-05-15 19:54:07] [INFO ] Time to serialize properties into /tmp/LTL4008448088633714610.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/LTL15077451072393219207.gal, -t, CGAL, -LTL, /tmp/LTL4008448088633714610.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/LTL15077451072393219207.gal -t CGAL -LTL /tmp/LTL4008448088633714610.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X((G(F("((i4.i0.i1.u66.p160==0)||(i19.u293.p698==1))")))U("(i3.i0.i0.u50.p122==1)"))))
Formula 0 simplified : !X(GF"((i4.i0.i1.u66.p160==0)||(i19.u293.p698==1))" U "(i3.i0.i0.u50.p122==1)")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
1126 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,11.3567,354012,1,0,403576,443,3934,2.96979e+06,122,2064,164661
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ShieldIIPt-PT-040A-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Detected timeout of ITS tools.
Treatment of property ShieldIIPt-PT-040A-03 finished in 44128 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(G(p0))&&F(p1))))], workingDir=/home/mcc/execution]
Support contains 4 out of 763 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 763/763 places, 562/562 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 763 transition count 561
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 762 transition count 561
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 761 transition count 560
Applied a total of 4 rules in 76 ms. Remains 761 /763 variables (removed 2) and now considering 560/562 (removed 2) transitions.
// Phase 1: matrix 560 rows 761 cols
[2021-05-15 19:54:25] [INFO ] Computed 361 place invariants in 2 ms
[2021-05-15 19:54:26] [INFO ] Implicit Places using invariants in 583 ms returned [753, 754]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 594 ms to find 2 implicit places.
[2021-05-15 19:54:26] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 560 rows 759 cols
[2021-05-15 19:54:26] [INFO ] Computed 359 place invariants in 2 ms
[2021-05-15 19:54:26] [INFO ] Dead Transitions using invariants and state equation in 361 ms returned []
Starting structural reductions, iteration 1 : 759/763 places, 560/562 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 759 transition count 559
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 758 transition count 559
Applied a total of 2 rules in 32 ms. Remains 758 /759 variables (removed 1) and now considering 559/560 (removed 1) transitions.
// Phase 1: matrix 559 rows 758 cols
[2021-05-15 19:54:26] [INFO ] Computed 359 place invariants in 1 ms
[2021-05-15 19:54:27] [INFO ] Implicit Places using invariants in 406 ms returned [747]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 407 ms to find 1 implicit places.
Starting structural reductions, iteration 2 : 757/763 places, 559/562 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 756 transition count 558
Applied a total of 2 rules in 46 ms. Remains 756 /757 variables (removed 1) and now considering 558/559 (removed 1) transitions.
// Phase 1: matrix 558 rows 756 cols
[2021-05-15 19:54:27] [INFO ] Computed 358 place invariants in 2 ms
[2021-05-15 19:54:27] [INFO ] Implicit Places using invariants in 379 ms returned []
// Phase 1: matrix 558 rows 756 cols
[2021-05-15 19:54:27] [INFO ] Computed 358 place invariants in 2 ms
[2021-05-15 19:54:28] [INFO ] Implicit Places using invariants and state equation in 706 ms returned []
Implicit Place search using SMT with State Equation took 1087 ms to find 0 implicit places.
Finished structural reductions, in 3 iterations. Remains : 756/763 places, 558/562 transitions.
Stuttering acceptance computed with spot in 86 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldIIPt-PT-040A-05 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s506 0) (EQ s571 1)), p1:(OR (EQ s512 0) (EQ s638 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 699 ms.
Stack based approach found an accepted trace after 13 steps with 0 reset with depth 14 and stack size 14 in 1 ms.
FORMULA ShieldIIPt-PT-040A-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-040A-05 finished in 4088 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)||G(p1)))], workingDir=/home/mcc/execution]
Support contains 4 out of 763 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 763/763 places, 562/562 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 763 transition count 561
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 762 transition count 561
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 761 transition count 560
Applied a total of 4 rules in 36 ms. Remains 761 /763 variables (removed 2) and now considering 560/562 (removed 2) transitions.
// Phase 1: matrix 560 rows 761 cols
[2021-05-15 19:54:29] [INFO ] Computed 361 place invariants in 1 ms
[2021-05-15 19:54:29] [INFO ] Implicit Places using invariants in 389 ms returned [753, 754]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 391 ms to find 2 implicit places.
[2021-05-15 19:54:29] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 560 rows 759 cols
[2021-05-15 19:54:29] [INFO ] Computed 359 place invariants in 2 ms
[2021-05-15 19:54:30] [INFO ] Dead Transitions using invariants and state equation in 364 ms returned []
Starting structural reductions, iteration 1 : 759/763 places, 560/562 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 759 transition count 559
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 758 transition count 559
Applied a total of 2 rules in 33 ms. Remains 758 /759 variables (removed 1) and now considering 559/560 (removed 1) transitions.
// Phase 1: matrix 559 rows 758 cols
[2021-05-15 19:54:30] [INFO ] Computed 359 place invariants in 2 ms
[2021-05-15 19:54:30] [INFO ] Implicit Places using invariants in 396 ms returned [747]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 397 ms to find 1 implicit places.
Starting structural reductions, iteration 2 : 757/763 places, 559/562 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 756 transition count 558
Applied a total of 2 rules in 37 ms. Remains 756 /757 variables (removed 1) and now considering 558/559 (removed 1) transitions.
// Phase 1: matrix 558 rows 756 cols
[2021-05-15 19:54:30] [INFO ] Computed 358 place invariants in 4 ms
[2021-05-15 19:54:30] [INFO ] Implicit Places using invariants in 409 ms returned []
// Phase 1: matrix 558 rows 756 cols
[2021-05-15 19:54:30] [INFO ] Computed 358 place invariants in 1 ms
[2021-05-15 19:54:31] [INFO ] Implicit Places using invariants and state equation in 679 ms returned []
Implicit Place search using SMT with State Equation took 1090 ms to find 0 implicit places.
Finished structural reductions, in 3 iterations. Remains : 756/763 places, 558/562 transitions.
Stuttering acceptance computed with spot in 8266 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-040A-08 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=2, aps=[p1:(OR (EQ s541 0) (EQ s136 1)), p0:(OR (EQ s127 0) (EQ s509 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 718 ms.
Product exploration explored 100000 steps with 0 reset in 908 ms.
Knowledge obtained : [p1, p0]
Stuttering acceptance computed with spot in 77 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 722 ms.
Product exploration explored 100000 steps with 0 reset in 915 ms.
[2021-05-15 19:54:43] [INFO ] Flatten gal took : 32 ms
[2021-05-15 19:54:43] [INFO ] Flatten gal took : 32 ms
[2021-05-15 19:54:43] [INFO ] Time to serialize gal into /tmp/LTL5676739882302518541.gal : 3 ms
[2021-05-15 19:54:43] [INFO ] Time to serialize properties into /tmp/LTL11242488988539091800.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/LTL5676739882302518541.gal, -t, CGAL, -LTL, /tmp/LTL11242488988539091800.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/LTL5676739882302518541.gal -t CGAL -LTL /tmp/LTL11242488988539091800.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((G("((p127==0)||(p509==1))"))||(G("((p541==0)||(p136==1))"))))
Formula 0 simplified : !(G"((p127==0)||(p509==1))" | G"((p541==0)||(p136==1))")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2021-05-15 19:54:58] [INFO ] Flatten gal took : 31 ms
[2021-05-15 19:54:58] [INFO ] Applying decomposition
[2021-05-15 19:54:58] [INFO ] Flatten gal took : 30 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/graph11623679141565827007.txt, -o, /tmp/graph11623679141565827007.bin, -w, /tmp/graph11623679141565827007.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/graph11623679141565827007.bin, -l, -1, -v, -w, /tmp/graph11623679141565827007.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-15 19:54:58] [INFO ] Decomposing Gal with order
[2021-05-15 19:54:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-15 19:54:58] [INFO ] Removed a total of 119 redundant transitions.
[2021-05-15 19:54:58] [INFO ] Flatten gal took : 44 ms
[2021-05-15 19:54:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 25 ms.
[2021-05-15 19:54:58] [INFO ] Time to serialize gal into /tmp/LTL7331484624336664100.gal : 7 ms
[2021-05-15 19:54:58] [INFO ] Time to serialize properties into /tmp/LTL17660655948598072079.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/LTL7331484624336664100.gal, -t, CGAL, -LTL, /tmp/LTL17660655948598072079.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/LTL7331484624336664100.gal -t CGAL -LTL /tmp/LTL17660655948598072079.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !(((G("((i4.u52.p127==0)||(i14.i0.i0.u213.p509==1))"))||(G("((i15.u226.p541==0)||(i4.u57.p136==1))"))))
Formula 0 simplified : !(G"((i4.u52.p127==0)||(i14.i0.i0.u213.p509==1))" | G"((i15.u226.p541==0)||(i4.u57.p136==1))")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7669732811412268956
[2021-05-15 19:55:13] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7669732811412268956
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/ltsmin7669732811412268956]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin7669732811412268956] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin7669732811412268956] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property ShieldIIPt-PT-040A-08 finished in 45507 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(F((X(p1)||p0)))&&F(p2)))], workingDir=/home/mcc/execution]
Support contains 4 out of 763 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 763/763 places, 562/562 transitions.
Applied a total of 0 rules in 9 ms. Remains 763 /763 variables (removed 0) and now considering 562/562 (removed 0) transitions.
// Phase 1: matrix 562 rows 763 cols
[2021-05-15 19:55:14] [INFO ] Computed 361 place invariants in 2 ms
[2021-05-15 19:55:15] [INFO ] Implicit Places using invariants in 444 ms returned []
// Phase 1: matrix 562 rows 763 cols
[2021-05-15 19:55:15] [INFO ] Computed 361 place invariants in 2 ms
[2021-05-15 19:55:15] [INFO ] Implicit Places using invariants and state equation in 776 ms returned []
Implicit Place search using SMT with State Equation took 1222 ms to find 0 implicit places.
// Phase 1: matrix 562 rows 763 cols
[2021-05-15 19:55:15] [INFO ] Computed 361 place invariants in 2 ms
[2021-05-15 19:55:16] [INFO ] Dead Transitions using invariants and state equation in 360 ms returned []
Finished structural reductions, in 1 iterations. Remains : 763/763 places, 562/562 transitions.
Stuttering acceptance computed with spot in 10766 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPt-PT-040A-12 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(OR (AND (OR (EQ s216 0) (EQ s140 1)) (EQ s558 1)) (EQ s216 0) (EQ s140 1)), p0:(OR (EQ s216 0) (EQ s140 1)), p1:(EQ s385 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]]
Product exploration explored 100000 steps with 50000 reset in 2567 ms.
Product exploration explored 100000 steps with 50000 reset in 2542 ms.
Knowledge obtained : [p2, p0, (NOT p1)]
Stuttering acceptance computed with spot in 85 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 50000 reset in 2430 ms.
Product exploration explored 100000 steps with 50000 reset in 2522 ms.
java.io.IOException: java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[/home/mcc/BenchKit/bin//..//autstates.py, /tmp/curaut1018883212999066161.hoa], workingDir=/home/mcc/execution] killed by timeout after 10 SECONDS
at fr.lip6.move.gal.application.SpotRunner.computeForwardClosedSI(SpotRunner.java:313)
at fr.lip6.move.gal.application.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:195)
at fr.lip6.move.gal.application.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:60)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:470)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Caused by: java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[/home/mcc/BenchKit/bin//..//autstates.py, /tmp/curaut1018883212999066161.hoa], workingDir=/home/mcc/execution] killed by timeout after 10 SECONDS
at fr.lip6.move.gal.process.Runner.waitForOrTimeout(Runner.java:76)
at fr.lip6.move.gal.process.Runner.runTool(Runner.java:138)
at fr.lip6.move.gal.process.Runner.runTool(Runner.java:112)
at fr.lip6.move.gal.application.SpotRunner.computeForwardClosedSI(SpotRunner.java:311)
... 18 more
[2021-05-15 19:55:57] [INFO ] Flatten gal took : 32 ms
[2021-05-15 19:55:57] [INFO ] Flatten gal took : 39 ms
[2021-05-15 19:55:57] [INFO ] Time to serialize gal into /tmp/LTL1379306618447280300.gal : 3 ms
[2021-05-15 19:55:57] [INFO ] Time to serialize properties into /tmp/LTL11781775634327440860.ltl : 117 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/LTL1379306618447280300.gal, -t, CGAL, -LTL, /tmp/LTL11781775634327440860.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/LTL1379306618447280300.gal -t CGAL -LTL /tmp/LTL11781775634327440860.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((X(F(("((p216==0)||(p140==1))")||(X("(p385==1)")))))&&(F("(((((p216==0)||(p140==1))&&(p558==1))||(p216==0))||(p140==1))"))))
Formula 0 simplified : !(XF("((p216==0)||(p140==1))" | X"(p385==1)") & F"(((((p216==0)||(p140==1))&&(p558==1))||(p216==0))||(p140==1))")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
570 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,5.75563,100124,1,0,6,488036,17,0,18507,256811,9
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA ShieldIIPt-PT-040A-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property ShieldIIPt-PT-040A-12 finished in 48670 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin14529839461052958344
[2021-05-15 19:56:03] [INFO ] Computing symmetric may disable matrix : 562 transitions.
[2021-05-15 19:56:03] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-15 19:56:03] [INFO ] Computing symmetric may enable matrix : 562 transitions.
[2021-05-15 19:56:03] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-15 19:56:03] [INFO ] Applying decomposition
[2021-05-15 19:56:03] [INFO ] Flatten gal took : 34 ms
[2021-05-15 19:56:03] [INFO ] Computing Do-Not-Accords matrix : 562 transitions.
[2021-05-15 19:56:03] [INFO ] Computation of Completed DNA matrix. took 14 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-15 19:56:03] [INFO ] Built C files in 75ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14529839461052958344
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/ltsmin14529839461052958344]
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/graph5878972103748829099.txt, -o, /tmp/graph5878972103748829099.bin, -w, /tmp/graph5878972103748829099.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/graph5878972103748829099.bin, -l, -1, -v, -w, /tmp/graph5878972103748829099.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-15 19:56:03] [INFO ] Decomposing Gal with order
[2021-05-15 19:56:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-15 19:56:03] [INFO ] Removed a total of 120 redundant transitions.
[2021-05-15 19:56:03] [INFO ] Flatten gal took : 64 ms
[2021-05-15 19:56:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 11 ms.
[2021-05-15 19:56:03] [INFO ] Time to serialize gal into /tmp/LTLCardinality15841353265248338139.gal : 6 ms
[2021-05-15 19:56:03] [INFO ] Time to serialize properties into /tmp/LTLCardinality6115163217874561320.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/LTLCardinality15841353265248338139.gal, -t, CGAL, -LTL, /tmp/LTLCardinality6115163217874561320.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/LTLCardinality15841353265248338139.gal -t CGAL -LTL /tmp/LTLCardinality6115163217874561320.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !(((G("((i3.i1.i0.u52.p127==0)||(i14.u213.p509==1))"))||(G("((i15.u226.p541==0)||(i3.i1.i2.u57.p136==1))"))))
Formula 0 simplified : !(G"((i3.i1.i0.u52.p127==0)||(i14.u213.p509==1))" | G"((i15.u226.p541==0)||(i3.i1.i2.u57.p136==1))")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Compilation finished in 11707 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin14529839461052958344]
Link finished in 49 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, ([]((LTLAPp0==true))||[]((LTLAPp1==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin14529839461052958344]
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 2/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.005: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.015: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.015: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.043: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.043: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.051: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.051: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.211: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.215: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.215: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.215: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.231: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.232: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.247: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.261: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.261: Initializing POR dependencies: labels 564, guards 562
pins2lts-mc-linux64( 7/ 8), 2.198: LTL layer: formula: ([]((LTLAPp0==true))||[]((LTLAPp1==true)))
pins2lts-mc-linux64( 7/ 8), 2.199: "([]((LTLAPp0==true))||[]((LTLAPp1==true)))" is not a file, parsing as formula...
pins2lts-mc-linux64( 7/ 8), 2.200: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 2.304: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 2.494: Forcing use of the an ignoring proviso (cndfs)
pins2lts-mc-linux64( 0/ 8), 2.536: There are 566 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 2.536: State length is 764, there are 571 groups
pins2lts-mc-linux64( 0/ 8), 2.536: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 2.536: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 2.536: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 2.536: Visible groups: 11 / 571, labels: 2 / 566
pins2lts-mc-linux64( 0/ 8), 2.536: POR cycle proviso: cndfs (ltl)
pins2lts-mc-linux64( 0/ 8), 2.536: Global bits: 2, count bits: 2, local bits: 0
pins2lts-mc-linux64( 1/ 8), 2.711: [Blue] ~120 levels ~960 states ~1848 transitions
pins2lts-mc-linux64( 5/ 8), 2.743: [Blue] ~240 levels ~1920 states ~4560 transitions
pins2lts-mc-linux64( 5/ 8), 2.788: [Blue] ~480 levels ~3840 states ~9864 transitions
pins2lts-mc-linux64( 5/ 8), 2.901: [Blue] ~960 levels ~7680 states ~19848 transitions
pins2lts-mc-linux64( 3/ 8), 3.135: [Blue] ~1920 levels ~15360 states ~54544 transitions
pins2lts-mc-linux64( 7/ 8), 3.581: [Blue] ~3822 levels ~30720 states ~54848 transitions
pins2lts-mc-linux64( 5/ 8), 4.518: [Blue] ~7680 levels ~61440 states ~187056 transitions
pins2lts-mc-linux64( 7/ 8), 6.882: [Blue] ~15300 levels ~122880 states ~224400 transitions
pins2lts-mc-linux64( 7/ 8), 11.287: [Blue] ~30648 levels ~245760 states ~475880 transitions
pins2lts-mc-linux64( 7/ 8), 20.728: [Blue] ~61309 levels ~491520 states ~1009952 transitions
pins2lts-mc-linux64( 1/ 8), 40.695: [Blue] ~122829 levels ~983040 states ~2754248 transitions
pins2lts-mc-linux64( 1/ 8), 79.515: [Blue] ~245656 levels ~1966080 states ~5613496 transitions
pins2lts-mc-linux64( 0/ 8), 162.828: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 163.068:
pins2lts-mc-linux64( 0/ 8), 163.068: Explored 3224648 states 11145914 transitions, fanout: 3.456
pins2lts-mc-linux64( 0/ 8), 163.068: Total exploration time 160.510 sec (160.310 sec minimum, 160.368 sec on average)
pins2lts-mc-linux64( 0/ 8), 163.068: States per second: 20090, Transitions per second: 69441
pins2lts-mc-linux64( 0/ 8), 163.068:
pins2lts-mc-linux64( 0/ 8), 163.068: State space has 14696447 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 163.068: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 163.068: blue states: 3224648 (21.94%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 163.068: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 163.068: all-red states: 0 (0.00%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 163.068:
pins2lts-mc-linux64( 0/ 8), 163.068: Total memory used for local state coloring: 49.2MB
pins2lts-mc-linux64( 0/ 8), 163.068:
pins2lts-mc-linux64( 0/ 8), 163.068: Queue width: 8B, total height: 3223930, memory: 24.60MB
pins2lts-mc-linux64( 0/ 8), 163.068: Tree memory: 368.1MB, 26.3 B/state, compr.: 0.9%
pins2lts-mc-linux64( 0/ 8), 163.068: Tree fill ratio (roots/leafs): 10.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 163.068: Stored 661 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 163.068: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 163.068: Est. total memory use: 392.7MB (~1048.6MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, ([]((LTLAPp0==true))||[]((LTLAPp1==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin14529839461052958344]
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, ([]((LTLAPp0==true))||[]((LTLAPp1==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin14529839461052958344]
255
at fr.lip6.move.gal.application.LTSminRunner.checkProperty(LTSminRunner.java:214)
at fr.lip6.move.gal.application.LTSminRunner.access$10(LTSminRunner.java:165)
at fr.lip6.move.gal.application.LTSminRunner$1.checkProperties(LTSminRunner.java:154)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:98)
at java.base/java.lang.Thread.run(Thread.java:834)
Detected timeout of ITS tools.
[2021-05-15 20:17:25] [INFO ] Applying decomposition
[2021-05-15 20:17:26] [INFO ] Flatten gal took : 533 ms
[2021-05-15 20:17:26] [INFO ] Decomposing Gal with order
[2021-05-15 20:17:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-15 20:17:26] [INFO ] Removed a total of 160 redundant transitions.
[2021-05-15 20:17:26] [INFO ] Flatten gal took : 212 ms
[2021-05-15 20:17:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 48 ms.
[2021-05-15 20:17:27] [INFO ] Time to serialize gal into /tmp/LTLCardinality1588656381070623635.gal : 25 ms
[2021-05-15 20:17:27] [INFO ] Time to serialize properties into /tmp/LTLCardinality6919851036780533481.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/LTLCardinality1588656381070623635.gal, -t, CGAL, -LTL, /tmp/LTLCardinality6919851036780533481.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/LTLCardinality1588656381070623635.gal -t CGAL -LTL /tmp/LTLCardinality6919851036780533481.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !(((G("((u67.p127==0)||(u268.p509==1))"))||(G("((i226.u285.p541==0)||(u72.p136==1))"))))
Formula 0 simplified : !(G"((u67.p127==0)||(u268.p509==1))" | G"((i226.u285.p541==0)||(u72.p136==1))")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
1184 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,11.9174,283232,1,0,576462,1099,9211,864424,45,803,1252098
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ShieldIIPt-PT-040A-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
BK_STOP 1621109861706
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldIIPt-PT-040A"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is ShieldIIPt-PT-040A, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r216-tall-162098205100468"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPt-PT-040A.tgz
mv ShieldIIPt-PT-040A execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;