fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r043-smll-171620180100082
Last Updated
July 7, 2024

About the Execution of 2023-gold for AutoFlight-PT-05b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
981.407 28420.00 60882.00 550.00 FFFFFFFFTTTFTFFF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r043-smll-171620180100082.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is AutoFlight-PT-05b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r043-smll-171620180100082
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 600K
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 17:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 12 22:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 164K Apr 12 22:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Apr 12 22:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K Apr 12 22:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 113K May 18 16:42 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-05b-LTLCardinality-00
FORMULA_NAME AutoFlight-PT-05b-LTLCardinality-01
FORMULA_NAME AutoFlight-PT-05b-LTLCardinality-02
FORMULA_NAME AutoFlight-PT-05b-LTLCardinality-03
FORMULA_NAME AutoFlight-PT-05b-LTLCardinality-04
FORMULA_NAME AutoFlight-PT-05b-LTLCardinality-05
FORMULA_NAME AutoFlight-PT-05b-LTLCardinality-06
FORMULA_NAME AutoFlight-PT-05b-LTLCardinality-07
FORMULA_NAME AutoFlight-PT-05b-LTLCardinality-08
FORMULA_NAME AutoFlight-PT-05b-LTLCardinality-09
FORMULA_NAME AutoFlight-PT-05b-LTLCardinality-10
FORMULA_NAME AutoFlight-PT-05b-LTLCardinality-11
FORMULA_NAME AutoFlight-PT-05b-LTLCardinality-12
FORMULA_NAME AutoFlight-PT-05b-LTLCardinality-13
FORMULA_NAME AutoFlight-PT-05b-LTLCardinality-14
FORMULA_NAME AutoFlight-PT-05b-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716278978568

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=gold2023
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutoFlight-PT-05b
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-21 08:09:41] [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]
[2024-05-21 08:09:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 08:09:41] [INFO ] Load time of PNML (sax parser for PT used): 150 ms
[2024-05-21 08:09:41] [INFO ] Transformed 482 places.
[2024-05-21 08:09:41] [INFO ] Transformed 480 transitions.
[2024-05-21 08:09:41] [INFO ] Found NUPN structural information;
[2024-05-21 08:09:41] [INFO ] Parsed PT model containing 482 places and 480 transitions and 1120 arcs in 265 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA AutoFlight-PT-05b-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-05b-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-05b-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-05b-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-05b-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-05b-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-05b-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-05b-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-05b-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 24 out of 482 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 482/482 places, 480/480 transitions.
Discarding 63 places :
Symmetric choice reduction at 0 with 63 rule applications. Total rules 63 place count 419 transition count 417
Iterating global reduction 0 with 63 rules applied. Total rules applied 126 place count 419 transition count 417
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 134 place count 419 transition count 409
Discarding 28 places :
Symmetric choice reduction at 1 with 28 rule applications. Total rules 162 place count 391 transition count 381
Iterating global reduction 1 with 28 rules applied. Total rules applied 190 place count 391 transition count 381
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 195 place count 386 transition count 376
Iterating global reduction 1 with 5 rules applied. Total rules applied 200 place count 386 transition count 376
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 205 place count 381 transition count 371
Iterating global reduction 1 with 5 rules applied. Total rules applied 210 place count 381 transition count 371
Applied a total of 210 rules in 167 ms. Remains 381 /482 variables (removed 101) and now considering 371/480 (removed 109) transitions.
// Phase 1: matrix 371 rows 381 cols
[2024-05-21 08:09:42] [INFO ] Computed 34 invariants in 43 ms
[2024-05-21 08:09:42] [INFO ] Implicit Places using invariants in 594 ms returned []
[2024-05-21 08:09:42] [INFO ] Invariant cache hit.
[2024-05-21 08:09:43] [INFO ] Implicit Places using invariants and state equation in 416 ms returned []
Implicit Place search using SMT with State Equation took 1057 ms to find 0 implicit places.
[2024-05-21 08:09:43] [INFO ] Invariant cache hit.
[2024-05-21 08:09:43] [INFO ] Dead Transitions using invariants and state equation in 424 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 381/482 places, 371/480 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1655 ms. Remains : 381/482 places, 371/480 transitions.
Support contains 24 out of 381 places after structural reductions.
[2024-05-21 08:09:44] [INFO ] Flatten gal took : 86 ms
[2024-05-21 08:09:44] [INFO ] Flatten gal took : 35 ms
[2024-05-21 08:09:44] [INFO ] Input system was already deterministic with 371 transitions.
Support contains 21 out of 381 places (down from 24) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 40 resets, run finished after 427 ms. (steps per millisecond=23 ) properties (out of 12) seen :11
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-21 08:09:44] [INFO ] Invariant cache hit.
[2024-05-21 08:09:44] [INFO ] [Real]Absence check using 33 positive place invariants in 23 ms returned sat
[2024-05-21 08:09:44] [INFO ] [Real]Absence check using 33 positive and 1 generalized place invariants in 6 ms returned sat
[2024-05-21 08:09:44] [INFO ] After 206ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-21 08:09:45] [INFO ] Deduced a trap composed of 17 places in 149 ms of which 9 ms to minimize.
[2024-05-21 08:09:45] [INFO ] Deduced a trap composed of 50 places in 147 ms of which 2 ms to minimize.
[2024-05-21 08:09:45] [INFO ] Deduced a trap composed of 72 places in 127 ms of which 2 ms to minimize.
[2024-05-21 08:09:45] [INFO ] Deduced a trap composed of 50 places in 120 ms of which 1 ms to minimize.
[2024-05-21 08:09:45] [INFO ] Deduced a trap composed of 72 places in 110 ms of which 2 ms to minimize.
[2024-05-21 08:09:45] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 819 ms
[2024-05-21 08:09:45] [INFO ] After 1046ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 08:09:45] [INFO ] After 1207ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 08:09:45] [INFO ] [Nat]Absence check using 33 positive place invariants in 19 ms returned sat
[2024-05-21 08:09:45] [INFO ] [Nat]Absence check using 33 positive and 1 generalized place invariants in 5 ms returned sat
[2024-05-21 08:09:46] [INFO ] After 203ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-21 08:09:46] [INFO ] Deduced a trap composed of 17 places in 119 ms of which 1 ms to minimize.
[2024-05-21 08:09:46] [INFO ] Deduced a trap composed of 50 places in 115 ms of which 0 ms to minimize.
[2024-05-21 08:09:46] [INFO ] Deduced a trap composed of 72 places in 146 ms of which 1 ms to minimize.
[2024-05-21 08:09:46] [INFO ] Deduced a trap composed of 50 places in 117 ms of which 1 ms to minimize.
[2024-05-21 08:09:46] [INFO ] Deduced a trap composed of 72 places in 104 ms of which 1 ms to minimize.
[2024-05-21 08:09:46] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 713 ms
[2024-05-21 08:09:46] [INFO ] After 936ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 22 ms.
[2024-05-21 08:09:46] [INFO ] After 1075ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 182 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=60 )
Parikh walk visited 1 properties in 5 ms.
Computed a total of 95 stabilizing places and 95 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)&&F(G(p1)))))'
Support contains 4 out of 381 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 381/381 places, 371/371 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 126 transitions
Trivial Post-agglo rules discarded 126 transitions
Performed 126 trivial Post agglomeration. Transition count delta: 126
Iterating post reduction 0 with 126 rules applied. Total rules applied 126 place count 380 transition count 244
Reduce places removed 126 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 142 rules applied. Total rules applied 268 place count 254 transition count 228
Reduce places removed 9 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 11 rules applied. Total rules applied 279 place count 245 transition count 226
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 281 place count 243 transition count 226
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 49 Pre rules applied. Total rules applied 281 place count 243 transition count 177
Deduced a syphon composed of 49 places in 1 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 4 with 98 rules applied. Total rules applied 379 place count 194 transition count 177
Performed 74 Post agglomeration using F-continuation condition with reduction of 10 identical transitions.
Deduced a syphon composed of 74 places in 2 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 4 with 148 rules applied. Total rules applied 527 place count 120 transition count 93
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 528 place count 119 transition count 92
Reduce places removed 8 places and 0 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 4 with 11 rules applied. Total rules applied 539 place count 111 transition count 89
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 542 place count 108 transition count 89
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 5 Pre rules applied. Total rules applied 542 place count 108 transition count 84
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 6 with 10 rules applied. Total rules applied 552 place count 103 transition count 84
Applied a total of 552 rules in 79 ms. Remains 103 /381 variables (removed 278) and now considering 84/371 (removed 287) transitions.
// Phase 1: matrix 84 rows 103 cols
[2024-05-21 08:09:47] [INFO ] Computed 26 invariants in 6 ms
[2024-05-21 08:09:47] [INFO ] Implicit Places using invariants in 134 ms returned [43, 60, 83, 88, 92, 97, 102]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 138 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 96/381 places, 84/371 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 91 transition count 79
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 91 transition count 79
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 90 transition count 78
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 90 transition count 78
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 89 transition count 77
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 89 transition count 77
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 88 transition count 76
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 88 transition count 76
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 87 transition count 75
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 87 transition count 75
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 86 transition count 74
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 86 transition count 74
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 24 place count 84 transition count 72
Applied a total of 24 rules in 36 ms. Remains 84 /96 variables (removed 12) and now considering 72/84 (removed 12) transitions.
// Phase 1: matrix 72 rows 84 cols
[2024-05-21 08:09:47] [INFO ] Computed 19 invariants in 2 ms
[2024-05-21 08:09:47] [INFO ] Implicit Places using invariants in 88 ms returned []
[2024-05-21 08:09:47] [INFO ] Invariant cache hit.
[2024-05-21 08:09:47] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 08:09:47] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 242 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 84/381 places, 72/371 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 495 ms. Remains : 84/381 places, 72/371 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 299 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : AutoFlight-PT-05b-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s72 0) (EQ s34 1)), p1:(OR (EQ s42 0) (EQ s12 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 32 steps with 0 reset in 2 ms.
FORMULA AutoFlight-PT-05b-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-05b-LTLCardinality-00 finished in 882 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(X((p1||((p0 U G(!p2))&&G(p3)))))))'
Support contains 7 out of 381 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 381/381 places, 371/371 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 379 transition count 369
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 379 transition count 369
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 379 transition count 368
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 378 transition count 367
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 378 transition count 367
Applied a total of 7 rules in 49 ms. Remains 378 /381 variables (removed 3) and now considering 367/371 (removed 4) transitions.
// Phase 1: matrix 367 rows 378 cols
[2024-05-21 08:09:48] [INFO ] Computed 34 invariants in 5 ms
[2024-05-21 08:09:48] [INFO ] Implicit Places using invariants in 157 ms returned []
[2024-05-21 08:09:48] [INFO ] Invariant cache hit.
[2024-05-21 08:09:48] [INFO ] Implicit Places using invariants and state equation in 351 ms returned []
Implicit Place search using SMT with State Equation took 515 ms to find 0 implicit places.
[2024-05-21 08:09:48] [INFO ] Invariant cache hit.
[2024-05-21 08:09:48] [INFO ] Dead Transitions using invariants and state equation in 302 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 378/381 places, 367/371 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 872 ms. Remains : 378/381 places, 367/371 transitions.
Stuttering acceptance computed with spot in 1122 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) p2)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) p2)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) p2)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) p2)), true, p2, (NOT p3), p2, (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) p2)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) p2)), (AND (NOT p1) p2), (AND (NOT p3) (NOT p1)), (AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) (NOT p3)), (AND (NOT p1) p2), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND p0 (NOT p1) (NOT p3))), (AND p2 (NOT p3)), (AND p2 (NOT p3) p0 (NOT p1))]
Running random walk in product with property : AutoFlight-PT-05b-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 8}, { cond=p0, acceptance={} source=2 dest: 9}], [{ cond=(OR (AND (NOT p0) (NOT p1) p2) (AND (NOT p1) (NOT p3))), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) (NOT p1) (NOT p2) p3), acceptance={} source=3 dest: 5}, { cond=(OR (AND p0 (NOT p1) p3) (AND (NOT p1) (NOT p2) p3)), acceptance={} source=3 dest: 6}, { cond=(AND p0 (NOT p1) p3), acceptance={} source=3 dest: 7}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=p2, acceptance={} source=5 dest: 4}, { cond=(NOT p2), acceptance={} source=5 dest: 5}], [{ cond=(NOT p3), acceptance={} source=6 dest: 4}, { cond=p3, acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p0) p2), acceptance={} source=7 dest: 4}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=7 dest: 5}, { cond=(AND p0 (NOT p2)), acceptance={} source=7 dest: 7}, { cond=(AND p0 p2), acceptance={0} source=7 dest: 7}], [{ cond=(OR (AND (NOT p0) (NOT p1) p2) (AND (NOT p1) (NOT p3))), acceptance={} source=8 dest: 3}, { cond=(AND (NOT p0) (NOT p1) (NOT p2) p3), acceptance={} source=8 dest: 10}, { cond=(OR (AND p0 (NOT p1) p3) (AND (NOT p1) (NOT p2) p3)), acceptance={} source=8 dest: 11}, { cond=(AND p0 (NOT p1) p3), acceptance={} source=8 dest: 12}], [{ cond=(OR (AND (NOT p0) (NOT p1) p2) (AND (NOT p0) (NOT p1) (NOT p3))), acceptance={} source=9 dest: 8}, { cond=(AND p0 (NOT p1) (NOT p3)), acceptance={0} source=9 dest: 9}, { cond=(AND (NOT p0) (NOT p1) (NOT p2) p3), acceptance={} source=9 dest: 13}, { cond=(AND (NOT p0) (NOT p1) (NOT p2) p3), acceptance={} source=9 dest: 14}, { cond=(AND p0 (NOT p1) p3), acceptance={} source=9 dest: 15}, { cond=(AND p0 (NOT p1) p3), acceptance={} source=9 dest: 16}], [{ cond=(OR (AND (NOT p0) (NOT p1) p2) (AND (NOT p1) p2 (NOT p3))), acceptance={} source=10 dest: 4}, { cond=(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p2) (NOT p3))), acceptance={} source=10 dest: 5}, { cond=(AND p0 (NOT p1) p2 p3), acceptance={} source=10 dest: 6}, { cond=(AND p0 (NOT p1) p3), acceptance={} source=10 dest: 7}, { cond=(AND p0 (NOT p1) (NOT p2) p3), acceptance={} source=10 dest: 17}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={} source=11 dest: 4}, { cond=(AND (NOT p1) p3), acceptance={} source=11 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=12 dest: 4}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=12 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=12 dest: 7}], [{ cond=(OR (AND (NOT p0) (NOT p1) p2) (AND (NOT p1) p2 (NOT p3))), acceptance={} source=13 dest: 3}, { cond=(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p2) (NOT p3))), acceptance={} source=13 dest: 10}, { cond=(AND p0 (NOT p1) p2 p3), acceptance={} source=13 dest: 11}, { cond=(AND p0 (NOT p1) p3), acceptance={} source=13 dest: 12}, { cond=(AND p0 (NOT p1) (NOT p2) p3), acceptance={} source=13 dest: 18}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={} source=14 dest: 3}, { cond=(AND (NOT p1) p3), acceptance={} source=14 dest: 11}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=15 dest: 8}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=15 dest: 13}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=15 dest: 15}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=15 dest: 15}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=16 dest: 8}, { cond=(AND p0 (NOT p1) (NOT p3)), acceptance={0} source=16 dest: 9}, { cond=(AND (NOT p0) (NOT p1) p3), acceptance={} source=16 dest: 14}, { cond=(AND p0 (NOT p1) p3), acceptance={} source=16 dest: 16}], [{ cond=(AND p2 (NOT p3)), acceptance={} source=17 dest: 4}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=17 dest: 5}, { cond=(AND p2 p3), acceptance={} source=17 dest: 6}, { cond=(AND (NOT p2) p3), acceptance={} source=17 dest: 17}], [{ cond=(AND p0 (NOT p1) p2 (NOT p3)), acceptance={} source=18 dest: 4}, { cond=(AND p0 (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=18 dest: 5}, { cond=(AND (NOT p1) p2 p3), acceptance={} source=18 dest: 6}, { cond=(AND (NOT p1) (NOT p2) p3), acceptance={} source=18 dest: 17}]], initial=0, aps=[p0:(OR (EQ s195 0) (EQ s157 1)), p1:(EQ s350 1), p2:(OR (EQ s36 0) (EQ s69 1)), p3:(OR (EQ s175 0) (EQ s103 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 241 steps with 0 reset in 16 ms.
FORMULA AutoFlight-PT-05b-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-05b-LTLCardinality-01 finished in 2060 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 1 out of 381 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 381/381 places, 371/371 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 377 transition count 367
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 377 transition count 367
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 10 place count 377 transition count 365
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 12 place count 375 transition count 363
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 375 transition count 363
Applied a total of 14 rules in 25 ms. Remains 375 /381 variables (removed 6) and now considering 363/371 (removed 8) transitions.
// Phase 1: matrix 363 rows 375 cols
[2024-05-21 08:09:50] [INFO ] Computed 34 invariants in 6 ms
[2024-05-21 08:09:50] [INFO ] Implicit Places using invariants in 195 ms returned []
[2024-05-21 08:09:50] [INFO ] Invariant cache hit.
[2024-05-21 08:09:50] [INFO ] Implicit Places using invariants and state equation in 481 ms returned []
Implicit Place search using SMT with State Equation took 685 ms to find 0 implicit places.
[2024-05-21 08:09:50] [INFO ] Invariant cache hit.
[2024-05-21 08:09:51] [INFO ] Dead Transitions using invariants and state equation in 325 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 375/381 places, 363/371 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1036 ms. Remains : 375/381 places, 363/371 transitions.
Stuttering acceptance computed with spot in 121 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : AutoFlight-PT-05b-LTLCardinality-06 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 s207 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]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA AutoFlight-PT-05b-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-05b-LTLCardinality-06 finished in 1187 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0||G(p1)) U X(!p0)))'
Support contains 3 out of 381 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 381/381 places, 371/371 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 377 transition count 367
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 377 transition count 367
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 10 place count 377 transition count 365
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 12 place count 375 transition count 363
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 375 transition count 363
Applied a total of 14 rules in 37 ms. Remains 375 /381 variables (removed 6) and now considering 363/371 (removed 8) transitions.
[2024-05-21 08:09:51] [INFO ] Invariant cache hit.
[2024-05-21 08:09:51] [INFO ] Implicit Places using invariants in 188 ms returned []
[2024-05-21 08:09:51] [INFO ] Invariant cache hit.
[2024-05-21 08:09:51] [INFO ] Implicit Places using invariants and state equation in 412 ms returned []
Implicit Place search using SMT with State Equation took 607 ms to find 0 implicit places.
[2024-05-21 08:09:51] [INFO ] Invariant cache hit.
[2024-05-21 08:09:52] [INFO ] Dead Transitions using invariants and state equation in 516 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 375/381 places, 363/371 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1163 ms. Remains : 375/381 places, 363/371 transitions.
Stuttering acceptance computed with spot in 258 ms :[p0, p0, (AND (NOT p1) p0), p0, true, (NOT p1)]
Running random walk in product with property : AutoFlight-PT-05b-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 2}, { cond=(OR p0 p1), acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={} source=1 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(AND p0 p1), acceptance={} source=2 dest: 5}], [{ cond=p0, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 4}, { cond=p1, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(EQ s272 1), p1:(OR (EQ s147 0) (EQ s250 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 571 ms.
Product exploration explored 100000 steps with 50000 reset in 792 ms.
Computed a total of 91 stabilizing places and 91 stable transitions
Computed a total of 91 stabilizing places and 91 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), true, (X (X p1)), (X (X (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 39 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutoFlight-PT-05b-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutoFlight-PT-05b-LTLCardinality-08 finished in 2867 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 381 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 381/381 places, 371/371 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 378 transition count 368
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 378 transition count 368
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 378 transition count 367
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 9 place count 376 transition count 365
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 376 transition count 365
Applied a total of 11 rules in 39 ms. Remains 376 /381 variables (removed 5) and now considering 365/371 (removed 6) transitions.
// Phase 1: matrix 365 rows 376 cols
[2024-05-21 08:09:54] [INFO ] Computed 34 invariants in 8 ms
[2024-05-21 08:09:54] [INFO ] Implicit Places using invariants in 252 ms returned []
[2024-05-21 08:09:54] [INFO ] Invariant cache hit.
[2024-05-21 08:09:54] [INFO ] Implicit Places using invariants and state equation in 378 ms returned []
Implicit Place search using SMT with State Equation took 634 ms to find 0 implicit places.
[2024-05-21 08:09:54] [INFO ] Invariant cache hit.
[2024-05-21 08:09:55] [INFO ] Dead Transitions using invariants and state equation in 383 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 376/381 places, 365/371 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1059 ms. Remains : 376/381 places, 365/371 transitions.
Stuttering acceptance computed with spot in 143 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-05b-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (EQ s84 0) (EQ s147 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 438 ms.
Product exploration explored 100000 steps with 33333 reset in 412 ms.
Computed a total of 91 stabilizing places and 91 stable transitions
Computed a total of 91 stabilizing places and 91 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 19 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-05b-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutoFlight-PT-05b-LTLCardinality-10 finished in 2116 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 3 out of 381 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 381/381 places, 371/371 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 129 transitions
Trivial Post-agglo rules discarded 129 transitions
Performed 129 trivial Post agglomeration. Transition count delta: 129
Iterating post reduction 0 with 129 rules applied. Total rules applied 129 place count 380 transition count 241
Reduce places removed 129 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 146 rules applied. Total rules applied 275 place count 251 transition count 224
Reduce places removed 10 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 12 rules applied. Total rules applied 287 place count 241 transition count 222
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 289 place count 239 transition count 222
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 48 Pre rules applied. Total rules applied 289 place count 239 transition count 174
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 4 with 96 rules applied. Total rules applied 385 place count 191 transition count 174
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 386 place count 190 transition count 173
Iterating global reduction 4 with 1 rules applied. Total rules applied 387 place count 190 transition count 173
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 387 place count 190 transition count 172
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 389 place count 189 transition count 172
Performed 71 Post agglomeration using F-continuation condition with reduction of 10 identical transitions.
Deduced a syphon composed of 71 places in 0 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 4 with 142 rules applied. Total rules applied 531 place count 118 transition count 91
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 532 place count 117 transition count 90
Applied a total of 532 rules in 61 ms. Remains 117 /381 variables (removed 264) and now considering 90/371 (removed 281) transitions.
// Phase 1: matrix 90 rows 117 cols
[2024-05-21 08:09:56] [INFO ] Computed 34 invariants in 1 ms
[2024-05-21 08:09:56] [INFO ] Implicit Places using invariants in 131 ms returned [49, 68, 85, 91, 97, 103, 109, 116]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 133 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 109/381 places, 90/371 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 103 transition count 84
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 103 transition count 84
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 102 transition count 83
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 102 transition count 83
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 101 transition count 82
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 101 transition count 82
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 100 transition count 81
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 100 transition count 81
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 99 transition count 80
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 99 transition count 80
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 98 transition count 79
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 98 transition count 79
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 97 transition count 78
Applied a total of 24 rules in 22 ms. Remains 97 /109 variables (removed 12) and now considering 78/90 (removed 12) transitions.
// Phase 1: matrix 78 rows 97 cols
[2024-05-21 08:09:56] [INFO ] Computed 26 invariants in 1 ms
[2024-05-21 08:09:56] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-05-21 08:09:56] [INFO ] Invariant cache hit.
[2024-05-21 08:09:56] [INFO ] State equation strengthened by 24 read => feed constraints.
[2024-05-21 08:09:56] [INFO ] Implicit Places using invariants and state equation in 190 ms returned [37, 42]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 283 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 95/381 places, 78/371 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 95 transition count 76
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 93 transition count 76
Applied a total of 4 rules in 5 ms. Remains 93 /95 variables (removed 2) and now considering 76/78 (removed 2) transitions.
// Phase 1: matrix 76 rows 93 cols
[2024-05-21 08:09:56] [INFO ] Computed 24 invariants in 2 ms
[2024-05-21 08:09:56] [INFO ] Implicit Places using invariants in 112 ms returned []
[2024-05-21 08:09:56] [INFO ] Invariant cache hit.
[2024-05-21 08:09:56] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-21 08:09:57] [INFO ] Implicit Places using invariants and state equation in 204 ms returned []
Implicit Place search using SMT with State Equation took 318 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 93/381 places, 76/371 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 824 ms. Remains : 93/381 places, 76/371 transitions.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Running random walk in product with property : AutoFlight-PT-05b-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (NEQ s52 1) (OR (EQ s1 0) (EQ s44 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 4185 reset in 267 ms.
Product exploration explored 100000 steps with 4161 reset in 382 ms.
Computed a total of 10 stabilizing places and 3 stable transitions
Computed a total of 10 stabilizing places and 3 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 1 factoid took 172 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 192 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Support contains 3 out of 93 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 93/93 places, 76/76 transitions.
Applied a total of 0 rules in 3 ms. Remains 93 /93 variables (removed 0) and now considering 76/76 (removed 0) transitions.
[2024-05-21 08:09:58] [INFO ] Invariant cache hit.
[2024-05-21 08:09:58] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-05-21 08:09:58] [INFO ] Invariant cache hit.
[2024-05-21 08:09:58] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-21 08:09:58] [INFO ] Implicit Places using invariants and state equation in 216 ms returned []
Implicit Place search using SMT with State Equation took 309 ms to find 0 implicit places.
[2024-05-21 08:09:58] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-21 08:09:58] [INFO ] Invariant cache hit.
[2024-05-21 08:09:58] [INFO ] Dead Transitions using invariants and state equation in 91 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 414 ms. Remains : 93/93 places, 76/76 transitions.
Computed a total of 10 stabilizing places and 3 stable transitions
Computed a total of 10 stabilizing places and 3 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 1 factoid took 194 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 228 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Product exploration explored 100000 steps with 4160 reset in 183 ms.
Product exploration explored 100000 steps with 4162 reset in 451 ms.
Built C files in :
/tmp/ltsmin13477032778959824171
[2024-05-21 08:10:00] [INFO ] Computing symmetric may disable matrix : 76 transitions.
[2024-05-21 08:10:00] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 08:10:00] [INFO ] Computing symmetric may enable matrix : 76 transitions.
[2024-05-21 08:10:00] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 08:10:00] [INFO ] Computing Do-Not-Accords matrix : 76 transitions.
[2024-05-21 08:10:00] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 08:10:00] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13477032778959824171
Running compilation step : cd /tmp/ltsmin13477032778959824171;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 435 ms.
Running link step : cd /tmp/ltsmin13477032778959824171;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 53 ms.
Running LTSmin : cd /tmp/ltsmin13477032778959824171;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11847128205001477299.hoa' '--buchi-type=spotba'
LTSmin run took 3247 ms.
FORMULA AutoFlight-PT-05b-LTLCardinality-11 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property AutoFlight-PT-05b-LTLCardinality-11 finished in 7551 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 381 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 381/381 places, 371/371 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 377 transition count 367
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 377 transition count 367
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 10 place count 377 transition count 365
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 12 place count 375 transition count 363
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 375 transition count 363
Applied a total of 14 rules in 21 ms. Remains 375 /381 variables (removed 6) and now considering 363/371 (removed 8) transitions.
// Phase 1: matrix 363 rows 375 cols
[2024-05-21 08:10:03] [INFO ] Computed 34 invariants in 3 ms
[2024-05-21 08:10:03] [INFO ] Implicit Places using invariants in 157 ms returned []
[2024-05-21 08:10:03] [INFO ] Invariant cache hit.
[2024-05-21 08:10:04] [INFO ] Implicit Places using invariants and state equation in 340 ms returned []
Implicit Place search using SMT with State Equation took 504 ms to find 0 implicit places.
[2024-05-21 08:10:04] [INFO ] Invariant cache hit.
[2024-05-21 08:10:04] [INFO ] Dead Transitions using invariants and state equation in 458 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 375/381 places, 363/371 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 990 ms. Remains : 375/381 places, 363/371 transitions.
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-05b-LTLCardinality-12 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 s124 0) (EQ s297 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 407 ms.
Product exploration explored 100000 steps with 50000 reset in 416 ms.
Computed a total of 91 stabilizing places and 91 stable transitions
Computed a total of 91 stabilizing places and 91 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 15 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-05b-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutoFlight-PT-05b-LTLCardinality-12 finished in 1934 ms.
All properties solved by simple procedures.
Total runtime 24389 ms.

BK_STOP 1716279006988

--------------------
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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /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-05b"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is AutoFlight-PT-05b, 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 r043-smll-171620180100082"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/AutoFlight-PT-05b.tgz
mv AutoFlight-PT-05b 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 ;