About the Execution of ITS-Tools for ShieldRVs-PT-010A
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16215.676 | 3600000.00 | 7500612.00 | 297669.30 | F?TFTFFFFFFT?FFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2022-input.r222-tall-165286025800788.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is ShieldRVs-PT-010A, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r222-tall-165286025800788
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 300K
-rw-r--r-- 1 mcc users 7.8K Apr 30 06:46 CTLCardinality.txt
-rw-r--r-- 1 mcc users 92K Apr 30 06:46 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.3K Apr 30 06:42 CTLFireability.txt
-rw-r--r-- 1 mcc users 37K Apr 30 06:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 9 08:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 9 08:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 9 08:58 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 08:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:58 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 9 08:58 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 63K May 10 09:34 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 ShieldRVs-PT-010A-LTLFireability-00
FORMULA_NAME ShieldRVs-PT-010A-LTLFireability-01
FORMULA_NAME ShieldRVs-PT-010A-LTLFireability-02
FORMULA_NAME ShieldRVs-PT-010A-LTLFireability-03
FORMULA_NAME ShieldRVs-PT-010A-LTLFireability-04
FORMULA_NAME ShieldRVs-PT-010A-LTLFireability-05
FORMULA_NAME ShieldRVs-PT-010A-LTLFireability-06
FORMULA_NAME ShieldRVs-PT-010A-LTLFireability-07
FORMULA_NAME ShieldRVs-PT-010A-LTLFireability-08
FORMULA_NAME ShieldRVs-PT-010A-LTLFireability-09
FORMULA_NAME ShieldRVs-PT-010A-LTLFireability-10
FORMULA_NAME ShieldRVs-PT-010A-LTLFireability-11
FORMULA_NAME ShieldRVs-PT-010A-LTLFireability-12
FORMULA_NAME ShieldRVs-PT-010A-LTLFireability-13
FORMULA_NAME ShieldRVs-PT-010A-LTLFireability-14
FORMULA_NAME ShieldRVs-PT-010A-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1653045638150
Running Version 202205111006
[2022-05-20 11:20:39] [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]
[2022-05-20 11:20:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 11:20:39] [INFO ] Load time of PNML (sax parser for PT used): 90 ms
[2022-05-20 11:20:39] [INFO ] Transformed 143 places.
[2022-05-20 11:20:39] [INFO ] Transformed 193 transitions.
[2022-05-20 11:20:39] [INFO ] Found NUPN structural information;
[2022-05-20 11:20:39] [INFO ] Parsed PT model containing 143 places and 193 transitions in 197 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ShieldRVs-PT-010A-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-010A-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-010A-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 51 out of 143 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 143/143 places, 193/193 transitions.
Applied a total of 0 rules in 20 ms. Remains 143 /143 variables (removed 0) and now considering 193/193 (removed 0) transitions.
// Phase 1: matrix 193 rows 143 cols
[2022-05-20 11:20:39] [INFO ] Computed 41 place invariants in 15 ms
[2022-05-20 11:20:39] [INFO ] Implicit Places using invariants in 219 ms returned []
// Phase 1: matrix 193 rows 143 cols
[2022-05-20 11:20:39] [INFO ] Computed 41 place invariants in 7 ms
[2022-05-20 11:20:40] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 400 ms to find 0 implicit places.
// Phase 1: matrix 193 rows 143 cols
[2022-05-20 11:20:40] [INFO ] Computed 41 place invariants in 5 ms
[2022-05-20 11:20:40] [INFO ] Dead Transitions using invariants and state equation in 131 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 143/143 places, 193/193 transitions.
Support contains 51 out of 143 places after structural reductions.
[2022-05-20 11:20:40] [INFO ] Flatten gal took : 52 ms
[2022-05-20 11:20:40] [INFO ] Flatten gal took : 24 ms
[2022-05-20 11:20:40] [INFO ] Input system was already deterministic with 193 transitions.
Finished random walk after 3632 steps, including 24 resets, run visited all 25 properties in 281 ms. (steps per millisecond=12 )
Computed a total of 1 stabilizing places and 1 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(!(!G(p0) U p1)))'
Support contains 5 out of 143 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 143/143 places, 193/193 transitions.
Applied a total of 0 rules in 8 ms. Remains 143 /143 variables (removed 0) and now considering 193/193 (removed 0) transitions.
// Phase 1: matrix 193 rows 143 cols
[2022-05-20 11:20:41] [INFO ] Computed 41 place invariants in 3 ms
[2022-05-20 11:20:41] [INFO ] Implicit Places using invariants in 195 ms returned []
// Phase 1: matrix 193 rows 143 cols
[2022-05-20 11:20:41] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-20 11:20:41] [INFO ] Implicit Places using invariants and state equation in 172 ms returned []
Implicit Place search using SMT with State Equation took 369 ms to find 0 implicit places.
// Phase 1: matrix 193 rows 143 cols
[2022-05-20 11:20:41] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-20 11:20:42] [INFO ] Dead Transitions using invariants and state equation in 874 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 143/143 places, 193/193 transitions.
Stuttering acceptance computed with spot in 394 ms :[true, p1, p1, (AND p1 (NOT p0)), (NOT p0)]
Running random walk in product with property : ShieldRVs-PT-010A-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND p0 p1), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=1, aps=[p1:(AND (EQ s1 1) (EQ s9 1)), p0:(AND (EQ s3 1) (EQ s18 1) (EQ s30 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 114 steps with 0 reset in 4 ms.
FORMULA ShieldRVs-PT-010A-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-010A-LTLFireability-00 finished in 1732 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 6 out of 143 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 143/143 places, 193/193 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 142 transition count 192
Applied a total of 2 rules in 37 ms. Remains 142 /143 variables (removed 1) and now considering 192/193 (removed 1) transitions.
// Phase 1: matrix 192 rows 142 cols
[2022-05-20 11:20:43] [INFO ] Computed 41 place invariants in 3 ms
[2022-05-20 11:20:43] [INFO ] Implicit Places using invariants in 153 ms returned []
// Phase 1: matrix 192 rows 142 cols
[2022-05-20 11:20:43] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-20 11:20:49] [INFO ] Implicit Places using invariants and state equation in 6329 ms returned []
Implicit Place search using SMT with State Equation took 6499 ms to find 0 implicit places.
[2022-05-20 11:20:49] [INFO ] Redundant transitions in 71 ms returned [60]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 191 rows 142 cols
[2022-05-20 11:20:49] [INFO ] Computed 41 place invariants in 2 ms
[2022-05-20 11:20:49] [INFO ] Dead Transitions using invariants and state equation in 148 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 142/143 places, 191/193 transitions.
Applied a total of 0 rules in 12 ms. Remains 142 /142 variables (removed 0) and now considering 191/191 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 142/143 places, 191/193 transitions.
Stuttering acceptance computed with spot in 54 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVs-PT-010A-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (OR (NEQ s31 1) (NEQ s48 1) (NEQ s57 1)) (OR (NEQ s103 1) (NEQ s105 1) (NEQ s110 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 697 reset in 391 ms.
Product exploration explored 100000 steps with 697 reset in 310 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 134 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Finished random walk after 352 steps, including 2 resets, run visited all 1 properties in 7 ms. (steps per millisecond=50 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 128 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Support contains 6 out of 142 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 142/142 places, 191/191 transitions.
Applied a total of 0 rules in 15 ms. Remains 142 /142 variables (removed 0) and now considering 191/191 (removed 0) transitions.
// Phase 1: matrix 191 rows 142 cols
[2022-05-20 11:20:50] [INFO ] Computed 41 place invariants in 3 ms
[2022-05-20 11:20:51] [INFO ] Implicit Places using invariants in 84 ms returned []
// Phase 1: matrix 191 rows 142 cols
[2022-05-20 11:20:51] [INFO ] Computed 41 place invariants in 9 ms
[2022-05-20 11:20:51] [INFO ] Implicit Places using invariants and state equation in 159 ms returned []
Implicit Place search using SMT with State Equation took 246 ms to find 0 implicit places.
[2022-05-20 11:20:51] [INFO ] Redundant transitions in 48 ms returned []
// Phase 1: matrix 191 rows 142 cols
[2022-05-20 11:20:51] [INFO ] Computed 41 place invariants in 5 ms
[2022-05-20 11:20:51] [INFO ] Dead Transitions using invariants and state equation in 93 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 142/142 places, 191/191 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 115 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Finished random walk after 642 steps, including 4 resets, run visited all 1 properties in 8 ms. (steps per millisecond=80 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 121 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Product exploration explored 100000 steps with 699 reset in 279 ms.
Product exploration explored 100000 steps with 697 reset in 256 ms.
Built C files in :
/tmp/ltsmin3000815231683416658
[2022-05-20 11:20:52] [INFO ] Computing symmetric may disable matrix : 191 transitions.
[2022-05-20 11:20:52] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 11:20:52] [INFO ] Computing symmetric may enable matrix : 191 transitions.
[2022-05-20 11:20:52] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 11:20:52] [INFO ] Computing Do-Not-Accords matrix : 191 transitions.
[2022-05-20 11:20:52] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 11:20:52] [INFO ] Built C files in 45ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3000815231683416658
Running compilation step : cd /tmp/ltsmin3000815231683416658;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 477 ms.
Running link step : cd /tmp/ltsmin3000815231683416658;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin3000815231683416658;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased14364338523042714184.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 142 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 142/142 places, 191/191 transitions.
Applied a total of 0 rules in 32 ms. Remains 142 /142 variables (removed 0) and now considering 191/191 (removed 0) transitions.
// Phase 1: matrix 191 rows 142 cols
[2022-05-20 11:21:07] [INFO ] Computed 41 place invariants in 3 ms
[2022-05-20 11:21:07] [INFO ] Implicit Places using invariants in 94 ms returned []
// Phase 1: matrix 191 rows 142 cols
[2022-05-20 11:21:07] [INFO ] Computed 41 place invariants in 3 ms
[2022-05-20 11:21:07] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 256 ms to find 0 implicit places.
[2022-05-20 11:21:07] [INFO ] Redundant transitions in 64 ms returned []
// Phase 1: matrix 191 rows 142 cols
[2022-05-20 11:21:07] [INFO ] Computed 41 place invariants in 10 ms
[2022-05-20 11:21:08] [INFO ] Dead Transitions using invariants and state equation in 183 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 142/142 places, 191/191 transitions.
Built C files in :
/tmp/ltsmin13160255279613851999
[2022-05-20 11:21:08] [INFO ] Computing symmetric may disable matrix : 191 transitions.
[2022-05-20 11:21:08] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 11:21:08] [INFO ] Computing symmetric may enable matrix : 191 transitions.
[2022-05-20 11:21:08] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 11:21:08] [INFO ] Computing Do-Not-Accords matrix : 191 transitions.
[2022-05-20 11:21:08] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 11:21:08] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13160255279613851999
Running compilation step : cd /tmp/ltsmin13160255279613851999;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 456 ms.
Running link step : cd /tmp/ltsmin13160255279613851999;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin13160255279613851999;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased2507605066906728054.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-20 11:21:23] [INFO ] Flatten gal took : 17 ms
[2022-05-20 11:21:23] [INFO ] Flatten gal took : 17 ms
[2022-05-20 11:21:23] [INFO ] Time to serialize gal into /tmp/LTL6909872751836235899.gal : 4 ms
[2022-05-20 11:21:23] [INFO ] Time to serialize properties into /tmp/LTL17770251947566471424.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6909872751836235899.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17770251947566471424.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL6909872...267
Read 1 LTL properties
Checking formula 0 : !((F(G("((((p31==0)||(p48==0))||(p57==0))&&(((p103==0)||(p105==0))||(p110==0)))"))))
Formula 0 simplified : !FG"((((p31==0)||(p48==0))||(p57==0))&&(((p103==0)||(p105==0))||(p110==0)))"
Detected timeout of ITS tools.
[2022-05-20 11:21:38] [INFO ] Flatten gal took : 17 ms
[2022-05-20 11:21:38] [INFO ] Applying decomposition
[2022-05-20 11:21:38] [INFO ] Flatten gal took : 39 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph87635183142756978.txt' '-o' '/tmp/graph87635183142756978.bin' '-w' '/tmp/graph87635183142756978.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph87635183142756978.bin' '-l' '-1' '-v' '-w' '/tmp/graph87635183142756978.weights' '-q' '0' '-e' '0.001'
[2022-05-20 11:21:38] [INFO ] Decomposing Gal with order
[2022-05-20 11:21:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 11:21:38] [INFO ] Removed a total of 205 redundant transitions.
[2022-05-20 11:21:38] [INFO ] Flatten gal took : 52 ms
[2022-05-20 11:21:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 188 labels/synchronizations in 14 ms.
[2022-05-20 11:21:38] [INFO ] Time to serialize gal into /tmp/LTL8961513714530987277.gal : 3 ms
[2022-05-20 11:21:38] [INFO ] Time to serialize properties into /tmp/LTL18065020987516997776.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8961513714530987277.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18065020987516997776.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL8961513...246
Read 1 LTL properties
Checking formula 0 : !((F(G("((((i2.u9.p31==0)||(i3.u13.p48==0))||(i3.u16.p57==0))&&(((i7.u29.p103==0)||(i7.u30.p105==0))||(i7.u31.p110==0)))"))))
Formula 0 simplified : !FG"((((i2.u9.p31==0)||(i3.u13.p48==0))||(i3.u16.p57==0))&&(((i7.u29.p103==0)||(i7.u30.p105==0))||(i7.u31.p110==0)))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2121653753755287891
[2022-05-20 11:21:53] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2121653753755287891
Running compilation step : cd /tmp/ltsmin2121653753755287891;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 322 ms.
Running link step : cd /tmp/ltsmin2121653753755287891;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin2121653753755287891;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldRVs-PT-010A-LTLFireability-01 finished in 85656 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 3 out of 143 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 143/143 places, 193/193 transitions.
Applied a total of 0 rules in 2 ms. Remains 143 /143 variables (removed 0) and now considering 193/193 (removed 0) transitions.
// Phase 1: matrix 193 rows 143 cols
[2022-05-20 11:22:08] [INFO ] Computed 41 place invariants in 2 ms
[2022-05-20 11:22:08] [INFO ] Implicit Places using invariants in 93 ms returned []
// Phase 1: matrix 193 rows 143 cols
[2022-05-20 11:22:08] [INFO ] Computed 41 place invariants in 2 ms
[2022-05-20 11:22:08] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 242 ms to find 0 implicit places.
// Phase 1: matrix 193 rows 143 cols
[2022-05-20 11:22:08] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-20 11:22:08] [INFO ] Dead Transitions using invariants and state equation in 93 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 143/143 places, 193/193 transitions.
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVs-PT-010A-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (EQ s54 1) (EQ s56 1) (EQ s65 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 140 steps with 0 reset in 1 ms.
FORMULA ShieldRVs-PT-010A-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-010A-LTLFireability-03 finished in 462 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||X(X(X(F(p1))))))))'
Support contains 2 out of 143 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 143/143 places, 193/193 transitions.
Applied a total of 0 rules in 4 ms. Remains 143 /143 variables (removed 0) and now considering 193/193 (removed 0) transitions.
// Phase 1: matrix 193 rows 143 cols
[2022-05-20 11:22:09] [INFO ] Computed 41 place invariants in 2 ms
[2022-05-20 11:22:09] [INFO ] Implicit Places using invariants in 74 ms returned []
// Phase 1: matrix 193 rows 143 cols
[2022-05-20 11:22:09] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-20 11:22:09] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 215 ms to find 0 implicit places.
// Phase 1: matrix 193 rows 143 cols
[2022-05-20 11:22:09] [INFO ] Computed 41 place invariants in 2 ms
[2022-05-20 11:22:09] [INFO ] Dead Transitions using invariants and state equation in 91 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 143/143 places, 193/193 transitions.
Stuttering acceptance computed with spot in 188 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldRVs-PT-010A-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}], [{ cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 2}]], initial=0, aps=[p0:(EQ s4 1), p1:(EQ s5 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 3122 steps with 26 reset in 22 ms.
FORMULA ShieldRVs-PT-010A-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-010A-LTLFireability-05 finished in 534 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(p0)||F(p1))))'
Support contains 5 out of 143 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 143/143 places, 193/193 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 142 transition count 192
Applied a total of 2 rules in 16 ms. Remains 142 /143 variables (removed 1) and now considering 192/193 (removed 1) transitions.
// Phase 1: matrix 192 rows 142 cols
[2022-05-20 11:22:09] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-20 11:22:09] [INFO ] Implicit Places using invariants in 71 ms returned []
// Phase 1: matrix 192 rows 142 cols
[2022-05-20 11:22:09] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-20 11:22:09] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 202 ms to find 0 implicit places.
[2022-05-20 11:22:09] [INFO ] Redundant transitions in 36 ms returned [60]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 191 rows 142 cols
[2022-05-20 11:22:09] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-20 11:22:09] [INFO ] Dead Transitions using invariants and state equation in 84 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 142/143 places, 191/193 transitions.
Applied a total of 0 rules in 11 ms. Remains 142 /142 variables (removed 0) and now considering 191/191 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 142/143 places, 191/193 transitions.
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : ShieldRVs-PT-010A-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s36 0) (EQ s41 0)), p1:(AND (EQ s96 1) (EQ s98 1) (EQ s107 1) (OR (EQ s36 0) (EQ s41 0)))], 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 130 steps with 0 reset in 0 ms.
FORMULA ShieldRVs-PT-010A-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-010A-LTLFireability-06 finished in 442 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U p1))'
Support contains 4 out of 143 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 143/143 places, 193/193 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 142 transition count 192
Applied a total of 2 rules in 8 ms. Remains 142 /143 variables (removed 1) and now considering 192/193 (removed 1) transitions.
// Phase 1: matrix 192 rows 142 cols
[2022-05-20 11:22:10] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-20 11:22:10] [INFO ] Implicit Places using invariants in 101 ms returned []
// Phase 1: matrix 192 rows 142 cols
[2022-05-20 11:22:10] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-20 11:22:10] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 248 ms to find 0 implicit places.
[2022-05-20 11:22:10] [INFO ] Redundant transitions in 49 ms returned [60]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 191 rows 142 cols
[2022-05-20 11:22:10] [INFO ] Computed 41 place invariants in 4 ms
[2022-05-20 11:22:10] [INFO ] Dead Transitions using invariants and state equation in 90 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 142/143 places, 191/193 transitions.
Applied a total of 0 rules in 8 ms. Remains 142 /142 variables (removed 0) and now considering 191/191 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 142/143 places, 191/193 transitions.
Stuttering acceptance computed with spot in 82 ms :[(NOT p1), (NOT p0)]
Running random walk in product with property : ShieldRVs-PT-010A-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(AND (EQ s52 1) (EQ s58 1) (EQ s65 1)), p0:(EQ s19 1)], nbAcceptance=0, 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 146 steps with 0 reset in 1 ms.
FORMULA ShieldRVs-PT-010A-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-010A-LTLFireability-07 finished in 506 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p0) U p1))))'
Support contains 5 out of 143 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 143/143 places, 193/193 transitions.
Applied a total of 0 rules in 2 ms. Remains 143 /143 variables (removed 0) and now considering 193/193 (removed 0) transitions.
// Phase 1: matrix 193 rows 143 cols
[2022-05-20 11:22:10] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-20 11:22:10] [INFO ] Implicit Places using invariants in 65 ms returned []
// Phase 1: matrix 193 rows 143 cols
[2022-05-20 11:22:10] [INFO ] Computed 41 place invariants in 10 ms
[2022-05-20 11:22:10] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 220 ms to find 0 implicit places.
// Phase 1: matrix 193 rows 143 cols
[2022-05-20 11:22:10] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-20 11:22:10] [INFO ] Dead Transitions using invariants and state equation in 87 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 143/143 places, 193/193 transitions.
Stuttering acceptance computed with spot in 150 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : ShieldRVs-PT-010A-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(AND (EQ s120 1) (EQ s125 1)), p0:(AND (EQ s76 1) (EQ s77 1) (EQ s82 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ShieldRVs-PT-010A-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-010A-LTLFireability-08 finished in 472 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 3 out of 143 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 143/143 places, 193/193 transitions.
Applied a total of 0 rules in 2 ms. Remains 143 /143 variables (removed 0) and now considering 193/193 (removed 0) transitions.
// Phase 1: matrix 193 rows 143 cols
[2022-05-20 11:22:11] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-20 11:22:11] [INFO ] Implicit Places using invariants in 70 ms returned []
// Phase 1: matrix 193 rows 143 cols
[2022-05-20 11:22:11] [INFO ] Computed 41 place invariants in 2 ms
[2022-05-20 11:22:11] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 204 ms to find 0 implicit places.
// Phase 1: matrix 193 rows 143 cols
[2022-05-20 11:22:11] [INFO ] Computed 41 place invariants in 8 ms
[2022-05-20 11:22:11] [INFO ] Dead Transitions using invariants and state equation in 102 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 143/143 places, 193/193 transitions.
Stuttering acceptance computed with spot in 80 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVs-PT-010A-LTLFireability-09 automaton TGBA Formula[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 (EQ s115 1) (EQ s130 1) (EQ s142 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldRVs-PT-010A-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-010A-LTLFireability-09 finished in 403 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(X(X((p0 U (p1 U p2)))))))'
Support contains 6 out of 143 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 143/143 places, 193/193 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 142 transition count 192
Applied a total of 2 rules in 13 ms. Remains 142 /143 variables (removed 1) and now considering 192/193 (removed 1) transitions.
// Phase 1: matrix 192 rows 142 cols
[2022-05-20 11:22:11] [INFO ] Computed 41 place invariants in 2 ms
[2022-05-20 11:22:11] [INFO ] Implicit Places using invariants in 70 ms returned []
// Phase 1: matrix 192 rows 142 cols
[2022-05-20 11:22:11] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-20 11:22:11] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 199 ms to find 0 implicit places.
[2022-05-20 11:22:11] [INFO ] Redundant transitions in 37 ms returned [60]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 191 rows 142 cols
[2022-05-20 11:22:11] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-20 11:22:11] [INFO ] Dead Transitions using invariants and state equation in 98 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 142/143 places, 191/193 transitions.
Applied a total of 0 rules in 10 ms. Remains 142 /142 variables (removed 0) and now considering 191/191 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 142/143 places, 191/193 transitions.
Stuttering acceptance computed with spot in 148 ms :[(NOT p2), (NOT p2), (NOT p2)]
Running random walk in product with property : ShieldRVs-PT-010A-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(OR p2 p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) p0), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0} source=0 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p2) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p2) p0), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(AND (EQ s38 1) (EQ s44 1) (EQ s51 1)), p1:(AND (EQ s40 1) (EQ s42 1) (EQ s51 1)), p0:(EQ s43 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 140 steps with 0 reset in 3 ms.
FORMULA ShieldRVs-PT-010A-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-010A-LTLFireability-10 finished in 535 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(!((X(p0) U p1) U ((!G(p2)||p3) U p1)))))'
Support contains 10 out of 143 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 143/143 places, 193/193 transitions.
Applied a total of 0 rules in 3 ms. Remains 143 /143 variables (removed 0) and now considering 193/193 (removed 0) transitions.
// Phase 1: matrix 193 rows 143 cols
[2022-05-20 11:22:12] [INFO ] Computed 41 place invariants in 0 ms
[2022-05-20 11:22:12] [INFO ] Implicit Places using invariants in 75 ms returned []
// Phase 1: matrix 193 rows 143 cols
[2022-05-20 11:22:12] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-20 11:22:12] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 230 ms to find 0 implicit places.
// Phase 1: matrix 193 rows 143 cols
[2022-05-20 11:22:12] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-20 11:22:12] [INFO ] Dead Transitions using invariants and state equation in 97 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 143/143 places, 193/193 transitions.
Stuttering acceptance computed with spot in 322 ms :[p1, p1, (AND p0 p1), p1, (AND p1 (NOT p2)), (AND p1 (NOT p2)), false]
Running random walk in product with property : ShieldRVs-PT-010A-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={0, 1} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 2}, { cond=(OR (AND p3 (NOT p1)) (AND (NOT p2) (NOT p1))), acceptance={0} source=1 dest: 3}, { cond=(AND (NOT p3) p2 (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=(AND p1 p0), acceptance={0, 1} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={0, 1} source=3 dest: 1}, { cond=(OR (AND p3 (NOT p1)) (AND (NOT p2) (NOT p1))), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p3) p2 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p2) p1), acceptance={0, 1} source=4 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={} source=4 dest: 4}, { cond=(AND p2 p1), acceptance={1} source=4 dest: 5}], [{ cond=(AND (NOT p2) p1), acceptance={0, 1} source=5 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=5 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=5 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(AND p2 p1), acceptance={1} source=5 dest: 5}, { cond=(AND p2 (NOT p1)), acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=6 dest: 2}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(AND (EQ s38 1) (EQ s44 1) (EQ s51 1)), p3:(EQ s136 1), p2:(AND (EQ s117 1) (EQ s119 1) (EQ s124 1)), p0:(AND (EQ s52 1) (EQ s56 1) (EQ s65 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1451 reset in 317 ms.
Product exploration explored 100000 steps with 1446 reset in 318 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p3) (NOT p2) (NOT p0)), (X (OR (AND p3 (NOT p1)) (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p3) p2 (NOT p1)))), (X (NOT p1)), (X (X (OR (AND p3 (NOT p1)) (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p2 p1)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p3) p2 (NOT p1))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 669 ms. Reduced automaton from 7 states, 22 edges and 4 AP to 7 states, 22 edges and 4 AP.
Stuttering acceptance computed with spot in 333 ms :[p1, p1, (AND p0 p1), p1, (AND p1 (NOT p2)), (AND p1 (NOT p2)), false]
Incomplete random walk after 10000 steps, including 69 resets, run finished after 310 ms. (steps per millisecond=32 ) properties (out of 11) seen :8
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :1
Running SMT prover for 2 properties.
// Phase 1: matrix 193 rows 143 cols
[2022-05-20 11:22:14] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-20 11:22:14] [INFO ] [Real]Absence check using 41 positive place invariants in 8 ms returned sat
[2022-05-20 11:22:14] [INFO ] After 141ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2022-05-20 11:22:14] [INFO ] [Nat]Absence check using 41 positive place invariants in 13 ms returned sat
[2022-05-20 11:22:15] [INFO ] After 71ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2022-05-20 11:22:15] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 3 ms to minimize.
[2022-05-20 11:22:15] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 1 ms to minimize.
[2022-05-20 11:22:15] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
[2022-05-20 11:22:15] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 2 ms to minimize.
[2022-05-20 11:22:15] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 0 ms to minimize.
[2022-05-20 11:22:15] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 224 ms
[2022-05-20 11:22:15] [INFO ] After 313ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 25 ms.
[2022-05-20 11:22:15] [INFO ] After 394ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 4 ms.
Support contains 6 out of 143 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 143/143 places, 193/193 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 142 transition count 192
Partial Free-agglomeration rule applied 22 times.
Drop transitions removed 22 transitions
Iterating global reduction 0 with 22 rules applied. Total rules applied 24 place count 142 transition count 192
Applied a total of 24 rules in 23 ms. Remains 142 /143 variables (removed 1) and now considering 192/193 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 142/143 places, 192/193 transitions.
Finished random walk after 8373 steps, including 62 resets, run visited all 1 properties in 26 ms. (steps per millisecond=322 )
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p3) (NOT p2) (NOT p0)), (X (OR (AND p3 (NOT p1)) (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p3) p2 (NOT p1)))), (X (NOT p1)), (X (X (OR (AND p3 (NOT p1)) (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p2 p1)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p3) p2 (NOT p1))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT p1))), (G (NOT (AND p1 p0)))]
False Knowledge obtained : [(F (AND (NOT p1) p0)), (F (NOT (AND (NOT p2) (NOT p1)))), (F (AND (NOT p2) p1)), (F p1), (F (AND (NOT p3) p2 (NOT p1))), (F (NOT (OR (AND p3 (NOT p1)) (AND (NOT p2) (NOT p1))))), (F (AND p2 p1)), (F (AND p2 (NOT p1))), (F (AND p2 (NOT p1) p0)), (F (AND (NOT p2) (NOT p1) p0))]
Knowledge based reduction with 14 factoid took 816 ms. Reduced automaton from 7 states, 22 edges and 4 AP to 3 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 112 ms :[p1, p1, (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 108 ms :[p1, p1, (AND p1 (NOT p2))]
Support contains 7 out of 143 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 143/143 places, 193/193 transitions.
Applied a total of 0 rules in 10 ms. Remains 143 /143 variables (removed 0) and now considering 193/193 (removed 0) transitions.
// Phase 1: matrix 193 rows 143 cols
[2022-05-20 11:22:16] [INFO ] Computed 41 place invariants in 2 ms
[2022-05-20 11:22:16] [INFO ] Implicit Places using invariants in 81 ms returned []
// Phase 1: matrix 193 rows 143 cols
[2022-05-20 11:22:16] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-20 11:22:16] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 235 ms to find 0 implicit places.
// Phase 1: matrix 193 rows 143 cols
[2022-05-20 11:22:16] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-20 11:22:16] [INFO ] Dead Transitions using invariants and state equation in 98 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 143/143 places, 193/193 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p3) (NOT p1) (NOT p2)), (X (OR (AND p3 (NOT p1)) (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p3) (NOT p1) p2))), (X (NOT p1)), (X (X (OR (AND p3 (NOT p1)) (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p3) (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 427 ms. Reduced automaton from 3 states, 8 edges and 3 AP to 3 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 117 ms :[p1, p1, (AND p1 (NOT p2))]
Incomplete random walk after 10000 steps, including 67 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 7) seen :6
Incomplete Best-First random walk after 10000 steps, including 11 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 193 rows 143 cols
[2022-05-20 11:22:17] [INFO ] Computed 41 place invariants in 0 ms
[2022-05-20 11:22:17] [INFO ] [Real]Absence check using 41 positive place invariants in 5 ms returned sat
[2022-05-20 11:22:17] [INFO ] After 102ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 11:22:17] [INFO ] [Nat]Absence check using 41 positive place invariants in 5 ms returned sat
[2022-05-20 11:22:17] [INFO ] After 71ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 11:22:17] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 1 ms to minimize.
[2022-05-20 11:22:17] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
[2022-05-20 11:22:17] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 0 ms to minimize.
[2022-05-20 11:22:17] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2022-05-20 11:22:17] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 0 ms to minimize.
[2022-05-20 11:22:17] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 224 ms
[2022-05-20 11:22:17] [INFO ] After 312ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 24 ms.
[2022-05-20 11:22:17] [INFO ] After 378ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 6 out of 143 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 143/143 places, 193/193 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 142 transition count 192
Partial Free-agglomeration rule applied 22 times.
Drop transitions removed 22 transitions
Iterating global reduction 0 with 22 rules applied. Total rules applied 24 place count 142 transition count 192
Applied a total of 24 rules in 16 ms. Remains 142 /143 variables (removed 1) and now considering 192/193 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 142/143 places, 192/193 transitions.
Incomplete random walk after 10000 steps, including 75 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1559374 steps, run timeout after 3001 ms. (steps per millisecond=519 ) properties seen :{}
Probabilistic random walk after 1559374 steps, saw 290297 distinct states, run finished after 3002 ms. (steps per millisecond=519 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 192 rows 142 cols
[2022-05-20 11:22:20] [INFO ] Computed 41 place invariants in 3 ms
[2022-05-20 11:22:20] [INFO ] [Real]Absence check using 41 positive place invariants in 6 ms returned sat
[2022-05-20 11:22:21] [INFO ] After 106ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 11:22:21] [INFO ] [Nat]Absence check using 41 positive place invariants in 5 ms returned sat
[2022-05-20 11:22:21] [INFO ] After 58ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 11:22:21] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 0 ms to minimize.
[2022-05-20 11:22:21] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 1 ms to minimize.
[2022-05-20 11:22:21] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 1 ms to minimize.
[2022-05-20 11:22:21] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 0 ms to minimize.
[2022-05-20 11:22:21] [INFO ] Deduced a trap composed of 7 places in 20 ms of which 0 ms to minimize.
[2022-05-20 11:22:21] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 0 ms to minimize.
[2022-05-20 11:22:21] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 0 ms to minimize.
[2022-05-20 11:22:21] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 0 ms to minimize.
[2022-05-20 11:22:21] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
[2022-05-20 11:22:21] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 1 ms to minimize.
[2022-05-20 11:22:21] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 457 ms
[2022-05-20 11:22:21] [INFO ] After 542ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2022-05-20 11:22:21] [INFO ] After 605ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 6 out of 142 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 142/142 places, 192/192 transitions.
Applied a total of 0 rules in 9 ms. Remains 142 /142 variables (removed 0) and now considering 192/192 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 142/142 places, 192/192 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 142/142 places, 192/192 transitions.
Applied a total of 0 rules in 5 ms. Remains 142 /142 variables (removed 0) and now considering 192/192 (removed 0) transitions.
// Phase 1: matrix 192 rows 142 cols
[2022-05-20 11:22:21] [INFO ] Computed 41 place invariants in 2 ms
[2022-05-20 11:22:21] [INFO ] Implicit Places using invariants in 78 ms returned []
// Phase 1: matrix 192 rows 142 cols
[2022-05-20 11:22:21] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-20 11:22:21] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 216 ms to find 0 implicit places.
[2022-05-20 11:22:21] [INFO ] Redundant transitions in 29 ms returned []
// Phase 1: matrix 192 rows 142 cols
[2022-05-20 11:22:21] [INFO ] Computed 41 place invariants in 2 ms
[2022-05-20 11:22:21] [INFO ] Dead Transitions using invariants and state equation in 101 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 142/142 places, 192/192 transitions.
Applied a total of 0 rules in 6 ms. Remains 142 /142 variables (removed 0) and now considering 192/192 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 192 rows 142 cols
[2022-05-20 11:22:22] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-20 11:22:22] [INFO ] [Real]Absence check using 41 positive place invariants in 4 ms returned sat
[2022-05-20 11:22:22] [INFO ] After 92ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 11:22:22] [INFO ] [Nat]Absence check using 41 positive place invariants in 6 ms returned sat
[2022-05-20 11:22:22] [INFO ] After 56ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 11:22:22] [INFO ] Deduced a trap composed of 6 places in 47 ms of which 0 ms to minimize.
[2022-05-20 11:22:22] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 0 ms to minimize.
[2022-05-20 11:22:22] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 0 ms to minimize.
[2022-05-20 11:22:22] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 1 ms to minimize.
[2022-05-20 11:22:22] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 0 ms to minimize.
[2022-05-20 11:22:22] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 0 ms to minimize.
[2022-05-20 11:22:22] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 0 ms to minimize.
[2022-05-20 11:22:22] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 0 ms to minimize.
[2022-05-20 11:22:22] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
[2022-05-20 11:22:22] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 1 ms to minimize.
[2022-05-20 11:22:22] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 494 ms
[2022-05-20 11:22:22] [INFO ] After 576ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 23 ms.
[2022-05-20 11:22:22] [INFO ] After 650ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-20 11:22:22] [INFO ] Flatten gal took : 19 ms
[2022-05-20 11:22:22] [INFO ] Flatten gal took : 14 ms
[2022-05-20 11:22:22] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17230103326730840163.gal : 2 ms
[2022-05-20 11:22:22] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6119612444922576351.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms10333278022083897752;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17230103326730840163.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6119612444922576351.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality6119612444922576351.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :3 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 35
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :35 after 210
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :210 after 688
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :688 after 3573
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :3573 after 36273
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :36273 after 328161
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :328161 after 3.70481e+06
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :3.70481e+06 after 3.364e+08
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :3.364e+08 after 4.84412e+10
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :4.84412e+10 after 2.22404e+13
Detected timeout of ITS tools.
[2022-05-20 11:22:37] [INFO ] Flatten gal took : 14 ms
[2022-05-20 11:22:37] [INFO ] Applying decomposition
[2022-05-20 11:22:37] [INFO ] Flatten gal took : 14 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph6195138434422216204.txt' '-o' '/tmp/graph6195138434422216204.bin' '-w' '/tmp/graph6195138434422216204.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph6195138434422216204.bin' '-l' '-1' '-v' '-w' '/tmp/graph6195138434422216204.weights' '-q' '0' '-e' '0.001'
[2022-05-20 11:22:37] [INFO ] Decomposing Gal with order
[2022-05-20 11:22:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 11:22:37] [INFO ] Removed a total of 221 redundant transitions.
[2022-05-20 11:22:37] [INFO ] Flatten gal took : 24 ms
[2022-05-20 11:22:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 200 labels/synchronizations in 5 ms.
[2022-05-20 11:22:37] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7464949288399994192.gal : 2 ms
[2022-05-20 11:22:37] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13626231228549853434.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms10333278022083897752;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality7464949288399994192.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13626231228549853434.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...299
Loading property file /tmp/ReachabilityCardinality13626231228549853434.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 12
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :12 after 13
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :13 after 351
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :351 after 108575
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :108575 after 5.38461e+06
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :5.38461e+06 after 5.12665e+14
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10276805315919136389
[2022-05-20 11:22:52] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10276805315919136389
Running compilation step : cd /tmp/ltsmin10276805315919136389;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 320 ms.
Running link step : cd /tmp/ltsmin10276805315919136389;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin10276805315919136389;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'apf6==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Knowledge obtained : [(AND (NOT p3) (NOT p1) (NOT p2)), (X (OR (AND p3 (NOT p1)) (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p3) (NOT p1) p2))), (X (NOT p1)), (X (X (OR (AND p3 (NOT p1)) (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p3) (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (AND (NOT p2) p1)), (F (NOT (AND (NOT p2) (NOT p1)))), (F (AND p2 (NOT p1))), (F (NOT (OR (AND p3 (NOT p1)) (AND (NOT p2) (NOT p1))))), (F (AND (NOT p3) p2 (NOT p1))), (F p1)]
Knowledge based reduction with 11 factoid took 619 ms. Reduced automaton from 3 states, 8 edges and 3 AP to 3 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 114 ms :[p1, p1, (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 100 ms :[p1, p1, (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 105 ms :[p1, p1, (AND p1 (NOT p2))]
Product exploration explored 100000 steps with 687 reset in 248 ms.
Product exploration explored 100000 steps with 685 reset in 266 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 108 ms :[p1, p1, (AND p1 (NOT p2))]
Support contains 7 out of 143 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 143/143 places, 193/193 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 143 transition count 193
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 1 rules in 13 ms. Remains 143 /143 variables (removed 0) and now considering 193/193 (removed 0) transitions.
[2022-05-20 11:23:09] [INFO ] Redundant transitions in 43 ms returned [61]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 192 rows 143 cols
[2022-05-20 11:23:09] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-20 11:23:09] [INFO ] Dead Transitions using invariants and state equation in 94 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 143/143 places, 192/193 transitions.
Deduced a syphon composed of 1 places in 1 ms
Applied a total of 0 rules in 6 ms. Remains 143 /143 variables (removed 0) and now considering 192/192 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 143/143 places, 192/193 transitions.
Product exploration explored 100000 steps with 693 reset in 293 ms.
Product exploration explored 100000 steps with 695 reset in 326 ms.
Built C files in :
/tmp/ltsmin13097093373443277086
[2022-05-20 11:23:10] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13097093373443277086
Running compilation step : cd /tmp/ltsmin13097093373443277086;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 319 ms.
Running link step : cd /tmp/ltsmin13097093373443277086;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin13097093373443277086;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased8074362012087539350.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 7 out of 143 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 143/143 places, 193/193 transitions.
Applied a total of 0 rules in 4 ms. Remains 143 /143 variables (removed 0) and now considering 193/193 (removed 0) transitions.
// Phase 1: matrix 193 rows 143 cols
[2022-05-20 11:23:25] [INFO ] Computed 41 place invariants in 4 ms
[2022-05-20 11:23:25] [INFO ] Implicit Places using invariants in 84 ms returned []
// Phase 1: matrix 193 rows 143 cols
[2022-05-20 11:23:25] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-20 11:23:25] [INFO ] Implicit Places using invariants and state equation in 151 ms returned []
Implicit Place search using SMT with State Equation took 238 ms to find 0 implicit places.
// Phase 1: matrix 193 rows 143 cols
[2022-05-20 11:23:25] [INFO ] Computed 41 place invariants in 2 ms
[2022-05-20 11:23:26] [INFO ] Dead Transitions using invariants and state equation in 98 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 143/143 places, 193/193 transitions.
Built C files in :
/tmp/ltsmin8785437326950651512
[2022-05-20 11:23:26] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8785437326950651512
Running compilation step : cd /tmp/ltsmin8785437326950651512;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 310 ms.
Running link step : cd /tmp/ltsmin8785437326950651512;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin8785437326950651512;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased13335183525137620648.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-20 11:23:41] [INFO ] Flatten gal took : 20 ms
[2022-05-20 11:23:41] [INFO ] Flatten gal took : 13 ms
[2022-05-20 11:23:41] [INFO ] Time to serialize gal into /tmp/LTL10487354044988017105.gal : 2 ms
[2022-05-20 11:23:41] [INFO ] Time to serialize properties into /tmp/LTL2165009356124071020.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10487354044988017105.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2165009356124071020.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1048735...267
Read 1 LTL properties
Checking formula 0 : !((X(F(!(((X("(((p52==1)&&(p56==1))&&(p65==1))"))U("(((p38==1)&&(p44==1))&&(p51==1))"))U(((!(G("(((p117==1)&&(p119==1))&&(p124==1))"))...215
Formula 0 simplified : !XF!((X"(((p52==1)&&(p56==1))&&(p65==1))" U "(((p38==1)&&(p44==1))&&(p51==1))") U (("(p136==1)" | !G"(((p117==1)&&(p119==1))&&(p124=...200
Detected timeout of ITS tools.
[2022-05-20 11:23:56] [INFO ] Flatten gal took : 19 ms
[2022-05-20 11:23:56] [INFO ] Applying decomposition
[2022-05-20 11:23:56] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph15511398076838950391.txt' '-o' '/tmp/graph15511398076838950391.bin' '-w' '/tmp/graph15511398076838950391.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph15511398076838950391.bin' '-l' '-1' '-v' '-w' '/tmp/graph15511398076838950391.weights' '-q' '0' '-e' '0.001'
[2022-05-20 11:23:56] [INFO ] Decomposing Gal with order
[2022-05-20 11:23:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 11:23:56] [INFO ] Removed a total of 207 redundant transitions.
[2022-05-20 11:23:56] [INFO ] Flatten gal took : 18 ms
[2022-05-20 11:23:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 192 labels/synchronizations in 5 ms.
[2022-05-20 11:23:56] [INFO ] Time to serialize gal into /tmp/LTL10053031567556286387.gal : 2 ms
[2022-05-20 11:23:56] [INFO ] Time to serialize properties into /tmp/LTL17488758167760492026.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10053031567556286387.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17488758167760492026.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1005303...247
Read 1 LTL properties
Checking formula 0 : !((X(F(!(((X("(((i3.u15.p52==1)&&(i3.u16.p56==1))&&(i4.u19.p65==1))"))U("(((i2.u11.p38==1)&&(i2.u12.p44==1))&&(i3.u15.p51==1))"))U(((!...306
Formula 0 simplified : !XF!((X"(((i3.u15.p52==1)&&(i3.u16.p56==1))&&(i4.u19.p65==1))" U "(((i2.u11.p38==1)&&(i2.u12.p44==1))&&(i3.u15.p51==1))") U (("(i9.u...291
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12967624145705130863
[2022-05-20 11:24:11] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12967624145705130863
Running compilation step : cd /tmp/ltsmin12967624145705130863;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 322 ms.
Running link step : cd /tmp/ltsmin12967624145705130863;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 25 ms.
Running LTSmin : cd /tmp/ltsmin12967624145705130863;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>(!((X((LTLAPp0==true)) U (LTLAPp1==true)) U (()||(LTLAPp3==true)) U (LTLAPp1==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldRVs-PT-010A-LTLFireability-12 finished in 134470 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!(((p0 U X(p1)) U p2)||p3) U p0))'
Support contains 6 out of 143 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 143/143 places, 193/193 transitions.
Applied a total of 0 rules in 4 ms. Remains 143 /143 variables (removed 0) and now considering 193/193 (removed 0) transitions.
// Phase 1: matrix 193 rows 143 cols
[2022-05-20 11:24:26] [INFO ] Computed 41 place invariants in 3 ms
[2022-05-20 11:24:26] [INFO ] Implicit Places using invariants in 82 ms returned []
// Phase 1: matrix 193 rows 143 cols
[2022-05-20 11:24:26] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-20 11:24:26] [INFO ] Implicit Places using invariants and state equation in 171 ms returned []
Implicit Place search using SMT with State Equation took 254 ms to find 0 implicit places.
// Phase 1: matrix 193 rows 143 cols
[2022-05-20 11:24:26] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-20 11:24:26] [INFO ] Dead Transitions using invariants and state equation in 170 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 143/143 places, 193/193 transitions.
Stuttering acceptance computed with spot in 206 ms :[(NOT p0), true, (AND p1 p2), (AND p1 p2), p1, p1]
Running random walk in product with property : ShieldRVs-PT-010A-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(OR (AND (NOT p0) p3) (AND (NOT p0) p2)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p2 p1), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=3 dest: 3}, { cond=p2, acceptance={} source=3 dest: 4}, { cond=(AND p0 p2), acceptance={} source=3 dest: 5}], [{ cond=p1, acceptance={} source=4 dest: 1}], [{ cond=true, acceptance={} source=5 dest: 4}, { cond=p0, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(AND (EQ s10 1) (EQ s16 1) (EQ s23 1)), p3:(EQ s126 1), p2:(EQ s43 1), p1:(EQ s103 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33233 reset in 335 ms.
Product exploration explored 100000 steps with 33261 reset in 362 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)), (X (AND (NOT p0) (NOT p3) (NOT p2))), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND p2 p1))), (X (NOT (OR (AND (NOT p0) p3) (AND (NOT p0) p2)))), (X (NOT (AND (NOT p2) p1))), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p3) (NOT p2)))), true, (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (OR (AND (NOT p0) p3) (AND (NOT p0) p2))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND p0 p2))))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 735 ms. Reduced automaton from 6 states, 14 edges and 4 AP to 6 states, 14 edges and 4 AP.
Stuttering acceptance computed with spot in 202 ms :[(NOT p0), true, (AND p1 p2), (AND p1 p2), p1, p1]
Incomplete random walk after 10000 steps, including 69 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 11) seen :10
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 193 rows 143 cols
[2022-05-20 11:24:28] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-20 11:24:28] [INFO ] [Real]Absence check using 41 positive place invariants in 6 ms returned sat
[2022-05-20 11:24:28] [INFO ] After 117ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 11:24:29] [INFO ] [Nat]Absence check using 41 positive place invariants in 5 ms returned sat
[2022-05-20 11:24:29] [INFO ] After 66ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 11:24:29] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 0 ms to minimize.
[2022-05-20 11:24:29] [INFO ] Deduced a trap composed of 11 places in 20 ms of which 0 ms to minimize.
[2022-05-20 11:24:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 81 ms
[2022-05-20 11:24:29] [INFO ] After 168ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 30 ms.
[2022-05-20 11:24:29] [INFO ] After 253ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 5 out of 143 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 143/143 places, 193/193 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 142 transition count 192
Partial Free-agglomeration rule applied 20 times.
Drop transitions removed 20 transitions
Iterating global reduction 0 with 20 rules applied. Total rules applied 22 place count 142 transition count 192
Applied a total of 22 rules in 9 ms. Remains 142 /143 variables (removed 1) and now considering 192/193 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 142/143 places, 192/193 transitions.
Finished random walk after 6003 steps, including 44 resets, run visited all 1 properties in 16 ms. (steps per millisecond=375 )
Knowledge obtained : [(AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)), (X (AND (NOT p0) (NOT p3) (NOT p2))), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND p2 p1))), (X (NOT (OR (AND (NOT p0) p3) (AND (NOT p0) p2)))), (X (NOT (AND (NOT p2) p1))), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p3) (NOT p2)))), true, (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (OR (AND (NOT p0) p3) (AND (NOT p0) p2))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND p0 p2))))]
False Knowledge obtained : [(F (AND p1 p0 (NOT p2))), (F (AND p1 (NOT p2))), (F (AND (NOT p1) p0 (NOT p2))), (F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT (AND (NOT p3) (NOT p0) (NOT p2)))), (F (AND p1 p2)), (F (OR (AND p3 (NOT p0)) (AND (NOT p0) p2))), (F (AND p0 p2)), (F p0), (F p2), (F p1)]
Knowledge based reduction with 16 factoid took 849 ms. Reduced automaton from 6 states, 14 edges and 4 AP to 6 states, 14 edges and 4 AP.
Stuttering acceptance computed with spot in 341 ms :[(NOT p0), true, (AND p1 p2), (AND p1 p2), p1, p1]
Stuttering acceptance computed with spot in 207 ms :[(NOT p0), true, (AND p1 p2), (AND p1 p2), p1, p1]
// Phase 1: matrix 193 rows 143 cols
[2022-05-20 11:24:30] [INFO ] Computed 41 place invariants in 2 ms
Proved EG (NOT p0)
Knowledge obtained : [(AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)), (X (AND (NOT p0) (NOT p3) (NOT p2))), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND p2 p1))), (X (NOT (OR (AND (NOT p0) p3) (AND (NOT p0) p2)))), (X (NOT (AND (NOT p2) p1))), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p3) (NOT p2)))), true, (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (OR (AND (NOT p0) p3) (AND (NOT p0) p2))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND p0 p2))))]
False Knowledge obtained : [(F (AND p1 p0 (NOT p2))), (F (AND p1 (NOT p2))), (F (AND (NOT p1) p0 (NOT p2))), (F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT (AND (NOT p3) (NOT p0) (NOT p2)))), (F (AND p1 p2)), (F (OR (AND p3 (NOT p0)) (AND (NOT p0) p2))), (F (AND p0 p2)), (F p0), (F p2), (F p1), (G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 16 factoid took 536 ms. Reduced automaton from 6 states, 14 edges and 4 AP to 1 states, 1 edges and 0 AP.
FORMULA ShieldRVs-PT-010A-LTLFireability-13 FALSE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVs-PT-010A-LTLFireability-13 finished in 4818 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 143 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 143/143 places, 193/193 transitions.
Applied a total of 0 rules in 6 ms. Remains 143 /143 variables (removed 0) and now considering 193/193 (removed 0) transitions.
// Phase 1: matrix 193 rows 143 cols
[2022-05-20 11:24:31] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-20 11:24:31] [INFO ] Implicit Places using invariants in 84 ms returned []
// Phase 1: matrix 193 rows 143 cols
[2022-05-20 11:24:31] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-20 11:24:31] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 231 ms to find 0 implicit places.
// Phase 1: matrix 193 rows 143 cols
[2022-05-20 11:24:31] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-20 11:24:31] [INFO ] Dead Transitions using invariants and state equation in 90 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 143/143 places, 193/193 transitions.
Stuttering acceptance computed with spot in 87 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVs-PT-010A-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(NEQ s99 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 16 steps with 0 reset in 0 ms.
FORMULA ShieldRVs-PT-010A-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-010A-LTLFireability-14 finished in 427 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((G(p0)&&X(p1)))))'
Support contains 6 out of 143 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 143/143 places, 193/193 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 142 transition count 192
Applied a total of 2 rules in 8 ms. Remains 142 /143 variables (removed 1) and now considering 192/193 (removed 1) transitions.
// Phase 1: matrix 192 rows 142 cols
[2022-05-20 11:24:31] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-20 11:24:31] [INFO ] Implicit Places using invariants in 69 ms returned []
// Phase 1: matrix 192 rows 142 cols
[2022-05-20 11:24:31] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-20 11:24:31] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 203 ms to find 0 implicit places.
[2022-05-20 11:24:31] [INFO ] Redundant transitions in 50 ms returned [60]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 191 rows 142 cols
[2022-05-20 11:24:31] [INFO ] Computed 41 place invariants in 0 ms
[2022-05-20 11:24:32] [INFO ] Dead Transitions using invariants and state equation in 99 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 142/143 places, 191/193 transitions.
Applied a total of 0 rules in 3 ms. Remains 142 /142 variables (removed 0) and now considering 191/191 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 142/143 places, 191/193 transitions.
Stuttering acceptance computed with spot in 35 ms :[(OR (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldRVs-PT-010A-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s2 1) (EQ s4 1) (EQ s16 1)), p1:(AND (EQ s80 1) (EQ s84 1) (EQ s93 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 155 steps with 0 reset in 0 ms.
FORMULA ShieldRVs-PT-010A-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-010A-LTLFireability-15 finished in 426 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(!((X(p0) U p1) U ((!G(p2)||p3) U p1)))))'
Found a CL insensitive property : ShieldRVs-PT-010A-LTLFireability-12
Stuttering acceptance computed with spot in 330 ms :[p1, p1, (AND p0 p1), p1, (AND p1 (NOT p2)), (AND p1 (NOT p2)), false]
Support contains 10 out of 143 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 143/143 places, 193/193 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 142 transition count 192
Applied a total of 2 rules in 10 ms. Remains 142 /143 variables (removed 1) and now considering 192/193 (removed 1) transitions.
// Phase 1: matrix 192 rows 142 cols
[2022-05-20 11:24:32] [INFO ] Computed 41 place invariants in 2 ms
[2022-05-20 11:24:32] [INFO ] Implicit Places using invariants in 71 ms returned []
// Phase 1: matrix 192 rows 142 cols
[2022-05-20 11:24:32] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-20 11:24:32] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 200 ms to find 0 implicit places.
// Phase 1: matrix 192 rows 142 cols
[2022-05-20 11:24:32] [INFO ] Computed 41 place invariants in 0 ms
[2022-05-20 11:24:32] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 142/143 places, 192/193 transitions.
Finished structural reductions, in 1 iterations. Remains : 142/143 places, 192/193 transitions.
Running random walk in product with property : ShieldRVs-PT-010A-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={0, 1} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 2}, { cond=(OR (AND p3 (NOT p1)) (AND (NOT p2) (NOT p1))), acceptance={0} source=1 dest: 3}, { cond=(AND (NOT p3) p2 (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=(AND p1 p0), acceptance={0, 1} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={0, 1} source=3 dest: 1}, { cond=(OR (AND p3 (NOT p1)) (AND (NOT p2) (NOT p1))), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p3) p2 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p2) p1), acceptance={0, 1} source=4 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={} source=4 dest: 4}, { cond=(AND p2 p1), acceptance={1} source=4 dest: 5}], [{ cond=(AND (NOT p2) p1), acceptance={0, 1} source=5 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=5 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=5 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(AND p2 p1), acceptance={1} source=5 dest: 5}, { cond=(AND p2 (NOT p1)), acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=6 dest: 2}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(AND (EQ s38 1) (EQ s44 1) (EQ s51 1)), p3:(EQ s135 1), p2:(AND (EQ s117 1) (EQ s119 1) (EQ s124 1)), p0:(AND (EQ s52 1) (EQ s56 1) (EQ s65 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1443 reset in 248 ms.
Product exploration explored 100000 steps with 1454 reset in 274 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p3) (NOT p2) (NOT p0)), (X (OR (AND p3 (NOT p1)) (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p3) p2 (NOT p1)))), (X (NOT p1)), (X (X (OR (AND p3 (NOT p1)) (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p2 p1)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p3) p2 (NOT p1))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 647 ms. Reduced automaton from 7 states, 22 edges and 4 AP to 7 states, 22 edges and 4 AP.
Stuttering acceptance computed with spot in 281 ms :[p1, p1, (AND p0 p1), p1, (AND p1 (NOT p2)), (AND p1 (NOT p2)), false]
Incomplete random walk after 10000 steps, including 70 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 11) seen :8
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 3) seen :1
Running SMT prover for 2 properties.
// Phase 1: matrix 192 rows 142 cols
[2022-05-20 11:24:34] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-20 11:24:34] [INFO ] [Real]Absence check using 41 positive place invariants in 5 ms returned sat
[2022-05-20 11:24:34] [INFO ] After 121ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2022-05-20 11:24:34] [INFO ] [Nat]Absence check using 41 positive place invariants in 5 ms returned sat
[2022-05-20 11:24:34] [INFO ] After 62ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2022-05-20 11:24:34] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 1 ms to minimize.
[2022-05-20 11:24:34] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
[2022-05-20 11:24:34] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 1 ms to minimize.
[2022-05-20 11:24:35] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 3 ms to minimize.
[2022-05-20 11:24:35] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 199 ms
[2022-05-20 11:24:35] [INFO ] After 284ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 38 ms.
[2022-05-20 11:24:35] [INFO ] After 367ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 6 out of 142 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 142/142 places, 192/192 transitions.
Partial Free-agglomeration rule applied 22 times.
Drop transitions removed 22 transitions
Iterating global reduction 0 with 22 rules applied. Total rules applied 22 place count 142 transition count 192
Applied a total of 22 rules in 8 ms. Remains 142 /142 variables (removed 0) and now considering 192/192 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 142/142 places, 192/192 transitions.
Finished random walk after 2620 steps, including 19 resets, run visited all 1 properties in 8 ms. (steps per millisecond=327 )
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p3) (NOT p2) (NOT p0)), (X (OR (AND p3 (NOT p1)) (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p3) p2 (NOT p1)))), (X (NOT p1)), (X (X (OR (AND p3 (NOT p1)) (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p2 p1)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p3) p2 (NOT p1))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT p1))), (G (NOT (AND p1 p0)))]
False Knowledge obtained : [(F (AND (NOT p1) p0)), (F (NOT (AND (NOT p2) (NOT p1)))), (F (AND (NOT p2) p1)), (F p1), (F (AND (NOT p3) p2 (NOT p1))), (F (NOT (OR (AND p3 (NOT p1)) (AND (NOT p2) (NOT p1))))), (F (AND p2 p1)), (F (AND p2 (NOT p1))), (F (AND p2 (NOT p1) p0)), (F (AND (NOT p2) (NOT p1) p0))]
Knowledge based reduction with 14 factoid took 986 ms. Reduced automaton from 7 states, 22 edges and 4 AP to 3 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 117 ms :[p1, p1, (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 116 ms :[p1, p1, (AND p1 (NOT p2))]
Support contains 7 out of 142 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 142/142 places, 192/192 transitions.
Applied a total of 0 rules in 2 ms. Remains 142 /142 variables (removed 0) and now considering 192/192 (removed 0) transitions.
// Phase 1: matrix 192 rows 142 cols
[2022-05-20 11:24:36] [INFO ] Computed 41 place invariants in 0 ms
[2022-05-20 11:24:36] [INFO ] Implicit Places using invariants in 64 ms returned []
// Phase 1: matrix 192 rows 142 cols
[2022-05-20 11:24:36] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-20 11:24:36] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 202 ms to find 0 implicit places.
// Phase 1: matrix 192 rows 142 cols
[2022-05-20 11:24:36] [INFO ] Computed 41 place invariants in 0 ms
[2022-05-20 11:24:36] [INFO ] Dead Transitions using invariants and state equation in 86 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 142/142 places, 192/192 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p3) (NOT p1) (NOT p2)), (X (OR (AND p3 (NOT p1)) (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p3) (NOT p1) p2))), (X (NOT p1)), (X (X (OR (AND p3 (NOT p1)) (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p3) (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 374 ms. Reduced automaton from 3 states, 8 edges and 3 AP to 3 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 117 ms :[p1, p1, (AND p1 (NOT p2))]
Incomplete random walk after 10000 steps, including 69 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 7) seen :6
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 192 rows 142 cols
[2022-05-20 11:24:37] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-20 11:24:37] [INFO ] [Real]Absence check using 41 positive place invariants in 5 ms returned sat
[2022-05-20 11:24:37] [INFO ] After 111ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 11:24:37] [INFO ] [Nat]Absence check using 41 positive place invariants in 4 ms returned sat
[2022-05-20 11:24:37] [INFO ] After 59ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 11:24:37] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 3 ms to minimize.
[2022-05-20 11:24:37] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 1 ms to minimize.
[2022-05-20 11:24:37] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 0 ms to minimize.
[2022-05-20 11:24:37] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 0 ms to minimize.
[2022-05-20 11:24:37] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 193 ms
[2022-05-20 11:24:37] [INFO ] After 275ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 29 ms.
[2022-05-20 11:24:37] [INFO ] After 344ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 6 out of 142 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 142/142 places, 192/192 transitions.
Partial Free-agglomeration rule applied 22 times.
Drop transitions removed 22 transitions
Iterating global reduction 0 with 22 rules applied. Total rules applied 22 place count 142 transition count 192
Applied a total of 22 rules in 12 ms. Remains 142 /142 variables (removed 0) and now considering 192/192 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 142/142 places, 192/192 transitions.
Incomplete random walk after 10000 steps, including 75 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1551492 steps, run timeout after 3001 ms. (steps per millisecond=516 ) properties seen :{}
Probabilistic random walk after 1551492 steps, saw 288646 distinct states, run finished after 3001 ms. (steps per millisecond=516 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 192 rows 142 cols
[2022-05-20 11:24:40] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-20 11:24:40] [INFO ] [Real]Absence check using 41 positive place invariants in 5 ms returned sat
[2022-05-20 11:24:40] [INFO ] After 109ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 11:24:40] [INFO ] [Nat]Absence check using 41 positive place invariants in 6 ms returned sat
[2022-05-20 11:24:40] [INFO ] After 65ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 11:24:41] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 1 ms to minimize.
[2022-05-20 11:24:41] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 0 ms to minimize.
[2022-05-20 11:24:41] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 1 ms to minimize.
[2022-05-20 11:24:41] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 0 ms to minimize.
[2022-05-20 11:24:41] [INFO ] Deduced a trap composed of 7 places in 18 ms of which 0 ms to minimize.
[2022-05-20 11:24:41] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 0 ms to minimize.
[2022-05-20 11:24:41] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2022-05-20 11:24:41] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 0 ms to minimize.
[2022-05-20 11:24:41] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 0 ms to minimize.
[2022-05-20 11:24:41] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 1 ms to minimize.
[2022-05-20 11:24:41] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 444 ms
[2022-05-20 11:24:41] [INFO ] After 533ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 27 ms.
[2022-05-20 11:24:41] [INFO ] After 624ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 6 out of 142 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 142/142 places, 192/192 transitions.
Applied a total of 0 rules in 4 ms. Remains 142 /142 variables (removed 0) and now considering 192/192 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 142/142 places, 192/192 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 142/142 places, 192/192 transitions.
Applied a total of 0 rules in 3 ms. Remains 142 /142 variables (removed 0) and now considering 192/192 (removed 0) transitions.
// Phase 1: matrix 192 rows 142 cols
[2022-05-20 11:24:41] [INFO ] Computed 41 place invariants in 2 ms
[2022-05-20 11:24:41] [INFO ] Implicit Places using invariants in 95 ms returned []
// Phase 1: matrix 192 rows 142 cols
[2022-05-20 11:24:41] [INFO ] Computed 41 place invariants in 17 ms
[2022-05-20 11:24:41] [INFO ] Implicit Places using invariants and state equation in 155 ms returned []
Implicit Place search using SMT with State Equation took 252 ms to find 0 implicit places.
[2022-05-20 11:24:41] [INFO ] Redundant transitions in 18 ms returned []
// Phase 1: matrix 192 rows 142 cols
[2022-05-20 11:24:41] [INFO ] Computed 41 place invariants in 0 ms
[2022-05-20 11:24:41] [INFO ] Dead Transitions using invariants and state equation in 89 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 142/142 places, 192/192 transitions.
Applied a total of 0 rules in 3 ms. Remains 142 /142 variables (removed 0) and now considering 192/192 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 192 rows 142 cols
[2022-05-20 11:24:41] [INFO ] Computed 41 place invariants in 0 ms
[2022-05-20 11:24:41] [INFO ] [Real]Absence check using 41 positive place invariants in 4 ms returned sat
[2022-05-20 11:24:41] [INFO ] After 97ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 11:24:41] [INFO ] [Nat]Absence check using 41 positive place invariants in 4 ms returned sat
[2022-05-20 11:24:42] [INFO ] After 56ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 11:24:42] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 1 ms to minimize.
[2022-05-20 11:24:42] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 0 ms to minimize.
[2022-05-20 11:24:42] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 2 ms to minimize.
[2022-05-20 11:24:42] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 1 ms to minimize.
[2022-05-20 11:24:42] [INFO ] Deduced a trap composed of 7 places in 21 ms of which 1 ms to minimize.
[2022-05-20 11:24:42] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 0 ms to minimize.
[2022-05-20 11:24:42] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 0 ms to minimize.
[2022-05-20 11:24:42] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 0 ms to minimize.
[2022-05-20 11:24:42] [INFO ] Deduced a trap composed of 11 places in 21 ms of which 1 ms to minimize.
[2022-05-20 11:24:42] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 0 ms to minimize.
[2022-05-20 11:24:42] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 448 ms
[2022-05-20 11:24:42] [INFO ] After 531ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2022-05-20 11:24:42] [INFO ] After 590ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-20 11:24:42] [INFO ] Flatten gal took : 13 ms
[2022-05-20 11:24:42] [INFO ] Flatten gal took : 10 ms
[2022-05-20 11:24:42] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15208989244707048786.gal : 2 ms
[2022-05-20 11:24:42] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1349665957922733468.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms674085669365898494;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality15208989244707048786.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1349665957922733468.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality1349665957922733468.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :3 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 35
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :35 after 210
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :210 after 688
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :688 after 3573
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :3573 after 36273
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :36273 after 328161
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :328161 after 3.70481e+06
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :3.70481e+06 after 3.364e+08
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :3.364e+08 after 4.84412e+10
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :4.84412e+10 after 2.22404e+13
Detected timeout of ITS tools.
[2022-05-20 11:24:57] [INFO ] Flatten gal took : 9 ms
[2022-05-20 11:24:57] [INFO ] Applying decomposition
[2022-05-20 11:24:57] [INFO ] Flatten gal took : 24 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph8286516644128953219.txt' '-o' '/tmp/graph8286516644128953219.bin' '-w' '/tmp/graph8286516644128953219.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph8286516644128953219.bin' '-l' '-1' '-v' '-w' '/tmp/graph8286516644128953219.weights' '-q' '0' '-e' '0.001'
[2022-05-20 11:24:57] [INFO ] Decomposing Gal with order
[2022-05-20 11:24:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 11:24:57] [INFO ] Removed a total of 219 redundant transitions.
[2022-05-20 11:24:57] [INFO ] Flatten gal took : 26 ms
[2022-05-20 11:24:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 197 labels/synchronizations in 4 ms.
[2022-05-20 11:24:57] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3165413821603326000.gal : 2 ms
[2022-05-20 11:24:57] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9634480412759714213.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms674085669365898494;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality3165413821603326000.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9634480412759714213.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...298
Loading property file /tmp/ReachabilityCardinality9634480412759714213.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 12
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :12 after 12
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :12 after 415
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :415 after 7.36e+07
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :7.36e+07 after 3.77919e+09
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :3.77919e+09 after 3.48685e+14
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6601678907756687290
[2022-05-20 11:25:12] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6601678907756687290
Running compilation step : cd /tmp/ltsmin6601678907756687290;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 328 ms.
Running link step : cd /tmp/ltsmin6601678907756687290;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin6601678907756687290;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'apf6==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Knowledge obtained : [(AND (NOT p3) (NOT p1) (NOT p2)), (X (OR (AND p3 (NOT p1)) (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p3) (NOT p1) p2))), (X (NOT p1)), (X (X (OR (AND p3 (NOT p1)) (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p3) (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (AND (NOT p2) p1)), (F (NOT (AND (NOT p2) (NOT p1)))), (F (AND p2 (NOT p1))), (F (NOT (OR (AND p3 (NOT p1)) (AND (NOT p2) (NOT p1))))), (F (AND (NOT p3) p2 (NOT p1))), (F p1)]
Knowledge based reduction with 11 factoid took 453 ms. Reduced automaton from 3 states, 8 edges and 3 AP to 3 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 123 ms :[p1, p1, (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 114 ms :[p1, p1, (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 114 ms :[p1, p1, (AND p1 (NOT p2))]
Product exploration explored 100000 steps with 694 reset in 251 ms.
Product exploration explored 100000 steps with 699 reset in 267 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 114 ms :[p1, p1, (AND p1 (NOT p2))]
Support contains 7 out of 142 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 142/142 places, 192/192 transitions.
Applied a total of 0 rules in 2 ms. Remains 142 /142 variables (removed 0) and now considering 192/192 (removed 0) transitions.
[2022-05-20 11:25:29] [INFO ] Redundant transitions in 36 ms returned [60]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 191 rows 142 cols
[2022-05-20 11:25:29] [INFO ] Computed 41 place invariants in 0 ms
[2022-05-20 11:25:29] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 142/142 places, 191/192 transitions.
Applied a total of 0 rules in 3 ms. Remains 142 /142 variables (removed 0) and now considering 191/191 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 142/142 places, 191/192 transitions.
Product exploration explored 100000 steps with 698 reset in 258 ms.
Product exploration explored 100000 steps with 697 reset in 282 ms.
Built C files in :
/tmp/ltsmin14796902560059170198
[2022-05-20 11:25:30] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14796902560059170198
Running compilation step : cd /tmp/ltsmin14796902560059170198;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 299 ms.
Running link step : cd /tmp/ltsmin14796902560059170198;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin14796902560059170198;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased15227524963572916774.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 7 out of 142 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 142/142 places, 192/192 transitions.
Applied a total of 0 rules in 3 ms. Remains 142 /142 variables (removed 0) and now considering 192/192 (removed 0) transitions.
// Phase 1: matrix 192 rows 142 cols
[2022-05-20 11:25:45] [INFO ] Computed 41 place invariants in 2 ms
[2022-05-20 11:25:45] [INFO ] Implicit Places using invariants in 83 ms returned []
// Phase 1: matrix 192 rows 142 cols
[2022-05-20 11:25:45] [INFO ] Computed 41 place invariants in 0 ms
[2022-05-20 11:25:45] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 223 ms to find 0 implicit places.
// Phase 1: matrix 192 rows 142 cols
[2022-05-20 11:25:45] [INFO ] Computed 41 place invariants in 0 ms
[2022-05-20 11:25:45] [INFO ] Dead Transitions using invariants and state equation in 95 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 142/142 places, 192/192 transitions.
Built C files in :
/tmp/ltsmin5941409244046802144
[2022-05-20 11:25:45] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5941409244046802144
Running compilation step : cd /tmp/ltsmin5941409244046802144;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 311 ms.
Running link step : cd /tmp/ltsmin5941409244046802144;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin5941409244046802144;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased7421185467818489661.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-20 11:26:00] [INFO ] Flatten gal took : 11 ms
[2022-05-20 11:26:00] [INFO ] Flatten gal took : 8 ms
[2022-05-20 11:26:00] [INFO ] Time to serialize gal into /tmp/LTL2707524804509374639.gal : 1 ms
[2022-05-20 11:26:00] [INFO ] Time to serialize properties into /tmp/LTL3262715153548490167.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2707524804509374639.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3262715153548490167.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL2707524...266
Read 1 LTL properties
Checking formula 0 : !((X(F(!(((X("(((p52==1)&&(p56==1))&&(p65==1))"))U("(((p38==1)&&(p44==1))&&(p51==1))"))U(((!(G("(((p117==1)&&(p119==1))&&(p124==1))"))...215
Formula 0 simplified : !XF!((X"(((p52==1)&&(p56==1))&&(p65==1))" U "(((p38==1)&&(p44==1))&&(p51==1))") U (("(p136==1)" | !G"(((p117==1)&&(p119==1))&&(p124=...200
Detected timeout of ITS tools.
[2022-05-20 11:26:15] [INFO ] Flatten gal took : 19 ms
[2022-05-20 11:26:15] [INFO ] Applying decomposition
[2022-05-20 11:26:15] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph16519068784449411148.txt' '-o' '/tmp/graph16519068784449411148.bin' '-w' '/tmp/graph16519068784449411148.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph16519068784449411148.bin' '-l' '-1' '-v' '-w' '/tmp/graph16519068784449411148.weights' '-q' '0' '-e' '0.001'
[2022-05-20 11:26:15] [INFO ] Decomposing Gal with order
[2022-05-20 11:26:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 11:26:15] [INFO ] Removed a total of 207 redundant transitions.
[2022-05-20 11:26:15] [INFO ] Flatten gal took : 34 ms
[2022-05-20 11:26:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 192 labels/synchronizations in 11 ms.
[2022-05-20 11:26:15] [INFO ] Time to serialize gal into /tmp/LTL9901217135984804299.gal : 3 ms
[2022-05-20 11:26:15] [INFO ] Time to serialize properties into /tmp/LTL7458601615883528506.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9901217135984804299.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7458601615883528506.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL9901217...245
Read 1 LTL properties
Checking formula 0 : !((X(F(!(((X("(((i3.u15.p52==1)&&(i3.u16.p56==1))&&(i4.u19.p65==1))"))U("(((i2.u11.p38==1)&&(i2.u12.p44==1))&&(i3.u15.p51==1))"))U(((!...306
Formula 0 simplified : !XF!((X"(((i3.u15.p52==1)&&(i3.u16.p56==1))&&(i4.u19.p65==1))" U "(((i2.u11.p38==1)&&(i2.u12.p44==1))&&(i3.u15.p51==1))") U (("(i9.u...291
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10640722416553539430
[2022-05-20 11:26:30] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10640722416553539430
Running compilation step : cd /tmp/ltsmin10640722416553539430;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 303 ms.
Running link step : cd /tmp/ltsmin10640722416553539430;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin10640722416553539430;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>(!((X((LTLAPp0==true)) U (LTLAPp1==true)) U (()||(LTLAPp3==true)) U (LTLAPp1==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldRVs-PT-010A-LTLFireability-12 finished in 133661 ms.
[2022-05-20 11:26:45] [INFO ] Flatten gal took : 14 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin5529397780869518011
[2022-05-20 11:26:45] [INFO ] Computing symmetric may disable matrix : 193 transitions.
[2022-05-20 11:26:45] [INFO ] Applying decomposition
[2022-05-20 11:26:45] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 11:26:45] [INFO ] Computing symmetric may enable matrix : 193 transitions.
[2022-05-20 11:26:45] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 11:26:45] [INFO ] Computing Do-Not-Accords matrix : 193 transitions.
[2022-05-20 11:26:45] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 11:26:45] [INFO ] Flatten gal took : 10 ms
[2022-05-20 11:26:45] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5529397780869518011
Running compilation step : cd /tmp/ltsmin5529397780869518011;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph5933505460932609874.txt' '-o' '/tmp/graph5933505460932609874.bin' '-w' '/tmp/graph5933505460932609874.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph5933505460932609874.bin' '-l' '-1' '-v' '-w' '/tmp/graph5933505460932609874.weights' '-q' '0' '-e' '0.001'
[2022-05-20 11:26:45] [INFO ] Decomposing Gal with order
[2022-05-20 11:26:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 11:26:45] [INFO ] Removed a total of 207 redundant transitions.
[2022-05-20 11:26:45] [INFO ] Flatten gal took : 38 ms
[2022-05-20 11:26:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 192 labels/synchronizations in 4 ms.
[2022-05-20 11:26:46] [INFO ] Time to serialize gal into /tmp/LTLFireability10820271927344660310.gal : 4 ms
[2022-05-20 11:26:46] [INFO ] Time to serialize properties into /tmp/LTLFireability11335995382994238101.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability10820271927344660310.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability11335995382994238101.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...269
Read 2 LTL properties
Checking formula 0 : !((F(G("((((i2.u9.p31!=1)||(i3.u13.p48!=1))||(i3.u16.p57!=1))&&(((i7.u29.p103!=1)||(i7.u30.p105!=1))||(i7.u31.p110!=1)))"))))
Formula 0 simplified : !FG"((((i2.u9.p31!=1)||(i3.u13.p48!=1))||(i3.u16.p57!=1))&&(((i7.u29.p103!=1)||(i7.u30.p105!=1))||(i7.u31.p110!=1)))"
Compilation finished in 375 ms.
Running link step : cd /tmp/ltsmin5529397780869518011;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin5529397780869518011;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t67, t71, t76, t81, t85, t88, t93, t95, t103, t107, t111, t116, t119, t126, t130, t133, t137,...1076
Computing Next relation with stutter on 1.50469e+07 deadlock states
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 1/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.005: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.010: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.010: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.010: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.013: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.013: Initializing POR dependencies: labels 198, guards 193
pins2lts-mc-linux64( 2/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.013: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.014: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.021: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.021: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.022: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.029: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.029: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.030: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.037: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.037: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.038: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.058: LTL layer: formula: <>([]((LTLAPp0==true)))
pins2lts-mc-linux64( 1/ 8), 0.061: "<>([]((LTLAPp0==true)))" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.061: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 0.107: Forcing use of the an ignoring proviso (cndfs)
pins2lts-mc-linux64( 0/ 8), 0.117: There are 199 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.117: State length is 144, there are 197 groups
pins2lts-mc-linux64( 0/ 8), 0.117: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.117: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.117: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.117: Visible groups: 0 / 197, labels: 1 / 199
pins2lts-mc-linux64( 0/ 8), 0.117: POR cycle proviso: cndfs (ltl)
pins2lts-mc-linux64( 0/ 8), 0.117: Global bits: 2, count bits: 2, local bits: 0
pins2lts-mc-linux64( 3/ 8), 0.173: [Blue] ~120 levels ~960 states ~4688 transitions
pins2lts-mc-linux64( 0/ 8), 0.190: [Blue] ~147 levels ~1920 states ~6480 transitions
pins2lts-mc-linux64( 4/ 8), 0.212: [Blue] ~169 levels ~3840 states ~11264 transitions
pins2lts-mc-linux64( 4/ 8), 0.259: [Blue] ~169 levels ~7680 states ~20776 transitions
pins2lts-mc-linux64( 4/ 8), 0.346: [Blue] ~172 levels ~15360 states ~42048 transitions
pins2lts-mc-linux64( 4/ 8), 0.520: [Blue] ~172 levels ~30720 states ~90200 transitions
pins2lts-mc-linux64( 7/ 8), 0.735: [Blue] ~174 levels ~61440 states ~168768 transitions
pins2lts-mc-linux64( 7/ 8), 1.309: [Blue] ~177 levels ~122880 states ~350544 transitions
pins2lts-mc-linux64( 7/ 8), 2.576: [Blue] ~177 levels ~245760 states ~716048 transitions
pins2lts-mc-linux64( 7/ 8), 4.775: [Blue] ~186 levels ~491520 states ~1479224 transitions
pins2lts-mc-linux64( 7/ 8), 8.423: [Blue] ~186 levels ~983040 states ~3043448 transitions
pins2lts-mc-linux64( 2/ 8), 15.349: [Blue] ~192 levels ~1966080 states ~6048160 transitions
pins2lts-mc-linux64( 2/ 8), 29.571: [Blue] ~195 levels ~3932160 states ~12637408 transitions
pins2lts-mc-linux64( 2/ 8), 59.322: [Blue] ~198 levels ~7864320 states ~26025376 transitions
pins2lts-mc-linux64( 2/ 8), 117.429: [Blue] ~198 levels ~15728640 states ~52134680 transitions
pins2lts-mc-linux64( 2/ 8), 243.562: [Blue] ~210 levels ~31457280 states ~109464976 transitions
pins2lts-mc-linux64( 7/ 8), 531.923: [Blue] ~194 levels ~62914560 states ~235842000 transitions
pins2lts-mc-linux64( 7/ 8), 1138.707: [Blue] ~194 levels ~125829120 states ~498942448 transitions
pins2lts-mc-linux64( 1/ 8), 1301.847: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 1301.900:
pins2lts-mc-linux64( 0/ 8), 1301.900: Explored 134212058 states 561414973 transitions, fanout: 4.183
pins2lts-mc-linux64( 0/ 8), 1301.900: Total exploration time 1301.750 sec (1301.700 sec minimum, 1301.728 sec on average)
pins2lts-mc-linux64( 0/ 8), 1301.900: States per second: 103101, Transitions per second: 431277
pins2lts-mc-linux64( 0/ 8), 1301.900:
pins2lts-mc-linux64( 0/ 8), 1301.900: State space has 134217318 states, 1486327 are accepting
pins2lts-mc-linux64( 0/ 8), 1301.900: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 1301.900: blue states: 134212058 (100.00%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 1301.900: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 1301.900: all-red states: 1568591 (1.17%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 1301.900:
pins2lts-mc-linux64( 0/ 8), 1301.900: Total memory used for local state coloring: 0.0MB
pins2lts-mc-linux64( 0/ 8), 1301.900:
pins2lts-mc-linux64( 0/ 8), 1301.900: Queue width: 8B, total height: 1664, memory: 0.01MB
pins2lts-mc-linux64( 0/ 8), 1301.900: Tree memory: 1036.9MB, 8.1 B/state, compr.: 1.4%
pins2lts-mc-linux64( 0/ 8), 1301.900: Tree fill ratio (roots/leafs): 99.0%/5.0%
pins2lts-mc-linux64( 0/ 8), 1301.900: Stored 193 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 1301.900: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 1301.900: Est. total memory use: 1036.9MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin5529397780869518011;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin5529397780869518011;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:242)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:177)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:115)
at java.base/java.lang.Thread.run(Thread.java:829)
Detected timeout of ITS tools.
[2022-05-20 11:48:48] [INFO ] Applying decomposition
[2022-05-20 11:48:48] [INFO ] Flatten gal took : 16 ms
[2022-05-20 11:48:48] [INFO ] Decomposing Gal with order
[2022-05-20 11:48:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 11:48:48] [INFO ] Removed a total of 207 redundant transitions.
[2022-05-20 11:48:48] [INFO ] Flatten gal took : 13 ms
[2022-05-20 11:48:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 120 labels/synchronizations in 4 ms.
[2022-05-20 11:48:48] [INFO ] Time to serialize gal into /tmp/LTLFireability12417888013563194195.gal : 1 ms
[2022-05-20 11:48:48] [INFO ] Time to serialize properties into /tmp/LTLFireability8364964594996094627.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability12417888013563194195.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability8364964594996094627.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...268
Read 2 LTL properties
Checking formula 0 : !((F(G("((((u10.p31!=1)||(u14.p48!=1))||(u17.p57!=1))&&(((u30.p103!=1)||(u31.p105!=1))||(u32.p110!=1)))"))))
Formula 0 simplified : !FG"((((u10.p31!=1)||(u14.p48!=1))||(u17.p57!=1))&&(((u30.p103!=1)||(u31.p105!=1))||(u32.p110!=1)))"
Reverse transition relation is NOT exact ! Due to transitions t64, t69, t71, t76, t78, t84, t86, t90, t96, t102, t103, t109, t114, t118, t120, t124, t130, ...859
Computing Next relation with stutter on 1.50469e+07 deadlock states
Detected timeout of ITS tools.
[2022-05-20 12:11:02] [INFO ] Flatten gal took : 223 ms
[2022-05-20 12:11:03] [INFO ] Input system was already deterministic with 193 transitions.
[2022-05-20 12:11:03] [INFO ] Transformed 143 places.
[2022-05-20 12:11:03] [INFO ] Transformed 193 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-05-20 12:11:03] [INFO ] Time to serialize gal into /tmp/LTLFireability13948613906360300063.gal : 14 ms
[2022-05-20 12:11:03] [INFO ] Time to serialize properties into /tmp/LTLFireability3571633767757501332.ltl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability13948613906360300063.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability3571633767757501332.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...334
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F(G("((((p31!=1)||(p48!=1))||(p57!=1))&&(((p103!=1)||(p105!=1))||(p110!=1)))"))))
Formula 0 simplified : !FG"((((p31!=1)||(p48!=1))||(p57!=1))&&(((p103!=1)||(p105!=1))||(p110!=1)))"
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20...969
Computing Next relation with stutter on 1.50469e+07 deadlock states
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export LANG=C
+ LANG=C
+ 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
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -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=@none -Xss128m -Xms40m -Xmx8192m
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="ShieldRVs-PT-010A"
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 ShieldRVs-PT-010A, 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 r222-tall-165286025800788"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVs-PT-010A.tgz
mv ShieldRVs-PT-010A 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 ;