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-171620180100102.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-12b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r043-smll-171620180100102
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 712K
-rw-r--r-- 1 mcc users 9.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 106K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K 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 May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 15:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 17:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.8K Apr 12 22:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 87K Apr 12 22:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Apr 12 22:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Apr 12 22:11 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 266K 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-12b-LTLCardinality-00
FORMULA_NAME AutoFlight-PT-12b-LTLCardinality-01
FORMULA_NAME AutoFlight-PT-12b-LTLCardinality-02
FORMULA_NAME AutoFlight-PT-12b-LTLCardinality-03
FORMULA_NAME AutoFlight-PT-12b-LTLCardinality-04
FORMULA_NAME AutoFlight-PT-12b-LTLCardinality-05
FORMULA_NAME AutoFlight-PT-12b-LTLCardinality-06
FORMULA_NAME AutoFlight-PT-12b-LTLCardinality-07
FORMULA_NAME AutoFlight-PT-12b-LTLCardinality-08
FORMULA_NAME AutoFlight-PT-12b-LTLCardinality-09
FORMULA_NAME AutoFlight-PT-12b-LTLCardinality-10
FORMULA_NAME AutoFlight-PT-12b-LTLCardinality-11
FORMULA_NAME AutoFlight-PT-12b-LTLCardinality-12
FORMULA_NAME AutoFlight-PT-12b-LTLCardinality-13
FORMULA_NAME AutoFlight-PT-12b-LTLCardinality-14
FORMULA_NAME AutoFlight-PT-12b-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716284809718

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-12b
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-21 09:46:52] [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 09:46:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 09:46:53] [INFO ] Load time of PNML (sax parser for PT used): 277 ms
[2024-05-21 09:46:53] [INFO ] Transformed 1126 places.
[2024-05-21 09:46:53] [INFO ] Transformed 1124 transitions.
[2024-05-21 09:46:53] [INFO ] Found NUPN structural information;
[2024-05-21 09:46:53] [INFO ] Parsed PT model containing 1126 places and 1124 transitions and 2618 arcs in 426 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA AutoFlight-PT-12b-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-12b-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-12b-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-12b-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-12b-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-12b-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-12b-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-12b-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 26 out of 1126 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1126/1126 places, 1124/1124 transitions.
Discarding 153 places :
Symmetric choice reduction at 0 with 153 rule applications. Total rules 153 place count 973 transition count 971
Iterating global reduction 0 with 153 rules applied. Total rules applied 306 place count 973 transition count 971
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 330 place count 973 transition count 947
Discarding 66 places :
Symmetric choice reduction at 1 with 66 rule applications. Total rules 396 place count 907 transition count 881
Iterating global reduction 1 with 66 rules applied. Total rules applied 462 place count 907 transition count 881
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 474 place count 895 transition count 869
Iterating global reduction 1 with 12 rules applied. Total rules applied 486 place count 895 transition count 869
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 497 place count 884 transition count 858
Iterating global reduction 1 with 11 rules applied. Total rules applied 508 place count 884 transition count 858
Applied a total of 508 rules in 795 ms. Remains 884 /1126 variables (removed 242) and now considering 858/1124 (removed 266) transitions.
// Phase 1: matrix 858 rows 884 cols
[2024-05-21 09:46:54] [INFO ] Computed 76 invariants in 28 ms
[2024-05-21 09:46:55] [INFO ] Implicit Places using invariants in 1171 ms returned []
[2024-05-21 09:46:55] [INFO ] Invariant cache hit.
[2024-05-21 09:46:56] [INFO ] Implicit Places using invariants and state equation in 1291 ms returned []
Implicit Place search using SMT with State Equation took 2553 ms to find 0 implicit places.
[2024-05-21 09:46:56] [INFO ] Invariant cache hit.
[2024-05-21 09:46:57] [INFO ] Dead Transitions using invariants and state equation in 1140 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 884/1126 places, 858/1124 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4491 ms. Remains : 884/1126 places, 858/1124 transitions.
Support contains 26 out of 884 places after structural reductions.
[2024-05-21 09:46:58] [INFO ] Flatten gal took : 128 ms
[2024-05-21 09:46:58] [INFO ] Flatten gal took : 67 ms
[2024-05-21 09:46:58] [INFO ] Input system was already deterministic with 858 transitions.
Incomplete random walk after 10000 steps, including 18 resets, run finished after 828 ms. (steps per millisecond=12 ) properties (out of 16) seen :7
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
[2024-05-21 09:46:59] [INFO ] Invariant cache hit.
[2024-05-21 09:47:00] [INFO ] After 410ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2024-05-21 09:47:00] [INFO ] [Nat]Absence check using 75 positive place invariants in 71 ms returned sat
[2024-05-21 09:47:00] [INFO ] [Nat]Absence check using 75 positive and 1 generalized place invariants in 5 ms returned sat
[2024-05-21 09:47:02] [INFO ] After 1086ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2024-05-21 09:47:02] [INFO ] Deduced a trap composed of 31 places in 501 ms of which 17 ms to minimize.
[2024-05-21 09:47:03] [INFO ] Deduced a trap composed of 66 places in 412 ms of which 2 ms to minimize.
[2024-05-21 09:47:03] [INFO ] Deduced a trap composed of 37 places in 205 ms of which 1 ms to minimize.
[2024-05-21 09:47:03] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1347 ms
[2024-05-21 09:47:04] [INFO ] Deduced a trap composed of 74 places in 322 ms of which 3 ms to minimize.
[2024-05-21 09:47:05] [INFO ] Deduced a trap composed of 123 places in 770 ms of which 2 ms to minimize.
[2024-05-21 09:47:05] [INFO ] Deduced a trap composed of 69 places in 325 ms of which 0 ms to minimize.
[2024-05-21 09:47:05] [INFO ] Deduced a trap composed of 140 places in 308 ms of which 2 ms to minimize.
[2024-05-21 09:47:06] [INFO ] Deduced a trap composed of 130 places in 350 ms of which 1 ms to minimize.
[2024-05-21 09:47:06] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2379 ms
[2024-05-21 09:47:06] [INFO ] After 5625ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 575 ms.
[2024-05-21 09:47:07] [INFO ] After 7035ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Fused 9 Parikh solutions to 8 different solutions.
Parikh walk visited 4 properties in 377 ms.
Support contains 7 out of 884 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 884/884 places, 858/858 transitions.
Drop transitions removed 307 transitions
Trivial Post-agglo rules discarded 307 transitions
Performed 307 trivial Post agglomeration. Transition count delta: 307
Iterating post reduction 0 with 307 rules applied. Total rules applied 307 place count 884 transition count 551
Reduce places removed 307 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 1 with 340 rules applied. Total rules applied 647 place count 577 transition count 518
Reduce places removed 22 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 25 rules applied. Total rules applied 672 place count 555 transition count 515
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 5 rules applied. Total rules applied 677 place count 552 transition count 513
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 678 place count 551 transition count 513
Performed 105 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 105 Pre rules applied. Total rules applied 678 place count 551 transition count 408
Deduced a syphon composed of 105 places in 3 ms
Reduce places removed 105 places and 0 transitions.
Iterating global reduction 5 with 210 rules applied. Total rules applied 888 place count 446 transition count 408
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 891 place count 443 transition count 405
Iterating global reduction 5 with 3 rules applied. Total rules applied 894 place count 443 transition count 405
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 894 place count 443 transition count 404
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 896 place count 442 transition count 404
Performed 171 Post agglomeration using F-continuation condition with reduction of 23 identical transitions.
Deduced a syphon composed of 171 places in 0 ms
Reduce places removed 171 places and 0 transitions.
Iterating global reduction 5 with 342 rules applied. Total rules applied 1238 place count 271 transition count 210
Renaming transitions due to excessive name length > 1024 char.
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 1239 place count 271 transition count 209
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 5 with 2 rules applied. Total rules applied 1241 place count 270 transition count 208
Free-agglomeration rule applied 48 times.
Iterating global reduction 5 with 48 rules applied. Total rules applied 1289 place count 270 transition count 160
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 5 with 48 rules applied. Total rules applied 1337 place count 222 transition count 160
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 1338 place count 221 transition count 159
Reduce places removed 56 places and 0 transitions.
Drop transitions removed 91 transitions
Trivial Post-agglo rules discarded 91 transitions
Performed 91 trivial Post agglomeration. Transition count delta: 91
Iterating post reduction 6 with 147 rules applied. Total rules applied 1485 place count 165 transition count 68
Reduce places removed 91 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 7 with 93 rules applied. Total rules applied 1578 place count 74 transition count 66
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 1580 place count 72 transition count 66
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 18 Pre rules applied. Total rules applied 1580 place count 72 transition count 48
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 9 with 36 rules applied. Total rules applied 1616 place count 54 transition count 48
Applied a total of 1616 rules in 369 ms. Remains 54 /884 variables (removed 830) and now considering 48/858 (removed 810) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 369 ms. Remains : 54/884 places, 48/858 transitions.
Finished random walk after 53 steps, including 0 resets, run visited all 5 properties in 3 ms. (steps per millisecond=17 )
Parikh walk visited 0 properties in 0 ms.
Computed a total of 218 stabilizing places and 218 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' '!(X(X(X((p0||G(!p1)||(!p1&&F(!p2)))))))'
Support contains 4 out of 884 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 884/884 places, 858/858 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 877 transition count 851
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 877 transition count 851
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 17 place count 874 transition count 848
Iterating global reduction 0 with 3 rules applied. Total rules applied 20 place count 874 transition count 848
Applied a total of 20 rules in 151 ms. Remains 874 /884 variables (removed 10) and now considering 848/858 (removed 10) transitions.
// Phase 1: matrix 848 rows 874 cols
[2024-05-21 09:47:08] [INFO ] Computed 76 invariants in 10 ms
[2024-05-21 09:47:09] [INFO ] Implicit Places using invariants in 658 ms returned []
[2024-05-21 09:47:09] [INFO ] Invariant cache hit.
[2024-05-21 09:47:10] [INFO ] Implicit Places using invariants and state equation in 1031 ms returned []
Implicit Place search using SMT with State Equation took 1695 ms to find 0 implicit places.
[2024-05-21 09:47:10] [INFO ] Invariant cache hit.
[2024-05-21 09:47:11] [INFO ] Dead Transitions using invariants and state equation in 1227 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 874/884 places, 848/858 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3075 ms. Remains : 874/884 places, 848/858 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 427 ms :[true, p2, (AND (NOT p0) p1), (AND p2 p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Running random walk in product with property : AutoFlight-PT-12b-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p2, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 p2), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 2}], [{ cond=true, acceptance={} source=5 dest: 4}], [{ cond=true, acceptance={} source=6 dest: 5}]], initial=6, aps=[p2:(OR (EQ s653 0) (EQ s538 1)), p0:(AND (EQ s538 0) (EQ s653 1)), p1:(OR (EQ s70 0) (EQ s865 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 2 ms.
FORMULA AutoFlight-PT-12b-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-12b-LTLCardinality-02 finished in 3642 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 2 out of 884 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 884/884 places, 858/858 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 877 transition count 851
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 877 transition count 851
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 17 place count 874 transition count 848
Iterating global reduction 0 with 3 rules applied. Total rules applied 20 place count 874 transition count 848
Applied a total of 20 rules in 199 ms. Remains 874 /884 variables (removed 10) and now considering 848/858 (removed 10) transitions.
// Phase 1: matrix 848 rows 874 cols
[2024-05-21 09:47:12] [INFO ] Computed 76 invariants in 15 ms
[2024-05-21 09:47:12] [INFO ] Implicit Places using invariants in 792 ms returned []
[2024-05-21 09:47:12] [INFO ] Invariant cache hit.
[2024-05-21 09:47:14] [INFO ] Implicit Places using invariants and state equation in 1228 ms returned []
Implicit Place search using SMT with State Equation took 2031 ms to find 0 implicit places.
[2024-05-21 09:47:14] [INFO ] Invariant cache hit.
[2024-05-21 09:47:15] [INFO ] Dead Transitions using invariants and state equation in 953 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 874/884 places, 848/858 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3195 ms. Remains : 874/884 places, 848/858 transitions.
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : AutoFlight-PT-12b-LTLCardinality-03 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 s474 0) (EQ s856 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 1060 ms.
Product exploration explored 100000 steps with 50000 reset in 1017 ms.
Computed a total of 210 stabilizing places and 210 stable transitions
Computed a total of 210 stabilizing places and 210 stable transitions
Knowledge obtained : [p0, (X p0), true]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 28 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-12b-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutoFlight-PT-12b-LTLCardinality-03 finished in 5430 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(G((p0||G(p1)))))'
Support contains 4 out of 884 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 884/884 places, 858/858 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 878 transition count 852
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 878 transition count 852
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 876 transition count 850
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 876 transition count 850
Applied a total of 16 rules in 118 ms. Remains 876 /884 variables (removed 8) and now considering 850/858 (removed 8) transitions.
// Phase 1: matrix 850 rows 876 cols
[2024-05-21 09:47:17] [INFO ] Computed 76 invariants in 9 ms
[2024-05-21 09:47:17] [INFO ] Implicit Places using invariants in 340 ms returned []
[2024-05-21 09:47:17] [INFO ] Invariant cache hit.
[2024-05-21 09:47:18] [INFO ] Implicit Places using invariants and state equation in 1178 ms returned []
Implicit Place search using SMT with State Equation took 1524 ms to find 0 implicit places.
[2024-05-21 09:47:18] [INFO ] Invariant cache hit.
[2024-05-21 09:47:19] [INFO ] Dead Transitions using invariants and state equation in 854 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 876/884 places, 850/858 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2498 ms. Remains : 876/884 places, 850/858 transitions.
Stuttering acceptance computed with spot in 179 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : AutoFlight-PT-12b-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(AND (NEQ s81 0) (NEQ s440 1)), p0:(AND (NEQ s238 0) (NEQ s295 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA AutoFlight-PT-12b-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-12b-LTLCardinality-05 finished in 2707 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)&&X(p1))))'
Support contains 3 out of 884 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 884/884 places, 858/858 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 876 transition count 850
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 876 transition count 850
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 20 place count 872 transition count 846
Iterating global reduction 0 with 4 rules applied. Total rules applied 24 place count 872 transition count 846
Applied a total of 24 rules in 152 ms. Remains 872 /884 variables (removed 12) and now considering 846/858 (removed 12) transitions.
// Phase 1: matrix 846 rows 872 cols
[2024-05-21 09:47:20] [INFO ] Computed 76 invariants in 11 ms
[2024-05-21 09:47:21] [INFO ] Implicit Places using invariants in 904 ms returned []
[2024-05-21 09:47:21] [INFO ] Invariant cache hit.
[2024-05-21 09:47:22] [INFO ] Implicit Places using invariants and state equation in 1046 ms returned []
Implicit Place search using SMT with State Equation took 1961 ms to find 0 implicit places.
[2024-05-21 09:47:22] [INFO ] Invariant cache hit.
[2024-05-21 09:47:23] [INFO ] Dead Transitions using invariants and state equation in 1099 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 872/884 places, 846/858 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3221 ms. Remains : 872/884 places, 846/858 transitions.
Stuttering acceptance computed with spot in 172 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : AutoFlight-PT-12b-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=p0, acceptance={0} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s737 0) (EQ s847 1)), p1:(EQ s153 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 514 reset in 479 ms.
Product exploration explored 100000 steps with 569 reset in 593 ms.
Computed a total of 210 stabilizing places and 210 stable transitions
Computed a total of 210 stabilizing places and 210 stable transitions
Detected a total of 210/872 stabilizing places and 210/846 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 138 ms. Reduced automaton from 3 states, 8 edges and 2 AP (stutter sensitive) to 3 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 228 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Incomplete random walk after 10000 steps, including 18 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-21 09:47:25] [INFO ] Invariant cache hit.
[2024-05-21 09:47:25] [INFO ] After 193ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 09:47:25] [INFO ] [Nat]Absence check using 75 positive place invariants in 52 ms returned sat
[2024-05-21 09:47:25] [INFO ] [Nat]Absence check using 75 positive and 1 generalized place invariants in 3 ms returned sat
[2024-05-21 09:47:26] [INFO ] After 498ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-21 09:47:26] [INFO ] After 588ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 44 ms.
[2024-05-21 09:47:26] [INFO ] After 927ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 167 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=83 )
Parikh walk visited 1 properties in 3 ms.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0)), (F (AND (NOT p1) p0)), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 8 factoid took 272 ms. Reduced automaton from 3 states, 8 edges and 2 AP (stutter sensitive) to 3 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 144 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 134 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 3 out of 872 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 872/872 places, 846/846 transitions.
Applied a total of 0 rules in 28 ms. Remains 872 /872 variables (removed 0) and now considering 846/846 (removed 0) transitions.
[2024-05-21 09:47:26] [INFO ] Invariant cache hit.
[2024-05-21 09:47:27] [INFO ] Implicit Places using invariants in 508 ms returned []
[2024-05-21 09:47:27] [INFO ] Invariant cache hit.
[2024-05-21 09:47:28] [INFO ] Implicit Places using invariants and state equation in 1081 ms returned []
Implicit Place search using SMT with State Equation took 1591 ms to find 0 implicit places.
[2024-05-21 09:47:28] [INFO ] Invariant cache hit.
[2024-05-21 09:47:29] [INFO ] Dead Transitions using invariants and state equation in 843 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2468 ms. Remains : 872/872 places, 846/846 transitions.
Computed a total of 210 stabilizing places and 210 stable transitions
Computed a total of 210 stabilizing places and 210 stable transitions
Detected a total of 210/872 stabilizing places and 210/846 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 138 ms. Reduced automaton from 3 states, 8 edges and 2 AP (stutter sensitive) to 3 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 135 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Incomplete random walk after 10000 steps, including 18 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-21 09:47:29] [INFO ] Invariant cache hit.
[2024-05-21 09:47:29] [INFO ] After 180ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 09:47:30] [INFO ] [Nat]Absence check using 75 positive place invariants in 63 ms returned sat
[2024-05-21 09:47:30] [INFO ] [Nat]Absence check using 75 positive and 1 generalized place invariants in 4 ms returned sat
[2024-05-21 09:47:30] [INFO ] After 647ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-21 09:47:30] [INFO ] After 737ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 52 ms.
[2024-05-21 09:47:30] [INFO ] After 1104ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 167 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=55 )
Parikh walk visited 1 properties in 2 ms.
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0)), (F (AND (NOT p1) p0)), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 8 factoid took 347 ms. Reduced automaton from 3 states, 8 edges and 2 AP (stutter sensitive) to 3 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 145 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 163 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 137 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 524 reset in 254 ms.
Product exploration explored 100000 steps with 544 reset in 291 ms.
Built C files in :
/tmp/ltsmin15113431135229978718
[2024-05-21 09:47:32] [INFO ] Built C files in 43ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15113431135229978718
Running compilation step : cd /tmp/ltsmin15113431135229978718;'/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 2513 ms.
Running link step : cd /tmp/ltsmin15113431135229978718;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 53 ms.
Running LTSmin : cd /tmp/ltsmin15113431135229978718;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased17099106689863878829.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 872 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 872/872 places, 846/846 transitions.
Applied a total of 0 rules in 31 ms. Remains 872 /872 variables (removed 0) and now considering 846/846 (removed 0) transitions.
[2024-05-21 09:47:47] [INFO ] Invariant cache hit.
[2024-05-21 09:47:48] [INFO ] Implicit Places using invariants in 429 ms returned []
[2024-05-21 09:47:48] [INFO ] Invariant cache hit.
[2024-05-21 09:47:49] [INFO ] Implicit Places using invariants and state equation in 1164 ms returned []
Implicit Place search using SMT with State Equation took 1597 ms to find 0 implicit places.
[2024-05-21 09:47:49] [INFO ] Invariant cache hit.
[2024-05-21 09:47:50] [INFO ] Dead Transitions using invariants and state equation in 1158 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2789 ms. Remains : 872/872 places, 846/846 transitions.
Built C files in :
/tmp/ltsmin5754424923261462996
[2024-05-21 09:47:50] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5754424923261462996
Running compilation step : cd /tmp/ltsmin5754424923261462996;'/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 2464 ms.
Running link step : cd /tmp/ltsmin5754424923261462996;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 51 ms.
Running LTSmin : cd /tmp/ltsmin5754424923261462996;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased9892775040334381127.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 09:48:05] [INFO ] Flatten gal took : 50 ms
[2024-05-21 09:48:05] [INFO ] Flatten gal took : 41 ms
[2024-05-21 09:48:05] [INFO ] Time to serialize gal into /tmp/LTL1299846193420100849.gal : 12 ms
[2024-05-21 09:48:05] [INFO ] Time to serialize properties into /tmp/LTL9612238291006852254.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1299846193420100849.gal' '-t' 'CGAL' '-hoa' '/tmp/aut388865129942940516.hoa' '-atoms' '/tmp/LTL9612238291006852254.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...316
Loading property file /tmp/LTL9612238291006852254.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut388865129942940516.hoa
Detected timeout of ITS tools.
[2024-05-21 09:48:20] [INFO ] Flatten gal took : 37 ms
[2024-05-21 09:48:20] [INFO ] Flatten gal took : 36 ms
[2024-05-21 09:48:20] [INFO ] Time to serialize gal into /tmp/LTL16552256297237087133.gal : 6 ms
[2024-05-21 09:48:20] [INFO ] Time to serialize properties into /tmp/LTL13126916235296656828.ltl : 6 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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16552256297237087133.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13126916235296656828.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F((G("((p983==0)||(p1100==1))"))&&(X("(p214==0)")))))
Formula 0 simplified : G(F!"((p983==0)||(p1100==1))" | X!"(p214==0)")
Detected timeout of ITS tools.
[2024-05-21 09:48:35] [INFO ] Flatten gal took : 34 ms
[2024-05-21 09:48:36] [INFO ] Applying decomposition
[2024-05-21 09:48:36] [INFO ] Flatten gal took : 29 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph6129481587102308160.txt' '-o' '/tmp/graph6129481587102308160.bin' '-w' '/tmp/graph6129481587102308160.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph6129481587102308160.bin' '-l' '-1' '-v' '-w' '/tmp/graph6129481587102308160.weights' '-q' '0' '-e' '0.001'
[2024-05-21 09:48:36] [INFO ] Decomposing Gal with order
[2024-05-21 09:48:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 09:48:36] [INFO ] Removed a total of 171 redundant transitions.
[2024-05-21 09:48:36] [INFO ] Flatten gal took : 206 ms
[2024-05-21 09:48:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 13 ms.
[2024-05-21 09:48:36] [INFO ] Time to serialize gal into /tmp/LTL6201596076392992015.gal : 26 ms
[2024-05-21 09:48:36] [INFO ] Time to serialize properties into /tmp/LTL15897808125744534820.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6201596076392992015.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15897808125744534820.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F((G("((i22.i1.i1.u314.p983==0)||(i19.i2.i1.u363.p1100==1))"))&&(X("(i12.u66.p214==0)")))))
Formula 0 simplified : G(F!"((i22.i1.i1.u314.p983==0)||(i19.i2.i1.u363.p1100==1))" | X!"(i12.u66.p214==0)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11803875738646376239
[2024-05-21 09:48:51] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11803875738646376239
Running compilation step : cd /tmp/ltsmin11803875738646376239;'/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 1965 ms.
Running link step : cd /tmp/ltsmin11803875738646376239;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin11803875738646376239;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(([]((LTLAPp0==true))&&X((LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property AutoFlight-PT-12b-LTLCardinality-08 finished in 106902 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((G((p1||X(p2)))&&p0)))'
Support contains 5 out of 884 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 884/884 places, 858/858 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 878 transition count 852
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 878 transition count 852
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 16 place count 874 transition count 848
Iterating global reduction 0 with 4 rules applied. Total rules applied 20 place count 874 transition count 848
Applied a total of 20 rules in 92 ms. Remains 874 /884 variables (removed 10) and now considering 848/858 (removed 10) transitions.
// Phase 1: matrix 848 rows 874 cols
[2024-05-21 09:49:07] [INFO ] Computed 76 invariants in 9 ms
[2024-05-21 09:49:07] [INFO ] Implicit Places using invariants in 464 ms returned []
[2024-05-21 09:49:07] [INFO ] Invariant cache hit.
[2024-05-21 09:49:08] [INFO ] Implicit Places using invariants and state equation in 1366 ms returned []
Implicit Place search using SMT with State Equation took 1832 ms to find 0 implicit places.
[2024-05-21 09:49:08] [INFO ] Invariant cache hit.
[2024-05-21 09:49:09] [INFO ] Dead Transitions using invariants and state equation in 1035 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 874/884 places, 848/858 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2962 ms. Remains : 874/884 places, 848/858 transitions.
Stuttering acceptance computed with spot in 236 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p2), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : AutoFlight-PT-12b-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND p0 p1), acceptance={} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 2}, { cond=(AND p1 p2), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=(NOT p1), acceptance={} source=4 dest: 2}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=3, aps=[p0:(AND (EQ s157 1) (OR (EQ s854 0) (EQ s773 1))), p1:(AND (EQ s39 0) (EQ s478 1)), p2:(AND (EQ s773 0) (EQ s854 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-12b-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-12b-LTLCardinality-09 finished in 3238 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(p0))'
Support contains 1 out of 884 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 884/884 places, 858/858 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 315 transitions
Trivial Post-agglo rules discarded 315 transitions
Performed 315 trivial Post agglomeration. Transition count delta: 315
Iterating post reduction 0 with 315 rules applied. Total rules applied 315 place count 883 transition count 542
Reduce places removed 315 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 1 with 351 rules applied. Total rules applied 666 place count 568 transition count 506
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 2 with 24 rules applied. Total rules applied 690 place count 544 transition count 506
Performed 104 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 104 Pre rules applied. Total rules applied 690 place count 544 transition count 402
Deduced a syphon composed of 104 places in 1 ms
Reduce places removed 104 places and 0 transitions.
Iterating global reduction 3 with 208 rules applied. Total rules applied 898 place count 440 transition count 402
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 903 place count 435 transition count 397
Iterating global reduction 3 with 5 rules applied. Total rules applied 908 place count 435 transition count 397
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 908 place count 435 transition count 395
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 912 place count 433 transition count 395
Performed 171 Post agglomeration using F-continuation condition with reduction of 24 identical transitions.
Deduced a syphon composed of 171 places in 0 ms
Reduce places removed 171 places and 0 transitions.
Iterating global reduction 3 with 342 rules applied. Total rules applied 1254 place count 262 transition count 200
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1255 place count 261 transition count 199
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 3 with 11 rules applied. Total rules applied 1266 place count 253 transition count 196
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 1269 place count 250 transition count 196
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 5 Pre rules applied. Total rules applied 1269 place count 250 transition count 191
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 1279 place count 245 transition count 191
Applied a total of 1279 rules in 110 ms. Remains 245 /884 variables (removed 639) and now considering 191/858 (removed 667) transitions.
// Phase 1: matrix 191 rows 245 cols
[2024-05-21 09:49:10] [INFO ] Computed 68 invariants in 2 ms
[2024-05-21 09:49:10] [INFO ] Implicit Places using invariants in 301 ms returned [103, 141, 179, 185, 191, 197, 203, 209, 215, 221, 226, 231, 235, 239, 244]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 304 ms to find 15 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 230/884 places, 191/858 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 217 transition count 178
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 217 transition count 178
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 216 transition count 177
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 216 transition count 177
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 215 transition count 176
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 215 transition count 176
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 214 transition count 175
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 214 transition count 175
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 213 transition count 174
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 213 transition count 174
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 212 transition count 173
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 212 transition count 173
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 211 transition count 172
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 211 transition count 172
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 210 transition count 171
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 210 transition count 171
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 209 transition count 170
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 209 transition count 170
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 208 transition count 169
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 208 transition count 169
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 207 transition count 168
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 207 transition count 168
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 206 transition count 167
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 206 transition count 167
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 205 transition count 166
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 205 transition count 166
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 52 place count 204 transition count 165
Applied a total of 52 rules in 93 ms. Remains 204 /230 variables (removed 26) and now considering 165/191 (removed 26) transitions.
// Phase 1: matrix 165 rows 204 cols
[2024-05-21 09:49:10] [INFO ] Computed 53 invariants in 2 ms
[2024-05-21 09:49:10] [INFO ] Implicit Places using invariants in 279 ms returned []
[2024-05-21 09:49:10] [INFO ] Invariant cache hit.
[2024-05-21 09:49:11] [INFO ] State equation strengthened by 52 read => feed constraints.
[2024-05-21 09:49:11] [INFO ] Implicit Places using invariants and state equation in 706 ms returned [85, 87, 89, 91, 93, 95, 97]
Discarding 7 places :
Implicit Place search using SMT with State Equation took 987 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 197/884 places, 165/858 transitions.
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 7 Pre rules applied. Total rules applied 0 place count 197 transition count 158
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 190 transition count 158
Applied a total of 14 rules in 15 ms. Remains 190 /197 variables (removed 7) and now considering 158/165 (removed 7) transitions.
// Phase 1: matrix 158 rows 190 cols
[2024-05-21 09:49:11] [INFO ] Computed 46 invariants in 9 ms
[2024-05-21 09:49:11] [INFO ] Implicit Places using invariants in 251 ms returned []
[2024-05-21 09:49:11] [INFO ] Invariant cache hit.
[2024-05-21 09:49:12] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-05-21 09:49:12] [INFO ] Implicit Places using invariants and state equation in 610 ms returned []
Implicit Place search using SMT with State Equation took 863 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 190/884 places, 158/858 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 2374 ms. Remains : 190/884 places, 158/858 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Running random walk in product with property : AutoFlight-PT-12b-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s92 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 33725 reset in 764 ms.
Product exploration explored 100000 steps with 33687 reset in 802 ms.
Computed a total of 12 stabilizing places and 3 stable transitions
Computed a total of 12 stabilizing places and 3 stable transitions
Detected a total of 12/190 stabilizing places and 3/158 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 237 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 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 : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 240 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
[2024-05-21 09:49:14] [INFO ] Invariant cache hit.
[2024-05-21 09:49:14] [INFO ] [Real]Absence check using 46 positive place invariants in 28 ms returned sat
[2024-05-21 09:49:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 09:49:15] [INFO ] [Real]Absence check using state equation in 277 ms returned sat
[2024-05-21 09:49:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 09:49:15] [INFO ] [Nat]Absence check using 46 positive place invariants in 25 ms returned sat
[2024-05-21 09:49:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 09:49:15] [INFO ] [Nat]Absence check using state equation in 262 ms returned sat
[2024-05-21 09:49:15] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-05-21 09:49:15] [INFO ] [Nat]Added 45 Read/Feed constraints in 18 ms returned sat
[2024-05-21 09:49:15] [INFO ] Computed and/alt/rep : 143/358/143 causal constraints (skipped 0 transitions) in 20 ms.
[2024-05-21 09:49:15] [INFO ] Added : 0 causal constraints over 0 iterations in 62 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 190 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 190/190 places, 158/158 transitions.
Applied a total of 0 rules in 11 ms. Remains 190 /190 variables (removed 0) and now considering 158/158 (removed 0) transitions.
[2024-05-21 09:49:15] [INFO ] Invariant cache hit.
[2024-05-21 09:49:16] [INFO ] Implicit Places using invariants in 186 ms returned []
[2024-05-21 09:49:16] [INFO ] Invariant cache hit.
[2024-05-21 09:49:16] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-05-21 09:49:16] [INFO ] Implicit Places using invariants and state equation in 696 ms returned []
Implicit Place search using SMT with State Equation took 889 ms to find 0 implicit places.
[2024-05-21 09:49:16] [INFO ] Redundant transitions in 6 ms returned []
[2024-05-21 09:49:16] [INFO ] Invariant cache hit.
[2024-05-21 09:49:17] [INFO ] Dead Transitions using invariants and state equation in 274 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1189 ms. Remains : 190/190 places, 158/158 transitions.
Computed a total of 12 stabilizing places and 3 stable transitions
Computed a total of 12 stabilizing places and 3 stable transitions
Detected a total of 12/190 stabilizing places and 3/158 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 306 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Finished random walk after 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 : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 277 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
[2024-05-21 09:49:17] [INFO ] Invariant cache hit.
[2024-05-21 09:49:18] [INFO ] [Real]Absence check using 46 positive place invariants in 29 ms returned sat
[2024-05-21 09:49:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 09:49:18] [INFO ] [Real]Absence check using state equation in 263 ms returned sat
[2024-05-21 09:49:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 09:49:18] [INFO ] [Nat]Absence check using 46 positive place invariants in 26 ms returned sat
[2024-05-21 09:49:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 09:49:18] [INFO ] [Nat]Absence check using state equation in 247 ms returned sat
[2024-05-21 09:49:18] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-05-21 09:49:18] [INFO ] [Nat]Added 45 Read/Feed constraints in 16 ms returned sat
[2024-05-21 09:49:18] [INFO ] Computed and/alt/rep : 143/358/143 causal constraints (skipped 0 transitions) in 20 ms.
[2024-05-21 09:49:18] [INFO ] Added : 0 causal constraints over 0 iterations in 64 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 55 ms :[(NOT p0)]
Product exploration explored 100000 steps with 33709 reset in 985 ms.
Product exploration explored 100000 steps with 33694 reset in 793 ms.
Built C files in :
/tmp/ltsmin661412202860785819
[2024-05-21 09:49:20] [INFO ] Computing symmetric may disable matrix : 158 transitions.
[2024-05-21 09:49:20] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 09:49:20] [INFO ] Computing symmetric may enable matrix : 158 transitions.
[2024-05-21 09:49:20] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 09:49:20] [INFO ] Computing Do-Not-Accords matrix : 158 transitions.
[2024-05-21 09:49:20] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 09:49:20] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin661412202860785819
Running compilation step : cd /tmp/ltsmin661412202860785819;'/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 484 ms.
Running link step : cd /tmp/ltsmin661412202860785819;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin661412202860785819;'/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/stateBased18028465104285748549.hoa' '--buchi-type=spotba'
LTSmin run took 409 ms.
FORMULA AutoFlight-PT-12b-LTLCardinality-10 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property AutoFlight-PT-12b-LTLCardinality-10 finished in 11516 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(X(X(X(X(F(p0))))))))'
Support contains 1 out of 884 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 884/884 places, 858/858 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 876 transition count 850
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 876 transition count 850
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 19 place count 873 transition count 847
Iterating global reduction 0 with 3 rules applied. Total rules applied 22 place count 873 transition count 847
Applied a total of 22 rules in 118 ms. Remains 873 /884 variables (removed 11) and now considering 847/858 (removed 11) transitions.
// Phase 1: matrix 847 rows 873 cols
[2024-05-21 09:49:21] [INFO ] Computed 76 invariants in 3 ms
[2024-05-21 09:49:22] [INFO ] Implicit Places using invariants in 702 ms returned []
[2024-05-21 09:49:22] [INFO ] Invariant cache hit.
[2024-05-21 09:49:23] [INFO ] Implicit Places using invariants and state equation in 1335 ms returned []
Implicit Place search using SMT with State Equation took 2051 ms to find 0 implicit places.
[2024-05-21 09:49:23] [INFO ] Invariant cache hit.
[2024-05-21 09:49:25] [INFO ] Dead Transitions using invariants and state equation in 1211 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 873/884 places, 847/858 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3381 ms. Remains : 873/884 places, 847/858 transitions.
Stuttering acceptance computed with spot in 345 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-12b-LTLCardinality-11 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}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}], [{ cond=true, acceptance={} source=6 dest: 5}]], initial=6, aps=[p0:(EQ s82 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 14285 reset in 603 ms.
Product exploration explored 100000 steps with 14285 reset in 525 ms.
Computed a total of 211 stabilizing places and 211 stable transitions
Computed a total of 211 stabilizing places and 211 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 129 ms. Reduced automaton from 7 states, 7 edges and 1 AP (stutter sensitive) to 7 states, 7 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 321 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 18 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 306360 steps, run timeout after 3001 ms. (steps per millisecond=102 ) properties seen :{}
Probabilistic random walk after 306360 steps, saw 81055 distinct states, run finished after 3005 ms. (steps per millisecond=101 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-21 09:49:30] [INFO ] Invariant cache hit.
[2024-05-21 09:49:30] [INFO ] After 193ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 09:49:30] [INFO ] [Nat]Absence check using 75 positive place invariants in 96 ms returned sat
[2024-05-21 09:49:30] [INFO ] [Nat]Absence check using 75 positive and 1 generalized place invariants in 4 ms returned sat
[2024-05-21 09:49:31] [INFO ] After 686ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-21 09:49:31] [INFO ] After 788ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 50 ms.
[2024-05-21 09:49:31] [INFO ] After 1158ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 469 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=156 )
Parikh walk visited 1 properties in 4 ms.
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 119 ms. Reduced automaton from 7 states, 7 edges and 1 AP (stutter sensitive) to 7 states, 7 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 315 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 325 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 873 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 873/873 places, 847/847 transitions.
Applied a total of 0 rules in 28 ms. Remains 873 /873 variables (removed 0) and now considering 847/847 (removed 0) transitions.
[2024-05-21 09:49:32] [INFO ] Invariant cache hit.
[2024-05-21 09:49:32] [INFO ] Implicit Places using invariants in 548 ms returned []
[2024-05-21 09:49:32] [INFO ] Invariant cache hit.
[2024-05-21 09:49:34] [INFO ] Implicit Places using invariants and state equation in 1481 ms returned []
Implicit Place search using SMT with State Equation took 2031 ms to find 0 implicit places.
[2024-05-21 09:49:34] [INFO ] Invariant cache hit.
[2024-05-21 09:49:35] [INFO ] Dead Transitions using invariants and state equation in 1239 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3301 ms. Remains : 873/873 places, 847/847 transitions.
Computed a total of 211 stabilizing places and 211 stable transitions
Computed a total of 211 stabilizing places and 211 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 87 ms. Reduced automaton from 7 states, 7 edges and 1 AP (stutter sensitive) to 7 states, 7 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 314 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 17 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 325292 steps, run timeout after 3001 ms. (steps per millisecond=108 ) properties seen :{}
Probabilistic random walk after 325292 steps, saw 83908 distinct states, run finished after 3003 ms. (steps per millisecond=108 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-21 09:49:39] [INFO ] Invariant cache hit.
[2024-05-21 09:49:39] [INFO ] After 184ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 09:49:39] [INFO ] [Nat]Absence check using 75 positive place invariants in 82 ms returned sat
[2024-05-21 09:49:39] [INFO ] [Nat]Absence check using 75 positive and 1 generalized place invariants in 4 ms returned sat
[2024-05-21 09:49:40] [INFO ] After 731ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-21 09:49:40] [INFO ] After 844ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 56 ms.
[2024-05-21 09:49:40] [INFO ] After 1213ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 465 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=116 )
Parikh walk visited 1 properties in 4 ms.
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 137 ms. Reduced automaton from 7 states, 7 edges and 1 AP (stutter sensitive) to 7 states, 7 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 319 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 291 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 296 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 14285 reset in 512 ms.
Product exploration explored 100000 steps with 14285 reset in 487 ms.
Applying partial POR strategy [true, false, false, false, false, false, false]
Stuttering acceptance computed with spot in 296 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 873 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 873/873 places, 847/847 transitions.
Performed 278 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 278 rules applied. Total rules applied 278 place count 873 transition count 847
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 24 rules applied. Total rules applied 302 place count 873 transition count 835
Performed 114 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 114 Pre rules applied. Total rules applied 302 place count 873 transition count 835
Deduced a syphon composed of 404 places in 2 ms
Iterating global reduction 2 with 114 rules applied. Total rules applied 416 place count 873 transition count 835
Discarding 239 places :
Symmetric choice reduction at 2 with 239 rule applications. Total rules 655 place count 634 transition count 596
Deduced a syphon composed of 165 places in 2 ms
Iterating global reduction 2 with 239 rules applied. Total rules applied 894 place count 634 transition count 596
Performed 209 Post agglomeration using F-continuation condition with reduction of 24 identical transitions.
Deduced a syphon composed of 374 places in 0 ms
Iterating global reduction 2 with 209 rules applied. Total rules applied 1103 place count 634 transition count 572
Renaming transitions due to excessive name length > 1024 char.
Discarding 134 places :
Symmetric choice reduction at 2 with 134 rule applications. Total rules 1237 place count 500 transition count 438
Deduced a syphon composed of 240 places in 1 ms
Iterating global reduction 2 with 134 rules applied. Total rules applied 1371 place count 500 transition count 438
Deduced a syphon composed of 240 places in 1 ms
Applied a total of 1371 rules in 447 ms. Remains 500 /873 variables (removed 373) and now considering 438/847 (removed 409) transitions.
[2024-05-21 09:49:43] [INFO ] Redundant transitions in 47 ms returned []
// Phase 1: matrix 438 rows 500 cols
[2024-05-21 09:49:43] [INFO ] Computed 76 invariants in 10 ms
[2024-05-21 09:49:44] [INFO ] Dead Transitions using invariants and state equation in 544 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 500/873 places, 438/847 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1057 ms. Remains : 500/873 places, 438/847 transitions.
Built C files in :
/tmp/ltsmin3524595797180034235
[2024-05-21 09:49:44] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3524595797180034235
Running compilation step : cd /tmp/ltsmin3524595797180034235;'/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 2802 ms.
Running link step : cd /tmp/ltsmin3524595797180034235;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin3524595797180034235;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased8372942751351767424.hoa' '--buchi-type=spotba'
LTSmin run took 516 ms.
FORMULA AutoFlight-PT-12b-LTLCardinality-11 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property AutoFlight-PT-12b-LTLCardinality-11 finished in 25779 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' '!((G(X(G(F((!(p0 U p1)||X(p2))))))||G(X(p0))))'
Support contains 6 out of 884 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 884/884 places, 858/858 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 877 transition count 851
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 877 transition count 851
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 18 place count 873 transition count 847
Iterating global reduction 0 with 4 rules applied. Total rules applied 22 place count 873 transition count 847
Applied a total of 22 rules in 110 ms. Remains 873 /884 variables (removed 11) and now considering 847/858 (removed 11) transitions.
// Phase 1: matrix 847 rows 873 cols
[2024-05-21 09:49:47] [INFO ] Computed 76 invariants in 6 ms
[2024-05-21 09:49:48] [INFO ] Implicit Places using invariants in 541 ms returned []
[2024-05-21 09:49:48] [INFO ] Invariant cache hit.
[2024-05-21 09:49:49] [INFO ] Implicit Places using invariants and state equation in 1356 ms returned []
Implicit Place search using SMT with State Equation took 1903 ms to find 0 implicit places.
[2024-05-21 09:49:49] [INFO ] Invariant cache hit.
[2024-05-21 09:49:50] [INFO ] Dead Transitions using invariants and state equation in 1039 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 873/884 places, 847/858 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3054 ms. Remains : 873/884 places, 847/858 transitions.
Stuttering acceptance computed with spot in 326 ms :[(AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p2) p1), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Running random walk in product with property : AutoFlight-PT-12b-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s135 0) (EQ s573 1)), p2:(AND (EQ s446 0) (EQ s67 1)), p1:(OR (EQ s565 0) (EQ s704 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 182 reset in 690 ms.
Product exploration explored 100000 steps with 181 reset in 600 ms.
Computed a total of 211 stabilizing places and 211 stable transitions
Computed a total of 211 stabilizing places and 211 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) p1), (X p0), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (X (AND (NOT p2) p1))), true, (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 168 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 168 ms :[(AND (NOT p0) p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Incomplete random walk after 10000 steps, including 18 resets, run finished after 270 ms. (steps per millisecond=37 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-21 09:49:52] [INFO ] Invariant cache hit.
[2024-05-21 09:49:53] [INFO ] After 282ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-21 09:49:53] [INFO ] [Nat]Absence check using 75 positive place invariants in 71 ms returned sat
[2024-05-21 09:49:53] [INFO ] [Nat]Absence check using 75 positive and 1 generalized place invariants in 5 ms returned sat
[2024-05-21 09:49:54] [INFO ] After 940ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-21 09:49:55] [INFO ] Deduced a trap composed of 31 places in 402 ms of which 2 ms to minimize.
[2024-05-21 09:49:55] [INFO ] Deduced a trap composed of 68 places in 327 ms of which 1 ms to minimize.
[2024-05-21 09:49:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 923 ms
[2024-05-21 09:49:55] [INFO ] After 2241ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 203 ms.
[2024-05-21 09:49:56] [INFO ] After 2886ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Finished Parikh walk after 294 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=98 )
Parikh walk visited 3 properties in 24 ms.
Knowledge obtained : [(AND p0 (NOT p2) p1), (X p0), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (X (AND (NOT p2) p1))), true, (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p0) p1))))]
False Knowledge obtained : [(F (NOT (AND p1 (NOT p2)))), (F (NOT p0)), (F (AND (NOT p1) p0 (NOT p2))), (F (AND p1 (NOT p0) (NOT p2)))]
Knowledge based reduction with 8 factoid took 355 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 169 ms :[(AND (NOT p0) p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 197 ms :[(AND (NOT p0) p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Support contains 6 out of 873 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 873/873 places, 847/847 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 307 transitions
Trivial Post-agglo rules discarded 307 transitions
Performed 307 trivial Post agglomeration. Transition count delta: 307
Iterating post reduction 0 with 307 rules applied. Total rules applied 307 place count 872 transition count 539
Reduce places removed 307 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 1 with 343 rules applied. Total rules applied 650 place count 565 transition count 503
Reduce places removed 24 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 26 rules applied. Total rules applied 676 place count 541 transition count 501
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 678 place count 539 transition count 501
Performed 104 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 104 Pre rules applied. Total rules applied 678 place count 539 transition count 397
Deduced a syphon composed of 104 places in 2 ms
Reduce places removed 104 places and 0 transitions.
Iterating global reduction 4 with 208 rules applied. Total rules applied 886 place count 435 transition count 397
Performed 171 Post agglomeration using F-continuation condition with reduction of 23 identical transitions.
Deduced a syphon composed of 171 places in 0 ms
Reduce places removed 171 places and 0 transitions.
Iterating global reduction 4 with 342 rules applied. Total rules applied 1228 place count 264 transition count 203
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1229 place count 264 transition count 202
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1230 place count 263 transition count 201
Reduce places removed 23 places and 0 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 5 with 34 rules applied. Total rules applied 1264 place count 240 transition count 190
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 6 with 11 rules applied. Total rules applied 1275 place count 229 transition count 190
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 12 Pre rules applied. Total rules applied 1275 place count 229 transition count 178
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 7 with 24 rules applied. Total rules applied 1299 place count 217 transition count 178
Applied a total of 1299 rules in 112 ms. Remains 217 /873 variables (removed 656) and now considering 178/847 (removed 669) transitions.
// Phase 1: matrix 178 rows 217 cols
[2024-05-21 09:49:56] [INFO ] Computed 53 invariants in 1 ms
[2024-05-21 09:49:57] [INFO ] Implicit Places using invariants in 251 ms returned [88, 126, 164, 174, 178, 182, 186, 190, 194, 198, 203, 207, 211, 216]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 255 ms to find 14 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 203/873 places, 178/847 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 191 transition count 166
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 191 transition count 166
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 190 transition count 165
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 190 transition count 165
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 189 transition count 164
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 189 transition count 164
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 188 transition count 163
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 188 transition count 163
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 187 transition count 162
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 187 transition count 162
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 186 transition count 161
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 186 transition count 161
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 185 transition count 160
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 185 transition count 160
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 184 transition count 159
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 184 transition count 159
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 183 transition count 158
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 183 transition count 158
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 182 transition count 157
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 182 transition count 157
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 181 transition count 156
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 181 transition count 156
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 180 transition count 155
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 180 transition count 155
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 179 transition count 154
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 179 transition count 154
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 52 place count 177 transition count 152
Applied a total of 52 rules in 86 ms. Remains 177 /203 variables (removed 26) and now considering 152/178 (removed 26) transitions.
// Phase 1: matrix 152 rows 177 cols
[2024-05-21 09:49:57] [INFO ] Computed 39 invariants in 3 ms
[2024-05-21 09:49:57] [INFO ] Implicit Places using invariants in 174 ms returned []
[2024-05-21 09:49:57] [INFO ] Invariant cache hit.
[2024-05-21 09:49:57] [INFO ] Implicit Places using invariants and state equation in 330 ms returned []
Implicit Place search using SMT with State Equation took 510 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 177/873 places, 152/847 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 968 ms. Remains : 177/873 places, 152/847 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X p0), (X (NOT (AND (NOT p1) p0 (NOT p2)))), true, (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p1) p0 (NOT p2)))))]
False Knowledge obtained : [(X (AND p1 (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2)))))]
Knowledge based reduction with 8 factoid took 247 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 118 ms :[(AND (NOT p0) p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Finished random walk after 1074 steps, including 23 resets, run visited all 4 properties in 13 ms. (steps per millisecond=82 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X p0), (X (NOT (AND (NOT p1) p0 (NOT p2)))), true, (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p1) p0 (NOT p2)))))]
False Knowledge obtained : [(X (AND p1 (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (F (NOT (AND p1 (NOT p2)))), (F (NOT p0)), (F (AND (NOT p1) p0 (NOT p2))), (F (AND p1 (NOT p0) (NOT p2)))]
Knowledge based reduction with 8 factoid took 465 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 173 ms :[(AND (NOT p0) p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 168 ms :[(AND (NOT p0) p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 148 ms :[(AND (NOT p0) p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Stuttering criterion allowed to conclude after 8887 steps with 192 reset in 31 ms.
FORMULA AutoFlight-PT-12b-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-12b-LTLCardinality-15 finished in 11797 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)&&X(p1))))'
Found a Shortening insensitive property : AutoFlight-PT-12b-LTLCardinality-08
Stuttering acceptance computed with spot in 159 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 3 out of 884 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 884/884 places, 858/858 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 307 transitions
Trivial Post-agglo rules discarded 307 transitions
Performed 307 trivial Post agglomeration. Transition count delta: 307
Iterating post reduction 0 with 307 rules applied. Total rules applied 307 place count 883 transition count 550
Reduce places removed 307 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 1 with 343 rules applied. Total rules applied 650 place count 576 transition count 514
Reduce places removed 24 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 26 rules applied. Total rules applied 676 place count 552 transition count 512
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 678 place count 550 transition count 512
Performed 107 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 107 Pre rules applied. Total rules applied 678 place count 550 transition count 405
Deduced a syphon composed of 107 places in 1 ms
Reduce places removed 107 places and 0 transitions.
Iterating global reduction 4 with 214 rules applied. Total rules applied 892 place count 443 transition count 405
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 897 place count 438 transition count 400
Iterating global reduction 4 with 5 rules applied. Total rules applied 902 place count 438 transition count 400
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 902 place count 438 transition count 398
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 906 place count 436 transition count 398
Performed 169 Post agglomeration using F-continuation condition with reduction of 24 identical transitions.
Deduced a syphon composed of 169 places in 0 ms
Reduce places removed 169 places and 0 transitions.
Iterating global reduction 4 with 338 rules applied. Total rules applied 1244 place count 267 transition count 205
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1245 place count 266 transition count 204
Reduce places removed 22 places and 0 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 4 with 32 rules applied. Total rules applied 1277 place count 244 transition count 194
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 1287 place count 234 transition count 194
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 12 Pre rules applied. Total rules applied 1287 place count 234 transition count 182
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 6 with 24 rules applied. Total rules applied 1311 place count 222 transition count 182
Applied a total of 1311 rules in 107 ms. Remains 222 /884 variables (removed 662) and now considering 182/858 (removed 676) transitions.
// Phase 1: matrix 182 rows 222 cols
[2024-05-21 09:49:59] [INFO ] Computed 54 invariants in 2 ms
[2024-05-21 09:50:00] [INFO ] Implicit Places using invariants in 344 ms returned [90, 128, 166, 170, 174, 184, 188, 192, 196, 201, 206, 216, 221]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 346 ms to find 13 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 209/884 places, 182/858 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 198 transition count 171
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 198 transition count 171
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 197 transition count 170
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 197 transition count 170
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 196 transition count 169
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 196 transition count 169
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 195 transition count 168
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 195 transition count 168
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 194 transition count 167
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 194 transition count 167
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 193 transition count 166
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 193 transition count 166
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 192 transition count 165
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 192 transition count 165
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 191 transition count 164
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 191 transition count 164
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 190 transition count 163
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 190 transition count 163
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 189 transition count 162
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 189 transition count 162
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 188 transition count 161
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 188 transition count 161
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 187 transition count 160
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 187 transition count 160
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 186 transition count 159
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 186 transition count 159
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 52 place count 183 transition count 156
Applied a total of 52 rules in 59 ms. Remains 183 /209 variables (removed 26) and now considering 156/182 (removed 26) transitions.
// Phase 1: matrix 156 rows 183 cols
[2024-05-21 09:50:00] [INFO ] Computed 41 invariants in 1 ms
[2024-05-21 09:50:00] [INFO ] Implicit Places using invariants in 248 ms returned []
[2024-05-21 09:50:00] [INFO ] Invariant cache hit.
[2024-05-21 09:50:00] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 09:50:00] [INFO ] Implicit Places using invariants and state equation in 299 ms returned []
Implicit Place search using SMT with State Equation took 551 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 183/884 places, 156/858 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 1066 ms. Remains : 183/884 places, 156/858 transitions.
Running random walk in product with property : AutoFlight-PT-12b-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=p0, acceptance={0} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s160 0) (EQ s179 1)), p1:(EQ s29 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 4192 reset in 430 ms.
Product exploration explored 100000 steps with 4333 reset in 545 ms.
Computed a total of 8 stabilizing places and 6 stable transitions
Computed a total of 8 stabilizing places and 6 stable transitions
Detected a total of 8/183 stabilizing places and 6/156 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 3 factoid took 413 ms. Reduced automaton from 3 states, 8 edges and 2 AP (stutter sensitive) to 3 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 157 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 82 steps, including 1 resets, run visited all 3 properties in 1 ms. (steps per millisecond=82 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (NOT p0)), (F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 591 ms. Reduced automaton from 3 states, 8 edges and 2 AP (stutter sensitive) to 3 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 164 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 164 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 3 out of 183 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 183/183 places, 156/156 transitions.
Applied a total of 0 rules in 2 ms. Remains 183 /183 variables (removed 0) and now considering 156/156 (removed 0) transitions.
[2024-05-21 09:50:03] [INFO ] Invariant cache hit.
[2024-05-21 09:50:03] [INFO ] Implicit Places using invariants in 195 ms returned []
[2024-05-21 09:50:03] [INFO ] Invariant cache hit.
[2024-05-21 09:50:03] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 09:50:03] [INFO ] Implicit Places using invariants and state equation in 425 ms returned []
Implicit Place search using SMT with State Equation took 636 ms to find 0 implicit places.
[2024-05-21 09:50:03] [INFO ] Invariant cache hit.
[2024-05-21 09:50:04] [INFO ] Dead Transitions using invariants and state equation in 245 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 884 ms. Remains : 183/183 places, 156/156 transitions.
Computed a total of 8 stabilizing places and 6 stable transitions
Computed a total of 8 stabilizing places and 6 stable transitions
Detected a total of 8/183 stabilizing places and 6/156 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 3 factoid took 518 ms. Reduced automaton from 3 states, 8 edges and 2 AP (stutter sensitive) to 3 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 160 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 35 steps, including 0 resets, run visited all 3 properties in 3 ms. (steps per millisecond=11 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (NOT p0)), (F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 738 ms. Reduced automaton from 3 states, 8 edges and 2 AP (stutter sensitive) to 3 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 163 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 161 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 166 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 4186 reset in 520 ms.
Product exploration explored 100000 steps with 4305 reset in 509 ms.
Built C files in :
/tmp/ltsmin7948468942741144953
[2024-05-21 09:50:07] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7948468942741144953
Running compilation step : cd /tmp/ltsmin7948468942741144953;'/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 588 ms.
Running link step : cd /tmp/ltsmin7948468942741144953;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin7948468942741144953;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased3617361335275430330.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 183 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 183/183 places, 156/156 transitions.
Applied a total of 0 rules in 1 ms. Remains 183 /183 variables (removed 0) and now considering 156/156 (removed 0) transitions.
[2024-05-21 09:50:22] [INFO ] Invariant cache hit.
[2024-05-21 09:50:22] [INFO ] Implicit Places using invariants in 200 ms returned []
[2024-05-21 09:50:22] [INFO ] Invariant cache hit.
[2024-05-21 09:50:22] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 09:50:22] [INFO ] Implicit Places using invariants and state equation in 373 ms returned []
Implicit Place search using SMT with State Equation took 578 ms to find 0 implicit places.
[2024-05-21 09:50:22] [INFO ] Invariant cache hit.
[2024-05-21 09:50:23] [INFO ] Dead Transitions using invariants and state equation in 235 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 816 ms. Remains : 183/183 places, 156/156 transitions.
Built C files in :
/tmp/ltsmin6974563400034995423
[2024-05-21 09:50:23] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6974563400034995423
Running compilation step : cd /tmp/ltsmin6974563400034995423;'/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 606 ms.
Running link step : cd /tmp/ltsmin6974563400034995423;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin6974563400034995423;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased3384897059541040701.hoa' '--buchi-type=spotba'
LTSmin run took 8274 ms.
Treatment of property AutoFlight-PT-12b-LTLCardinality-08 finished in 32948 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
[2024-05-21 09:50:32] [INFO ] Flatten gal took : 31 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin3388192024769464786
[2024-05-21 09:50:32] [INFO ] Computing symmetric may disable matrix : 858 transitions.
[2024-05-21 09:50:32] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 09:50:32] [INFO ] Computing symmetric may enable matrix : 858 transitions.
[2024-05-21 09:50:32] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 09:50:32] [INFO ] Applying decomposition
[2024-05-21 09:50:32] [INFO ] Flatten gal took : 34 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph11802943156807007181.txt' '-o' '/tmp/graph11802943156807007181.bin' '-w' '/tmp/graph11802943156807007181.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph11802943156807007181.bin' '-l' '-1' '-v' '-w' '/tmp/graph11802943156807007181.weights' '-q' '0' '-e' '0.001'
[2024-05-21 09:50:32] [INFO ] Decomposing Gal with order
[2024-05-21 09:50:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 09:50:32] [INFO ] Computing Do-Not-Accords matrix : 858 transitions.
[2024-05-21 09:50:32] [INFO ] Computation of Completed DNA matrix. took 60 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 09:50:32] [INFO ] Removed a total of 166 redundant transitions.
[2024-05-21 09:50:32] [INFO ] Built C files in 296ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3388192024769464786
Running compilation step : cd /tmp/ltsmin3388192024769464786;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '720' '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'
[2024-05-21 09:50:32] [INFO ] Flatten gal took : 101 ms
[2024-05-21 09:50:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 8 ms.
[2024-05-21 09:50:32] [INFO ] Time to serialize gal into /tmp/LTLCardinality11908155846763249806.gal : 15 ms
[2024-05-21 09:50:32] [INFO ] Time to serialize properties into /tmp/LTLCardinality18444514012990523345.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality11908155846763249806.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality18444514012990523345.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 1 LTL properties
Checking formula 0 : !((F((G("((i25.u316.p983==0)||(i30.i0.i0.u364.p1100==1))"))&&(X("(i8.u64.p214==0)")))))
Formula 0 simplified : G(F!"((i25.u316.p983==0)||(i30.i0.i0.u364.p1100==1))" | X!"(i8.u64.p214==0)")
Compilation finished in 3871 ms.
Running link step : cd /tmp/ltsmin3388192024769464786;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin3388192024769464786;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(([]((LTLAPp0==true))&&X((LTLAPp1==true))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-21 10:11:47] [INFO ] Applying decomposition
[2024-05-21 10:11:47] [INFO ] Flatten gal took : 86 ms
[2024-05-21 10:11:47] [INFO ] Decomposing Gal with order
[2024-05-21 10:11:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 10:11:47] [INFO ] Removed a total of 26 redundant transitions.
[2024-05-21 10:11:47] [INFO ] Flatten gal took : 155 ms
[2024-05-21 10:11:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 206 labels/synchronizations in 531 ms.
[2024-05-21 10:11:48] [INFO ] Time to serialize gal into /tmp/LTLCardinality3598992671685312089.gal : 60 ms
[2024-05-21 10:11:48] [INFO ] Time to serialize properties into /tmp/LTLCardinality9386732594232027130.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality3598992671685312089.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality9386732594232027130.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F((G("((i1.i0.i0.i0.i0.i0.i0.i0.i0.i0.u139.p983==0)||(i1.i0.i0.u146.p1100==1))"))&&(X("(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i...277
Formula 0 simplified : G(F!"((i1.i0.i0.i0.i0.i0.i0.i0.i0.i0.u139.p983==0)||(i1.i0.i0.u146.p1100==1))" | X!"(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0...269
Detected timeout of ITS tools.
[2024-05-21 10:33:04] [INFO ] Flatten gal took : 274 ms
[2024-05-21 10:33:05] [INFO ] Input system was already deterministic with 858 transitions.
[2024-05-21 10:33:05] [INFO ] Transformed 884 places.
[2024-05-21 10:33:05] [INFO ] Transformed 858 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-21 10:33:05] [INFO ] Time to serialize gal into /tmp/LTLCardinality13744856280553664098.gal : 35 ms
[2024-05-21 10:33:05] [INFO ] Time to serialize properties into /tmp/LTLCardinality7218293261995526131.ltl : 5 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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality13744856280553664098.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality7218293261995526131.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...343
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F((G("((p983==0)||(p1100==1))"))&&(X("(p214==0)")))))
Formula 0 simplified : G(F!"((p983==0)||(p1100==1))" | X!"(p214==0)")
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 8512856 kB
After kill :
MemTotal: 16393216 kB
MemFree: 15750084 kB

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ 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-12b"
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-12b, 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-171620180100102"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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