Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r389-oct2-167903713500395.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is ShieldPPPs-PT-003B, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r389-oct2-167903713500395
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 7.1K Feb 26 02:08 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Feb 26 02:08 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 26 02:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 26 02:07 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:58 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Feb 26 02:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K Feb 26 02:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Feb 26 02:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K Feb 26 02:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:58 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:58 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 52K Mar 5 18:23 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 ShieldPPPs-PT-003B-LTLCardinality-00
FORMULA_NAME ShieldPPPs-PT-003B-LTLCardinality-01
FORMULA_NAME ShieldPPPs-PT-003B-LTLCardinality-02
FORMULA_NAME ShieldPPPs-PT-003B-LTLCardinality-03
FORMULA_NAME ShieldPPPs-PT-003B-LTLCardinality-04
FORMULA_NAME ShieldPPPs-PT-003B-LTLCardinality-05
FORMULA_NAME ShieldPPPs-PT-003B-LTLCardinality-06
FORMULA_NAME ShieldPPPs-PT-003B-LTLCardinality-07
FORMULA_NAME ShieldPPPs-PT-003B-LTLCardinality-08
FORMULA_NAME ShieldPPPs-PT-003B-LTLCardinality-09
FORMULA_NAME ShieldPPPs-PT-003B-LTLCardinality-10
FORMULA_NAME ShieldPPPs-PT-003B-LTLCardinality-11
FORMULA_NAME ShieldPPPs-PT-003B-LTLCardinality-12
FORMULA_NAME ShieldPPPs-PT-003B-LTLCardinality-13
FORMULA_NAME ShieldPPPs-PT-003B-LTLCardinality-14
FORMULA_NAME ShieldPPPs-PT-003B-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679194890903

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPs-PT-003B
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202303021504
[2023-03-19 03:01:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-19 03:01:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 03:01:33] [INFO ] Load time of PNML (sax parser for PT used): 56 ms
[2023-03-19 03:01:33] [INFO ] Transformed 207 places.
[2023-03-19 03:01:33] [INFO ] Transformed 192 transitions.
[2023-03-19 03:01:33] [INFO ] Found NUPN structural information;
[2023-03-19 03:01:33] [INFO ] Parsed PT model containing 207 places and 192 transitions and 528 arcs in 199 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA ShieldPPPs-PT-003B-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-003B-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-003B-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-003B-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-003B-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-003B-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-003B-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 out of 207 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 207/207 places, 192/192 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 195 transition count 180
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 195 transition count 180
Applied a total of 24 rules in 39 ms. Remains 195 /207 variables (removed 12) and now considering 180/192 (removed 12) transitions.
// Phase 1: matrix 180 rows 195 cols
[2023-03-19 03:01:33] [INFO ] Computed 34 place invariants in 16 ms
[2023-03-19 03:01:34] [INFO ] Implicit Places using invariants in 376 ms returned []
[2023-03-19 03:01:34] [INFO ] Invariant cache hit.
[2023-03-19 03:01:34] [INFO ] Implicit Places using invariants and state equation in 404 ms returned []
Implicit Place search using SMT with State Equation took 820 ms to find 0 implicit places.
[2023-03-19 03:01:34] [INFO ] Invariant cache hit.
[2023-03-19 03:01:34] [INFO ] Dead Transitions using invariants and state equation in 254 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 195/207 places, 180/192 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1116 ms. Remains : 195/207 places, 180/192 transitions.
Support contains 30 out of 195 places after structural reductions.
[2023-03-19 03:01:34] [INFO ] Flatten gal took : 44 ms
[2023-03-19 03:01:34] [INFO ] Flatten gal took : 29 ms
[2023-03-19 03:01:35] [INFO ] Input system was already deterministic with 180 transitions.
Support contains 29 out of 195 places (down from 30) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 18 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 17) seen :16
Finished Best-First random walk after 1160 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=386 )
FORMULA ShieldPPPs-PT-003B-LTLCardinality-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA ShieldPPPs-PT-003B-LTLCardinality-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 41 stabilizing places and 41 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((X(p1)&&p0)))))'
Support contains 3 out of 195 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 195/195 places, 180/180 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 187 transition count 172
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 187 transition count 172
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 186 transition count 171
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 186 transition count 171
Applied a total of 18 rules in 55 ms. Remains 186 /195 variables (removed 9) and now considering 171/180 (removed 9) transitions.
// Phase 1: matrix 171 rows 186 cols
[2023-03-19 03:01:35] [INFO ] Computed 34 place invariants in 4 ms
[2023-03-19 03:01:35] [INFO ] Implicit Places using invariants in 127 ms returned []
[2023-03-19 03:01:35] [INFO ] Invariant cache hit.
[2023-03-19 03:01:36] [INFO ] Implicit Places using invariants and state equation in 354 ms returned []
Implicit Place search using SMT with State Equation took 499 ms to find 0 implicit places.
[2023-03-19 03:01:36] [INFO ] Invariant cache hit.
[2023-03-19 03:01:36] [INFO ] Dead Transitions using invariants and state equation in 159 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 186/195 places, 171/180 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 714 ms. Remains : 186/195 places, 171/180 transitions.
Stuttering acceptance computed with spot in 906 ms :[true, (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldPPPs-PT-003B-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=3, aps=[p0:(AND (NEQ s2 0) (NEQ s173 1)), p1:(EQ s113 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, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 2 ms.
FORMULA ShieldPPPs-PT-003B-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-003B-LTLCardinality-03 finished in 1730 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 195 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 195/195 places, 180/180 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 194 transition count 157
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 44 place count 172 transition count 157
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 44 place count 172 transition count 142
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 74 place count 157 transition count 142
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 83 place count 148 transition count 133
Iterating global reduction 2 with 9 rules applied. Total rules applied 92 place count 148 transition count 133
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 92 place count 148 transition count 130
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 98 place count 145 transition count 130
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 2 with 98 rules applied. Total rules applied 196 place count 96 transition count 81
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 198 place count 94 transition count 79
Applied a total of 198 rules in 75 ms. Remains 94 /195 variables (removed 101) and now considering 79/180 (removed 101) transitions.
// Phase 1: matrix 79 rows 94 cols
[2023-03-19 03:01:37] [INFO ] Computed 34 place invariants in 1 ms
[2023-03-19 03:01:37] [INFO ] Implicit Places using invariants in 87 ms returned []
[2023-03-19 03:01:37] [INFO ] Invariant cache hit.
[2023-03-19 03:01:37] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 235 ms to find 0 implicit places.
[2023-03-19 03:01:37] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-19 03:01:37] [INFO ] Invariant cache hit.
[2023-03-19 03:01:37] [INFO ] Dead Transitions using invariants and state equation in 132 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 94/195 places, 79/180 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 449 ms. Remains : 94/195 places, 79/180 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-003B-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (NEQ s29 0) (NEQ s92 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 22292 reset in 319 ms.
Product exploration explored 100000 steps with 22142 reset in 317 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 140 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 237 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 56 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 112 ms :[(NOT p0)]
[2023-03-19 03:01:38] [INFO ] Invariant cache hit.
[2023-03-19 03:01:39] [INFO ] [Real]Absence check using 34 positive place invariants in 11 ms returned sat
[2023-03-19 03:01:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 03:01:39] [INFO ] [Real]Absence check using state equation in 115 ms returned sat
[2023-03-19 03:01:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 03:01:39] [INFO ] [Nat]Absence check using 34 positive place invariants in 16 ms returned sat
[2023-03-19 03:01:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 03:01:39] [INFO ] [Nat]Absence check using state equation in 63 ms returned sat
[2023-03-19 03:01:39] [INFO ] Computed and/alt/rep : 76/145/76 causal constraints (skipped 0 transitions) in 10 ms.
[2023-03-19 03:01:39] [INFO ] Added : 44 causal constraints over 9 iterations in 145 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 94 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 94/94 places, 79/79 transitions.
Applied a total of 0 rules in 6 ms. Remains 94 /94 variables (removed 0) and now considering 79/79 (removed 0) transitions.
[2023-03-19 03:01:39] [INFO ] Invariant cache hit.
[2023-03-19 03:01:39] [INFO ] Implicit Places using invariants in 105 ms returned []
[2023-03-19 03:01:39] [INFO ] Invariant cache hit.
[2023-03-19 03:01:39] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 211 ms to find 0 implicit places.
[2023-03-19 03:01:39] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-19 03:01:39] [INFO ] Invariant cache hit.
[2023-03-19 03:01:39] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 281 ms. Remains : 94/94 places, 79/79 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 98 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 229 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 96 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 84 ms :[(NOT p0)]
[2023-03-19 03:01:40] [INFO ] Invariant cache hit.
[2023-03-19 03:01:40] [INFO ] [Real]Absence check using 34 positive place invariants in 10 ms returned sat
[2023-03-19 03:01:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 03:01:40] [INFO ] [Real]Absence check using state equation in 65 ms returned sat
[2023-03-19 03:01:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 03:01:40] [INFO ] [Nat]Absence check using 34 positive place invariants in 9 ms returned sat
[2023-03-19 03:01:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 03:01:41] [INFO ] [Nat]Absence check using state equation in 102 ms returned sat
[2023-03-19 03:01:41] [INFO ] Computed and/alt/rep : 76/145/76 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-19 03:01:41] [INFO ] Added : 44 causal constraints over 9 iterations in 195 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 65 ms :[(NOT p0)]
Product exploration explored 100000 steps with 22293 reset in 175 ms.
Product exploration explored 100000 steps with 22162 reset in 175 ms.
Built C files in :
/tmp/ltsmin11347326769586730953
[2023-03-19 03:01:41] [INFO ] Computing symmetric may disable matrix : 79 transitions.
[2023-03-19 03:01:41] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 03:01:41] [INFO ] Computing symmetric may enable matrix : 79 transitions.
[2023-03-19 03:01:41] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 03:01:41] [INFO ] Computing Do-Not-Accords matrix : 79 transitions.
[2023-03-19 03:01:41] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 03:01:41] [INFO ] Built C files in 45ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11347326769586730953
Running compilation step : cd /tmp/ltsmin11347326769586730953;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 489 ms.
Running link step : cd /tmp/ltsmin11347326769586730953;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 79 ms.
Running LTSmin : cd /tmp/ltsmin11347326769586730953;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased5804255475603090595.hoa' '--buchi-type=spotba'
LTSmin run took 263 ms.
FORMULA ShieldPPPs-PT-003B-LTLCardinality-05 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldPPPs-PT-003B-LTLCardinality-05 finished in 5378 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(((p0 U p1)||F(p2)||(p0&&F(G(p3)))))))'
Support contains 7 out of 195 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 195/195 places, 180/180 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 189 transition count 174
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 189 transition count 174
Applied a total of 12 rules in 43 ms. Remains 189 /195 variables (removed 6) and now considering 174/180 (removed 6) transitions.
// Phase 1: matrix 174 rows 189 cols
[2023-03-19 03:01:42] [INFO ] Computed 34 place invariants in 2 ms
[2023-03-19 03:01:42] [INFO ] Implicit Places using invariants in 119 ms returned []
[2023-03-19 03:01:42] [INFO ] Invariant cache hit.
[2023-03-19 03:01:43] [INFO ] Implicit Places using invariants and state equation in 327 ms returned []
Implicit Place search using SMT with State Equation took 449 ms to find 0 implicit places.
[2023-03-19 03:01:43] [INFO ] Invariant cache hit.
[2023-03-19 03:01:43] [INFO ] Dead Transitions using invariants and state equation in 107 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 189/195 places, 174/180 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 601 ms. Remains : 189/195 places, 174/180 transitions.
Stuttering acceptance computed with spot in 360 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p2) (NOT p3))), (NOT p2), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Running random walk in product with property : ShieldPPPs-PT-003B-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p0 (NOT p2) (NOT p3)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) p0 (NOT p2) p3), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) p0 (NOT p2) (NOT p3)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p2) p3), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p2) (NOT p3)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(OR (EQ s61 0) (EQ s107 1)), p0:(OR (EQ s70 0) (EQ s31 1)), p2:(EQ s73 1), p3:(OR (EQ s161 0) (EQ s3 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 193 reset in 347 ms.
Product exploration explored 100000 steps with 196 reset in 293 ms.
Computed a total of 38 stabilizing places and 38 stable transitions
Computed a total of 38 stabilizing places and 38 stable transitions
Detected a total of 38/189 stabilizing places and 38/174 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND p1 p0 (NOT p2) p3), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) p0 (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), true, (X (X (NOT (AND (NOT p1) p0 (NOT p2) (NOT p3))))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p0 (NOT p2) p3)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 515 ms. Reduced automaton from 5 states, 10 edges and 4 AP (stutter sensitive) to 5 states, 10 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 356 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p2) (NOT p3))), (NOT p2), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Incomplete random walk after 10000 steps, including 19 resets, run finished after 178 ms. (steps per millisecond=56 ) properties (out of 6) seen :5
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-19 03:01:45] [INFO ] Invariant cache hit.
[2023-03-19 03:01:45] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 03:01:45] [INFO ] [Nat]Absence check using 34 positive place invariants in 6 ms returned sat
[2023-03-19 03:01:45] [INFO ] After 69ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 03:01:45] [INFO ] Deduced a trap composed of 11 places in 115 ms of which 4 ms to minimize.
[2023-03-19 03:01:45] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 2 ms to minimize.
[2023-03-19 03:01:45] [INFO ] Deduced a trap composed of 22 places in 122 ms of which 14 ms to minimize.
[2023-03-19 03:01:45] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 353 ms
[2023-03-19 03:01:45] [INFO ] After 430ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-19 03:01:45] [INFO ] After 493ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 5 out of 189 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 189/189 places, 174/174 transitions.
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 189 transition count 153
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 42 place count 168 transition count 153
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 42 place count 168 transition count 137
Deduced a syphon composed of 16 places in 2 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 74 place count 152 transition count 137
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 75 place count 151 transition count 136
Iterating global reduction 2 with 1 rules applied. Total rules applied 76 place count 151 transition count 136
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 76 place count 151 transition count 135
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 78 place count 150 transition count 135
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 174 place count 102 transition count 87
Partial Free-agglomeration rule applied 23 times.
Drop transitions removed 23 transitions
Iterating global reduction 2 with 23 rules applied. Total rules applied 197 place count 102 transition count 87
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 198 place count 101 transition count 86
Applied a total of 198 rules in 37 ms. Remains 101 /189 variables (removed 88) and now considering 86/174 (removed 88) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 101/189 places, 86/174 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1881790 steps, run timeout after 3001 ms. (steps per millisecond=627 ) properties seen :{}
Probabilistic random walk after 1881790 steps, saw 336584 distinct states, run finished after 3007 ms. (steps per millisecond=625 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 86 rows 101 cols
[2023-03-19 03:01:48] [INFO ] Computed 34 place invariants in 3 ms
[2023-03-19 03:01:49] [INFO ] After 70ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 03:01:49] [INFO ] [Nat]Absence check using 31 positive place invariants in 12 ms returned sat
[2023-03-19 03:01:49] [INFO ] [Nat]Absence check using 31 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-19 03:01:49] [INFO ] After 71ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 03:01:49] [INFO ] Deduced a trap composed of 6 places in 66 ms of which 1 ms to minimize.
[2023-03-19 03:01:49] [INFO ] Deduced a trap composed of 5 places in 71 ms of which 1 ms to minimize.
[2023-03-19 03:01:49] [INFO ] Deduced a trap composed of 6 places in 56 ms of which 1 ms to minimize.
[2023-03-19 03:01:49] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 226 ms
[2023-03-19 03:01:49] [INFO ] After 306ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2023-03-19 03:01:49] [INFO ] After 409ms 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 101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 86/86 transitions.
Applied a total of 0 rules in 6 ms. Remains 101 /101 variables (removed 0) and now considering 86/86 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 101/101 places, 86/86 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 86/86 transitions.
Applied a total of 0 rules in 5 ms. Remains 101 /101 variables (removed 0) and now considering 86/86 (removed 0) transitions.
[2023-03-19 03:01:49] [INFO ] Invariant cache hit.
[2023-03-19 03:01:49] [INFO ] Implicit Places using invariants in 107 ms returned []
[2023-03-19 03:01:49] [INFO ] Invariant cache hit.
[2023-03-19 03:01:49] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 243 ms to find 0 implicit places.
[2023-03-19 03:01:49] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-19 03:01:49] [INFO ] Invariant cache hit.
[2023-03-19 03:01:49] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 319 ms. Remains : 101/101 places, 86/86 transitions.
Applied a total of 0 rules in 2 ms. Remains 101 /101 variables (removed 0) and now considering 86/86 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-19 03:01:49] [INFO ] Invariant cache hit.
[2023-03-19 03:01:49] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 03:01:49] [INFO ] [Nat]Absence check using 31 positive place invariants in 6 ms returned sat
[2023-03-19 03:01:49] [INFO ] [Nat]Absence check using 31 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-19 03:01:49] [INFO ] After 35ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 03:01:49] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 1 ms to minimize.
[2023-03-19 03:01:49] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 1 ms to minimize.
[2023-03-19 03:01:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 79 ms
[2023-03-19 03:01:49] [INFO ] After 122ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 11 ms.
[2023-03-19 03:01:49] [INFO ] After 177ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p1 p0 (NOT p2) p3), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) p0 (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), true, (X (X (NOT (AND (NOT p1) p0 (NOT p2) (NOT p3))))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p0 (NOT p2) p3)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT (AND (NOT p2) p3))), (F (AND (NOT p1) (NOT p2) p0 p3)), (F (AND (NOT p2) (NOT p3))), (F p2), (F (AND (NOT p1) (NOT p2) p0 (NOT p3)))]
Knowledge based reduction with 9 factoid took 638 ms. Reduced automaton from 5 states, 10 edges and 4 AP (stutter sensitive) to 5 states, 10 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 436 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p2) (NOT p3))), (NOT p2), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 396 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p2) (NOT p3))), (NOT p2), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Support contains 7 out of 189 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 189/189 places, 174/174 transitions.
Applied a total of 0 rules in 4 ms. Remains 189 /189 variables (removed 0) and now considering 174/174 (removed 0) transitions.
// Phase 1: matrix 174 rows 189 cols
[2023-03-19 03:01:51] [INFO ] Computed 34 place invariants in 2 ms
[2023-03-19 03:01:51] [INFO ] Implicit Places using invariants in 92 ms returned []
[2023-03-19 03:01:51] [INFO ] Invariant cache hit.
[2023-03-19 03:01:51] [INFO ] Implicit Places using invariants and state equation in 206 ms returned []
Implicit Place search using SMT with State Equation took 304 ms to find 0 implicit places.
[2023-03-19 03:01:51] [INFO ] Invariant cache hit.
[2023-03-19 03:01:51] [INFO ] Dead Transitions using invariants and state equation in 103 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 412 ms. Remains : 189/189 places, 174/174 transitions.
Computed a total of 38 stabilizing places and 38 stable transitions
Computed a total of 38 stabilizing places and 38 stable transitions
Detected a total of 38/189 stabilizing places and 38/174 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p2) p0 p3), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) p0 (NOT p3)))), true, (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p2) p0 p3)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) p0 (NOT p3))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 392 ms. Reduced automaton from 5 states, 10 edges and 4 AP (stutter sensitive) to 5 states, 10 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 287 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p2) (NOT p3))), (NOT p2), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Incomplete random walk after 10000 steps, including 17 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 6) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-19 03:01:52] [INFO ] Invariant cache hit.
[2023-03-19 03:01:52] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 03:01:52] [INFO ] [Nat]Absence check using 34 positive place invariants in 12 ms returned sat
[2023-03-19 03:01:52] [INFO ] After 93ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 03:01:52] [INFO ] Deduced a trap composed of 11 places in 78 ms of which 1 ms to minimize.
[2023-03-19 03:01:53] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 0 ms to minimize.
[2023-03-19 03:01:53] [INFO ] Deduced a trap composed of 22 places in 84 ms of which 0 ms to minimize.
[2023-03-19 03:01:53] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 289 ms
[2023-03-19 03:01:53] [INFO ] After 396ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-19 03:01:53] [INFO ] After 474ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 5 out of 189 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 189/189 places, 174/174 transitions.
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 189 transition count 153
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 42 place count 168 transition count 153
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 42 place count 168 transition count 137
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 74 place count 152 transition count 137
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 75 place count 151 transition count 136
Iterating global reduction 2 with 1 rules applied. Total rules applied 76 place count 151 transition count 136
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 76 place count 151 transition count 135
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 78 place count 150 transition count 135
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 174 place count 102 transition count 87
Partial Free-agglomeration rule applied 23 times.
Drop transitions removed 23 transitions
Iterating global reduction 2 with 23 rules applied. Total rules applied 197 place count 102 transition count 87
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 198 place count 101 transition count 86
Applied a total of 198 rules in 32 ms. Remains 101 /189 variables (removed 88) and now considering 86/174 (removed 88) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 101/189 places, 86/174 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1911025 steps, run timeout after 3001 ms. (steps per millisecond=636 ) properties seen :{}
Probabilistic random walk after 1911025 steps, saw 341783 distinct states, run finished after 3001 ms. (steps per millisecond=636 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 86 rows 101 cols
[2023-03-19 03:01:56] [INFO ] Computed 34 place invariants in 4 ms
[2023-03-19 03:01:56] [INFO ] After 66ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 03:01:56] [INFO ] [Nat]Absence check using 31 positive place invariants in 11 ms returned sat
[2023-03-19 03:01:56] [INFO ] [Nat]Absence check using 31 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-19 03:01:56] [INFO ] After 81ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 03:01:56] [INFO ] Deduced a trap composed of 6 places in 70 ms of which 1 ms to minimize.
[2023-03-19 03:01:56] [INFO ] Deduced a trap composed of 5 places in 66 ms of which 1 ms to minimize.
[2023-03-19 03:01:56] [INFO ] Deduced a trap composed of 6 places in 59 ms of which 1 ms to minimize.
[2023-03-19 03:01:56] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 230 ms
[2023-03-19 03:01:56] [INFO ] After 324ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2023-03-19 03:01:56] [INFO ] After 422ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 5 out of 101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 86/86 transitions.
Applied a total of 0 rules in 6 ms. Remains 101 /101 variables (removed 0) and now considering 86/86 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 101/101 places, 86/86 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 86/86 transitions.
Applied a total of 0 rules in 6 ms. Remains 101 /101 variables (removed 0) and now considering 86/86 (removed 0) transitions.
[2023-03-19 03:01:56] [INFO ] Invariant cache hit.
[2023-03-19 03:01:56] [INFO ] Implicit Places using invariants in 122 ms returned []
[2023-03-19 03:01:56] [INFO ] Invariant cache hit.
[2023-03-19 03:01:57] [INFO ] Implicit Places using invariants and state equation in 201 ms returned []
Implicit Place search using SMT with State Equation took 325 ms to find 0 implicit places.
[2023-03-19 03:01:57] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-19 03:01:57] [INFO ] Invariant cache hit.
[2023-03-19 03:01:57] [INFO ] Dead Transitions using invariants and state equation in 118 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 465 ms. Remains : 101/101 places, 86/86 transitions.
Applied a total of 0 rules in 3 ms. Remains 101 /101 variables (removed 0) and now considering 86/86 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-19 03:01:57] [INFO ] Invariant cache hit.
[2023-03-19 03:01:57] [INFO ] After 57ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 03:01:57] [INFO ] [Nat]Absence check using 31 positive place invariants in 9 ms returned sat
[2023-03-19 03:01:57] [INFO ] [Nat]Absence check using 31 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-19 03:01:57] [INFO ] After 73ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 03:01:57] [INFO ] Deduced a trap composed of 5 places in 64 ms of which 1 ms to minimize.
[2023-03-19 03:01:57] [INFO ] Deduced a trap composed of 6 places in 62 ms of which 1 ms to minimize.
[2023-03-19 03:01:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 152 ms
[2023-03-19 03:01:57] [INFO ] After 237ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2023-03-19 03:01:57] [INFO ] After 322ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p1 (NOT p2) p0 p3), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) p0 (NOT p3)))), true, (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p2) p0 p3)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) p0 (NOT p3))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT (AND (NOT p2) p3))), (F (AND (NOT p1) (NOT p2) p0 p3)), (F (AND (NOT p2) (NOT p3))), (F p2), (F (AND (NOT p1) (NOT p2) p0 (NOT p3)))]
Knowledge based reduction with 9 factoid took 796 ms. Reduced automaton from 5 states, 10 edges and 4 AP (stutter sensitive) to 5 states, 10 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 385 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p2) (NOT p3))), (NOT p2), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 435 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p2) (NOT p3))), (NOT p2), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 456 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p2) (NOT p3))), (NOT p2), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Product exploration explored 100000 steps with 189 reset in 231 ms.
Product exploration explored 100000 steps with 191 reset in 196 ms.
Applying partial POR strategy [false, true, true, true, true]
Stuttering acceptance computed with spot in 343 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p2) (NOT p3))), (NOT p2), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Support contains 7 out of 189 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 189/189 places, 174/174 transitions.
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 189 transition count 174
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 9 Pre rules applied. Total rules applied 20 place count 189 transition count 176
Deduced a syphon composed of 29 places in 0 ms
Iterating global reduction 1 with 9 rules applied. Total rules applied 29 place count 189 transition count 176
Performed 54 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 83 places in 0 ms
Iterating global reduction 1 with 54 rules applied. Total rules applied 83 place count 189 transition count 176
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 103 place count 169 transition count 156
Deduced a syphon composed of 63 places in 0 ms
Iterating global reduction 1 with 20 rules applied. Total rules applied 123 place count 169 transition count 156
Deduced a syphon composed of 63 places in 0 ms
Applied a total of 123 rules in 47 ms. Remains 169 /189 variables (removed 20) and now considering 156/174 (removed 18) transitions.
[2023-03-19 03:02:00] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 156 rows 169 cols
[2023-03-19 03:02:00] [INFO ] Computed 34 place invariants in 1 ms
[2023-03-19 03:02:01] [INFO ] Dead Transitions using invariants and state equation in 183 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 169/189 places, 156/174 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 244 ms. Remains : 169/189 places, 156/174 transitions.
Built C files in :
/tmp/ltsmin4660227160704769907
[2023-03-19 03:02:01] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4660227160704769907
Running compilation step : cd /tmp/ltsmin4660227160704769907;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 249 ms.
Running link step : cd /tmp/ltsmin4660227160704769907;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 25 ms.
Running LTSmin : cd /tmp/ltsmin4660227160704769907;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased6811236236347227217.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 7 out of 189 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 189/189 places, 174/174 transitions.
Applied a total of 0 rules in 9 ms. Remains 189 /189 variables (removed 0) and now considering 174/174 (removed 0) transitions.
// Phase 1: matrix 174 rows 189 cols
[2023-03-19 03:02:16] [INFO ] Computed 34 place invariants in 3 ms
[2023-03-19 03:02:16] [INFO ] Implicit Places using invariants in 126 ms returned []
[2023-03-19 03:02:16] [INFO ] Invariant cache hit.
[2023-03-19 03:02:16] [INFO ] Implicit Places using invariants and state equation in 171 ms returned []
Implicit Place search using SMT with State Equation took 300 ms to find 0 implicit places.
[2023-03-19 03:02:16] [INFO ] Invariant cache hit.
[2023-03-19 03:02:16] [INFO ] Dead Transitions using invariants and state equation in 111 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 421 ms. Remains : 189/189 places, 174/174 transitions.
Built C files in :
/tmp/ltsmin2258909511849155011
[2023-03-19 03:02:16] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2258909511849155011
Running compilation step : cd /tmp/ltsmin2258909511849155011;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 296 ms.
Running link step : cd /tmp/ltsmin2258909511849155011;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin2258909511849155011;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased17738428092225354816.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-19 03:02:31] [INFO ] Flatten gal took : 16 ms
[2023-03-19 03:02:31] [INFO ] Flatten gal took : 12 ms
[2023-03-19 03:02:31] [INFO ] Time to serialize gal into /tmp/LTL4388352201019947809.gal : 4 ms
[2023-03-19 03:02:31] [INFO ] Time to serialize properties into /tmp/LTL196149226851639203.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4388352201019947809.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15379388416931450307.hoa' '-atoms' '/tmp/LTL196149226851639203.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL196149226851639203.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15379388416931450307.hoa
Detected timeout of ITS tools.
[2023-03-19 03:02:47] [INFO ] Flatten gal took : 9 ms
[2023-03-19 03:02:47] [INFO ] Flatten gal took : 7 ms
[2023-03-19 03:02:47] [INFO ] Time to serialize gal into /tmp/LTL12269833618716704880.gal : 21 ms
[2023-03-19 03:02:47] [INFO ] Time to serialize properties into /tmp/LTL1976400216652931921.ltl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12269833618716704880.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1976400216652931921.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(G(((("((p76==0)||(p31==1))")U("((p66==0)||(p114==1))"))||(F("(p79==1)")))||((F(G("((p173==0)||(p3==1))")))&&("((p76==0)||(p31==1)...163
Formula 0 simplified : XF((!"((p76==0)||(p31==1))" R !"((p66==0)||(p114==1))") & G!"(p79==1)" & (!"((p76==0)||(p31==1))" | GF!"((p173==0)||(p3==1))"))
Detected timeout of ITS tools.
[2023-03-19 03:03:02] [INFO ] Flatten gal took : 23 ms
[2023-03-19 03:03:02] [INFO ] Applying decomposition
[2023-03-19 03:03:02] [INFO ] Flatten gal took : 14 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph416122523010670508.txt' '-o' '/tmp/graph416122523010670508.bin' '-w' '/tmp/graph416122523010670508.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph416122523010670508.bin' '-l' '-1' '-v' '-w' '/tmp/graph416122523010670508.weights' '-q' '0' '-e' '0.001'
[2023-03-19 03:03:02] [INFO ] Decomposing Gal with order
[2023-03-19 03:03:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 03:03:02] [INFO ] Removed a total of 27 redundant transitions.
[2023-03-19 03:03:02] [INFO ] Flatten gal took : 44 ms
[2023-03-19 03:03:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2023-03-19 03:03:02] [INFO ] Time to serialize gal into /tmp/LTL11815319412492424128.gal : 5 ms
[2023-03-19 03:03:02] [INFO ] Time to serialize properties into /tmp/LTL5141912955684387777.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11815319412492424128.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5141912955684387777.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(G(((("((i5.i0.u27.p76==0)||(i2.i0.u13.p31==1))")U("((i2.i1.u24.p66==0)||(i6.i1.u39.p114==1))"))||(F("(i5.i1.u28.p79==1)")))||((F(...247
Formula 0 simplified : XF((!"((i5.i0.u27.p76==0)||(i2.i0.u13.p31==1))" R !"((i2.i1.u24.p66==0)||(i6.i1.u39.p114==1))") & G!"(i5.i1.u28.p79==1)" & (!"((i5.i...234
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12300689151781345251
[2023-03-19 03:03:17] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12300689151781345251
Running compilation step : cd /tmp/ltsmin12300689151781345251;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 273 ms.
Running link step : cd /tmp/ltsmin12300689151781345251;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin12300689151781345251;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([]((((LTLAPp0==true) U (LTLAPp1==true))||<>((LTLAPp2==true))||(<>([]((LTLAPp3==true)))&&(LTLAPp0==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldPPPs-PT-003B-LTLCardinality-06 finished in 110039 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X(X(G(p1))))))'
Support contains 1 out of 195 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 195/195 places, 180/180 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 187 transition count 172
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 187 transition count 172
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 186 transition count 171
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 186 transition count 171
Applied a total of 18 rules in 16 ms. Remains 186 /195 variables (removed 9) and now considering 171/180 (removed 9) transitions.
// Phase 1: matrix 171 rows 186 cols
[2023-03-19 03:03:32] [INFO ] Computed 34 place invariants in 3 ms
[2023-03-19 03:03:32] [INFO ] Implicit Places using invariants in 156 ms returned []
[2023-03-19 03:03:32] [INFO ] Invariant cache hit.
[2023-03-19 03:03:33] [INFO ] Implicit Places using invariants and state equation in 384 ms returned []
Implicit Place search using SMT with State Equation took 544 ms to find 0 implicit places.
[2023-03-19 03:03:33] [INFO ] Invariant cache hit.
[2023-03-19 03:03:33] [INFO ] Dead Transitions using invariants and state equation in 156 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 186/195 places, 171/180 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 718 ms. Remains : 186/195 places, 171/180 transitions.
Stuttering acceptance computed with spot in 258 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPs-PT-003B-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=4, aps=[p0:(EQ s106 1), p1:(EQ s106 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, 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 15 steps with 0 reset in 0 ms.
FORMULA ShieldPPPs-PT-003B-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-003B-LTLCardinality-08 finished in 1010 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 195 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 195/195 places, 180/180 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 194 transition count 157
Reduce places removed 22 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 23 rules applied. Total rules applied 45 place count 172 transition count 156
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 46 place count 171 transition count 156
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 15 Pre rules applied. Total rules applied 46 place count 171 transition count 141
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 76 place count 156 transition count 141
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 85 place count 147 transition count 132
Iterating global reduction 3 with 9 rules applied. Total rules applied 94 place count 147 transition count 132
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 94 place count 147 transition count 129
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 100 place count 144 transition count 129
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 3 with 98 rules applied. Total rules applied 198 place count 95 transition count 80
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 200 place count 93 transition count 78
Applied a total of 200 rules in 54 ms. Remains 93 /195 variables (removed 102) and now considering 78/180 (removed 102) transitions.
// Phase 1: matrix 78 rows 93 cols
[2023-03-19 03:03:33] [INFO ] Computed 34 place invariants in 8 ms
[2023-03-19 03:03:33] [INFO ] Implicit Places using invariants in 173 ms returned []
[2023-03-19 03:03:33] [INFO ] Invariant cache hit.
[2023-03-19 03:03:34] [INFO ] Implicit Places using invariants and state equation in 193 ms returned []
Implicit Place search using SMT with State Equation took 382 ms to find 0 implicit places.
[2023-03-19 03:03:34] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-19 03:03:34] [INFO ] Invariant cache hit.
[2023-03-19 03:03:34] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 93/195 places, 78/180 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 513 ms. Remains : 93/195 places, 78/180 transitions.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-003B-LTLCardinality-10 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 (EQ s65 0) (EQ s47 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 214 steps with 0 reset in 0 ms.
FORMULA ShieldPPPs-PT-003B-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-003B-LTLCardinality-10 finished in 594 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G(p1))))'
Support contains 3 out of 195 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 195/195 places, 180/180 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 194 transition count 157
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 44 place count 172 transition count 157
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 44 place count 172 transition count 142
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 74 place count 157 transition count 142
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 82 place count 149 transition count 134
Iterating global reduction 2 with 8 rules applied. Total rules applied 90 place count 149 transition count 134
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 90 place count 149 transition count 132
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 94 place count 147 transition count 132
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 46
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 2 with 92 rules applied. Total rules applied 186 place count 101 transition count 86
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 188 place count 99 transition count 84
Applied a total of 188 rules in 21 ms. Remains 99 /195 variables (removed 96) and now considering 84/180 (removed 96) transitions.
// Phase 1: matrix 84 rows 99 cols
[2023-03-19 03:03:34] [INFO ] Computed 34 place invariants in 1 ms
[2023-03-19 03:03:34] [INFO ] Implicit Places using invariants in 159 ms returned []
[2023-03-19 03:03:34] [INFO ] Invariant cache hit.
[2023-03-19 03:03:34] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 295 ms to find 0 implicit places.
[2023-03-19 03:03:34] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 03:03:34] [INFO ] Invariant cache hit.
[2023-03-19 03:03:34] [INFO ] Dead Transitions using invariants and state equation in 88 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 99/195 places, 84/180 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 410 ms. Remains : 99/195 places, 84/180 transitions.
Stuttering acceptance computed with spot in 45 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldPPPs-PT-003B-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(OR (EQ s38 0) (EQ s1 1)), p0:(EQ s28 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 10940 reset in 181 ms.
Product exploration explored 100000 steps with 11014 reset in 149 ms.
Computed a total of 5 stabilizing places and 5 stable transitions
Computed a total of 5 stabilizing places and 5 stable transitions
Detected a total of 5/99 stabilizing places and 5/84 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
Knowledge based reduction with 5 factoid took 334 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(AND (NOT p1) (NOT p0))]
Finished random walk after 1222 steps, including 5 resets, run visited all 2 properties in 14 ms. (steps per millisecond=87 )
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (NOT (AND p1 (NOT p0)))), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 5 factoid took 348 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 92 ms :[(AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p1) (NOT p0))]
Support contains 3 out of 99 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 99/99 places, 84/84 transitions.
Applied a total of 0 rules in 4 ms. Remains 99 /99 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2023-03-19 03:03:35] [INFO ] Invariant cache hit.
[2023-03-19 03:03:36] [INFO ] Implicit Places using invariants in 141 ms returned []
[2023-03-19 03:03:36] [INFO ] Invariant cache hit.
[2023-03-19 03:03:36] [INFO ] Implicit Places using invariants and state equation in 193 ms returned []
Implicit Place search using SMT with State Equation took 351 ms to find 0 implicit places.
[2023-03-19 03:03:36] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-19 03:03:36] [INFO ] Invariant cache hit.
[2023-03-19 03:03:36] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 461 ms. Remains : 99/99 places, 84/84 transitions.
Computed a total of 5 stabilizing places and 5 stable transitions
Computed a total of 5 stabilizing places and 5 stable transitions
Detected a total of 5/99 stabilizing places and 5/84 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
Knowledge based reduction with 5 factoid took 338 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 55 ms :[(AND (NOT p1) (NOT p0))]
Finished random walk after 3245 steps, including 14 resets, run visited all 2 properties in 18 ms. (steps per millisecond=180 )
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (NOT (AND p1 (NOT p0)))), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 5 factoid took 304 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[(AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 36 ms :[(AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 60 ms :[(AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 10871 reset in 149 ms.
Product exploration explored 100000 steps with 10973 reset in 202 ms.
Built C files in :
/tmp/ltsmin12634296770187947727
[2023-03-19 03:03:37] [INFO ] Computing symmetric may disable matrix : 84 transitions.
[2023-03-19 03:03:37] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 03:03:37] [INFO ] Computing symmetric may enable matrix : 84 transitions.
[2023-03-19 03:03:37] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 03:03:37] [INFO ] Computing Do-Not-Accords matrix : 84 transitions.
[2023-03-19 03:03:37] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 03:03:37] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12634296770187947727
Running compilation step : cd /tmp/ltsmin12634296770187947727;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 227 ms.
Running link step : cd /tmp/ltsmin12634296770187947727;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin12634296770187947727;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased77097674651578683.hoa' '--buchi-type=spotba'
LTSmin run took 7868 ms.
FORMULA ShieldPPPs-PT-003B-LTLCardinality-11 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldPPPs-PT-003B-LTLCardinality-11 finished in 11613 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0) U X(X(p1)))))'
Support contains 4 out of 195 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 195/195 places, 180/180 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 186 transition count 171
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 186 transition count 171
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 185 transition count 170
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 185 transition count 170
Applied a total of 20 rules in 9 ms. Remains 185 /195 variables (removed 10) and now considering 170/180 (removed 10) transitions.
// Phase 1: matrix 170 rows 185 cols
[2023-03-19 03:03:45] [INFO ] Computed 34 place invariants in 2 ms
[2023-03-19 03:03:46] [INFO ] Implicit Places using invariants in 142 ms returned []
[2023-03-19 03:03:46] [INFO ] Invariant cache hit.
[2023-03-19 03:03:46] [INFO ] Implicit Places using invariants and state equation in 274 ms returned []
Implicit Place search using SMT with State Equation took 419 ms to find 0 implicit places.
[2023-03-19 03:03:46] [INFO ] Invariant cache hit.
[2023-03-19 03:03:46] [INFO ] Dead Transitions using invariants and state equation in 113 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 185/195 places, 170/180 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 542 ms. Remains : 185/195 places, 170/180 transitions.
Stuttering acceptance computed with spot in 420 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-003B-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 4}, { cond=true, acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=5 dest: 4}, { cond=(NOT p1), acceptance={0} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(OR (EQ s19 0) (EQ s16 1)), p1:(OR (EQ s139 0) (EQ s24 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, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 24947 reset in 93 ms.
Product exploration explored 100000 steps with 24919 reset in 137 ms.
Computed a total of 35 stabilizing places and 35 stable transitions
Computed a total of 35 stabilizing places and 35 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 339 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 7 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 364 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Finished random walk after 2315 steps, including 4 resets, run visited all 3 properties in 18 ms. (steps per millisecond=128 )
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 4 factoid took 307 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 7 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 372 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 229 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Support contains 4 out of 185 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 185/185 places, 170/170 transitions.
Applied a total of 0 rules in 2 ms. Remains 185 /185 variables (removed 0) and now considering 170/170 (removed 0) transitions.
[2023-03-19 03:03:48] [INFO ] Invariant cache hit.
[2023-03-19 03:03:48] [INFO ] Implicit Places using invariants in 128 ms returned []
[2023-03-19 03:03:48] [INFO ] Invariant cache hit.
[2023-03-19 03:03:49] [INFO ] Implicit Places using invariants and state equation in 239 ms returned []
Implicit Place search using SMT with State Equation took 368 ms to find 0 implicit places.
[2023-03-19 03:03:49] [INFO ] Invariant cache hit.
[2023-03-19 03:03:49] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 451 ms. Remains : 185/185 places, 170/170 transitions.
Computed a total of 35 stabilizing places and 35 stable transitions
Computed a total of 35 stabilizing places and 35 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 197 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 7 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 256 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Finished random walk after 176 steps, including 0 resets, run visited all 3 properties in 6 ms. (steps per millisecond=29 )
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 4 factoid took 337 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 7 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 284 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 277 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 375 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Product exploration explored 100000 steps with 24978 reset in 99 ms.
Product exploration explored 100000 steps with 24996 reset in 111 ms.
Applying partial POR strategy [false, false, false, true, false, false, true]
Stuttering acceptance computed with spot in 376 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Support contains 4 out of 185 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 185/185 places, 170/170 transitions.
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 185 transition count 170
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 8 Pre rules applied. Total rules applied 21 place count 185 transition count 171
Deduced a syphon composed of 29 places in 0 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 29 place count 185 transition count 171
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 88 places in 0 ms
Iterating global reduction 1 with 59 rules applied. Total rules applied 88 place count 185 transition count 171
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 111 place count 162 transition count 148
Deduced a syphon composed of 65 places in 0 ms
Iterating global reduction 1 with 23 rules applied. Total rules applied 134 place count 162 transition count 148
Deduced a syphon composed of 65 places in 0 ms
Applied a total of 134 rules in 26 ms. Remains 162 /185 variables (removed 23) and now considering 148/170 (removed 22) transitions.
[2023-03-19 03:03:51] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 148 rows 162 cols
[2023-03-19 03:03:51] [INFO ] Computed 34 place invariants in 1 ms
[2023-03-19 03:03:51] [INFO ] Dead Transitions using invariants and state equation in 143 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 162/185 places, 148/170 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 205 ms. Remains : 162/185 places, 148/170 transitions.
Built C files in :
/tmp/ltsmin13364673629115315431
[2023-03-19 03:03:51] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13364673629115315431
Running compilation step : cd /tmp/ltsmin13364673629115315431;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 262 ms.
Running link step : cd /tmp/ltsmin13364673629115315431;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 23 ms.
Running LTSmin : cd /tmp/ltsmin13364673629115315431;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased541125573431839928.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 185 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 185/185 places, 170/170 transitions.
Applied a total of 0 rules in 2 ms. Remains 185 /185 variables (removed 0) and now considering 170/170 (removed 0) transitions.
// Phase 1: matrix 170 rows 185 cols
[2023-03-19 03:04:06] [INFO ] Computed 34 place invariants in 3 ms
[2023-03-19 03:04:07] [INFO ] Implicit Places using invariants in 161 ms returned []
[2023-03-19 03:04:07] [INFO ] Invariant cache hit.
[2023-03-19 03:04:07] [INFO ] Implicit Places using invariants and state equation in 229 ms returned []
Implicit Place search using SMT with State Equation took 393 ms to find 0 implicit places.
[2023-03-19 03:04:07] [INFO ] Invariant cache hit.
[2023-03-19 03:04:07] [INFO ] Dead Transitions using invariants and state equation in 159 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 555 ms. Remains : 185/185 places, 170/170 transitions.
Built C files in :
/tmp/ltsmin7052789128927976474
[2023-03-19 03:04:07] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7052789128927976474
Running compilation step : cd /tmp/ltsmin7052789128927976474;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 263 ms.
Running link step : cd /tmp/ltsmin7052789128927976474;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin7052789128927976474;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased6234190747284208572.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-19 03:04:22] [INFO ] Flatten gal took : 12 ms
[2023-03-19 03:04:22] [INFO ] Flatten gal took : 11 ms
[2023-03-19 03:04:22] [INFO ] Time to serialize gal into /tmp/LTL12250302545813742445.gal : 7 ms
[2023-03-19 03:04:22] [INFO ] Time to serialize properties into /tmp/LTL14693989220623026580.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12250302545813742445.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1931881324309664913.hoa' '-atoms' '/tmp/LTL14693989220623026580.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL14693989220623026580.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1931881324309664913.hoa
Detected timeout of ITS tools.
[2023-03-19 03:04:37] [INFO ] Flatten gal took : 24 ms
[2023-03-19 03:04:37] [INFO ] Flatten gal took : 8 ms
[2023-03-19 03:04:37] [INFO ] Time to serialize gal into /tmp/LTL10660034730300380287.gal : 2 ms
[2023-03-19 03:04:37] [INFO ] Time to serialize properties into /tmp/LTL14392576995492822224.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10660034730300380287.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14392576995492822224.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G((F("((p19==0)||(p16==1))"))U(X(X("((p153==0)||(p24==1))"))))))
Formula 0 simplified : F(G!"((p19==0)||(p16==1))" R XX!"((p153==0)||(p24==1))")
Detected timeout of ITS tools.
[2023-03-19 03:04:52] [INFO ] Flatten gal took : 30 ms
[2023-03-19 03:04:52] [INFO ] Applying decomposition
[2023-03-19 03:04:52] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph16239540814112348809.txt' '-o' '/tmp/graph16239540814112348809.bin' '-w' '/tmp/graph16239540814112348809.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph16239540814112348809.bin' '-l' '-1' '-v' '-w' '/tmp/graph16239540814112348809.weights' '-q' '0' '-e' '0.001'
[2023-03-19 03:04:53] [INFO ] Decomposing Gal with order
[2023-03-19 03:04:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 03:04:53] [INFO ] Removed a total of 27 redundant transitions.
[2023-03-19 03:04:53] [INFO ] Flatten gal took : 17 ms
[2023-03-19 03:04:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2023-03-19 03:04:53] [INFO ] Time to serialize gal into /tmp/LTL16763538137168738177.gal : 4 ms
[2023-03-19 03:04:53] [INFO ] Time to serialize properties into /tmp/LTL6701413242744143681.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16763538137168738177.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6701413242744143681.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G((F("((i1.i2.u8.p19==0)||(i1.i1.u6.p16==1))"))U(X(X("((i9.i0.u56.p153==0)||(i2.i0.u10.p24==1))"))))))
Formula 0 simplified : F(G!"((i1.i2.u8.p19==0)||(i1.i1.u6.p16==1))" R XX!"((i9.i0.u56.p153==0)||(i2.i0.u10.p24==1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8575782101502792013
[2023-03-19 03:05:08] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8575782101502792013
Running compilation step : cd /tmp/ltsmin8575782101502792013;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 248 ms.
Running link step : cd /tmp/ltsmin8575782101502792013;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin8575782101502792013;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((<>((LTLAPp0==true)) U X(X((LTLAPp1==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldPPPs-PT-003B-LTLCardinality-13 finished in 97450 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(((p0 U p1)||F(p2)||(p0&&F(G(p3)))))))'
Found a Lengthening insensitive property : ShieldPPPs-PT-003B-LTLCardinality-06
Stuttering acceptance computed with spot in 400 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p2) (NOT p3))), (NOT p2), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Support contains 7 out of 195 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 195/195 places, 180/180 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 194 transition count 159
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 40 place count 174 transition count 159
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 40 place count 174 transition count 143
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 72 place count 158 transition count 143
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 78 place count 152 transition count 137
Iterating global reduction 2 with 6 rules applied. Total rules applied 84 place count 152 transition count 137
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 84 place count 152 transition count 136
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 86 place count 151 transition count 136
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 44
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 2 with 88 rules applied. Total rules applied 174 place count 107 transition count 92
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 176 place count 105 transition count 90
Applied a total of 176 rules in 27 ms. Remains 105 /195 variables (removed 90) and now considering 90/180 (removed 90) transitions.
// Phase 1: matrix 90 rows 105 cols
[2023-03-19 03:05:23] [INFO ] Computed 34 place invariants in 1 ms
[2023-03-19 03:05:24] [INFO ] Implicit Places using invariants in 124 ms returned []
[2023-03-19 03:05:24] [INFO ] Invariant cache hit.
[2023-03-19 03:05:24] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 248 ms to find 0 implicit places.
[2023-03-19 03:05:24] [INFO ] Invariant cache hit.
[2023-03-19 03:05:24] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 105/195 places, 90/180 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 325 ms. Remains : 105/195 places, 90/180 transitions.
Running random walk in product with property : ShieldPPPs-PT-003B-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p0 (NOT p2) (NOT p3)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) p0 (NOT p2) p3), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) p0 (NOT p2) (NOT p3)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p2) p3), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p2) (NOT p3)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(OR (EQ s34 0) (EQ s63 1)), p0:(OR (EQ s38 0) (EQ s17 1)), p2:(EQ s40 1), p3:(OR (EQ s90 0) (EQ s1 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 432 reset in 182 ms.
Product exploration explored 100000 steps with 419 reset in 194 ms.
Computed a total of 8 stabilizing places and 8 stable transitions
Computed a total of 8 stabilizing places and 8 stable transitions
Detected a total of 8/105 stabilizing places and 8/90 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND p1 p0 (NOT p2) p3), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) p0 (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), true, (X (X (NOT (AND (NOT p1) p0 (NOT p2) (NOT p3))))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p0 (NOT p2) p3)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 695 ms. Reduced automaton from 5 states, 10 edges and 4 AP (stutter sensitive) to 5 states, 10 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 357 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p2) (NOT p3))), (NOT p2), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Incomplete random walk after 10000 steps, including 37 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 6) seen :5
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-19 03:05:25] [INFO ] Invariant cache hit.
[2023-03-19 03:05:25] [INFO ] After 72ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 03:05:25] [INFO ] [Nat]Absence check using 34 positive place invariants in 4 ms returned sat
[2023-03-19 03:05:25] [INFO ] After 48ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 03:05:25] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 1 ms to minimize.
[2023-03-19 03:05:26] [INFO ] Deduced a trap composed of 8 places in 61 ms of which 0 ms to minimize.
[2023-03-19 03:05:26] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2023-03-19 03:05:26] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 151 ms
[2023-03-19 03:05:26] [INFO ] After 208ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 23 ms.
[2023-03-19 03:05:26] [INFO ] After 295ms 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 105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 90/90 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 105 transition count 89
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 104 transition count 89
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 102 transition count 87
Partial Free-agglomeration rule applied 21 times.
Drop transitions removed 21 transitions
Iterating global reduction 2 with 21 rules applied. Total rules applied 27 place count 102 transition count 87
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 28 place count 101 transition count 86
Applied a total of 28 rules in 14 ms. Remains 101 /105 variables (removed 4) and now considering 86/90 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 101/105 places, 86/90 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1901777 steps, run timeout after 3001 ms. (steps per millisecond=633 ) properties seen :{}
Probabilistic random walk after 1901777 steps, saw 345646 distinct states, run finished after 3001 ms. (steps per millisecond=633 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 86 rows 101 cols
[2023-03-19 03:05:29] [INFO ] Computed 34 place invariants in 2 ms
[2023-03-19 03:05:29] [INFO ] After 93ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 03:05:29] [INFO ] [Nat]Absence check using 33 positive place invariants in 8 ms returned sat
[2023-03-19 03:05:29] [INFO ] [Nat]Absence check using 33 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-19 03:05:29] [INFO ] After 43ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 03:05:29] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 0 ms to minimize.
[2023-03-19 03:05:29] [INFO ] Deduced a trap composed of 5 places in 79 ms of which 0 ms to minimize.
[2023-03-19 03:05:29] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 0 ms to minimize.
[2023-03-19 03:05:29] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 1 ms to minimize.
[2023-03-19 03:05:29] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 0 ms to minimize.
[2023-03-19 03:05:29] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 260 ms
[2023-03-19 03:05:29] [INFO ] After 334ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-03-19 03:05:29] [INFO ] After 451ms 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 101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 86/86 transitions.
Applied a total of 0 rules in 1 ms. Remains 101 /101 variables (removed 0) and now considering 86/86 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 101/101 places, 86/86 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 86/86 transitions.
Applied a total of 0 rules in 2 ms. Remains 101 /101 variables (removed 0) and now considering 86/86 (removed 0) transitions.
[2023-03-19 03:05:29] [INFO ] Invariant cache hit.
[2023-03-19 03:05:29] [INFO ] Implicit Places using invariants in 97 ms returned []
[2023-03-19 03:05:29] [INFO ] Invariant cache hit.
[2023-03-19 03:05:29] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 201 ms to find 0 implicit places.
[2023-03-19 03:05:29] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 03:05:29] [INFO ] Invariant cache hit.
[2023-03-19 03:05:29] [INFO ] Dead Transitions using invariants and state equation in 93 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 305 ms. Remains : 101/101 places, 86/86 transitions.
Applied a total of 0 rules in 1 ms. Remains 101 /101 variables (removed 0) and now considering 86/86 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-19 03:05:30] [INFO ] Invariant cache hit.
[2023-03-19 03:05:30] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 03:05:30] [INFO ] [Nat]Absence check using 33 positive place invariants in 10 ms returned sat
[2023-03-19 03:05:30] [INFO ] [Nat]Absence check using 33 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-19 03:05:30] [INFO ] After 48ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 03:05:30] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 0 ms to minimize.
[2023-03-19 03:05:30] [INFO ] Deduced a trap composed of 6 places in 132 ms of which 13 ms to minimize.
[2023-03-19 03:05:30] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 175 ms
[2023-03-19 03:05:30] [INFO ] After 227ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-19 03:05:30] [INFO ] After 289ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p1 p0 (NOT p2) p3), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) p0 (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), true, (X (X (NOT (AND (NOT p1) p0 (NOT p2) (NOT p3))))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p0 (NOT p2) p3)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT (AND (NOT p2) p3))), (F (AND (NOT p1) (NOT p2) p0 p3)), (F (AND (NOT p2) (NOT p3))), (F p2), (F (AND (NOT p1) (NOT p2) p0 (NOT p3)))]
Knowledge based reduction with 9 factoid took 853 ms. Reduced automaton from 5 states, 10 edges and 4 AP (stutter sensitive) to 5 states, 10 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 424 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p2) (NOT p3))), (NOT p2), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 340 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p2) (NOT p3))), (NOT p2), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Support contains 7 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 90/90 transitions.
Applied a total of 0 rules in 1 ms. Remains 105 /105 variables (removed 0) and now considering 90/90 (removed 0) transitions.
// Phase 1: matrix 90 rows 105 cols
[2023-03-19 03:05:31] [INFO ] Computed 34 place invariants in 0 ms
[2023-03-19 03:05:32] [INFO ] Implicit Places using invariants in 69 ms returned []
[2023-03-19 03:05:32] [INFO ] Invariant cache hit.
[2023-03-19 03:05:32] [INFO ] Implicit Places using invariants and state equation in 181 ms returned []
Implicit Place search using SMT with State Equation took 251 ms to find 0 implicit places.
[2023-03-19 03:05:32] [INFO ] Invariant cache hit.
[2023-03-19 03:05:32] [INFO ] Dead Transitions using invariants and state equation in 82 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 336 ms. Remains : 105/105 places, 90/90 transitions.
Computed a total of 8 stabilizing places and 8 stable transitions
Computed a total of 8 stabilizing places and 8 stable transitions
Detected a total of 8/105 stabilizing places and 8/90 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p2) p0 p3), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) p0 (NOT p3)))), true, (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p2) p0 p3)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) p0 (NOT p3))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 672 ms. Reduced automaton from 5 states, 10 edges and 4 AP (stutter sensitive) to 5 states, 10 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 301 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p2) (NOT p3))), (NOT p2), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Incomplete random walk after 10000 steps, including 37 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 6) seen :5
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-19 03:05:33] [INFO ] Invariant cache hit.
[2023-03-19 03:05:33] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 03:05:33] [INFO ] [Nat]Absence check using 34 positive place invariants in 12 ms returned sat
[2023-03-19 03:05:33] [INFO ] After 38ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 03:05:33] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 1 ms to minimize.
[2023-03-19 03:05:33] [INFO ] Deduced a trap composed of 8 places in 128 ms of which 2 ms to minimize.
[2023-03-19 03:05:33] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 0 ms to minimize.
[2023-03-19 03:05:33] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 261 ms
[2023-03-19 03:05:33] [INFO ] After 306ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 27 ms.
[2023-03-19 03:05:33] [INFO ] After 395ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 90/90 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 105 transition count 89
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 104 transition count 89
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 102 transition count 87
Partial Free-agglomeration rule applied 21 times.
Drop transitions removed 21 transitions
Iterating global reduction 2 with 21 rules applied. Total rules applied 27 place count 102 transition count 87
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 28 place count 101 transition count 86
Applied a total of 28 rules in 6 ms. Remains 101 /105 variables (removed 4) and now considering 86/90 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 101/105 places, 86/90 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1919677 steps, run timeout after 3001 ms. (steps per millisecond=639 ) properties seen :{}
Probabilistic random walk after 1919677 steps, saw 348023 distinct states, run finished after 3002 ms. (steps per millisecond=639 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 86 rows 101 cols
[2023-03-19 03:05:36] [INFO ] Computed 34 place invariants in 3 ms
[2023-03-19 03:05:36] [INFO ] After 58ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 03:05:36] [INFO ] [Nat]Absence check using 33 positive place invariants in 9 ms returned sat
[2023-03-19 03:05:36] [INFO ] [Nat]Absence check using 33 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 03:05:37] [INFO ] After 159ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 03:05:37] [INFO ] Deduced a trap composed of 5 places in 46 ms of which 1 ms to minimize.
[2023-03-19 03:05:37] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 1 ms to minimize.
[2023-03-19 03:05:37] [INFO ] Deduced a trap composed of 6 places in 51 ms of which 0 ms to minimize.
[2023-03-19 03:05:37] [INFO ] Deduced a trap composed of 4 places in 90 ms of which 1 ms to minimize.
[2023-03-19 03:05:37] [INFO ] Deduced a trap composed of 6 places in 60 ms of which 1 ms to minimize.
[2023-03-19 03:05:37] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 368 ms
[2023-03-19 03:05:37] [INFO ] After 539ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-19 03:05:37] [INFO ] After 616ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 86/86 transitions.
Applied a total of 0 rules in 3 ms. Remains 101 /101 variables (removed 0) and now considering 86/86 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 101/101 places, 86/86 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 86/86 transitions.
Applied a total of 0 rules in 3 ms. Remains 101 /101 variables (removed 0) and now considering 86/86 (removed 0) transitions.
[2023-03-19 03:05:37] [INFO ] Invariant cache hit.
[2023-03-19 03:05:37] [INFO ] Implicit Places using invariants in 122 ms returned []
[2023-03-19 03:05:37] [INFO ] Invariant cache hit.
[2023-03-19 03:05:37] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 251 ms to find 0 implicit places.
[2023-03-19 03:05:37] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-19 03:05:37] [INFO ] Invariant cache hit.
[2023-03-19 03:05:37] [INFO ] Dead Transitions using invariants and state equation in 129 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 401 ms. Remains : 101/101 places, 86/86 transitions.
Applied a total of 0 rules in 2 ms. Remains 101 /101 variables (removed 0) and now considering 86/86 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-19 03:05:37] [INFO ] Invariant cache hit.
[2023-03-19 03:05:37] [INFO ] After 23ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 03:05:37] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2023-03-19 03:05:37] [INFO ] [Nat]Absence check using 33 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-19 03:05:38] [INFO ] After 55ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 03:05:38] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 0 ms to minimize.
[2023-03-19 03:05:38] [INFO ] Deduced a trap composed of 6 places in 39 ms of which 0 ms to minimize.
[2023-03-19 03:05:38] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 103 ms
[2023-03-19 03:05:38] [INFO ] After 166ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-19 03:05:38] [INFO ] After 215ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p1 (NOT p2) p0 p3), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) p0 (NOT p3)))), true, (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p2) p0 p3)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) p0 (NOT p3))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT (AND (NOT p2) p3))), (F (AND (NOT p1) (NOT p2) p0 p3)), (F (AND (NOT p2) (NOT p3))), (F p2), (F (AND (NOT p1) (NOT p2) p0 (NOT p3)))]
Knowledge based reduction with 9 factoid took 681 ms. Reduced automaton from 5 states, 10 edges and 4 AP (stutter sensitive) to 5 states, 10 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 324 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p2) (NOT p3))), (NOT p2), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 284 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p2) (NOT p3))), (NOT p2), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 311 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p2) (NOT p3))), (NOT p2), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Product exploration explored 100000 steps with 429 reset in 258 ms.
Product exploration explored 100000 steps with 421 reset in 223 ms.
Applying partial POR strategy [false, true, true, true, true]
Stuttering acceptance computed with spot in 212 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p2) (NOT p3))), (NOT p2), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Support contains 7 out of 105 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 105/105 places, 90/90 transitions.
Applied a total of 0 rules in 3 ms. Remains 105 /105 variables (removed 0) and now considering 90/90 (removed 0) transitions.
[2023-03-19 03:05:40] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 90 rows 105 cols
[2023-03-19 03:05:40] [INFO ] Computed 34 place invariants in 0 ms
[2023-03-19 03:05:40] [INFO ] Dead Transitions using invariants and state equation in 132 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 159 ms. Remains : 105/105 places, 90/90 transitions.
Built C files in :
/tmp/ltsmin7248569939122825675
[2023-03-19 03:05:40] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7248569939122825675
Running compilation step : cd /tmp/ltsmin7248569939122825675;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 204 ms.
Running link step : cd /tmp/ltsmin7248569939122825675;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 57 ms.
Running LTSmin : cd /tmp/ltsmin7248569939122825675;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased4827701577035387962.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 7 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 90/90 transitions.
Applied a total of 0 rules in 1 ms. Remains 105 /105 variables (removed 0) and now considering 90/90 (removed 0) transitions.
[2023-03-19 03:05:55] [INFO ] Invariant cache hit.
[2023-03-19 03:05:55] [INFO ] Implicit Places using invariants in 105 ms returned []
[2023-03-19 03:05:55] [INFO ] Invariant cache hit.
[2023-03-19 03:05:56] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 228 ms to find 0 implicit places.
[2023-03-19 03:05:56] [INFO ] Invariant cache hit.
[2023-03-19 03:05:56] [INFO ] Dead Transitions using invariants and state equation in 111 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 340 ms. Remains : 105/105 places, 90/90 transitions.
Built C files in :
/tmp/ltsmin15489988558256128825
[2023-03-19 03:05:56] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15489988558256128825
Running compilation step : cd /tmp/ltsmin15489988558256128825;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 219 ms.
Running link step : cd /tmp/ltsmin15489988558256128825;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin15489988558256128825;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased259805869688762245.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-19 03:06:11] [INFO ] Flatten gal took : 5 ms
[2023-03-19 03:06:11] [INFO ] Flatten gal took : 4 ms
[2023-03-19 03:06:11] [INFO ] Time to serialize gal into /tmp/LTL10905914411971642585.gal : 8 ms
[2023-03-19 03:06:11] [INFO ] Time to serialize properties into /tmp/LTL8934956186080745273.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10905914411971642585.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10632882351321209350.hoa' '-atoms' '/tmp/LTL8934956186080745273.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL8934956186080745273.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10632882351321209350.hoa
Detected timeout of ITS tools.
[2023-03-19 03:06:26] [INFO ] Flatten gal took : 50 ms
[2023-03-19 03:06:26] [INFO ] Flatten gal took : 7 ms
[2023-03-19 03:06:26] [INFO ] Time to serialize gal into /tmp/LTL7364812935242376136.gal : 2 ms
[2023-03-19 03:06:26] [INFO ] Time to serialize properties into /tmp/LTL6039380757984390497.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7364812935242376136.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6039380757984390497.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(G(((("((p76==0)||(p31==1))")U("((p66==0)||(p114==1))"))||(F("(p79==1)")))||((F(G("((p173==0)||(p3==1))")))&&("((p76==0)||(p31==1)...163
Formula 0 simplified : XF((!"((p76==0)||(p31==1))" R !"((p66==0)||(p114==1))") & G!"(p79==1)" & (!"((p76==0)||(p31==1))" | GF!"((p173==0)||(p3==1))"))
Detected timeout of ITS tools.
[2023-03-19 03:06:41] [INFO ] Flatten gal took : 5 ms
[2023-03-19 03:06:41] [INFO ] Applying decomposition
[2023-03-19 03:06:41] [INFO ] Flatten gal took : 21 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph4324074047724031668.txt' '-o' '/tmp/graph4324074047724031668.bin' '-w' '/tmp/graph4324074047724031668.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph4324074047724031668.bin' '-l' '-1' '-v' '-w' '/tmp/graph4324074047724031668.weights' '-q' '0' '-e' '0.001'
[2023-03-19 03:06:41] [INFO ] Decomposing Gal with order
[2023-03-19 03:06:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 03:06:41] [INFO ] Removed a total of 20 redundant transitions.
[2023-03-19 03:06:41] [INFO ] Flatten gal took : 18 ms
[2023-03-19 03:06:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 28 labels/synchronizations in 4 ms.
[2023-03-19 03:06:41] [INFO ] Time to serialize gal into /tmp/LTL3724257272107594416.gal : 6 ms
[2023-03-19 03:06:41] [INFO ] Time to serialize properties into /tmp/LTL7845222936700539392.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3724257272107594416.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7845222936700539392.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(G(((("((i3.i1.u12.p76==0)||(i1.i0.u6.p31==1))")U("((i1.i0.u11.p66==0)||(i3.i1.u21.p114==1))"))||(F("(i3.i1.u13.p79==1)")))||((F(G...244
Formula 0 simplified : XF((!"((i3.i1.u12.p76==0)||(i1.i0.u6.p31==1))" R !"((i1.i0.u11.p66==0)||(i3.i1.u21.p114==1))") & G!"(i3.i1.u13.p79==1)" & (!"((i3.i1...231
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16284149551587223278
[2023-03-19 03:06:56] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16284149551587223278
Running compilation step : cd /tmp/ltsmin16284149551587223278;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 220 ms.
Running link step : cd /tmp/ltsmin16284149551587223278;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin16284149551587223278;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([]((((LTLAPp0==true) U (LTLAPp1==true))||<>((LTLAPp2==true))||(<>([]((LTLAPp3==true)))&&(LTLAPp0==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldPPPs-PT-003B-LTLCardinality-06 finished in 108532 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0) U X(X(p1)))))'
Found a Lengthening insensitive property : ShieldPPPs-PT-003B-LTLCardinality-13
Stuttering acceptance computed with spot in 505 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Support contains 4 out of 195 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 195/195 places, 180/180 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 194 transition count 157
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 44 place count 172 transition count 157
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 44 place count 172 transition count 141
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 76 place count 156 transition count 141
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 85 place count 147 transition count 132
Iterating global reduction 2 with 9 rules applied. Total rules applied 94 place count 147 transition count 132
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 94 place count 147 transition count 129
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 100 place count 144 transition count 129
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 46
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 2 with 92 rules applied. Total rules applied 192 place count 98 transition count 83
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 194 place count 96 transition count 81
Applied a total of 194 rules in 33 ms. Remains 96 /195 variables (removed 99) and now considering 81/180 (removed 99) transitions.
// Phase 1: matrix 81 rows 96 cols
[2023-03-19 03:07:12] [INFO ] Computed 34 place invariants in 1 ms
[2023-03-19 03:07:12] [INFO ] Implicit Places using invariants in 125 ms returned []
[2023-03-19 03:07:12] [INFO ] Invariant cache hit.
[2023-03-19 03:07:12] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 255 ms to find 0 implicit places.
[2023-03-19 03:07:12] [INFO ] Invariant cache hit.
[2023-03-19 03:07:12] [INFO ] Dead Transitions using invariants and state equation in 185 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 96/195 places, 81/180 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 488 ms. Remains : 96/195 places, 81/180 transitions.
Running random walk in product with property : ShieldPPPs-PT-003B-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 4}, { cond=true, acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=5 dest: 4}, { cond=(NOT p1), acceptance={0} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(OR (EQ s6 0) (EQ s4 1)), p1:(OR (EQ s69 0) (EQ s11 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25003 reset in 123 ms.
Product exploration explored 100000 steps with 24977 reset in 190 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 p0 p1), (X p0), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 430 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 7 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 617 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Finished random walk after 302 steps, including 1 resets, run visited all 3 properties in 4 ms. (steps per millisecond=75 )
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 4 factoid took 311 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 7 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 437 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 419 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Support contains 4 out of 96 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 96/96 places, 81/81 transitions.
Applied a total of 0 rules in 0 ms. Remains 96 /96 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2023-03-19 03:07:15] [INFO ] Invariant cache hit.
[2023-03-19 03:07:15] [INFO ] Implicit Places using invariants in 82 ms returned []
[2023-03-19 03:07:15] [INFO ] Invariant cache hit.
[2023-03-19 03:07:15] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 227 ms to find 0 implicit places.
[2023-03-19 03:07:15] [INFO ] Invariant cache hit.
[2023-03-19 03:07:15] [INFO ] Dead Transitions using invariants and state equation in 92 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 347 ms. Remains : 96/96 places, 81/81 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 p0 p1), (X p0), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 245 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 7 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 540 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Finished random walk after 59 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=29 )
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 4 factoid took 444 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 7 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 579 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 481 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 549 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Product exploration explored 100000 steps with 25014 reset in 174 ms.
Product exploration explored 100000 steps with 25083 reset in 262 ms.
Applying partial POR strategy [false, false, false, true, false, false, true]
Stuttering acceptance computed with spot in 561 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Support contains 4 out of 96 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 96/96 places, 81/81 transitions.
Applied a total of 0 rules in 5 ms. Remains 96 /96 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2023-03-19 03:07:19] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-19 03:07:19] [INFO ] Invariant cache hit.
[2023-03-19 03:07:20] [INFO ] Dead Transitions using invariants and state equation in 117 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 158 ms. Remains : 96/96 places, 81/81 transitions.
Built C files in :
/tmp/ltsmin9450227537337107432
[2023-03-19 03:07:20] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9450227537337107432
Running compilation step : cd /tmp/ltsmin9450227537337107432;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 181 ms.
Running link step : cd /tmp/ltsmin9450227537337107432;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 66 ms.
Running LTSmin : cd /tmp/ltsmin9450227537337107432;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased14192226795541708113.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 96 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 96/96 places, 81/81 transitions.
Applied a total of 0 rules in 3 ms. Remains 96 /96 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2023-03-19 03:07:35] [INFO ] Invariant cache hit.
[2023-03-19 03:07:35] [INFO ] Implicit Places using invariants in 74 ms returned []
[2023-03-19 03:07:35] [INFO ] Invariant cache hit.
[2023-03-19 03:07:35] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 215 ms to find 0 implicit places.
[2023-03-19 03:07:35] [INFO ] Invariant cache hit.
[2023-03-19 03:07:35] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 289 ms. Remains : 96/96 places, 81/81 transitions.
Built C files in :
/tmp/ltsmin17395543299334566340
[2023-03-19 03:07:35] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17395543299334566340
Running compilation step : cd /tmp/ltsmin17395543299334566340;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 199 ms.
Running link step : cd /tmp/ltsmin17395543299334566340;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 25 ms.
Running LTSmin : cd /tmp/ltsmin17395543299334566340;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased12080756050447567585.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-19 03:07:50] [INFO ] Flatten gal took : 3 ms
[2023-03-19 03:07:50] [INFO ] Flatten gal took : 4 ms
[2023-03-19 03:07:50] [INFO ] Time to serialize gal into /tmp/LTL88361130297202125.gal : 1 ms
[2023-03-19 03:07:50] [INFO ] Time to serialize properties into /tmp/LTL9762446095826364117.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL88361130297202125.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14906967951264867566.hoa' '-atoms' '/tmp/LTL9762446095826364117.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...316
Loading property file /tmp/LTL9762446095826364117.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14906967951264867566.hoa
Detected timeout of ITS tools.
[2023-03-19 03:08:05] [INFO ] Flatten gal took : 5 ms
[2023-03-19 03:08:05] [INFO ] Flatten gal took : 2 ms
[2023-03-19 03:08:05] [INFO ] Time to serialize gal into /tmp/LTL13739276120979877317.gal : 1 ms
[2023-03-19 03:08:05] [INFO ] Time to serialize properties into /tmp/LTL14549754010221675544.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13739276120979877317.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14549754010221675544.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G((F("((p19==0)||(p16==1))"))U(X(X("((p153==0)||(p24==1))"))))))
Formula 0 simplified : F(G!"((p19==0)||(p16==1))" R XX!"((p153==0)||(p24==1))")
Detected timeout of ITS tools.
[2023-03-19 03:08:20] [INFO ] Flatten gal took : 7 ms
[2023-03-19 03:08:20] [INFO ] Applying decomposition
[2023-03-19 03:08:20] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph9286334403495115429.txt' '-o' '/tmp/graph9286334403495115429.bin' '-w' '/tmp/graph9286334403495115429.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph9286334403495115429.bin' '-l' '-1' '-v' '-w' '/tmp/graph9286334403495115429.weights' '-q' '0' '-e' '0.001'
[2023-03-19 03:08:20] [INFO ] Decomposing Gal with order
[2023-03-19 03:08:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 03:08:20] [INFO ] Removed a total of 20 redundant transitions.
[2023-03-19 03:08:20] [INFO ] Flatten gal took : 7 ms
[2023-03-19 03:08:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 44 labels/synchronizations in 2 ms.
[2023-03-19 03:08:20] [INFO ] Time to serialize gal into /tmp/LTL656717005988915787.gal : 15 ms
[2023-03-19 03:08:20] [INFO ] Time to serialize properties into /tmp/LTL12519643886290580702.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL656717005988915787.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12519643886290580702.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((G((F("((i0.i1.u2.p19==0)||(i0.i0.u1.p16==1))"))U(X(X("((i6.i0.u26.p153==0)||(i0.i2.u5.p24==1))"))))))
Formula 0 simplified : F(G!"((i0.i1.u2.p19==0)||(i0.i0.u1.p16==1))" R XX!"((i6.i0.u26.p153==0)||(i0.i2.u5.p24==1))")
Reverse transition relation is NOT exact ! Due to transitions t2_t118, t13_t96, t14_t93, t15_t90, t27_t64, t1_t121, t166_t6, t28_t61_t127_t60, t140_t29, i0...804
Computing Next relation with stutter on 7758 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14664612301894109669
[2023-03-19 03:08:35] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14664612301894109669
Running compilation step : cd /tmp/ltsmin14664612301894109669;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 193 ms.
Running link step : cd /tmp/ltsmin14664612301894109669;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 55 ms.
Running LTSmin : cd /tmp/ltsmin14664612301894109669;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((<>((LTLAPp0==true)) U X(X((LTLAPp1==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldPPPs-PT-003B-LTLCardinality-13 finished in 99145 ms.
[2023-03-19 03:08:50] [INFO ] Flatten gal took : 6 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin6079158095712525589
[2023-03-19 03:08:51] [INFO ] Computing symmetric may disable matrix : 180 transitions.
[2023-03-19 03:08:51] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 03:08:51] [INFO ] Computing symmetric may enable matrix : 180 transitions.
[2023-03-19 03:08:51] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 03:08:51] [INFO ] Computing Do-Not-Accords matrix : 180 transitions.
[2023-03-19 03:08:51] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 03:08:51] [INFO ] Applying decomposition
[2023-03-19 03:08:51] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6079158095712525589
Running compilation step : cd /tmp/ltsmin6079158095712525589;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2023-03-19 03:08:51] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph3982996334617813915.txt' '-o' '/tmp/graph3982996334617813915.bin' '-w' '/tmp/graph3982996334617813915.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph3982996334617813915.bin' '-l' '-1' '-v' '-w' '/tmp/graph3982996334617813915.weights' '-q' '0' '-e' '0.001'
[2023-03-19 03:08:51] [INFO ] Decomposing Gal with order
[2023-03-19 03:08:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 03:08:51] [INFO ] Removed a total of 27 redundant transitions.
[2023-03-19 03:08:51] [INFO ] Flatten gal took : 14 ms
[2023-03-19 03:08:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2023-03-19 03:08:51] [INFO ] Time to serialize gal into /tmp/LTLCardinality12607912305925736732.gal : 3 ms
[2023-03-19 03:08:51] [INFO ] Time to serialize properties into /tmp/LTLCardinality3899483534285731928.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality12607912305925736732.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality3899483534285731928.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 2 LTL properties
Checking formula 0 : !((X(G(((("((i4.i0.u26.p76==0)||(i2.i0.u12.p31==1))")U("((i2.i1.u23.p66==0)||(i7.i1.u38.p114==1))"))||(F("(i4.i1.u27.p79==1)")))||(("(...249
Formula 0 simplified : XF((!"((i4.i0.u26.p76==0)||(i2.i0.u12.p31==1))" R !"((i2.i1.u23.p66==0)||(i7.i1.u38.p114==1))") & G!"(i4.i1.u27.p79==1)" & (!"((i4.i...236
Compilation finished in 388 ms.
Running link step : cd /tmp/ltsmin6079158095712525589;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 68 ms.
Running LTSmin : cd /tmp/ltsmin6079158095712525589;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([]((((LTLAPp0==true) U (LTLAPp1==true))||<>((LTLAPp2==true))||((LTLAPp0==true)&&<>([]((LTLAPp3==true)))))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t59, t62, t88, t91, t94, t116, t119, t122, i0.i0.u1.t126, i0.i2.u5.t125, i1.i0.u6.t124, i1.i1...1076
Computing Next relation with stutter on 7758 deadlock states
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.016: Loading model from ./gal.so
pins2lts-mc-linux64( 5/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.016: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.017: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.005: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.005: LTL layer: formula: X([]((((LTLAPp0==true) U (LTLAPp1==true))||<>((LTLAPp2==true))||((LTLAPp0==true)&&<>([]((LTLAPp3==true)))))))
pins2lts-mc-linux64( 3/ 8), 0.005: "X([]((((LTLAPp0==true) U (LTLAPp1==true))||<>((LTLAPp2==true))||((LTLAPp0==true)&&<>([]((LTLAPp3==true)))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 3/ 8), 0.005: Using Spin LTL semantics
pins2lts-mc-linux64( 5/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.008: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.025: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.016: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.027: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.027: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.031: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.074: There are 187 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.074: State length is 196, there are 195 groups
pins2lts-mc-linux64( 0/ 8), 0.074: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.074: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.074: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.074: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 5/ 8), 0.124: [Blue] ~120 levels ~960 states ~5432 transitions
pins2lts-mc-linux64( 7/ 8), 0.182: [Blue] ~240 levels ~1920 states ~12992 transitions
pins2lts-mc-linux64( 1/ 8), 0.244: [Blue] ~400 levels ~3840 states ~22208 transitions
pins2lts-mc-linux64( 1/ 8), 0.272: [Blue] ~424 levels ~7680 states ~34504 transitions
pins2lts-mc-linux64( 1/ 8), 0.341: [Blue] ~453 levels ~15360 states ~62952 transitions
pins2lts-mc-linux64( 5/ 8), 0.464: [Blue] ~488 levels ~30720 states ~126816 transitions
pins2lts-mc-linux64( 5/ 8), 0.668: [Blue] ~488 levels ~61440 states ~257480 transitions
pins2lts-mc-linux64( 5/ 8), 1.081: [Blue] ~488 levels ~122880 states ~528824 transitions
pins2lts-mc-linux64( 7/ 8), 1.913: [Blue] ~596 levels ~245760 states ~1095576 transitions
pins2lts-mc-linux64( 7/ 8), 3.156: [Blue] ~596 levels ~491520 states ~2379568 transitions
pins2lts-mc-linux64( 7/ 8), 5.107: [Blue] ~991 levels ~983040 states ~4812096 transitions
pins2lts-mc-linux64( 7/ 8), 8.550: [Blue] ~991 levels ~1966080 states ~10562744 transitions
pins2lts-mc-linux64( 4/ 8), 15.264: [Blue] ~1766 levels ~3932160 states ~15523088 transitions
pins2lts-mc-linux64( 4/ 8), 29.045: [Blue] ~1766 levels ~7864320 states ~33252368 transitions
pins2lts-mc-linux64( 4/ 8), 56.529: [Blue] ~1771 levels ~15728640 states ~66874488 transitions
pins2lts-mc-linux64( 4/ 8), 112.356: [Blue] ~1771 levels ~31457280 states ~140337128 transitions
pins2lts-mc-linux64( 4/ 8), 226.575: [Blue] ~1771 levels ~62914560 states ~298714584 transitions
pins2lts-mc-linux64( 4/ 8), 462.437: [Blue] ~1771 levels ~125829120 states ~626113896 transitions
pins2lts-mc-linux64( 4/ 8), 578.719: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 578.756:
pins2lts-mc-linux64( 0/ 8), 578.756: Explored 135266235 states 1038897949 transitions, fanout: 7.680
pins2lts-mc-linux64( 0/ 8), 578.756: Total exploration time 578.650 sec (578.610 sec minimum, 578.626 sec on average)
pins2lts-mc-linux64( 0/ 8), 578.756: States per second: 233762, Transitions per second: 1795382
pins2lts-mc-linux64( 0/ 8), 578.756:
pins2lts-mc-linux64( 0/ 8), 578.756: State space has 134217246 states, 4425202 are accepting
pins2lts-mc-linux64( 0/ 8), 578.756: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 578.756: blue states: 135266235 (100.78%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 578.756: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 578.756: all-red states: 20576936 (15.33%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 578.756:
pins2lts-mc-linux64( 0/ 8), 578.756: Total memory used for local state coloring: 0.4MB
pins2lts-mc-linux64( 0/ 8), 578.756:
pins2lts-mc-linux64( 0/ 8), 578.756: Queue width: 8B, total height: 23082, memory: 0.18MB
pins2lts-mc-linux64( 0/ 8), 578.756: Tree memory: 1065.5MB, 8.3 B/state, compr.: 1.1%
pins2lts-mc-linux64( 0/ 8), 578.756: Tree fill ratio (roots/leafs): 99.0%/16.0%
pins2lts-mc-linux64( 0/ 8), 578.756: Stored 194 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 578.756: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 578.756: Est. total memory use: 1065.6MB (~1024.2MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin6079158095712525589;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([]((((LTLAPp0==true) U (LTLAPp1==true))||<>((LTLAPp2==true))||((LTLAPp0==true)&&<>([]((LTLAPp3==true)))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin6079158095712525589;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([]((((LTLAPp0==true) U (LTLAPp1==true))||<>((LTLAPp2==true))||((LTLAPp0==true)&&<>([]((LTLAPp3==true)))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Detected timeout of ITS tools.
[2023-03-19 03:31:16] [INFO ] Applying decomposition
[2023-03-19 03:31:16] [INFO ] Flatten gal took : 7 ms
[2023-03-19 03:31:16] [INFO ] Decomposing Gal with order
[2023-03-19 03:31:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 03:31:16] [INFO ] Removed a total of 18 redundant transitions.
[2023-03-19 03:31:16] [INFO ] Flatten gal took : 9 ms
[2023-03-19 03:31:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 36 labels/synchronizations in 3 ms.
[2023-03-19 03:31:16] [INFO ] Time to serialize gal into /tmp/LTLCardinality8901867267245830738.gal : 3 ms
[2023-03-19 03:31:16] [INFO ] Time to serialize properties into /tmp/LTLCardinality4915862165907384103.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality8901867267245830738.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality4915862165907384103.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 2 LTL properties
Checking formula 0 : !((X(G(((("((i0.i1.i0.i0.u98.p76==0)||(i0.i0.i1.i0.i0.i0.i0.i1.u87.p31==1))")U("((i0.i0.i1.u24.p66==0)||(i0.i1.i0.i0.i0.u42.p114==1))"...333
Formula 0 simplified : XF((!"((i0.i1.i0.i0.u98.p76==0)||(i0.i0.i1.i0.i0.i0.i0.i1.u87.p31==1))" R !"((i0.i0.i1.u24.p66==0)||(i0.i1.i0.i0.i0.u42.p114==1))") ...320
Detected timeout of ITS tools.
[2023-03-19 03:53:44] [INFO ] Flatten gal took : 280 ms
[2023-03-19 03:53:44] [INFO ] Input system was already deterministic with 180 transitions.
[2023-03-19 03:53:44] [INFO ] Transformed 195 places.
[2023-03-19 03:53:44] [INFO ] Transformed 180 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/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//../itstools/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
[2023-03-19 03:53:45] [INFO ] Time to serialize gal into /tmp/LTLCardinality5429429490071773191.gal : 29 ms
[2023-03-19 03:53:45] [INFO ] Time to serialize properties into /tmp/LTLCardinality4208943512367964927.ltl : 28 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality5429429490071773191.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality4208943512367964927.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...342
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X(G(((("((p76==0)||(p31==1))")U("((p66==0)||(p114==1))"))||(F("(p79==1)")))||(("((p76==0)||(p31==1))")&&(F(G("((p173==0)||(p3==1))"...163
Formula 0 simplified : XF((!"((p76==0)||(p31==1))" R !"((p66==0)||(p114==1))") & G!"(p79==1)" & (!"((p76==0)||(p31==1))" | GF!"((p173==0)||(p3==1))"))
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 10992536 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16110652 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="ShieldPPPs-PT-003B"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is ShieldPPPs-PT-003B, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r389-oct2-167903713500395"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPs-PT-003B.tgz
mv ShieldPPPs-PT-003B execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;