fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r005-oct2-167813593200467
Last Updated
May 14, 2023

About the Execution of ITS-Tools for AutoFlight-PT-12a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1945.896 98820.00 220230.00 520.30 FFFTTFTFFFTTFTFF 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.r005-oct2-167813593200467.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is AutoFlight-PT-12a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r005-oct2-167813593200467
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 516K
-rw-r--r-- 1 mcc users 6.9K Feb 25 18:08 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Feb 25 18:08 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 25 18:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 25 18:03 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Feb 25 15:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 15:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.9K Feb 25 18:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 77K Feb 25 18:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.9K Feb 25 18:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 91K Feb 25 18:12 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:32 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:32 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 85K Mar 5 18:22 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 AutoFlight-PT-12a-LTLCardinality-00
FORMULA_NAME AutoFlight-PT-12a-LTLCardinality-01
FORMULA_NAME AutoFlight-PT-12a-LTLCardinality-02
FORMULA_NAME AutoFlight-PT-12a-LTLCardinality-03
FORMULA_NAME AutoFlight-PT-12a-LTLCardinality-04
FORMULA_NAME AutoFlight-PT-12a-LTLCardinality-05
FORMULA_NAME AutoFlight-PT-12a-LTLCardinality-06
FORMULA_NAME AutoFlight-PT-12a-LTLCardinality-07
FORMULA_NAME AutoFlight-PT-12a-LTLCardinality-08
FORMULA_NAME AutoFlight-PT-12a-LTLCardinality-09
FORMULA_NAME AutoFlight-PT-12a-LTLCardinality-10
FORMULA_NAME AutoFlight-PT-12a-LTLCardinality-11
FORMULA_NAME AutoFlight-PT-12a-LTLCardinality-12
FORMULA_NAME AutoFlight-PT-12a-LTLCardinality-13
FORMULA_NAME AutoFlight-PT-12a-LTLCardinality-14
FORMULA_NAME AutoFlight-PT-12a-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678514811141

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutoFlight-PT-12a
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202303021504
[2023-03-11 06:06:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-11 06:06:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 06:06:53] [INFO ] Load time of PNML (sax parser for PT used): 65 ms
[2023-03-11 06:06:53] [INFO ] Transformed 307 places.
[2023-03-11 06:06:53] [INFO ] Transformed 305 transitions.
[2023-03-11 06:06:53] [INFO ] Found NUPN structural information;
[2023-03-11 06:06:53] [INFO ] Parsed PT model containing 307 places and 305 transitions and 980 arcs in 132 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 7 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 60 transitions
Reduce redundant transitions removed 60 transitions.
FORMULA AutoFlight-PT-12a-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-12a-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 38 out of 307 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 307/307 places, 245/245 transitions.
Applied a total of 0 rules in 25 ms. Remains 307 /307 variables (removed 0) and now considering 245/245 (removed 0) transitions.
// Phase 1: matrix 245 rows 307 cols
[2023-03-11 06:06:53] [INFO ] Computed 76 place invariants in 11 ms
[2023-03-11 06:06:55] [INFO ] Implicit Places using invariants in 1418 ms returned [7, 14, 21, 35, 56, 63, 70, 77, 84, 90, 93, 96, 99, 102, 105, 108, 111, 114, 117, 238, 244, 250, 256, 262, 268, 274, 280, 286, 292, 298, 304, 306]
Discarding 32 places :
Implicit Place search using SMT only with invariants took 1447 ms to find 32 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 275/307 places, 245/245 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 265 transition count 235
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 265 transition count 235
Applied a total of 20 rules in 50 ms. Remains 265 /275 variables (removed 10) and now considering 235/245 (removed 10) transitions.
// Phase 1: matrix 235 rows 265 cols
[2023-03-11 06:06:55] [INFO ] Computed 44 place invariants in 2 ms
[2023-03-11 06:06:55] [INFO ] Implicit Places using invariants in 129 ms returned []
[2023-03-11 06:06:55] [INFO ] Invariant cache hit.
[2023-03-11 06:06:55] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-11 06:06:56] [INFO ] Implicit Places using invariants and state equation in 870 ms returned []
Implicit Place search using SMT with State Equation took 1001 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 265/307 places, 235/245 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2524 ms. Remains : 265/307 places, 235/245 transitions.
Support contains 38 out of 265 places after structural reductions.
[2023-03-11 06:06:56] [INFO ] Flatten gal took : 53 ms
[2023-03-11 06:06:56] [INFO ] Flatten gal took : 20 ms
[2023-03-11 06:06:56] [INFO ] Input system was already deterministic with 235 transitions.
Support contains 35 out of 265 places (down from 38) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 176 resets, run finished after 468 ms. (steps per millisecond=21 ) properties (out of 26) seen :21
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-11 06:06:57] [INFO ] Invariant cache hit.
[2023-03-11 06:06:57] [INFO ] After 89ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-11 06:06:57] [INFO ] [Nat]Absence check using 44 positive place invariants in 10 ms returned sat
[2023-03-11 06:06:57] [INFO ] After 139ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :0
Fused 4 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
FORMULA AutoFlight-PT-12a-LTLCardinality-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA AutoFlight-PT-12a-LTLCardinality-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 4 atomic propositions for a total of 12 simplifications.
FORMULA AutoFlight-PT-12a-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 6 stabilizing places and 1 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' '!(F(G((X(p1)||p0))))'
Support contains 3 out of 265 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 265/265 places, 235/235 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 264 transition count 234
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 264 transition count 234
Applied a total of 2 rules in 36 ms. Remains 264 /265 variables (removed 1) and now considering 234/235 (removed 1) transitions.
// Phase 1: matrix 234 rows 264 cols
[2023-03-11 06:06:58] [INFO ] Computed 44 place invariants in 8 ms
[2023-03-11 06:06:58] [INFO ] Implicit Places using invariants in 213 ms returned [25, 38, 45, 78, 101, 163, 213]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 217 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 257/265 places, 234/235 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 255 transition count 232
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 255 transition count 232
Applied a total of 4 rules in 13 ms. Remains 255 /257 variables (removed 2) and now considering 232/234 (removed 2) transitions.
// Phase 1: matrix 232 rows 255 cols
[2023-03-11 06:06:58] [INFO ] Computed 37 place invariants in 4 ms
[2023-03-11 06:06:58] [INFO ] Implicit Places using invariants in 139 ms returned []
[2023-03-11 06:06:58] [INFO ] Invariant cache hit.
[2023-03-11 06:06:58] [INFO ] Implicit Places using invariants and state equation in 227 ms returned []
Implicit Place search using SMT with State Equation took 371 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 255/265 places, 232/235 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 637 ms. Remains : 255/265 places, 232/235 transitions.
Stuttering acceptance computed with spot in 339 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutoFlight-PT-12a-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p0:(OR (EQ s52 0) (EQ s5 0) (EQ s158 1)), p1:(EQ s52 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 1857 reset in 477 ms.
Product exploration explored 100000 steps with 1849 reset in 437 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1))))]
Knowledge based reduction with 9 factoid took 674 ms. Reduced automaton from 2 states, 6 edges and 2 AP (stutter sensitive) to 2 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 142 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 201 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 5) seen :4
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-11 06:07:00] [INFO ] Invariant cache hit.
[2023-03-11 06:07:01] [INFO ] After 119ms SMT Verify possible using all constraints in real 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 p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (G (NOT (AND p1 (NOT p0))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (F (AND (NOT p1) (NOT p0))), (F (NOT p0)), (F (AND (NOT p1) p0)), (F (NOT (AND p1 p0)))]
Knowledge based reduction with 10 factoid took 946 ms. Reduced automaton from 2 states, 6 edges and 2 AP (stutter sensitive) to 2 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 208 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 156 ms :[(NOT p0), (NOT p0)]
Support contains 3 out of 255 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 255/255 places, 232/232 transitions.
Applied a total of 0 rules in 7 ms. Remains 255 /255 variables (removed 0) and now considering 232/232 (removed 0) transitions.
[2023-03-11 06:07:02] [INFO ] Invariant cache hit.
[2023-03-11 06:07:02] [INFO ] Implicit Places using invariants in 154 ms returned []
[2023-03-11 06:07:02] [INFO ] Invariant cache hit.
[2023-03-11 06:07:02] [INFO ] Implicit Places using invariants and state equation in 241 ms returned []
Implicit Place search using SMT with State Equation took 398 ms to find 0 implicit places.
[2023-03-11 06:07:02] [INFO ] Invariant cache hit.
[2023-03-11 06:07:03] [INFO ] Dead Transitions using invariants and state equation in 198 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 606 ms. Remains : 255/255 places, 232/232 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X p0), (X (X p0))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1))))]
Knowledge based reduction with 5 factoid took 460 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter sensitive) to 2 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 125 ms :[(NOT p0), (NOT p0)]
Finished random walk after 22 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=11 )
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X p0), (X (X p0))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (F (NOT p0)), (F (AND (NOT p1) p0)), (F (NOT (AND p1 p0)))]
Knowledge based reduction with 5 factoid took 650 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter sensitive) to 2 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 142 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 136 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 167 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1874 reset in 321 ms.
Product exploration explored 100000 steps with 1861 reset in 326 ms.
Built C files in :
/tmp/ltsmin12869895192057912984
[2023-03-11 06:07:05] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12869895192057912984
Running compilation step : cd /tmp/ltsmin12869895192057912984;'/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 634 ms.
Running link step : cd /tmp/ltsmin12869895192057912984;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 108 ms.
Running LTSmin : cd /tmp/ltsmin12869895192057912984;'/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/stateBased6721295771467458498.hoa' '--buchi-type=spotba'
LTSmin run took 1220 ms.
FORMULA AutoFlight-PT-12a-LTLCardinality-00 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property AutoFlight-PT-12a-LTLCardinality-00 finished in 9729 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||F(p1)))))'
Support contains 3 out of 265 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 265/265 places, 235/235 transitions.
Drop transitions removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 0 with 72 rules applied. Total rules applied 72 place count 265 transition count 163
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 1 with 72 rules applied. Total rules applied 144 place count 193 transition count 163
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 144 place count 193 transition count 143
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 184 place count 173 transition count 143
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 185 place count 172 transition count 142
Iterating global reduction 2 with 1 rules applied. Total rules applied 186 place count 172 transition count 142
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 238 place count 146 transition count 116
Applied a total of 238 rules in 23 ms. Remains 146 /265 variables (removed 119) and now considering 116/235 (removed 119) transitions.
// Phase 1: matrix 116 rows 146 cols
[2023-03-11 06:07:07] [INFO ] Computed 44 place invariants in 1 ms
[2023-03-11 06:07:07] [INFO ] Implicit Places using invariants in 101 ms returned [17, 26, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 85, 106]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 103 ms to find 18 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 128/265 places, 116/235 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 128 transition count 98
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 36 place count 110 transition count 98
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 36 place count 110 transition count 96
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 40 place count 108 transition count 96
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 41 place count 107 transition count 95
Iterating global reduction 2 with 1 rules applied. Total rules applied 42 place count 107 transition count 95
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 43 place count 106 transition count 94
Iterating global reduction 2 with 1 rules applied. Total rules applied 44 place count 106 transition count 94
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 2 with 2 rules applied. Total rules applied 46 place count 105 transition count 93
Applied a total of 46 rules in 9 ms. Remains 105 /128 variables (removed 23) and now considering 93/116 (removed 23) transitions.
// Phase 1: matrix 93 rows 105 cols
[2023-03-11 06:07:07] [INFO ] Computed 26 place invariants in 0 ms
[2023-03-11 06:07:07] [INFO ] Implicit Places using invariants in 52 ms returned []
[2023-03-11 06:07:07] [INFO ] Invariant cache hit.
[2023-03-11 06:07:07] [INFO ] State equation strengthened by 26 read => feed constraints.
[2023-03-11 06:07:08] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 170 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 105/265 places, 93/235 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 306 ms. Remains : 105/265 places, 93/235 transitions.
Stuttering acceptance computed with spot in 852 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutoFlight-PT-12a-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s44 1), p1:(AND (EQ s44 1) (OR (EQ s29 0) (EQ s65 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 30 steps with 0 reset in 1 ms.
FORMULA AutoFlight-PT-12a-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-12a-LTLCardinality-01 finished in 1174 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(F(p0)))'
Support contains 2 out of 265 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 265/265 places, 235/235 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 264 transition count 234
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 264 transition count 234
Applied a total of 2 rules in 19 ms. Remains 264 /265 variables (removed 1) and now considering 234/235 (removed 1) transitions.
// Phase 1: matrix 234 rows 264 cols
[2023-03-11 06:07:08] [INFO ] Computed 44 place invariants in 4 ms
[2023-03-11 06:07:09] [INFO ] Implicit Places using invariants in 225 ms returned [25, 38, 45, 78, 101, 163, 213]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 227 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 257/265 places, 234/235 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 255 transition count 232
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 255 transition count 232
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 254 transition count 231
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 254 transition count 231
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 253 transition count 230
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 253 transition count 230
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 252 transition count 229
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 252 transition count 229
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 251 transition count 228
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 251 transition count 228
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 250 transition count 227
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 250 transition count 227
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 249 transition count 226
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 249 transition count 226
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 248 transition count 225
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 248 transition count 225
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 247 transition count 224
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 247 transition count 224
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 246 transition count 223
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 246 transition count 223
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 245 transition count 222
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 245 transition count 222
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 244 transition count 221
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 244 transition count 221
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 243 transition count 220
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 243 transition count 220
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 242 transition count 219
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 242 transition count 219
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 241 transition count 218
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 241 transition count 218
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 240 transition count 217
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 240 transition count 217
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 239 transition count 216
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 239 transition count 216
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 238 transition count 215
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 238 transition count 215
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 237 transition count 214
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 237 transition count 214
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 236 transition count 213
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 236 transition count 213
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 235 transition count 212
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 235 transition count 212
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 234 transition count 211
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 234 transition count 211
Applied a total of 46 rules in 56 ms. Remains 234 /257 variables (removed 23) and now considering 211/234 (removed 23) transitions.
// Phase 1: matrix 211 rows 234 cols
[2023-03-11 06:07:09] [INFO ] Computed 37 place invariants in 3 ms
[2023-03-11 06:07:09] [INFO ] Implicit Places using invariants in 163 ms returned []
[2023-03-11 06:07:09] [INFO ] Invariant cache hit.
[2023-03-11 06:07:09] [INFO ] Implicit Places using invariants and state equation in 197 ms returned []
Implicit Place search using SMT with State Equation took 364 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 234/265 places, 211/235 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 668 ms. Remains : 234/265 places, 211/235 transitions.
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-12a-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s158 0) (EQ s45 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 453 ms.
Product exploration explored 100000 steps with 50000 reset in 474 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 96 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutoFlight-PT-12a-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutoFlight-PT-12a-LTLCardinality-04 finished in 1838 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 265 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 265/265 places, 235/235 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 93 transitions
Trivial Post-agglo rules discarded 93 transitions
Performed 93 trivial Post agglomeration. Transition count delta: 93
Iterating post reduction 0 with 98 rules applied. Total rules applied 98 place count 259 transition count 141
Reduce places removed 93 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 94 rules applied. Total rules applied 192 place count 166 transition count 140
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 193 place count 165 transition count 140
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 193 place count 165 transition count 127
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 231 place count 140 transition count 127
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 3 with 12 rules applied. Total rules applied 243 place count 140 transition count 115
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 255 place count 128 transition count 115
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 256 place count 127 transition count 114
Iterating global reduction 5 with 1 rules applied. Total rules applied 257 place count 127 transition count 114
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 5 with 52 rules applied. Total rules applied 309 place count 101 transition count 88
Applied a total of 309 rules in 30 ms. Remains 101 /265 variables (removed 164) and now considering 88/235 (removed 147) transitions.
// Phase 1: matrix 88 rows 101 cols
[2023-03-11 06:07:10] [INFO ] Computed 27 place invariants in 1 ms
[2023-03-11 06:07:10] [INFO ] Implicit Places using invariants in 119 ms returned [62, 75]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 121 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 99/265 places, 88/235 transitions.
Applied a total of 0 rules in 4 ms. Remains 99 /99 variables (removed 0) and now considering 88/88 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 155 ms. Remains : 99/265 places, 88/235 transitions.
Stuttering acceptance computed with spot in 129 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-12a-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s48 0) (EQ s53 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 64 steps with 1 reset in 0 ms.
FORMULA AutoFlight-PT-12a-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-12a-LTLCardinality-05 finished in 311 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||G((F(p1)&&F(G(p2)))))))'
Support contains 4 out of 265 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 265/265 places, 235/235 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 264 transition count 234
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 264 transition count 234
Applied a total of 2 rules in 23 ms. Remains 264 /265 variables (removed 1) and now considering 234/235 (removed 1) transitions.
// Phase 1: matrix 234 rows 264 cols
[2023-03-11 06:07:11] [INFO ] Computed 44 place invariants in 3 ms
[2023-03-11 06:07:11] [INFO ] Implicit Places using invariants in 204 ms returned [25, 38, 45, 78, 101, 163, 213]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 206 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 257/265 places, 234/235 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 255 transition count 232
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 255 transition count 232
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 254 transition count 231
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 254 transition count 231
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 253 transition count 230
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 253 transition count 230
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 252 transition count 229
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 252 transition count 229
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 251 transition count 228
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 251 transition count 228
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 250 transition count 227
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 250 transition count 227
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 249 transition count 226
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 249 transition count 226
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 248 transition count 225
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 248 transition count 225
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 247 transition count 224
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 247 transition count 224
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 246 transition count 223
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 246 transition count 223
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 245 transition count 222
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 245 transition count 222
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 244 transition count 221
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 244 transition count 221
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 243 transition count 220
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 243 transition count 220
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 242 transition count 219
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 242 transition count 219
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 241 transition count 218
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 241 transition count 218
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 240 transition count 217
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 240 transition count 217
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 239 transition count 216
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 239 transition count 216
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 238 transition count 215
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 238 transition count 215
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 237 transition count 214
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 237 transition count 214
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 236 transition count 213
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 236 transition count 213
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 235 transition count 212
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 235 transition count 212
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 234 transition count 211
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 234 transition count 211
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 233 transition count 210
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 233 transition count 210
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 232 transition count 209
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 232 transition count 209
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 231 transition count 208
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 231 transition count 208
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 230 transition count 207
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 230 transition count 207
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 229 transition count 206
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 229 transition count 206
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 228 transition count 205
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 228 transition count 205
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 227 transition count 204
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 227 transition count 204
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 226 transition count 203
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 226 transition count 203
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 225 transition count 202
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 225 transition count 202
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 224 transition count 201
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 224 transition count 201
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 223 transition count 200
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 223 transition count 200
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 222 transition count 199
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 222 transition count 199
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 71 place count 221 transition count 198
Iterating global reduction 0 with 1 rules applied. Total rules applied 72 place count 221 transition count 198
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 73 place count 220 transition count 197
Iterating global reduction 0 with 1 rules applied. Total rules applied 74 place count 220 transition count 197
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 75 place count 219 transition count 196
Iterating global reduction 0 with 1 rules applied. Total rules applied 76 place count 219 transition count 196
Applied a total of 76 rules in 108 ms. Remains 219 /257 variables (removed 38) and now considering 196/234 (removed 38) transitions.
// Phase 1: matrix 196 rows 219 cols
[2023-03-11 06:07:11] [INFO ] Computed 37 place invariants in 2 ms
[2023-03-11 06:07:11] [INFO ] Implicit Places using invariants in 126 ms returned []
[2023-03-11 06:07:11] [INFO ] Invariant cache hit.
[2023-03-11 06:07:11] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 285 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 219/265 places, 196/235 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 622 ms. Remains : 219/265 places, 196/235 transitions.
Stuttering acceptance computed with spot in 319 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p2), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : AutoFlight-PT-12a-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=p2, acceptance={} source=3 dest: 3}, { cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 2}, { cond=(NOT p2), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (NEQ s63 0) (NEQ s136 1)), p1:(OR (EQ s189 0) (EQ s154 1)), p2:(AND (EQ s154 0) (EQ s189 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 372 ms.
Product exploration explored 100000 steps with 50000 reset in 411 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X p0), true]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (NOT p1))), (X (X p1))]
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 5 factoid took 364 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutoFlight-PT-12a-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutoFlight-PT-12a-LTLCardinality-06 finished in 2131 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 1 out of 265 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 265/265 places, 235/235 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 264 transition count 234
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 264 transition count 234
Applied a total of 2 rules in 7 ms. Remains 264 /265 variables (removed 1) and now considering 234/235 (removed 1) transitions.
// Phase 1: matrix 234 rows 264 cols
[2023-03-11 06:07:13] [INFO ] Computed 44 place invariants in 4 ms
[2023-03-11 06:07:13] [INFO ] Implicit Places using invariants in 191 ms returned [25, 38, 45, 78, 101, 163, 213]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 205 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 257/265 places, 234/235 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 255 transition count 232
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 255 transition count 232
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 254 transition count 231
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 254 transition count 231
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 253 transition count 230
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 253 transition count 230
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 252 transition count 229
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 252 transition count 229
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 251 transition count 228
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 251 transition count 228
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 250 transition count 227
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 250 transition count 227
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 249 transition count 226
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 249 transition count 226
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 248 transition count 225
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 248 transition count 225
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 247 transition count 224
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 247 transition count 224
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 246 transition count 223
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 246 transition count 223
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 245 transition count 222
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 245 transition count 222
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 244 transition count 221
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 244 transition count 221
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 243 transition count 220
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 243 transition count 220
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 242 transition count 219
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 242 transition count 219
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 241 transition count 218
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 241 transition count 218
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 240 transition count 217
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 240 transition count 217
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 239 transition count 216
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 239 transition count 216
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 238 transition count 215
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 238 transition count 215
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 237 transition count 214
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 237 transition count 214
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 236 transition count 213
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 236 transition count 213
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 235 transition count 212
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 235 transition count 212
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 234 transition count 211
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 234 transition count 211
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 233 transition count 210
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 233 transition count 210
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 232 transition count 209
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 232 transition count 209
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 231 transition count 208
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 231 transition count 208
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 230 transition count 207
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 230 transition count 207
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 229 transition count 206
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 229 transition count 206
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 228 transition count 205
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 228 transition count 205
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 227 transition count 204
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 227 transition count 204
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 226 transition count 203
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 226 transition count 203
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 225 transition count 202
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 225 transition count 202
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 224 transition count 201
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 224 transition count 201
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 223 transition count 200
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 223 transition count 200
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 222 transition count 199
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 222 transition count 199
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 71 place count 221 transition count 198
Iterating global reduction 0 with 1 rules applied. Total rules applied 72 place count 221 transition count 198
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 73 place count 220 transition count 197
Iterating global reduction 0 with 1 rules applied. Total rules applied 74 place count 220 transition count 197
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 75 place count 219 transition count 196
Iterating global reduction 0 with 1 rules applied. Total rules applied 76 place count 219 transition count 196
Applied a total of 76 rules in 110 ms. Remains 219 /257 variables (removed 38) and now considering 196/234 (removed 38) transitions.
// Phase 1: matrix 196 rows 219 cols
[2023-03-11 06:07:13] [INFO ] Computed 37 place invariants in 1 ms
[2023-03-11 06:07:13] [INFO ] Implicit Places using invariants in 111 ms returned []
[2023-03-11 06:07:13] [INFO ] Invariant cache hit.
[2023-03-11 06:07:13] [INFO ] Implicit Places using invariants and state equation in 197 ms returned []
Implicit Place search using SMT with State Equation took 326 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 219/265 places, 196/235 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 648 ms. Remains : 219/265 places, 196/235 transitions.
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : AutoFlight-PT-12a-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s84 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-12a-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-12a-LTLCardinality-07 finished in 775 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(G((X(X(p1))||p0)))))'
Support contains 2 out of 265 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 265/265 places, 235/235 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 264 transition count 234
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 264 transition count 234
Applied a total of 2 rules in 12 ms. Remains 264 /265 variables (removed 1) and now considering 234/235 (removed 1) transitions.
// Phase 1: matrix 234 rows 264 cols
[2023-03-11 06:07:13] [INFO ] Computed 44 place invariants in 3 ms
[2023-03-11 06:07:14] [INFO ] Implicit Places using invariants in 191 ms returned [25, 38, 45, 78, 101, 163, 213]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 192 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 257/265 places, 234/235 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 255 transition count 232
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 255 transition count 232
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 254 transition count 231
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 254 transition count 231
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 253 transition count 230
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 253 transition count 230
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 252 transition count 229
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 252 transition count 229
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 251 transition count 228
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 251 transition count 228
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 250 transition count 227
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 250 transition count 227
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 249 transition count 226
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 249 transition count 226
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 248 transition count 225
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 248 transition count 225
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 247 transition count 224
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 247 transition count 224
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 246 transition count 223
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 246 transition count 223
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 245 transition count 222
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 245 transition count 222
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 244 transition count 221
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 244 transition count 221
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 243 transition count 220
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 243 transition count 220
Applied a total of 28 rules in 32 ms. Remains 243 /257 variables (removed 14) and now considering 220/234 (removed 14) transitions.
// Phase 1: matrix 220 rows 243 cols
[2023-03-11 06:07:14] [INFO ] Computed 37 place invariants in 1 ms
[2023-03-11 06:07:14] [INFO ] Implicit Places using invariants in 106 ms returned []
[2023-03-11 06:07:14] [INFO ] Invariant cache hit.
[2023-03-11 06:07:14] [INFO ] Implicit Places using invariants and state equation in 193 ms returned []
Implicit Place search using SMT with State Equation took 307 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 243/265 places, 220/235 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 543 ms. Remains : 243/265 places, 220/235 transitions.
Stuttering acceptance computed with spot in 346 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
Running random walk in product with property : AutoFlight-PT-12a-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(OR (EQ s81 0) (EQ s110 1)), p1:(AND (EQ s110 0) (EQ s81 1))], 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 5738 steps with 229 reset in 39 ms.
FORMULA AutoFlight-PT-12a-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-12a-LTLCardinality-08 finished in 957 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(G((p0||G(p1))))))'
Support contains 2 out of 265 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 265/265 places, 235/235 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 264 transition count 234
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 264 transition count 234
Applied a total of 2 rules in 10 ms. Remains 264 /265 variables (removed 1) and now considering 234/235 (removed 1) transitions.
// Phase 1: matrix 234 rows 264 cols
[2023-03-11 06:07:14] [INFO ] Computed 44 place invariants in 3 ms
[2023-03-11 06:07:15] [INFO ] Implicit Places using invariants in 194 ms returned [25, 45, 78, 101, 163, 213]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 200 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 258/265 places, 234/235 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 256 transition count 232
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 256 transition count 232
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 255 transition count 231
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 255 transition count 231
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 254 transition count 230
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 254 transition count 230
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 253 transition count 229
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 253 transition count 229
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 252 transition count 228
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 252 transition count 228
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 251 transition count 227
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 251 transition count 227
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 250 transition count 226
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 250 transition count 226
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 249 transition count 225
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 249 transition count 225
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 248 transition count 224
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 248 transition count 224
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 247 transition count 223
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 247 transition count 223
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 246 transition count 222
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 246 transition count 222
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 245 transition count 221
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 245 transition count 221
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 244 transition count 220
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 244 transition count 220
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 243 transition count 219
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 243 transition count 219
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 242 transition count 218
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 242 transition count 218
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 241 transition count 217
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 241 transition count 217
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 240 transition count 216
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 240 transition count 216
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 239 transition count 215
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 239 transition count 215
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 238 transition count 214
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 238 transition count 214
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 237 transition count 213
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 237 transition count 213
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 236 transition count 212
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 236 transition count 212
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 235 transition count 211
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 235 transition count 211
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 234 transition count 210
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 234 transition count 210
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 233 transition count 209
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 233 transition count 209
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 232 transition count 208
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 232 transition count 208
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 231 transition count 207
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 231 transition count 207
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 230 transition count 206
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 230 transition count 206
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 229 transition count 205
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 229 transition count 205
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 228 transition count 204
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 228 transition count 204
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 227 transition count 203
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 227 transition count 203
Applied a total of 62 rules in 82 ms. Remains 227 /258 variables (removed 31) and now considering 203/234 (removed 31) transitions.
// Phase 1: matrix 203 rows 227 cols
[2023-03-11 06:07:15] [INFO ] Computed 38 place invariants in 3 ms
[2023-03-11 06:07:15] [INFO ] Implicit Places using invariants in 142 ms returned []
[2023-03-11 06:07:15] [INFO ] Invariant cache hit.
[2023-03-11 06:07:15] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-11 06:07:15] [INFO ] Implicit Places using invariants and state equation in 205 ms returned []
Implicit Place search using SMT with State Equation took 349 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 227/265 places, 203/235 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 641 ms. Remains : 227/265 places, 203/235 transitions.
Stuttering acceptance computed with spot in 288 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : AutoFlight-PT-12a-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p1:(EQ s85 1), p0:(EQ s37 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 1845 reset in 329 ms.
Product exploration explored 100000 steps with 1906 reset in 317 ms.
Computed a total of 2 stabilizing places and 1 stable transitions
Computed a total of 2 stabilizing places and 1 stable transitions
Detected a total of 2/227 stabilizing places and 1/203 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 362 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 300 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 193 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-11 06:07:17] [INFO ] Invariant cache hit.
[2023-03-11 06:07:17] [INFO ] [Real]Absence check using 38 positive place invariants in 12 ms returned sat
[2023-03-11 06:07:17] [INFO ] After 120ms SMT Verify possible using all constraints in real 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 p1) (NOT p0)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (G (NOT (AND p1 (NOT p0))))]
False Knowledge obtained : [(F p0), (F p1), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 6 factoid took 522 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 223 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 196 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
[2023-03-11 06:07:18] [INFO ] Invariant cache hit.
[2023-03-11 06:07:18] [INFO ] [Real]Absence check using 38 positive place invariants in 20 ms returned sat
[2023-03-11 06:07:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 06:07:18] [INFO ] [Real]Absence check using state equation in 92 ms returned sat
[2023-03-11 06:07:18] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-11 06:07:18] [INFO ] [Real]Added 3 Read/Feed constraints in 4 ms returned sat
[2023-03-11 06:07:18] [INFO ] Computed and/alt/rep : 201/387/201 causal constraints (skipped 1 transitions) in 23 ms.
[2023-03-11 06:07:18] [INFO ] Added : 0 causal constraints over 0 iterations in 69 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 227 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 227/227 places, 203/203 transitions.
Applied a total of 0 rules in 2 ms. Remains 227 /227 variables (removed 0) and now considering 203/203 (removed 0) transitions.
[2023-03-11 06:07:18] [INFO ] Invariant cache hit.
[2023-03-11 06:07:18] [INFO ] Implicit Places using invariants in 104 ms returned []
[2023-03-11 06:07:18] [INFO ] Invariant cache hit.
[2023-03-11 06:07:18] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-11 06:07:19] [INFO ] Implicit Places using invariants and state equation in 261 ms returned []
Implicit Place search using SMT with State Equation took 368 ms to find 0 implicit places.
[2023-03-11 06:07:19] [INFO ] Invariant cache hit.
[2023-03-11 06:07:19] [INFO ] Dead Transitions using invariants and state equation in 143 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 514 ms. Remains : 227/227 places, 203/203 transitions.
Computed a total of 2 stabilizing places and 1 stable transitions
Computed a total of 2 stabilizing places and 1 stable transitions
Detected a total of 2/227 stabilizing places and 1/203 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 210 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 248 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 230 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 223 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 206 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
[2023-03-11 06:07:20] [INFO ] Invariant cache hit.
[2023-03-11 06:07:20] [INFO ] [Real]Absence check using 38 positive place invariants in 19 ms returned sat
[2023-03-11 06:07:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 06:07:20] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2023-03-11 06:07:20] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-11 06:07:20] [INFO ] [Real]Added 3 Read/Feed constraints in 14 ms returned sat
[2023-03-11 06:07:20] [INFO ] Computed and/alt/rep : 201/387/201 causal constraints (skipped 1 transitions) in 25 ms.
[2023-03-11 06:07:20] [INFO ] Added : 0 causal constraints over 0 iterations in 65 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 156 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1850 reset in 241 ms.
Product exploration explored 100000 steps with 1884 reset in 262 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 232 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 227 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 227/227 places, 203/203 transitions.
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 59 rules applied. Total rules applied 59 place count 227 transition count 203
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 15 Pre rules applied. Total rules applied 59 place count 227 transition count 203
Deduced a syphon composed of 74 places in 0 ms
Iterating global reduction 1 with 15 rules applied. Total rules applied 74 place count 227 transition count 203
Discarding 45 places :
Symmetric choice reduction at 1 with 45 rule applications. Total rules 119 place count 182 transition count 158
Deduced a syphon composed of 29 places in 0 ms
Iterating global reduction 1 with 45 rules applied. Total rules applied 164 place count 182 transition count 158
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 56 places in 0 ms
Iterating global reduction 1 with 27 rules applied. Total rules applied 191 place count 182 transition count 158
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 196 place count 177 transition count 153
Deduced a syphon composed of 52 places in 0 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 201 place count 177 transition count 153
Deduced a syphon composed of 52 places in 0 ms
Applied a total of 201 rules in 66 ms. Remains 177 /227 variables (removed 50) and now considering 153/203 (removed 50) transitions.
[2023-03-11 06:07:21] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 153 rows 177 cols
[2023-03-11 06:07:21] [INFO ] Computed 38 place invariants in 2 ms
[2023-03-11 06:07:21] [INFO ] Dead Transitions using invariants and state equation in 172 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 177/227 places, 153/203 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 250 ms. Remains : 177/227 places, 153/203 transitions.
Built C files in :
/tmp/ltsmin14846436055773123565
[2023-03-11 06:07:22] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14846436055773123565
Running compilation step : cd /tmp/ltsmin14846436055773123565;'/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 322 ms.
Running link step : cd /tmp/ltsmin14846436055773123565;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin14846436055773123565;'/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/stateBased13881843569954949851.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 227 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 227/227 places, 203/203 transitions.
Applied a total of 0 rules in 10 ms. Remains 227 /227 variables (removed 0) and now considering 203/203 (removed 0) transitions.
// Phase 1: matrix 203 rows 227 cols
[2023-03-11 06:07:37] [INFO ] Computed 38 place invariants in 2 ms
[2023-03-11 06:07:37] [INFO ] Implicit Places using invariants in 156 ms returned []
[2023-03-11 06:07:37] [INFO ] Invariant cache hit.
[2023-03-11 06:07:37] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-11 06:07:37] [INFO ] Implicit Places using invariants and state equation in 194 ms returned []
Implicit Place search using SMT with State Equation took 352 ms to find 0 implicit places.
[2023-03-11 06:07:37] [INFO ] Invariant cache hit.
[2023-03-11 06:07:37] [INFO ] Dead Transitions using invariants and state equation in 173 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 536 ms. Remains : 227/227 places, 203/203 transitions.
Built C files in :
/tmp/ltsmin8721755424643737308
[2023-03-11 06:07:37] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8721755424643737308
Running compilation step : cd /tmp/ltsmin8721755424643737308;'/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 355 ms.
Running link step : cd /tmp/ltsmin8721755424643737308;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 57 ms.
Running LTSmin : cd /tmp/ltsmin8721755424643737308;'/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/stateBased6074398422769798961.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-11 06:07:52] [INFO ] Flatten gal took : 18 ms
[2023-03-11 06:07:52] [INFO ] Flatten gal took : 12 ms
[2023-03-11 06:07:52] [INFO ] Time to serialize gal into /tmp/LTL5502165208402457393.gal : 4 ms
[2023-03-11 06:07:52] [INFO ] Time to serialize properties into /tmp/LTL2969198813624717635.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5502165208402457393.gal' '-t' 'CGAL' '-hoa' '/tmp/aut425995135052289439.hoa' '-atoms' '/tmp/LTL2969198813624717635.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

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

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...274
Read 1 LTL properties
Checking formula 0 : !((X(X(G(("(p42==1)")||(G("(p101==1)")))))))
Formula 0 simplified : XXF(!"(p42==1)" & F!"(p101==1)")
Detected timeout of ITS tools.
[2023-03-11 06:08:23] [INFO ] Flatten gal took : 27 ms
[2023-03-11 06:08:23] [INFO ] Applying decomposition
[2023-03-11 06:08:23] [INFO ] Flatten gal took : 20 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph14651498984869105908.txt' '-o' '/tmp/graph14651498984869105908.bin' '-w' '/tmp/graph14651498984869105908.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph14651498984869105908.bin' '-l' '-1' '-v' '-w' '/tmp/graph14651498984869105908.weights' '-q' '0' '-e' '0.001'
[2023-03-11 06:08:23] [INFO ] Decomposing Gal with order
[2023-03-11 06:08:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-11 06:08:23] [INFO ] Removed a total of 25 redundant transitions.
[2023-03-11 06:08:23] [INFO ] Flatten gal took : 51 ms
[2023-03-11 06:08:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2023-03-11 06:08:23] [INFO ] Time to serialize gal into /tmp/LTL7660881687985165330.gal : 5 ms
[2023-03-11 06:08:23] [INFO ] Time to serialize properties into /tmp/LTL8003957157732223980.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7660881687985165330.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8003957157732223980.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(X(G(("(i10.i1.u52.p42==1)")||(G("(i17.u30.p101==1)")))))))
Formula 0 simplified : XXF(!"(i10.i1.u52.p42==1)" & F!"(i17.u30.p101==1)")
Reverse transition relation is NOT exact ! Due to transitions i0.u0.t59, i0.u1.t57, i1.u7.t45, i2.i0.u6.t47, i2.i0.u8.t43, i2.i1.u10.t39, i2.i1.u12.t35, i3...504
Computing Next relation with stutter on 24 deadlock states
3 unique states visited
0 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
239 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,2.42184,64984,1,0,106201,191,2638,166197,127,315,143110
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA AutoFlight-PT-12a-LTLCardinality-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property AutoFlight-PT-12a-LTLCardinality-10 finished in 71262 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&F(p1))))'
Support contains 4 out of 265 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 265/265 places, 235/235 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 264 transition count 234
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 264 transition count 234
Applied a total of 2 rules in 8 ms. Remains 264 /265 variables (removed 1) and now considering 234/235 (removed 1) transitions.
// Phase 1: matrix 234 rows 264 cols
[2023-03-11 06:08:26] [INFO ] Computed 44 place invariants in 3 ms
[2023-03-11 06:08:26] [INFO ] Implicit Places using invariants in 381 ms returned [45, 78, 101, 163, 213]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 395 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 259/265 places, 234/235 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 257 transition count 232
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 257 transition count 232
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 256 transition count 231
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 256 transition count 231
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 255 transition count 230
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 255 transition count 230
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 254 transition count 229
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 254 transition count 229
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 253 transition count 228
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 253 transition count 228
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 252 transition count 227
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 252 transition count 227
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 251 transition count 226
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 251 transition count 226
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 250 transition count 225
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 250 transition count 225
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 249 transition count 224
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 249 transition count 224
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 248 transition count 223
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 248 transition count 223
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 247 transition count 222
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 247 transition count 222
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 246 transition count 221
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 246 transition count 221
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 245 transition count 220
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 245 transition count 220
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 244 transition count 219
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 244 transition count 219
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 243 transition count 218
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 243 transition count 218
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 242 transition count 217
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 242 transition count 217
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 241 transition count 216
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 241 transition count 216
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 240 transition count 215
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 240 transition count 215
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 239 transition count 214
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 239 transition count 214
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 238 transition count 213
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 238 transition count 213
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 237 transition count 212
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 237 transition count 212
Applied a total of 44 rules in 58 ms. Remains 237 /259 variables (removed 22) and now considering 212/234 (removed 22) transitions.
// Phase 1: matrix 212 rows 237 cols
[2023-03-11 06:08:26] [INFO ] Computed 39 place invariants in 1 ms
[2023-03-11 06:08:26] [INFO ] Implicit Places using invariants in 153 ms returned []
[2023-03-11 06:08:26] [INFO ] Invariant cache hit.
[2023-03-11 06:08:26] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-11 06:08:27] [INFO ] Implicit Places using invariants and state equation in 254 ms returned []
Implicit Place search using SMT with State Equation took 422 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 237/265 places, 212/235 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 884 ms. Remains : 237/265 places, 212/235 transitions.
Stuttering acceptance computed with spot in 191 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : AutoFlight-PT-12a-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(AND (EQ s152 0) (EQ s25 1)), p0:(OR (EQ s38 0) (EQ s160 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-12a-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-12a-LTLCardinality-12 finished in 1106 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 2 out of 265 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 265/265 places, 235/235 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 264 transition count 234
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 264 transition count 234
Applied a total of 2 rules in 10 ms. Remains 264 /265 variables (removed 1) and now considering 234/235 (removed 1) transitions.
// Phase 1: matrix 234 rows 264 cols
[2023-03-11 06:08:27] [INFO ] Computed 44 place invariants in 3 ms
[2023-03-11 06:08:27] [INFO ] Implicit Places using invariants in 179 ms returned [25, 38, 45, 78, 101, 163, 213]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 195 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 257/265 places, 234/235 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 255 transition count 232
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 255 transition count 232
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 254 transition count 231
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 254 transition count 231
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 253 transition count 230
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 253 transition count 230
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 252 transition count 229
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 252 transition count 229
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 251 transition count 228
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 251 transition count 228
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 250 transition count 227
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 250 transition count 227
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 249 transition count 226
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 249 transition count 226
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 248 transition count 225
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 248 transition count 225
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 247 transition count 224
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 247 transition count 224
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 246 transition count 223
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 246 transition count 223
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 245 transition count 222
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 245 transition count 222
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 244 transition count 221
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 244 transition count 221
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 243 transition count 220
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 243 transition count 220
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 242 transition count 219
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 242 transition count 219
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 241 transition count 218
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 241 transition count 218
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 240 transition count 217
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 240 transition count 217
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 239 transition count 216
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 239 transition count 216
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 238 transition count 215
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 238 transition count 215
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 237 transition count 214
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 237 transition count 214
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 236 transition count 213
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 236 transition count 213
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 235 transition count 212
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 235 transition count 212
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 234 transition count 211
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 234 transition count 211
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 233 transition count 210
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 233 transition count 210
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 232 transition count 209
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 232 transition count 209
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 231 transition count 208
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 231 transition count 208
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 230 transition count 207
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 230 transition count 207
Applied a total of 54 rules in 61 ms. Remains 230 /257 variables (removed 27) and now considering 207/234 (removed 27) transitions.
// Phase 1: matrix 207 rows 230 cols
[2023-03-11 06:08:27] [INFO ] Computed 37 place invariants in 2 ms
[2023-03-11 06:08:27] [INFO ] Implicit Places using invariants in 116 ms returned []
[2023-03-11 06:08:27] [INFO ] Invariant cache hit.
[2023-03-11 06:08:27] [INFO ] Implicit Places using invariants and state equation in 219 ms returned []
Implicit Place search using SMT with State Equation took 337 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 230/265 places, 207/235 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 603 ms. Remains : 230/265 places, 207/235 transitions.
Stuttering acceptance computed with spot in 111 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : AutoFlight-PT-12a-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s123 0) (EQ s144 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 425 ms.
Product exploration explored 100000 steps with 50000 reset in 329 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X p0), true]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 110 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutoFlight-PT-12a-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutoFlight-PT-12a-LTLCardinality-13 finished in 1605 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 2 out of 265 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 265/265 places, 235/235 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 264 transition count 234
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 264 transition count 234
Applied a total of 2 rules in 9 ms. Remains 264 /265 variables (removed 1) and now considering 234/235 (removed 1) transitions.
// Phase 1: matrix 234 rows 264 cols
[2023-03-11 06:08:28] [INFO ] Computed 44 place invariants in 7 ms
[2023-03-11 06:08:29] [INFO ] Implicit Places using invariants in 176 ms returned [25, 38, 45, 78, 101, 163, 213]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 177 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 257/265 places, 234/235 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 255 transition count 232
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 255 transition count 232
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 254 transition count 231
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 254 transition count 231
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 253 transition count 230
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 253 transition count 230
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 252 transition count 229
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 252 transition count 229
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 251 transition count 228
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 251 transition count 228
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 250 transition count 227
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 250 transition count 227
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 249 transition count 226
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 249 transition count 226
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 248 transition count 225
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 248 transition count 225
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 247 transition count 224
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 247 transition count 224
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 246 transition count 223
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 246 transition count 223
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 245 transition count 222
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 245 transition count 222
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 244 transition count 221
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 244 transition count 221
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 243 transition count 220
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 243 transition count 220
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 242 transition count 219
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 242 transition count 219
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 241 transition count 218
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 241 transition count 218
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 240 transition count 217
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 240 transition count 217
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 239 transition count 216
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 239 transition count 216
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 238 transition count 215
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 238 transition count 215
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 237 transition count 214
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 237 transition count 214
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 236 transition count 213
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 236 transition count 213
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 235 transition count 212
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 235 transition count 212
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 234 transition count 211
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 234 transition count 211
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 233 transition count 210
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 233 transition count 210
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 232 transition count 209
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 232 transition count 209
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 231 transition count 208
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 231 transition count 208
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 230 transition count 207
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 230 transition count 207
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 229 transition count 206
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 229 transition count 206
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 228 transition count 205
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 228 transition count 205
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 227 transition count 204
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 227 transition count 204
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 226 transition count 203
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 226 transition count 203
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 225 transition count 202
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 225 transition count 202
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 224 transition count 201
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 224 transition count 201
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 223 transition count 200
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 223 transition count 200
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 222 transition count 199
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 222 transition count 199
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 71 place count 221 transition count 198
Iterating global reduction 0 with 1 rules applied. Total rules applied 72 place count 221 transition count 198
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 73 place count 220 transition count 197
Iterating global reduction 0 with 1 rules applied. Total rules applied 74 place count 220 transition count 197
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 75 place count 219 transition count 196
Iterating global reduction 0 with 1 rules applied. Total rules applied 76 place count 219 transition count 196
Applied a total of 76 rules in 67 ms. Remains 219 /257 variables (removed 38) and now considering 196/234 (removed 38) transitions.
// Phase 1: matrix 196 rows 219 cols
[2023-03-11 06:08:29] [INFO ] Computed 37 place invariants in 1 ms
[2023-03-11 06:08:29] [INFO ] Implicit Places using invariants in 112 ms returned []
[2023-03-11 06:08:29] [INFO ] Invariant cache hit.
[2023-03-11 06:08:29] [INFO ] Implicit Places using invariants and state equation in 256 ms returned []
Implicit Place search using SMT with State Equation took 370 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 219/265 places, 196/235 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 623 ms. Remains : 219/265 places, 196/235 transitions.
Stuttering acceptance computed with spot in 153 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-12a-LTLCardinality-15 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 (EQ s147 0) (EQ s172 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 856 steps with 19 reset in 4 ms.
FORMULA AutoFlight-PT-12a-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-12a-LTLCardinality-15 finished in 806 ms.
All properties solved by simple procedures.
Total runtime 96121 ms.

BK_STOP 1678514909961

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ 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 LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="AutoFlight-PT-12a"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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