fond

jQuery Multi Level CSS Menu Css3Menu.com

Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r261-smll-167863536300388
Last Updated
May 14, 2023

About the Execution of ITS-Tools for ParamProductionCell-PT-3

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
895.084 76276.00 137403.00 864.30 FFFFFTFFTTFTTFFT normal

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.r261-smll-167863536300388.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 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 ParamProductionCell-PT-3, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r261-smll-167863536300388
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 616K
-rw-r--r-- 1 mcc users 8.0K Feb 26 17:15 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Feb 26 17:15 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Feb 26 17:15 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 26 17:15 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.8K Feb 25 16:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Feb 25 16:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Feb 25 16:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.9K Feb 26 17:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 26 17:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 26 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K Feb 26 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 16:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 2 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 174K 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 ParamProductionCell-PT-3-LTLFireability-00
FORMULA_NAME ParamProductionCell-PT-3-LTLFireability-01
FORMULA_NAME ParamProductionCell-PT-3-LTLFireability-02
FORMULA_NAME ParamProductionCell-PT-3-LTLFireability-03
FORMULA_NAME ParamProductionCell-PT-3-LTLFireability-04
FORMULA_NAME ParamProductionCell-PT-3-LTLFireability-05
FORMULA_NAME ParamProductionCell-PT-3-LTLFireability-06
FORMULA_NAME ParamProductionCell-PT-3-LTLFireability-07
FORMULA_NAME ParamProductionCell-PT-3-LTLFireability-08
FORMULA_NAME ParamProductionCell-PT-3-LTLFireability-09
FORMULA_NAME ParamProductionCell-PT-3-LTLFireability-10
FORMULA_NAME ParamProductionCell-PT-3-LTLFireability-11
FORMULA_NAME ParamProductionCell-PT-3-LTLFireability-12
FORMULA_NAME ParamProductionCell-PT-3-LTLFireability-13
FORMULA_NAME ParamProductionCell-PT-3-LTLFireability-14
FORMULA_NAME ParamProductionCell-PT-3-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678919415334

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=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ParamProductionCell-PT-3
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-15 22:30:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-15 22:30:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 22:30:19] [INFO ] Load time of PNML (sax parser for PT used): 237 ms
[2023-03-15 22:30:19] [INFO ] Transformed 231 places.
[2023-03-15 22:30:19] [INFO ] Transformed 202 transitions.
[2023-03-15 22:30:19] [INFO ] Found NUPN structural information;
[2023-03-15 22:30:19] [INFO ] Parsed PT model containing 231 places and 202 transitions and 846 arcs in 413 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 19 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ParamProductionCell-PT-3-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-3-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-3-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 56 out of 231 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 231/231 places, 202/202 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 227 transition count 198
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 227 transition count 198
Applied a total of 8 rules in 78 ms. Remains 227 /231 variables (removed 4) and now considering 198/202 (removed 4) transitions.
// Phase 1: matrix 198 rows 227 cols
[2023-03-15 22:30:20] [INFO ] Computed 59 place invariants in 28 ms
[2023-03-15 22:30:20] [INFO ] Implicit Places using invariants in 759 ms returned [15, 16, 24, 35, 36, 42, 59, 64, 65, 73, 79, 99, 114, 119, 120, 161, 162, 164, 166, 167, 192, 193, 197, 202, 203]
Discarding 25 places :
Implicit Place search using SMT only with invariants took 820 ms to find 25 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 202/231 places, 198/202 transitions.
Applied a total of 0 rules in 21 ms. Remains 202 /202 variables (removed 0) and now considering 198/198 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 920 ms. Remains : 202/231 places, 198/202 transitions.
Support contains 56 out of 202 places after structural reductions.
[2023-03-15 22:30:21] [INFO ] Flatten gal took : 96 ms
[2023-03-15 22:30:21] [INFO ] Flatten gal took : 45 ms
[2023-03-15 22:30:21] [INFO ] Input system was already deterministic with 198 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 708 ms. (steps per millisecond=14 ) properties (out of 29) seen :27
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 198 rows 202 cols
[2023-03-15 22:30:22] [INFO ] Computed 34 place invariants in 7 ms
[2023-03-15 22:30:22] [INFO ] After 160ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 22:30:22] [INFO ] [Nat]Absence check using 18 positive place invariants in 23 ms returned sat
[2023-03-15 22:30:22] [INFO ] [Nat]Absence check using 18 positive and 16 generalized place invariants in 10 ms returned sat
[2023-03-15 22:30:22] [INFO ] After 133ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
FORMULA ParamProductionCell-PT-3-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 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(p0))))'
Support contains 2 out of 202 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 202/202 places, 198/198 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 201 transition count 197
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 201 transition count 197
Applied a total of 2 rules in 46 ms. Remains 201 /202 variables (removed 1) and now considering 197/198 (removed 1) transitions.
// Phase 1: matrix 197 rows 201 cols
[2023-03-15 22:30:23] [INFO ] Computed 34 place invariants in 6 ms
[2023-03-15 22:30:23] [INFO ] Implicit Places using invariants in 651 ms returned [16, 17, 28, 36, 40, 41, 68, 89, 102, 104, 173, 181, 192]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 653 ms to find 13 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 188/202 places, 197/198 transitions.
Applied a total of 0 rules in 10 ms. Remains 188 /188 variables (removed 0) and now considering 197/197 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 709 ms. Remains : 188/202 places, 197/198 transitions.
Stuttering acceptance computed with spot in 577 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-3-LTLFireability-00 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: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (EQ s80 1) (EQ s86 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 3 ms.
FORMULA ParamProductionCell-PT-3-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-3-LTLFireability-00 finished in 1421 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(X(X((G(F(p0))&&F(p1))))))'
Support contains 4 out of 202 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 202/202 places, 198/198 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 200 transition count 196
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 200 transition count 196
Applied a total of 4 rules in 25 ms. Remains 200 /202 variables (removed 2) and now considering 196/198 (removed 2) transitions.
// Phase 1: matrix 196 rows 200 cols
[2023-03-15 22:30:24] [INFO ] Computed 34 place invariants in 5 ms
[2023-03-15 22:30:24] [INFO ] Implicit Places using invariants in 348 ms returned [16, 17, 28, 40, 41, 68, 87, 89, 101, 103, 172, 180, 191]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 350 ms to find 13 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 187/202 places, 196/198 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 185 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 185 transition count 194
Applied a total of 4 rules in 14 ms. Remains 185 /187 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 185 cols
[2023-03-15 22:30:24] [INFO ] Computed 21 place invariants in 3 ms
[2023-03-15 22:30:25] [INFO ] Implicit Places using invariants in 233 ms returned []
[2023-03-15 22:30:25] [INFO ] Invariant cache hit.
[2023-03-15 22:30:25] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-15 22:30:25] [INFO ] Implicit Places using invariants and state equation in 564 ms returned []
Implicit Place search using SMT with State Equation took 799 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 185/202 places, 194/198 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1189 ms. Remains : 185/202 places, 194/198 transitions.
Stuttering acceptance computed with spot in 330 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p1)]
Running random walk in product with property : ParamProductionCell-PT-3-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 4}, { cond=true, acceptance={} source=3 dest: 5}, { cond=(NOT p1), acceptance={} source=3 dest: 6}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(AND (OR (EQ s85 0) (EQ s122 0)) (OR (EQ s33 0) (EQ s46 0))), p1:(AND (EQ s85 1) (EQ s122 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 56 reset in 385 ms.
Stack based approach found an accepted trace after 500 steps with 3 reset with depth 469 and stack size 469 in 3 ms.
FORMULA ParamProductionCell-PT-3-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property ParamProductionCell-PT-3-LTLFireability-01 finished in 1953 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&&(p1||(!p2 U p3))))))'
Support contains 7 out of 202 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 202/202 places, 198/198 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 202 transition count 178
Reduce places removed 20 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 22 rules applied. Total rules applied 42 place count 182 transition count 176
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 44 place count 180 transition count 176
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 16 Pre rules applied. Total rules applied 44 place count 180 transition count 160
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 76 place count 164 transition count 160
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 78 place count 162 transition count 158
Iterating global reduction 3 with 2 rules applied. Total rules applied 80 place count 162 transition count 158
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 81 place count 162 transition count 157
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 82 place count 161 transition count 157
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 1 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 5 with 64 rules applied. Total rules applied 146 place count 129 transition count 125
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 148 place count 128 transition count 124
Applied a total of 148 rules in 71 ms. Remains 128 /202 variables (removed 74) and now considering 124/198 (removed 74) transitions.
// Phase 1: matrix 124 rows 128 cols
[2023-03-15 22:30:26] [INFO ] Computed 34 place invariants in 2 ms
[2023-03-15 22:30:26] [INFO ] Implicit Places using invariants in 414 ms returned [10, 11, 19, 25, 29, 30, 48, 59, 60, 70, 111, 121]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 416 ms to find 12 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 116/202 places, 124/198 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 116 transition count 121
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 113 transition count 121
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 6 place count 113 transition count 117
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 14 place count 109 transition count 117
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 16 place count 107 transition count 115
Iterating global reduction 2 with 2 rules applied. Total rules applied 18 place count 107 transition count 115
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 46 place count 93 transition count 101
Applied a total of 46 rules in 25 ms. Remains 93 /116 variables (removed 23) and now considering 101/124 (removed 23) transitions.
// Phase 1: matrix 101 rows 93 cols
[2023-03-15 22:30:26] [INFO ] Computed 22 place invariants in 1 ms
[2023-03-15 22:30:27] [INFO ] Implicit Places using invariants in 193 ms returned []
[2023-03-15 22:30:27] [INFO ] Invariant cache hit.
[2023-03-15 22:30:27] [INFO ] State equation strengthened by 67 read => feed constraints.
[2023-03-15 22:30:27] [INFO ] Implicit Places using invariants and state equation in 281 ms returned []
Implicit Place search using SMT with State Equation took 476 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 93/202 places, 101/198 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 991 ms. Remains : 93/202 places, 101/198 transitions.
Stuttering acceptance computed with spot in 135 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3)))]
Running random walk in product with property : ParamProductionCell-PT-3-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(OR (AND p3 p0) (AND p1 p0) (AND p0 (NOT p2))), acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p3) (NOT p1) p2) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p1) p0 (NOT p2)), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p3) p1 p0 p2), acceptance={} source=1 dest: 0}, { cond=(OR (AND (NOT p3) (NOT p1) p2) (AND (NOT p3) (NOT p0) p2)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p3) p1 p0 (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(OR (AND (NOT p3) (NOT p1) (NOT p2)) (AND (NOT p3) (NOT p0) (NOT p2))), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p3:(AND (EQ s47 1) (EQ s55 1) (EQ s59 1)), p0:(OR (EQ s44 0) (EQ s48 0)), p1:(AND (EQ s44 1) (EQ s48 1)), p2:(AND (EQ s83 1) (EQ s86 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1426 reset in 462 ms.
Stack based approach found an accepted trace after 8831 steps with 122 reset with depth 114 and stack size 114 in 49 ms.
FORMULA ParamProductionCell-PT-3-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property ParamProductionCell-PT-3-LTLFireability-02 finished in 1668 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||X(X((p1||G(p2))))))))'
Support contains 6 out of 202 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 202/202 places, 198/198 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 200 transition count 196
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 200 transition count 196
Applied a total of 4 rules in 13 ms. Remains 200 /202 variables (removed 2) and now considering 196/198 (removed 2) transitions.
// Phase 1: matrix 196 rows 200 cols
[2023-03-15 22:30:28] [INFO ] Computed 34 place invariants in 4 ms
[2023-03-15 22:30:28] [INFO ] Implicit Places using invariants in 565 ms returned [16, 17, 28, 36, 41, 68, 87, 89, 101, 103, 172, 180, 191]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 569 ms to find 13 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 187/202 places, 196/198 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 185 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 185 transition count 194
Applied a total of 4 rules in 6 ms. Remains 185 /187 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 185 cols
[2023-03-15 22:30:28] [INFO ] Computed 21 place invariants in 2 ms
[2023-03-15 22:30:28] [INFO ] Implicit Places using invariants in 183 ms returned []
[2023-03-15 22:30:28] [INFO ] Invariant cache hit.
[2023-03-15 22:30:28] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-15 22:30:29] [INFO ] Implicit Places using invariants and state equation in 327 ms returned []
Implicit Place search using SMT with State Equation took 516 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 185/202 places, 194/198 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1104 ms. Remains : 185/202 places, 194/198 transitions.
Stuttering acceptance computed with spot in 422 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), true, (NOT p2)]
Running random walk in product with property : ParamProductionCell-PT-3-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 4}, { cond=p2, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(AND (EQ s36 1) (EQ s44 1)), p1:(AND (EQ s132 1) (EQ s155 1)), p2:(OR (EQ s6 0) (EQ s115 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 20 steps with 0 reset in 1 ms.
FORMULA ParamProductionCell-PT-3-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-3-LTLFireability-04 finished in 1552 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(X(F(p0))))'
Support contains 3 out of 202 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 202/202 places, 198/198 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 200 transition count 196
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 200 transition count 196
Applied a total of 4 rules in 7 ms. Remains 200 /202 variables (removed 2) and now considering 196/198 (removed 2) transitions.
// Phase 1: matrix 196 rows 200 cols
[2023-03-15 22:30:29] [INFO ] Computed 34 place invariants in 3 ms
[2023-03-15 22:30:29] [INFO ] Implicit Places using invariants in 334 ms returned [16, 28, 36, 40, 41, 68, 87, 89, 101, 103, 172, 180, 191]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 336 ms to find 13 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 187/202 places, 196/198 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 185 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 185 transition count 194
Applied a total of 4 rules in 7 ms. Remains 185 /187 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 185 cols
[2023-03-15 22:30:29] [INFO ] Computed 21 place invariants in 2 ms
[2023-03-15 22:30:30] [INFO ] Implicit Places using invariants in 212 ms returned []
[2023-03-15 22:30:30] [INFO ] Invariant cache hit.
[2023-03-15 22:30:30] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-15 22:30:30] [INFO ] Implicit Places using invariants and state equation in 557 ms returned []
Implicit Place search using SMT with State Equation took 771 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 185/202 places, 194/198 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1124 ms. Remains : 185/202 places, 194/198 transitions.
Stuttering acceptance computed with spot in 160 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-3-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (EQ s16 0) (EQ s17 0) (EQ s23 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 419 ms.
Product exploration explored 100000 steps with 33333 reset in 534 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 : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 2 factoid took 60 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ParamProductionCell-PT-3-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ParamProductionCell-PT-3-LTLFireability-05 finished in 2322 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 202 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 202/202 places, 198/198 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 202 transition count 174
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 48 place count 178 transition count 174
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 48 place count 178 transition count 160
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 76 place count 164 transition count 160
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 78 place count 162 transition count 158
Iterating global reduction 2 with 2 rules applied. Total rules applied 80 place count 162 transition count 158
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 81 place count 162 transition count 157
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 82 place count 161 transition count 157
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 4 with 62 rules applied. Total rules applied 144 place count 130 transition count 126
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 146 place count 129 transition count 125
Applied a total of 146 rules in 31 ms. Remains 129 /202 variables (removed 73) and now considering 125/198 (removed 73) transitions.
// Phase 1: matrix 125 rows 129 cols
[2023-03-15 22:30:31] [INFO ] Computed 34 place invariants in 1 ms
[2023-03-15 22:30:32] [INFO ] Implicit Places using invariants in 174 ms returned [10, 11, 19, 25, 29, 30, 48, 59, 60, 70, 72, 112, 115, 122]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 178 ms to find 14 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 115/202 places, 125/198 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 115 transition count 122
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 112 transition count 122
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 6 place count 112 transition count 118
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 14 place count 108 transition count 118
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 16 place count 106 transition count 116
Iterating global reduction 2 with 2 rules applied. Total rules applied 18 place count 106 transition count 116
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 60 place count 85 transition count 95
Applied a total of 60 rules in 12 ms. Remains 85 /115 variables (removed 30) and now considering 95/125 (removed 30) transitions.
// Phase 1: matrix 95 rows 85 cols
[2023-03-15 22:30:32] [INFO ] Computed 20 place invariants in 3 ms
[2023-03-15 22:30:32] [INFO ] Implicit Places using invariants in 103 ms returned []
[2023-03-15 22:30:32] [INFO ] Invariant cache hit.
[2023-03-15 22:30:32] [INFO ] State equation strengthened by 67 read => feed constraints.
[2023-03-15 22:30:32] [INFO ] Implicit Places using invariants and state equation in 223 ms returned []
Implicit Place search using SMT with State Equation took 328 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 85/202 places, 95/198 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 550 ms. Remains : 85/202 places, 95/198 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-3-LTLFireability-06 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 s38 1) (EQ s66 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 177 ms.
Stack based approach found an accepted trace after 152 steps with 0 reset with depth 153 and stack size 153 in 0 ms.
FORMULA ParamProductionCell-PT-3-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property ParamProductionCell-PT-3-LTLFireability-06 finished in 784 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(p0) U (G(X(p1)) U p2)))'
Support contains 7 out of 202 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 202/202 places, 198/198 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 200 transition count 196
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 200 transition count 196
Applied a total of 4 rules in 12 ms. Remains 200 /202 variables (removed 2) and now considering 196/198 (removed 2) transitions.
// Phase 1: matrix 196 rows 200 cols
[2023-03-15 22:30:32] [INFO ] Computed 34 place invariants in 2 ms
[2023-03-15 22:30:32] [INFO ] Implicit Places using invariants in 233 ms returned [16, 17, 28, 36, 40, 41, 68, 87, 89, 103, 180, 191]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 234 ms to find 12 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 188/202 places, 196/198 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 186 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 186 transition count 194
Applied a total of 4 rules in 5 ms. Remains 186 /188 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 186 cols
[2023-03-15 22:30:32] [INFO ] Computed 22 place invariants in 5 ms
[2023-03-15 22:30:33] [INFO ] Implicit Places using invariants in 186 ms returned []
[2023-03-15 22:30:33] [INFO ] Invariant cache hit.
[2023-03-15 22:30:33] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-15 22:30:33] [INFO ] Implicit Places using invariants and state equation in 508 ms returned []
Implicit Place search using SMT with State Equation took 696 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 186/202 places, 194/198 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 947 ms. Remains : 186/202 places, 194/198 transitions.
Stuttering acceptance computed with spot in 361 ms :[(NOT p2), (OR (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), true, (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ParamProductionCell-PT-3-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 3}, { cond=(AND p2 p1), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND p2 (NOT p0) p1), acceptance={} source=2 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 5}, { cond=(AND p2 p0 p1), acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 3}, { cond=p0, acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=6 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=6 dest: 5}, { cond=(AND p0 p1), acceptance={} source=6 dest: 6}]], initial=0, aps=[p2:(AND (EQ s159 1) (EQ s160 1) (EQ s169 1)), p0:(OR (AND (EQ s108 1) (EQ s112 1)) (AND (EQ s159 1) (EQ s160 1) (EQ s169 1))), p1:(AND (EQ s91 1) (EQ s110...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ParamProductionCell-PT-3-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-3-LTLFireability-07 finished in 1336 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(((G(p1)||X(X(G(p2)))) U p0)))))'
Support contains 2 out of 202 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 202/202 places, 198/198 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 202 transition count 174
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 48 place count 178 transition count 174
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 48 place count 178 transition count 161
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 74 place count 165 transition count 161
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 76 place count 163 transition count 159
Iterating global reduction 2 with 2 rules applied. Total rules applied 78 place count 163 transition count 159
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 79 place count 163 transition count 158
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 80 place count 162 transition count 158
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 4 with 48 rules applied. Total rules applied 128 place count 138 transition count 134
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 130 place count 137 transition count 133
Applied a total of 130 rules in 39 ms. Remains 137 /202 variables (removed 65) and now considering 133/198 (removed 65) transitions.
// Phase 1: matrix 133 rows 137 cols
[2023-03-15 22:30:34] [INFO ] Computed 34 place invariants in 1 ms
[2023-03-15 22:30:34] [INFO ] Implicit Places using invariants in 260 ms returned [11, 12, 20, 26, 30, 31, 49, 60, 72, 74, 120, 123, 130]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 265 ms to find 13 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 124/202 places, 133/198 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 124 transition count 131
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 5 place count 122 transition count 130
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 121 transition count 130
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 6 place count 121 transition count 128
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 10 place count 119 transition count 128
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 48 place count 100 transition count 109
Applied a total of 48 rules in 22 ms. Remains 100 /124 variables (removed 24) and now considering 109/133 (removed 24) transitions.
// Phase 1: matrix 109 rows 100 cols
[2023-03-15 22:30:34] [INFO ] Computed 21 place invariants in 1 ms
[2023-03-15 22:30:34] [INFO ] Implicit Places using invariants in 129 ms returned []
[2023-03-15 22:30:34] [INFO ] Invariant cache hit.
[2023-03-15 22:30:34] [INFO ] State equation strengthened by 67 read => feed constraints.
[2023-03-15 22:30:34] [INFO ] Implicit Places using invariants and state equation in 342 ms returned []
Implicit Place search using SMT with State Equation took 473 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 100/202 places, 109/198 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 801 ms. Remains : 100/202 places, 109/198 transitions.
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-3-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s11 1) (EQ s15 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 1321 reset in 213 ms.
Product exploration explored 100000 steps with 1323 reset in 247 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), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 159 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 51 ms :[(NOT p0)]
Finished random walk after 72 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=36 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 190 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 51 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
[2023-03-15 22:30:35] [INFO ] Invariant cache hit.
[2023-03-15 22:30:36] [INFO ] [Real]Absence check using 18 positive place invariants in 12 ms returned sat
[2023-03-15 22:30:36] [INFO ] [Real]Absence check using 18 positive and 3 generalized place invariants in 4 ms returned sat
[2023-03-15 22:30:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 22:30:36] [INFO ] [Real]Absence check using state equation in 119 ms returned sat
[2023-03-15 22:30:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 22:30:36] [INFO ] [Nat]Absence check using 18 positive place invariants in 12 ms returned sat
[2023-03-15 22:30:36] [INFO ] [Nat]Absence check using 18 positive and 3 generalized place invariants in 4 ms returned sat
[2023-03-15 22:30:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 22:30:36] [INFO ] [Nat]Absence check using state equation in 126 ms returned sat
[2023-03-15 22:30:36] [INFO ] State equation strengthened by 67 read => feed constraints.
[2023-03-15 22:30:36] [INFO ] [Nat]Added 67 Read/Feed constraints in 27 ms returned sat
[2023-03-15 22:30:36] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 5 ms to minimize.
[2023-03-15 22:30:36] [INFO ] Deduced a trap composed of 3 places in 117 ms of which 2 ms to minimize.
[2023-03-15 22:30:36] [INFO ] Deduced a trap composed of 4 places in 148 ms of which 3 ms to minimize.
[2023-03-15 22:30:37] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 2 ms to minimize.
[2023-03-15 22:30:37] [INFO ] Deduced a trap composed of 3 places in 70 ms of which 2 ms to minimize.
[2023-03-15 22:30:37] [INFO ] Deduced a trap composed of 6 places in 69 ms of which 0 ms to minimize.
[2023-03-15 22:30:37] [INFO ] Deduced a trap composed of 4 places in 86 ms of which 1 ms to minimize.
[2023-03-15 22:30:37] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 1 ms to minimize.
[2023-03-15 22:30:37] [INFO ] Deduced a trap composed of 43 places in 53 ms of which 1 ms to minimize.
[2023-03-15 22:30:37] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
[2023-03-15 22:30:37] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 989 ms
[2023-03-15 22:30:37] [INFO ] Computed and/alt/rep : 100/241/100 causal constraints (skipped 7 transitions) in 12 ms.
[2023-03-15 22:30:37] [INFO ] Added : 84 causal constraints over 17 iterations in 334 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 100 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 100/100 places, 109/109 transitions.
Applied a total of 0 rules in 11 ms. Remains 100 /100 variables (removed 0) and now considering 109/109 (removed 0) transitions.
[2023-03-15 22:30:37] [INFO ] Invariant cache hit.
[2023-03-15 22:30:38] [INFO ] Implicit Places using invariants in 231 ms returned []
[2023-03-15 22:30:38] [INFO ] Invariant cache hit.
[2023-03-15 22:30:38] [INFO ] State equation strengthened by 67 read => feed constraints.
[2023-03-15 22:30:38] [INFO ] Implicit Places using invariants and state equation in 383 ms returned []
Implicit Place search using SMT with State Equation took 623 ms to find 0 implicit places.
[2023-03-15 22:30:38] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-15 22:30:38] [INFO ] Invariant cache hit.
[2023-03-15 22:30:38] [INFO ] Dead Transitions using invariants and state equation in 166 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 823 ms. Remains : 100/100 places, 109/109 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), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 165 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 52 ms :[(NOT p0)]
Finished random walk after 67 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=33 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 190 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 50 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
[2023-03-15 22:30:39] [INFO ] Invariant cache hit.
[2023-03-15 22:30:39] [INFO ] [Real]Absence check using 18 positive place invariants in 12 ms returned sat
[2023-03-15 22:30:39] [INFO ] [Real]Absence check using 18 positive and 3 generalized place invariants in 4 ms returned sat
[2023-03-15 22:30:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 22:30:39] [INFO ] [Real]Absence check using state equation in 119 ms returned sat
[2023-03-15 22:30:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 22:30:39] [INFO ] [Nat]Absence check using 18 positive place invariants in 13 ms returned sat
[2023-03-15 22:30:39] [INFO ] [Nat]Absence check using 18 positive and 3 generalized place invariants in 4 ms returned sat
[2023-03-15 22:30:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 22:30:39] [INFO ] [Nat]Absence check using state equation in 129 ms returned sat
[2023-03-15 22:30:39] [INFO ] State equation strengthened by 67 read => feed constraints.
[2023-03-15 22:30:39] [INFO ] [Nat]Added 67 Read/Feed constraints in 28 ms returned sat
[2023-03-15 22:30:39] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 1 ms to minimize.
[2023-03-15 22:30:39] [INFO ] Deduced a trap composed of 3 places in 68 ms of which 1 ms to minimize.
[2023-03-15 22:30:40] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 1 ms to minimize.
[2023-03-15 22:30:40] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 1 ms to minimize.
[2023-03-15 22:30:40] [INFO ] Deduced a trap composed of 3 places in 68 ms of which 1 ms to minimize.
[2023-03-15 22:30:40] [INFO ] Deduced a trap composed of 6 places in 69 ms of which 1 ms to minimize.
[2023-03-15 22:30:40] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 0 ms to minimize.
[2023-03-15 22:30:40] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 1 ms to minimize.
[2023-03-15 22:30:40] [INFO ] Deduced a trap composed of 43 places in 65 ms of which 0 ms to minimize.
[2023-03-15 22:30:40] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 1 ms to minimize.
[2023-03-15 22:30:40] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 791 ms
[2023-03-15 22:30:40] [INFO ] Computed and/alt/rep : 100/241/100 causal constraints (skipped 7 transitions) in 13 ms.
[2023-03-15 22:30:40] [INFO ] Added : 84 causal constraints over 17 iterations in 346 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Product exploration explored 100000 steps with 1330 reset in 227 ms.
Product exploration explored 100000 steps with 1322 reset in 249 ms.
Built C files in :
/tmp/ltsmin11317395797589334309
[2023-03-15 22:30:41] [INFO ] Computing symmetric may disable matrix : 109 transitions.
[2023-03-15 22:30:41] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-15 22:30:41] [INFO ] Computing symmetric may enable matrix : 109 transitions.
[2023-03-15 22:30:41] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-15 22:30:41] [INFO ] Computing Do-Not-Accords matrix : 109 transitions.
[2023-03-15 22:30:41] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-15 22:30:41] [INFO ] Built C files in 38ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11317395797589334309
Running compilation step : cd /tmp/ltsmin11317395797589334309;'/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 715 ms.
Running link step : cd /tmp/ltsmin11317395797589334309;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 64 ms.
Running LTSmin : cd /tmp/ltsmin11317395797589334309;'/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/stateBased6676985053319564850.hoa' '--buchi-type=spotba'
LTSmin run took 1885 ms.
FORMULA ParamProductionCell-PT-3-LTLFireability-08 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ParamProductionCell-PT-3-LTLFireability-08 finished in 10235 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(X(F((X(G((p1||X(F(p2)))))&&p0)))))'
Support contains 5 out of 202 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 202/202 places, 198/198 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 201 transition count 197
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 201 transition count 197
Applied a total of 2 rules in 5 ms. Remains 201 /202 variables (removed 1) and now considering 197/198 (removed 1) transitions.
// Phase 1: matrix 197 rows 201 cols
[2023-03-15 22:30:44] [INFO ] Computed 34 place invariants in 1 ms
[2023-03-15 22:30:44] [INFO ] Implicit Places using invariants in 276 ms returned [16, 17, 28, 36, 40, 41, 68, 87, 101, 103, 173, 181, 192]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 279 ms to find 13 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 188/202 places, 197/198 transitions.
Applied a total of 0 rules in 2 ms. Remains 188 /188 variables (removed 0) and now considering 197/197 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 287 ms. Remains : 188/202 places, 197/198 transitions.
Stuttering acceptance computed with spot in 375 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ParamProductionCell-PT-3-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=4 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={0} source=4 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=5 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={} source=5 dest: 5}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(AND (EQ s85 1) (EQ s108 1)), p1:(AND (EQ s81 1) (EQ s130 1)), p2:(OR (EQ s85 0) (EQ s143 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 10 reset in 218 ms.
Stack based approach found an accepted trace after 208 steps with 0 reset with depth 209 and stack size 209 in 1 ms.
FORMULA ParamProductionCell-PT-3-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property ParamProductionCell-PT-3-LTLFireability-10 finished in 903 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(((G(F(!p0))||G(p1)) U X(p2))))'
Support contains 5 out of 202 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 202/202 places, 198/198 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 200 transition count 196
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 200 transition count 196
Applied a total of 4 rules in 6 ms. Remains 200 /202 variables (removed 2) and now considering 196/198 (removed 2) transitions.
// Phase 1: matrix 196 rows 200 cols
[2023-03-15 22:30:45] [INFO ] Computed 34 place invariants in 2 ms
[2023-03-15 22:30:45] [INFO ] Implicit Places using invariants in 320 ms returned [16, 17, 28, 36, 40, 68, 87, 89, 101, 103, 172, 180]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 322 ms to find 12 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 188/202 places, 196/198 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 186 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 186 transition count 194
Applied a total of 4 rules in 9 ms. Remains 186 /188 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 186 cols
[2023-03-15 22:30:45] [INFO ] Computed 22 place invariants in 2 ms
[2023-03-15 22:30:45] [INFO ] Implicit Places using invariants in 198 ms returned []
[2023-03-15 22:30:45] [INFO ] Invariant cache hit.
[2023-03-15 22:30:45] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-15 22:30:46] [INFO ] Implicit Places using invariants and state equation in 524 ms returned []
Implicit Place search using SMT with State Equation took 724 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 186/202 places, 194/198 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1063 ms. Remains : 186/202 places, 194/198 transitions.
Stuttering acceptance computed with spot in 405 ms :[(NOT p2), (AND p0 (NOT p2)), (NOT p2), (AND (NOT p1) p0 (NOT p2)), p0, p0, (AND p0 (NOT p1))]
Running random walk in product with property : ParamProductionCell-PT-3-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 4}, { cond=(NOT p2), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(NOT p2), acceptance={0} source=2 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={0} source=2 dest: 3}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 5}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 6}], [{ cond=p0, acceptance={0} source=4 dest: 4}], [{ cond=p0, acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=6 dest: 4}, { cond=(NOT p1), acceptance={} source=6 dest: 5}, { cond=p1, acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(AND (EQ s162 1) (EQ s177 1) (EQ s183 1) (EQ s36 1) (EQ s43 1)), p0:(AND (EQ s162 1) (EQ s177 1) (EQ s183 1)), p2:(AND (EQ s36 1) (EQ s43 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 841 reset in 201 ms.
Product exploration explored 100000 steps with 794 reset in 237 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 : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT p2)), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), true, (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 15 factoid took 1227 ms. Reduced automaton from 7 states, 18 edges and 3 AP (stutter sensitive) to 6 states, 18 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 245 ms :[(NOT p2), (AND p1 (NOT p2) p0), (NOT p2), p0, p0, (AND p0 (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 156 ms. (steps per millisecond=64 ) properties (out of 9) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-15 22:30:48] [INFO ] Invariant cache hit.
[2023-03-15 22:30:48] [INFO ] After 64ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT p2)), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), true, (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT p0))), (G (NOT (AND p1 (NOT p2)))), (G (NOT (AND p1 (NOT p2) p0)))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p2)))), (F p0), (F (AND (NOT p1) p2)), (F (AND (NOT p1) (NOT p2) p0)), (F p2), (F p1), (F (AND (NOT p1) p0))]
Knowledge based reduction with 17 factoid took 1650 ms. Reduced automaton from 6 states, 18 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 211 ms :[(NOT p2), (NOT p2), p0, p0]
Stuttering acceptance computed with spot in 216 ms :[(NOT p2), (NOT p2), p0, p0]
[2023-03-15 22:30:51] [INFO ] Invariant cache hit.
[2023-03-15 22:30:51] [INFO ] [Real]Absence check using 19 positive place invariants in 15 ms returned sat
[2023-03-15 22:30:51] [INFO ] [Real]Absence check using 19 positive and 3 generalized place invariants in 8 ms returned sat
[2023-03-15 22:30:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 22:30:51] [INFO ] [Real]Absence check using state equation in 380 ms returned sat
[2023-03-15 22:30:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 22:30:51] [INFO ] [Nat]Absence check using 19 positive place invariants in 16 ms returned sat
[2023-03-15 22:30:51] [INFO ] [Nat]Absence check using 19 positive and 3 generalized place invariants in 5 ms returned sat
[2023-03-15 22:30:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 22:30:52] [INFO ] [Nat]Absence check using state equation in 311 ms returned sat
[2023-03-15 22:30:52] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-15 22:30:52] [INFO ] [Nat]Added 68 Read/Feed constraints in 31 ms returned sat
[2023-03-15 22:30:52] [INFO ] Deduced a trap composed of 7 places in 107 ms of which 1 ms to minimize.
[2023-03-15 22:30:52] [INFO ] Deduced a trap composed of 5 places in 103 ms of which 1 ms to minimize.
[2023-03-15 22:30:52] [INFO ] Deduced a trap composed of 5 places in 102 ms of which 0 ms to minimize.
[2023-03-15 22:30:52] [INFO ] Deduced a trap composed of 7 places in 92 ms of which 1 ms to minimize.
[2023-03-15 22:30:52] [INFO ] Deduced a trap composed of 7 places in 95 ms of which 0 ms to minimize.
[2023-03-15 22:30:52] [INFO ] Deduced a trap composed of 26 places in 89 ms of which 1 ms to minimize.
[2023-03-15 22:30:53] [INFO ] Deduced a trap composed of 25 places in 98 ms of which 1 ms to minimize.
[2023-03-15 22:30:53] [INFO ] Deduced a trap composed of 7 places in 81 ms of which 1 ms to minimize.
[2023-03-15 22:30:53] [INFO ] Deduced a trap composed of 7 places in 114 ms of which 2 ms to minimize.
[2023-03-15 22:30:53] [INFO ] Deduced a trap composed of 12 places in 106 ms of which 1 ms to minimize.
[2023-03-15 22:30:53] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1250 ms
[2023-03-15 22:30:53] [INFO ] Computed and/alt/rep : 191/311/191 causal constraints (skipped 0 transitions) in 21 ms.
[2023-03-15 22:30:54] [INFO ] Added : 180 causal constraints over 36 iterations in 1234 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 5 out of 186 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 186/186 places, 194/194 transitions.
Drop transitions removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 0 with 37 rules applied. Total rules applied 37 place count 186 transition count 157
Reduce places removed 37 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 38 rules applied. Total rules applied 75 place count 149 transition count 156
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 76 place count 148 transition count 156
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 76 place count 148 transition count 144
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 100 place count 136 transition count 144
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 3 with 84 rules applied. Total rules applied 184 place count 94 transition count 102
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 186 place count 93 transition count 101
Applied a total of 186 rules in 22 ms. Remains 93 /186 variables (removed 93) and now considering 101/194 (removed 93) transitions.
// Phase 1: matrix 101 rows 93 cols
[2023-03-15 22:30:54] [INFO ] Computed 22 place invariants in 1 ms
[2023-03-15 22:30:54] [INFO ] Implicit Places using invariants in 144 ms returned []
[2023-03-15 22:30:54] [INFO ] Invariant cache hit.
[2023-03-15 22:30:54] [INFO ] State equation strengthened by 67 read => feed constraints.
[2023-03-15 22:30:55] [INFO ] Implicit Places using invariants and state equation in 332 ms returned []
Implicit Place search using SMT with State Equation took 480 ms to find 0 implicit places.
[2023-03-15 22:30:55] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-15 22:30:55] [INFO ] Invariant cache hit.
[2023-03-15 22:30:55] [INFO ] Dead Transitions using invariants and state equation in 154 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 93/186 places, 101/194 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 669 ms. Remains : 93/186 places, 101/194 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 : [(AND (NOT p2) (NOT p0)), (X (NOT p2)), (X (NOT (AND p0 (NOT p2)))), (X (NOT p0)), true, (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 495 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 211 ms :[(NOT p2), (NOT p2), p0, p0]
Finished random walk after 12 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=6 )
Knowledge obtained : [(AND (NOT p2) (NOT p0)), (X (NOT p2)), (X (NOT (AND p0 (NOT p2)))), (X (NOT p0)), true, (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p2), (F p0), (F (AND (NOT p2) p0))]
Knowledge based reduction with 8 factoid took 588 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 212 ms :[(NOT p2), (NOT p2), p0, p0]
Stuttering acceptance computed with spot in 219 ms :[(NOT p2), (NOT p2), p0, p0]
[2023-03-15 22:30:57] [INFO ] Invariant cache hit.
[2023-03-15 22:30:57] [INFO ] [Real]Absence check using 19 positive place invariants in 12 ms returned sat
[2023-03-15 22:30:57] [INFO ] [Real]Absence check using 19 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-15 22:30:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 22:30:57] [INFO ] [Real]Absence check using state equation in 102 ms returned sat
[2023-03-15 22:30:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 22:30:57] [INFO ] [Nat]Absence check using 19 positive place invariants in 13 ms returned sat
[2023-03-15 22:30:57] [INFO ] [Nat]Absence check using 19 positive and 3 generalized place invariants in 4 ms returned sat
[2023-03-15 22:30:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 22:30:57] [INFO ] [Nat]Absence check using state equation in 98 ms returned sat
[2023-03-15 22:30:57] [INFO ] State equation strengthened by 67 read => feed constraints.
[2023-03-15 22:30:57] [INFO ] [Nat]Added 67 Read/Feed constraints in 20 ms returned sat
[2023-03-15 22:30:57] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 1 ms to minimize.
[2023-03-15 22:30:57] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 1 ms to minimize.
[2023-03-15 22:30:57] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 0 ms to minimize.
[2023-03-15 22:30:57] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 2 ms to minimize.
[2023-03-15 22:30:57] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 4 ms to minimize.
[2023-03-15 22:30:58] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 1 ms to minimize.
[2023-03-15 22:30:58] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 3 ms to minimize.
[2023-03-15 22:30:58] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 0 ms to minimize.
[2023-03-15 22:30:58] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 0 ms to minimize.
[2023-03-15 22:30:58] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 0 ms to minimize.
[2023-03-15 22:30:58] [INFO ] Deduced a trap composed of 5 places in 54 ms of which 1 ms to minimize.
[2023-03-15 22:30:58] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2023-03-15 22:30:58] [INFO ] Deduced a trap composed of 11 places in 64 ms of which 0 ms to minimize.
[2023-03-15 22:30:58] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 0 ms to minimize.
[2023-03-15 22:30:58] [INFO ] Deduced a trap composed of 10 places in 61 ms of which 0 ms to minimize.
[2023-03-15 22:30:58] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 1 ms to minimize.
[2023-03-15 22:30:58] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 1 ms to minimize.
[2023-03-15 22:30:58] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 0 ms to minimize.
[2023-03-15 22:30:58] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 1 ms to minimize.
[2023-03-15 22:30:59] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 0 ms to minimize.
[2023-03-15 22:30:59] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 2 ms to minimize.
[2023-03-15 22:30:59] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 1 ms to minimize.
[2023-03-15 22:30:59] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 0 ms to minimize.
[2023-03-15 22:30:59] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 1 ms to minimize.
[2023-03-15 22:30:59] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 1 ms to minimize.
[2023-03-15 22:30:59] [INFO ] Deduced a trap composed of 7 places in 63 ms of which 1 ms to minimize.
[2023-03-15 22:30:59] [INFO ] Trap strengthening (SAT) tested/added 27/26 trap constraints in 1820 ms
[2023-03-15 22:30:59] [INFO ] Computed and/alt/rep : 99/225/99 causal constraints (skipped 0 transitions) in 13 ms.
[2023-03-15 22:30:59] [INFO ] Added : 91 causal constraints over 19 iterations in 334 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 216 ms :[(NOT p2), (NOT p2), p0, p0]
Product exploration explored 100000 steps with 1721 reset in 215 ms.
Product exploration explored 100000 steps with 1762 reset in 253 ms.
Built C files in :
/tmp/ltsmin5361268506331936249
[2023-03-15 22:31:00] [INFO ] Computing symmetric may disable matrix : 101 transitions.
[2023-03-15 22:31:00] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-15 22:31:00] [INFO ] Computing symmetric may enable matrix : 101 transitions.
[2023-03-15 22:31:00] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-15 22:31:00] [INFO ] Computing Do-Not-Accords matrix : 101 transitions.
[2023-03-15 22:31:00] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-15 22:31:00] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5361268506331936249
Running compilation step : cd /tmp/ltsmin5361268506331936249;'/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 484 ms.
Running link step : cd /tmp/ltsmin5361268506331936249;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin5361268506331936249;'/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/stateBased15871082345631013545.hoa' '--buchi-type=spotba'
LTSmin run took 6761 ms.
FORMULA ParamProductionCell-PT-3-LTLFireability-11 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ParamProductionCell-PT-3-LTLFireability-11 finished in 22692 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(((X(!p0) U G((p0||G(p1))))||X(G(p2)))))'
Support contains 6 out of 202 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 202/202 places, 198/198 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 200 transition count 196
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 200 transition count 196
Applied a total of 4 rules in 4 ms. Remains 200 /202 variables (removed 2) and now considering 196/198 (removed 2) transitions.
// Phase 1: matrix 196 rows 200 cols
[2023-03-15 22:31:07] [INFO ] Computed 34 place invariants in 1 ms
[2023-03-15 22:31:08] [INFO ] Implicit Places using invariants in 211 ms returned [16, 17, 36, 40, 41, 68, 87, 101, 103, 172, 180, 191]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 213 ms to find 12 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 188/202 places, 196/198 transitions.
Applied a total of 0 rules in 1 ms. Remains 188 /188 variables (removed 0) and now considering 196/196 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 219 ms. Remains : 188/202 places, 196/198 transitions.
Stuttering acceptance computed with spot in 788 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) p0), (AND (NOT p2) (NOT p1) p0), false, p0, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) p0), false, true, (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Running random walk in product with property : ParamProductionCell-PT-3-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 4}, { cond=p0, acceptance={} source=1 dest: 5}], [{ cond=p2, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=2 dest: 4}, { cond=(AND p0 p2), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=2 dest: 6}, { cond=(NOT p2), acceptance={} source=2 dest: 7}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=2 dest: 8}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=2 dest: 9}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 10}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 11}, { cond=(AND p0 p2), acceptance={} source=3 dest: 12}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=4 dest: 11}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=4 dest: 12}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=4 dest: 13}, { cond=(AND p0 p1 p2), acceptance={} source=4 dest: 14}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=5 dest: 15}, { cond=(AND p0 p2), acceptance={} source=5 dest: 16}], [{ cond=p0, acceptance={} source=6 dest: 11}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=7 dest: 6}, { cond=(OR p0 p1), acceptance={0} source=7 dest: 7}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=7 dest: 7}, { cond=(AND (NOT p0) p1), acceptance={1} source=7 dest: 8}, { cond=(AND (NOT p0) p1), acceptance={} source=7 dest: 9}, { cond=p0, acceptance={} source=7 dest: 10}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=8 dest: 6}, { cond=(AND p0 (NOT p1)), acceptance={0} source=8 dest: 7}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=8 dest: 7}, { cond=(AND p0 p1), acceptance={} source=8 dest: 8}, { cond=(AND (NOT p0) p1), acceptance={1} source=8 dest: 8}, { cond=(AND (NOT p0) p1), acceptance={} source=8 dest: 9}, { cond=p0, acceptance={} source=8 dest: 10}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=9 dest: 11}, { cond=(AND p0 p1), acceptance={} source=9 dest: 13}], [{ cond=p0, acceptance={} source=10 dest: 15}], [{ cond=true, acceptance={0, 1} source=11 dest: 11}], [{ cond=(NOT p2), acceptance={} source=12 dest: 11}, { cond=p2, acceptance={} source=12 dest: 12}], [{ cond=(NOT p1), acceptance={} source=13 dest: 11}, { cond=p1, acceptance={} source=13 dest: 13}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=14 dest: 11}, { cond=(AND (NOT p1) p2), acceptance={} source=14 dest: 12}, { cond=(AND p1 (NOT p2)), acceptance={} source=14 dest: 13}, { cond=(AND p1 p2), acceptance={} source=14 dest: 14}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=15 dest: 11}, { cond=(AND (NOT p0) p1), acceptance={} source=15 dest: 13}, { cond=p0, acceptance={} source=15 dest: 15}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=16 dest: 11}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=16 dest: 12}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=16 dest: 13}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=16 dest: 14}]], initial=0, aps=[p0:(AND (EQ s26 1) (EQ s28 1)), p1:(AND (EQ s80 1) (EQ s130 1)), p2:(AND (EQ s80 1) (EQ s82 1) (EQ s107 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 24965 reset in 506 ms.
Product exploration explored 100000 steps with 25056 reset in 428 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 : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 15 factoid took 1322 ms. Reduced automaton from 17 states, 55 edges and 3 AP (stutter sensitive) to 8 states, 24 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 494 ms :[(OR (NOT p1) p0), p0, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) p0), true, (NOT p1), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 7) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 196 rows 188 cols
[2023-03-15 22:31:11] [INFO ] Computed 22 place invariants in 1 ms
[2023-03-15 22:31:11] [INFO ] [Real]Absence check using 19 positive place invariants in 15 ms returned sat
[2023-03-15 22:31:11] [INFO ] [Real]Absence check using 19 positive and 3 generalized place invariants in 7 ms returned sat
[2023-03-15 22:31:11] [INFO ] After 145ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-15 22:31:11] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-15 22:31:12] [INFO ] After 45ms SMT Verify possible using 68 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 22:31:12] [INFO ] After 303ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 22:31:12] [INFO ] [Nat]Absence check using 19 positive place invariants in 14 ms returned sat
[2023-03-15 22:31:12] [INFO ] [Nat]Absence check using 19 positive and 3 generalized place invariants in 7 ms returned sat
[2023-03-15 22:31:12] [INFO ] After 143ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 22:31:12] [INFO ] After 48ms SMT Verify possible using 68 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 22:31:12] [INFO ] Deduced a trap composed of 7 places in 127 ms of which 19 ms to minimize.
[2023-03-15 22:31:12] [INFO ] Deduced a trap composed of 5 places in 103 ms of which 1 ms to minimize.
[2023-03-15 22:31:12] [INFO ] Deduced a trap composed of 7 places in 84 ms of which 1 ms to minimize.
[2023-03-15 22:31:12] [INFO ] Deduced a trap composed of 7 places in 87 ms of which 1 ms to minimize.
[2023-03-15 22:31:12] [INFO ] Deduced a trap composed of 42 places in 79 ms of which 1 ms to minimize.
[2023-03-15 22:31:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 5 trap constraints in 564 ms
[2023-03-15 22:31:12] [INFO ] After 623ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :0
[2023-03-15 22:31:12] [INFO ] After 868ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (G (NOT (AND p0 p1)))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (AND (NOT p0) p1)), (F p1), (F p0), (F (OR p0 p1)), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 16 factoid took 1231 ms. Reduced automaton from 8 states, 24 edges and 2 AP (stutter sensitive) to 6 states, 16 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 303 ms :[(OR (NOT p1) p0), p0, (OR (AND p0 p1) (AND (NOT p0) (NOT p1))), (OR (AND p0 p1) (AND (NOT p0) (NOT p1))), true, (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 306 ms :[(OR (NOT p1) p0), p0, (OR (AND p0 p1) (AND (NOT p0) (NOT p1))), (OR (AND p0 p1) (AND (NOT p0) (NOT p1))), true, (AND (NOT p0) (NOT p1))]
[2023-03-15 22:31:14] [INFO ] Invariant cache hit.
[2023-03-15 22:31:15] [INFO ] [Real]Absence check using 19 positive place invariants in 15 ms returned sat
[2023-03-15 22:31:15] [INFO ] [Real]Absence check using 19 positive and 3 generalized place invariants in 6 ms returned sat
[2023-03-15 22:31:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 22:31:15] [INFO ] [Real]Absence check using state equation in 299 ms returned sat
[2023-03-15 22:31:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 22:31:15] [INFO ] [Nat]Absence check using 19 positive place invariants in 16 ms returned sat
[2023-03-15 22:31:15] [INFO ] [Nat]Absence check using 19 positive and 3 generalized place invariants in 7 ms returned sat
[2023-03-15 22:31:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 22:31:15] [INFO ] [Nat]Absence check using state equation in 293 ms returned sat
[2023-03-15 22:31:15] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-15 22:31:15] [INFO ] [Nat]Added 68 Read/Feed constraints in 32 ms returned sat
[2023-03-15 22:31:16] [INFO ] Deduced a trap composed of 11 places in 117 ms of which 1 ms to minimize.
[2023-03-15 22:31:16] [INFO ] Deduced a trap composed of 5 places in 118 ms of which 1 ms to minimize.
[2023-03-15 22:31:16] [INFO ] Deduced a trap composed of 7 places in 120 ms of which 1 ms to minimize.
[2023-03-15 22:31:16] [INFO ] Deduced a trap composed of 7 places in 119 ms of which 0 ms to minimize.
[2023-03-15 22:31:16] [INFO ] Deduced a trap composed of 7 places in 115 ms of which 3 ms to minimize.
[2023-03-15 22:31:16] [INFO ] Deduced a trap composed of 7 places in 106 ms of which 1 ms to minimize.
[2023-03-15 22:31:16] [INFO ] Deduced a trap composed of 26 places in 98 ms of which 3 ms to minimize.
[2023-03-15 22:31:16] [INFO ] Deduced a trap composed of 5 places in 103 ms of which 11 ms to minimize.
[2023-03-15 22:31:17] [INFO ] Deduced a trap composed of 41 places in 96 ms of which 1 ms to minimize.
[2023-03-15 22:31:17] [INFO ] Deduced a trap composed of 6 places in 90 ms of which 1 ms to minimize.
[2023-03-15 22:31:17] [INFO ] Deduced a trap composed of 12 places in 120 ms of which 1 ms to minimize.
[2023-03-15 22:31:17] [INFO ] Deduced a trap composed of 35 places in 116 ms of which 1 ms to minimize.
[2023-03-15 22:31:17] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 0 ms to minimize.
[2023-03-15 22:31:17] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1755 ms
[2023-03-15 22:31:17] [INFO ] Computed and/alt/rep : 186/327/186 causal constraints (skipped 7 transitions) in 24 ms.
[2023-03-15 22:31:18] [INFO ] Added : 180 causal constraints over 36 iterations in 1107 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 4 out of 188 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 196/196 transitions.
Applied a total of 0 rules in 3 ms. Remains 188 /188 variables (removed 0) and now considering 196/196 (removed 0) transitions.
[2023-03-15 22:31:18] [INFO ] Invariant cache hit.
[2023-03-15 22:31:18] [INFO ] Implicit Places using invariants in 206 ms returned []
[2023-03-15 22:31:18] [INFO ] Invariant cache hit.
[2023-03-15 22:31:19] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-15 22:31:19] [INFO ] Implicit Places using invariants and state equation in 576 ms returned []
Implicit Place search using SMT with State Equation took 785 ms to find 0 implicit places.
[2023-03-15 22:31:19] [INFO ] Invariant cache hit.
[2023-03-15 22:31:19] [INFO ] Dead Transitions using invariants and state equation in 294 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1094 ms. Remains : 188/188 places, 196/196 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 : [(AND (NOT p0) (NOT p1)), (X (NOT (OR p0 p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), true, (X (X (NOT (OR p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 11 factoid took 790 ms. Reduced automaton from 6 states, 16 edges and 2 AP (stutter sensitive) to 6 states, 16 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 288 ms :[(OR (NOT p1) p0), p0, (OR (AND p0 p1) (AND (NOT p0) (NOT p1))), (OR (AND p0 p1) (AND (NOT p0) (NOT p1))), true, (AND (NOT p0) (NOT p1))]
Finished random walk after 274 steps, including 0 resets, run visited all 6 properties in 11 ms. (steps per millisecond=24 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (OR p0 p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), true, (X (X (NOT (OR p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (AND (NOT p0) p1)), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR (AND (NOT p0) (NOT p1)) (AND p0 p1)))), (F (OR (AND (NOT p0) p1) (AND p0 (NOT p1))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 11 factoid took 1061 ms. Reduced automaton from 6 states, 16 edges and 2 AP (stutter sensitive) to 6 states, 16 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 287 ms :[(OR (NOT p1) p0), p0, (OR (AND p0 p1) (AND (NOT p0) (NOT p1))), (OR (AND p0 p1) (AND (NOT p0) (NOT p1))), true, (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 288 ms :[(OR (NOT p1) p0), p0, (OR (AND p0 p1) (AND (NOT p0) (NOT p1))), (OR (AND p0 p1) (AND (NOT p0) (NOT p1))), true, (AND (NOT p0) (NOT p1))]
[2023-03-15 22:31:22] [INFO ] Invariant cache hit.
[2023-03-15 22:31:22] [INFO ] [Real]Absence check using 19 positive place invariants in 15 ms returned sat
[2023-03-15 22:31:22] [INFO ] [Real]Absence check using 19 positive and 3 generalized place invariants in 5 ms returned sat
[2023-03-15 22:31:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 22:31:23] [INFO ] [Real]Absence check using state equation in 289 ms returned sat
[2023-03-15 22:31:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 22:31:23] [INFO ] [Nat]Absence check using 19 positive place invariants in 18 ms returned sat
[2023-03-15 22:31:23] [INFO ] [Nat]Absence check using 19 positive and 3 generalized place invariants in 6 ms returned sat
[2023-03-15 22:31:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 22:31:23] [INFO ] [Nat]Absence check using state equation in 297 ms returned sat
[2023-03-15 22:31:23] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-15 22:31:23] [INFO ] [Nat]Added 68 Read/Feed constraints in 33 ms returned sat
[2023-03-15 22:31:23] [INFO ] Deduced a trap composed of 11 places in 103 ms of which 0 ms to minimize.
[2023-03-15 22:31:24] [INFO ] Deduced a trap composed of 5 places in 125 ms of which 0 ms to minimize.
[2023-03-15 22:31:24] [INFO ] Deduced a trap composed of 7 places in 120 ms of which 1 ms to minimize.
[2023-03-15 22:31:24] [INFO ] Deduced a trap composed of 7 places in 115 ms of which 1 ms to minimize.
[2023-03-15 22:31:24] [INFO ] Deduced a trap composed of 7 places in 108 ms of which 0 ms to minimize.
[2023-03-15 22:31:24] [INFO ] Deduced a trap composed of 7 places in 106 ms of which 1 ms to minimize.
[2023-03-15 22:31:24] [INFO ] Deduced a trap composed of 26 places in 96 ms of which 1 ms to minimize.
[2023-03-15 22:31:24] [INFO ] Deduced a trap composed of 5 places in 93 ms of which 0 ms to minimize.
[2023-03-15 22:31:24] [INFO ] Deduced a trap composed of 41 places in 100 ms of which 1 ms to minimize.
[2023-03-15 22:31:25] [INFO ] Deduced a trap composed of 6 places in 87 ms of which 0 ms to minimize.
[2023-03-15 22:31:25] [INFO ] Deduced a trap composed of 12 places in 129 ms of which 1 ms to minimize.
[2023-03-15 22:31:25] [INFO ] Deduced a trap composed of 35 places in 110 ms of which 1 ms to minimize.
[2023-03-15 22:31:25] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 1 ms to minimize.
[2023-03-15 22:31:25] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1734 ms
[2023-03-15 22:31:25] [INFO ] Computed and/alt/rep : 186/327/186 causal constraints (skipped 7 transitions) in 23 ms.
[2023-03-15 22:31:26] [INFO ] Added : 180 causal constraints over 36 iterations in 1098 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 299 ms :[(OR (NOT p1) p0), p0, (OR (AND p0 p1) (AND (NOT p0) (NOT p1))), (OR (AND p0 p1) (AND (NOT p0) (NOT p1))), true, (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 33318 reset in 418 ms.
Product exploration explored 100000 steps with 33378 reset in 418 ms.
Applying partial POR strategy [false, true, true, true, true, true]
Stuttering acceptance computed with spot in 289 ms :[(OR (NOT p1) p0), p0, (OR (AND p0 p1) (AND (NOT p0) (NOT p1))), (OR (AND p0 p1) (AND (NOT p0) (NOT p1))), true, (AND (NOT p0) (NOT p1))]
Support contains 4 out of 188 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 188/188 places, 196/196 transitions.
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 188 transition count 196
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 14 Pre rules applied. Total rules applied 35 place count 188 transition count 198
Deduced a syphon composed of 49 places in 1 ms
Iterating global reduction 1 with 14 rules applied. Total rules applied 49 place count 188 transition count 198
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 58 place count 179 transition count 188
Deduced a syphon composed of 40 places in 1 ms
Iterating global reduction 1 with 9 rules applied. Total rules applied 67 place count 179 transition count 188
Performed 43 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 83 places in 1 ms
Iterating global reduction 1 with 43 rules applied. Total rules applied 110 place count 179 transition count 188
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 135 place count 154 transition count 163
Deduced a syphon composed of 58 places in 1 ms
Iterating global reduction 1 with 25 rules applied. Total rules applied 160 place count 154 transition count 163
Deduced a syphon composed of 58 places in 0 ms
Applied a total of 160 rules in 57 ms. Remains 154 /188 variables (removed 34) and now considering 163/196 (removed 33) transitions.
[2023-03-15 22:31:28] [INFO ] Redundant transitions in 9 ms returned []
// Phase 1: matrix 163 rows 154 cols
[2023-03-15 22:31:28] [INFO ] Computed 22 place invariants in 2 ms
[2023-03-15 22:31:28] [INFO ] Dead Transitions using invariants and state equation in 231 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 154/188 places, 163/196 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 317 ms. Remains : 154/188 places, 163/196 transitions.
Built C files in :
/tmp/ltsmin16410240251797025147
[2023-03-15 22:31:28] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16410240251797025147
Running compilation step : cd /tmp/ltsmin16410240251797025147;'/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 549 ms.
Running link step : cd /tmp/ltsmin16410240251797025147;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin16410240251797025147;'/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/stateBased6390618192270096153.hoa' '--buchi-type=spotba'
LTSmin run took 268 ms.
FORMULA ParamProductionCell-PT-3-LTLFireability-13 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ParamProductionCell-PT-3-LTLFireability-13 finished in 21666 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)))'
Support contains 5 out of 202 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 202/202 places, 198/198 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 200 transition count 196
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 200 transition count 196
Applied a total of 4 rules in 9 ms. Remains 200 /202 variables (removed 2) and now considering 196/198 (removed 2) transitions.
// Phase 1: matrix 196 rows 200 cols
[2023-03-15 22:31:29] [INFO ] Computed 34 place invariants in 2 ms
[2023-03-15 22:31:29] [INFO ] Implicit Places using invariants in 259 ms returned [16, 17, 28, 40, 41, 68, 87, 89, 101, 103, 180, 191]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 269 ms to find 12 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 188/202 places, 196/198 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 186 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 186 transition count 194
Applied a total of 4 rules in 9 ms. Remains 186 /188 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 186 cols
[2023-03-15 22:31:29] [INFO ] Computed 22 place invariants in 2 ms
[2023-03-15 22:31:29] [INFO ] Implicit Places using invariants in 156 ms returned []
[2023-03-15 22:31:29] [INFO ] Invariant cache hit.
[2023-03-15 22:31:30] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-15 22:31:30] [INFO ] Implicit Places using invariants and state equation in 446 ms returned []
Implicit Place search using SMT with State Equation took 619 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 186/202 places, 194/198 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 906 ms. Remains : 186/202 places, 194/198 transitions.
Stuttering acceptance computed with spot in 79 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-3-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (AND (EQ s160 1) (EQ s168 1)) (AND (EQ s32 1) (EQ s33 1) (EQ s38 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ParamProductionCell-PT-3-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-3-LTLFireability-14 finished in 1003 ms.
All properties solved by simple procedures.
Total runtime 71453 ms.

BK_STOP 1678919491610

--------------------
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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -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:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ 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 LTLFireability -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="ParamProductionCell-PT-3"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is ParamProductionCell-PT-3, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r261-smll-167863536300388"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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