Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r037-tajo-167813690600628.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.......................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is CANConstruction-PT-020, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r037-tajo-167813690600628
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 6.7K Feb 25 21:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 55K Feb 25 21:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.8K Feb 25 21:42 CTLFireability.txt
-rw-r--r-- 1 mcc users 80K Feb 25 21:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.6K Feb 25 15:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Feb 25 15:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 15:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 21:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 25 21:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Feb 25 21:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 25 21:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 15:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 15:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 641K Mar 5 18:22 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME CANConstruction-PT-020-LTLFireability-00
FORMULA_NAME CANConstruction-PT-020-LTLFireability-01
FORMULA_NAME CANConstruction-PT-020-LTLFireability-02
FORMULA_NAME CANConstruction-PT-020-LTLFireability-03
FORMULA_NAME CANConstruction-PT-020-LTLFireability-04
FORMULA_NAME CANConstruction-PT-020-LTLFireability-05
FORMULA_NAME CANConstruction-PT-020-LTLFireability-06
FORMULA_NAME CANConstruction-PT-020-LTLFireability-07
FORMULA_NAME CANConstruction-PT-020-LTLFireability-08
FORMULA_NAME CANConstruction-PT-020-LTLFireability-09
FORMULA_NAME CANConstruction-PT-020-LTLFireability-10
FORMULA_NAME CANConstruction-PT-020-LTLFireability-11
FORMULA_NAME CANConstruction-PT-020-LTLFireability-12
FORMULA_NAME CANConstruction-PT-020-LTLFireability-13
FORMULA_NAME CANConstruction-PT-020-LTLFireability-14
FORMULA_NAME CANConstruction-PT-020-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678366755931

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANConstruction-PT-020
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-09 12:59:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-09 12:59:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 12:59:18] [INFO ] Load time of PNML (sax parser for PT used): 124 ms
[2023-03-09 12:59:18] [INFO ] Transformed 1042 places.
[2023-03-09 12:59:18] [INFO ] Transformed 1760 transitions.
[2023-03-09 12:59:18] [INFO ] Parsed PT model containing 1042 places and 1760 transitions and 5200 arcs in 233 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA CANConstruction-PT-020-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-020-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 42 out of 1042 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1042/1042 places, 1760/1760 transitions.
Discarding 349 places :
Symmetric choice reduction at 0 with 349 rule applications. Total rules 349 place count 693 transition count 1062
Iterating global reduction 0 with 349 rules applied. Total rules applied 698 place count 693 transition count 1062
Applied a total of 698 rules in 196 ms. Remains 693 /1042 variables (removed 349) and now considering 1062/1760 (removed 698) transitions.
// Phase 1: matrix 1062 rows 693 cols
[2023-03-09 12:59:18] [INFO ] Computed 41 place invariants in 50 ms
[2023-03-09 12:59:19] [INFO ] Implicit Places using invariants in 836 ms returned [12, 26, 54, 68, 82, 96, 110, 124, 138, 152, 166, 180, 194, 208, 222, 236, 250, 264, 278]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 905 ms to find 19 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 674/1042 places, 1062/1760 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 656 transition count 1044
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 656 transition count 1044
Applied a total of 36 rules in 138 ms. Remains 656 /674 variables (removed 18) and now considering 1044/1062 (removed 18) transitions.
// Phase 1: matrix 1044 rows 656 cols
[2023-03-09 12:59:19] [INFO ] Computed 22 place invariants in 7 ms
[2023-03-09 12:59:20] [INFO ] Implicit Places using invariants in 540 ms returned []
[2023-03-09 12:59:20] [INFO ] Invariant cache hit.
[2023-03-09 12:59:20] [INFO ] State equation strengthened by 780 read => feed constraints.
[2023-03-09 12:59:22] [INFO ] Implicit Places using invariants and state equation in 1848 ms returned []
Implicit Place search using SMT with State Equation took 2416 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 656/1042 places, 1044/1760 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3656 ms. Remains : 656/1042 places, 1044/1760 transitions.
Support contains 42 out of 656 places after structural reductions.
[2023-03-09 12:59:22] [INFO ] Flatten gal took : 164 ms
[2023-03-09 12:59:22] [INFO ] Flatten gal took : 67 ms
[2023-03-09 12:59:22] [INFO ] Input system was already deterministic with 1044 transitions.
Incomplete random walk after 10000 steps, including 28 resets, run finished after 323 ms. (steps per millisecond=30 ) properties (out of 30) seen :29
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
Running SMT prover for 1 properties.
[2023-03-09 12:59:23] [INFO ] Invariant cache hit.
[2023-03-09 12:59:23] [INFO ] After 154ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
FORMULA CANConstruction-PT-020-LTLFireability-07 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA CANConstruction-PT-020-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 63 stabilizing places and 82 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)&&X(X((X(!p1) U ((p2&&X(!p1))||X(G(!p1)))))))))'
Support contains 4 out of 656 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 656/656 places, 1044/1044 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 646 transition count 1025
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 646 transition count 1025
Applied a total of 20 rules in 40 ms. Remains 646 /656 variables (removed 10) and now considering 1025/1044 (removed 19) transitions.
// Phase 1: matrix 1025 rows 646 cols
[2023-03-09 12:59:24] [INFO ] Computed 22 place invariants in 4 ms
[2023-03-09 12:59:24] [INFO ] Implicit Places using invariants in 299 ms returned []
[2023-03-09 12:59:24] [INFO ] Invariant cache hit.
[2023-03-09 12:59:24] [INFO ] State equation strengthened by 780 read => feed constraints.
[2023-03-09 12:59:28] [INFO ] Implicit Places using invariants and state equation in 3971 ms returned []
Implicit Place search using SMT with State Equation took 4292 ms to find 0 implicit places.
[2023-03-09 12:59:28] [INFO ] Invariant cache hit.
[2023-03-09 12:59:28] [INFO ] Dead Transitions using invariants and state equation in 603 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 646/656 places, 1025/1044 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4938 ms. Remains : 646/656 places, 1025/1044 transitions.
Stuttering acceptance computed with spot in 522 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), true, (NOT p0), p1, p1, p1]
Running random walk in product with property : CANConstruction-PT-020-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p2) p1), acceptance={0} source=5 dest: 5}, { cond=true, acceptance={} source=5 dest: 6}], [{ cond=p1, acceptance={} source=6 dest: 2}]], initial=0, aps=[p0:(GEQ s548 1), p2:(LT s477 1), p1:(AND (GEQ s36 1) (GEQ s38 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 3 ms.
FORMULA CANConstruction-PT-020-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-020-LTLFireability-01 finished in 5553 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 656 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 656/656 places, 1044/1044 transitions.
Drop transitions removed 134 transitions
Trivial Post-agglo rules discarded 134 transitions
Performed 134 trivial Post agglomeration. Transition count delta: 134
Iterating post reduction 0 with 134 rules applied. Total rules applied 134 place count 656 transition count 910
Reduce places removed 134 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 135 rules applied. Total rules applied 269 place count 522 transition count 909
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 270 place count 521 transition count 909
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 18 Pre rules applied. Total rules applied 270 place count 521 transition count 891
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 306 place count 503 transition count 891
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 317 place count 492 transition count 869
Iterating global reduction 3 with 11 rules applied. Total rules applied 328 place count 492 transition count 869
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 3 with 6 rules applied. Total rules applied 334 place count 492 transition count 863
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 340 place count 486 transition count 863
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 5 with 38 rules applied. Total rules applied 378 place count 467 transition count 844
Applied a total of 378 rules in 234 ms. Remains 467 /656 variables (removed 189) and now considering 844/1044 (removed 200) transitions.
// Phase 1: matrix 844 rows 467 cols
[2023-03-09 12:59:29] [INFO ] Computed 22 place invariants in 4 ms
[2023-03-09 12:59:30] [INFO ] Implicit Places using invariants in 357 ms returned [11]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 363 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 466/656 places, 844/1044 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 466 transition count 842
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 464 transition count 842
Applied a total of 4 rules in 53 ms. Remains 464 /466 variables (removed 2) and now considering 842/844 (removed 2) transitions.
// Phase 1: matrix 842 rows 464 cols
[2023-03-09 12:59:30] [INFO ] Computed 21 place invariants in 16 ms
[2023-03-09 12:59:30] [INFO ] Implicit Places using invariants in 358 ms returned []
[2023-03-09 12:59:30] [INFO ] Invariant cache hit.
[2023-03-09 12:59:30] [INFO ] State equation strengthened by 780 read => feed constraints.
[2023-03-09 12:59:32] [INFO ] Implicit Places using invariants and state equation in 1567 ms returned []
Implicit Place search using SMT with State Equation took 1941 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 464/656 places, 842/1044 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2591 ms. Remains : 464/656 places, 842/1044 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : CANConstruction-PT-020-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s29 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]]
Stuttering criterion allowed to conclude after 4786 steps with 110 reset in 60 ms.
FORMULA CANConstruction-PT-020-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-020-LTLFireability-03 finished in 2711 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(!p0)||(!p0&&F(G(!p1)))))))'
Support contains 4 out of 656 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 656/656 places, 1044/1044 transitions.
Drop transitions removed 131 transitions
Trivial Post-agglo rules discarded 131 transitions
Performed 131 trivial Post agglomeration. Transition count delta: 131
Iterating post reduction 0 with 131 rules applied. Total rules applied 131 place count 656 transition count 913
Reduce places removed 131 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 132 rules applied. Total rules applied 263 place count 525 transition count 912
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 264 place count 524 transition count 912
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 19 Pre rules applied. Total rules applied 264 place count 524 transition count 893
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 302 place count 505 transition count 893
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 314 place count 493 transition count 870
Iterating global reduction 3 with 12 rules applied. Total rules applied 326 place count 493 transition count 870
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 3 with 6 rules applied. Total rules applied 332 place count 493 transition count 864
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 338 place count 487 transition count 864
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 340 place count 486 transition count 863
Applied a total of 340 rules in 139 ms. Remains 486 /656 variables (removed 170) and now considering 863/1044 (removed 181) transitions.
// Phase 1: matrix 863 rows 486 cols
[2023-03-09 12:59:32] [INFO ] Computed 22 place invariants in 8 ms
[2023-03-09 12:59:32] [INFO ] Implicit Places using invariants in 286 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 289 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 485/656 places, 863/1044 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 485 transition count 862
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 484 transition count 862
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 3 place count 483 transition count 861
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 483 transition count 861
Applied a total of 4 rules in 73 ms. Remains 483 /485 variables (removed 2) and now considering 861/863 (removed 2) transitions.
// Phase 1: matrix 861 rows 483 cols
[2023-03-09 12:59:32] [INFO ] Computed 21 place invariants in 7 ms
[2023-03-09 12:59:33] [INFO ] Implicit Places using invariants in 892 ms returned []
[2023-03-09 12:59:33] [INFO ] Invariant cache hit.
[2023-03-09 12:59:33] [INFO ] State equation strengthened by 780 read => feed constraints.
[2023-03-09 12:59:35] [INFO ] Implicit Places using invariants and state equation in 1577 ms returned []
Implicit Place search using SMT with State Equation took 2473 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 483/656 places, 861/1044 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2975 ms. Remains : 483/656 places, 861/1044 transitions.
Stuttering acceptance computed with spot in 134 ms :[p0, (AND p1 p0), p0]
Running random walk in product with property : CANConstruction-PT-020-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={1} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={0, 1} source=1 dest: 1}], [{ cond=p0, acceptance={0, 1} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s0 1) (GEQ s43 1)), p0:(AND (GEQ s16 1) (GEQ s22 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 643 reset in 471 ms.
Product exploration explored 100000 steps with 649 reset in 448 ms.
Computed a total of 21 stabilizing places and 40 stable transitions
Computed a total of 21 stabilizing places and 40 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
Knowledge based reduction with 9 factoid took 885 ms. Reduced automaton from 3 states, 8 edges and 2 AP (stutter insensitive) to 3 states, 8 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 156 ms :[p0, (AND p1 p0), p0]
Finished random walk after 7108 steps, including 44 resets, run visited all 6 properties in 54 ms. (steps per millisecond=131 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (AND p0 (NOT p1))), (F (AND (NOT p0) p1)), (F (AND p0 p1)), (F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0)]
Knowledge based reduction with 9 factoid took 884 ms. Reduced automaton from 3 states, 8 edges and 2 AP (stutter insensitive) to 3 states, 8 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 162 ms :[p0, (AND p1 p0), p0]
Stuttering acceptance computed with spot in 94 ms :[p0, (AND p1 p0), p0]
Support contains 4 out of 483 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 483/483 places, 861/861 transitions.
Applied a total of 0 rules in 26 ms. Remains 483 /483 variables (removed 0) and now considering 861/861 (removed 0) transitions.
[2023-03-09 12:59:38] [INFO ] Invariant cache hit.
[2023-03-09 12:59:52] [INFO ] Implicit Places using invariants in 13576 ms returned []
[2023-03-09 12:59:52] [INFO ] Invariant cache hit.
[2023-03-09 12:59:52] [INFO ] State equation strengthened by 780 read => feed constraints.
[2023-03-09 12:59:54] [INFO ] Implicit Places using invariants and state equation in 1987 ms returned []
Implicit Place search using SMT with State Equation took 15579 ms to find 0 implicit places.
[2023-03-09 12:59:54] [INFO ] Redundant transitions in 56 ms returned []
[2023-03-09 12:59:54] [INFO ] Invariant cache hit.
[2023-03-09 12:59:54] [INFO ] Dead Transitions using invariants and state equation in 487 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 16189 ms. Remains : 483/483 places, 861/861 transitions.
Computed a total of 21 stabilizing places and 40 stable transitions
Computed a total of 21 stabilizing places and 40 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
Knowledge based reduction with 9 factoid took 824 ms. Reduced automaton from 3 states, 8 edges and 2 AP (stutter insensitive) to 3 states, 8 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 134 ms :[p0, (AND p1 p0), p0]
Finished random walk after 2329 steps, including 15 resets, run visited all 6 properties in 50 ms. (steps per millisecond=46 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F (AND (NOT p1) p0)), (F (AND p1 (NOT p0))), (F (AND p1 p0)), (F p1), (F (NOT (AND (NOT p1) (NOT p0)))), (F p0)]
Knowledge based reduction with 9 factoid took 792 ms. Reduced automaton from 3 states, 8 edges and 2 AP (stutter insensitive) to 3 states, 8 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 197 ms :[p0, (AND p1 p0), p0]
Stuttering acceptance computed with spot in 238 ms :[p0, (AND p1 p0), p0]
Stuttering acceptance computed with spot in 267 ms :[p0, (AND p1 p0), p0]
Product exploration explored 100000 steps with 640 reset in 503 ms.
Product exploration explored 100000 steps with 642 reset in 467 ms.
Built C files in :
/tmp/ltsmin6778187718511852234
[2023-03-09 12:59:58] [INFO ] Computing symmetric may disable matrix : 861 transitions.
[2023-03-09 12:59:58] [INFO ] Computation of Complete disable matrix. took 17 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 12:59:58] [INFO ] Computing symmetric may enable matrix : 861 transitions.
[2023-03-09 12:59:58] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 12:59:58] [INFO ] Computing Do-Not-Accords matrix : 861 transitions.
[2023-03-09 12:59:58] [INFO ] Computation of Completed DNA matrix. took 42 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 12:59:58] [INFO ] Built C files in 330ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6778187718511852234
Running compilation step : cd /tmp/ltsmin6778187718511852234;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2378 ms.
Running link step : cd /tmp/ltsmin6778187718511852234;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 137 ms.
Running LTSmin : cd /tmp/ltsmin6778187718511852234;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased8142218387719171539.hoa' '--buchi-type=spotba'
LTSmin run took 11088 ms.
FORMULA CANConstruction-PT-020-LTLFireability-05 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CANConstruction-PT-020-LTLFireability-05 finished in 40105 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)&&(G(p0)||F(p1))))'
Support contains 4 out of 656 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 656/656 places, 1044/1044 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 646 transition count 1024
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 646 transition count 1024
Applied a total of 20 rules in 46 ms. Remains 646 /656 variables (removed 10) and now considering 1024/1044 (removed 20) transitions.
// Phase 1: matrix 1024 rows 646 cols
[2023-03-09 13:00:12] [INFO ] Computed 22 place invariants in 6 ms
[2023-03-09 13:00:15] [INFO ] Implicit Places using invariants in 2697 ms returned [36]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 2701 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 645/656 places, 1024/1044 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 644 transition count 1023
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 644 transition count 1023
Applied a total of 2 rules in 30 ms. Remains 644 /645 variables (removed 1) and now considering 1023/1024 (removed 1) transitions.
// Phase 1: matrix 1023 rows 644 cols
[2023-03-09 13:00:15] [INFO ] Computed 21 place invariants in 14 ms
[2023-03-09 13:00:15] [INFO ] Implicit Places using invariants in 317 ms returned []
[2023-03-09 13:00:15] [INFO ] Invariant cache hit.
[2023-03-09 13:00:15] [INFO ] State equation strengthened by 780 read => feed constraints.
[2023-03-09 13:00:17] [INFO ] Implicit Places using invariants and state equation in 1883 ms returned []
Implicit Place search using SMT with State Equation took 2230 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 644/656 places, 1023/1044 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 5011 ms. Remains : 644/656 places, 1023/1044 transitions.
Stuttering acceptance computed with spot in 263 ms :[(NOT p0), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p0)), true]
Running random walk in product with property : CANConstruction-PT-020-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(LT s197 1), p1:(OR (LT s248 1) (AND (GEQ s30 1) (GEQ s216 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 736 ms.
Product exploration explored 100000 steps with 50000 reset in 847 ms.
Computed a total of 62 stabilizing places and 81 stable transitions
Computed a total of 62 stabilizing places and 81 stable transitions
Detected a total of 62/644 stabilizing places and 81/1023 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 p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 10 factoid took 160 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CANConstruction-PT-020-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANConstruction-PT-020-LTLFireability-06 finished in 7078 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0)) U p1)))'
Support contains 3 out of 656 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 656/656 places, 1044/1044 transitions.
Drop transitions removed 135 transitions
Trivial Post-agglo rules discarded 135 transitions
Performed 135 trivial Post agglomeration. Transition count delta: 135
Iterating post reduction 0 with 135 rules applied. Total rules applied 135 place count 656 transition count 909
Reduce places removed 135 places and 0 transitions.
Iterating post reduction 1 with 135 rules applied. Total rules applied 270 place count 521 transition count 909
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 270 place count 521 transition count 890
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 308 place count 502 transition count 890
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 318 place count 492 transition count 870
Iterating global reduction 2 with 10 rules applied. Total rules applied 328 place count 492 transition count 870
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 2 with 5 rules applied. Total rules applied 333 place count 492 transition count 865
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 338 place count 487 transition count 865
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 4 with 40 rules applied. Total rules applied 378 place count 467 transition count 845
Applied a total of 378 rules in 66 ms. Remains 467 /656 variables (removed 189) and now considering 845/1044 (removed 199) transitions.
// Phase 1: matrix 845 rows 467 cols
[2023-03-09 13:00:19] [INFO ] Computed 22 place invariants in 7 ms
[2023-03-09 13:00:19] [INFO ] Implicit Places using invariants in 268 ms returned [12]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 276 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 466/656 places, 845/1044 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 466 transition count 844
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 465 transition count 844
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 3 place count 464 transition count 843
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 464 transition count 843
Applied a total of 4 rules in 37 ms. Remains 464 /466 variables (removed 2) and now considering 843/845 (removed 2) transitions.
// Phase 1: matrix 843 rows 464 cols
[2023-03-09 13:00:19] [INFO ] Computed 21 place invariants in 5 ms
[2023-03-09 13:00:20] [INFO ] Implicit Places using invariants in 311 ms returned []
[2023-03-09 13:00:20] [INFO ] Invariant cache hit.
[2023-03-09 13:00:20] [INFO ] State equation strengthened by 780 read => feed constraints.
[2023-03-09 13:00:21] [INFO ] Implicit Places using invariants and state equation in 1431 ms returned []
Implicit Place search using SMT with State Equation took 1745 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 464/656 places, 843/1044 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2125 ms. Remains : 464/656 places, 843/1044 transitions.
Stuttering acceptance computed with spot in 199 ms :[(NOT p1), (NOT p0), (NOT p1)]
Running random walk in product with property : CANConstruction-PT-020-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s10 1) (GEQ s351 1)), p0:(LT s361 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 737 reset in 503 ms.
Stack based approach found an accepted trace after 40149 steps with 302 reset with depth 107 and stack size 107 in 183 ms.
FORMULA CANConstruction-PT-020-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property CANConstruction-PT-020-LTLFireability-08 finished in 3033 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((!p0&&X(p0)))))'
Support contains 2 out of 656 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 656/656 places, 1044/1044 transitions.
Drop transitions removed 135 transitions
Trivial Post-agglo rules discarded 135 transitions
Performed 135 trivial Post agglomeration. Transition count delta: 135
Iterating post reduction 0 with 135 rules applied. Total rules applied 135 place count 656 transition count 909
Reduce places removed 135 places and 0 transitions.
Iterating post reduction 1 with 135 rules applied. Total rules applied 270 place count 521 transition count 909
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 270 place count 521 transition count 890
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 308 place count 502 transition count 890
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 319 place count 491 transition count 868
Iterating global reduction 2 with 11 rules applied. Total rules applied 330 place count 491 transition count 868
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 2 with 6 rules applied. Total rules applied 336 place count 491 transition count 862
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 342 place count 485 transition count 862
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 36 rules applied. Total rules applied 378 place count 467 transition count 844
Applied a total of 378 rules in 62 ms. Remains 467 /656 variables (removed 189) and now considering 844/1044 (removed 200) transitions.
// Phase 1: matrix 844 rows 467 cols
[2023-03-09 13:00:22] [INFO ] Computed 22 place invariants in 7 ms
[2023-03-09 13:00:22] [INFO ] Implicit Places using invariants in 280 ms returned [11]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 282 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 466/656 places, 844/1044 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 466 transition count 842
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 464 transition count 842
Applied a total of 4 rules in 22 ms. Remains 464 /466 variables (removed 2) and now considering 842/844 (removed 2) transitions.
// Phase 1: matrix 842 rows 464 cols
[2023-03-09 13:00:22] [INFO ] Computed 21 place invariants in 4 ms
[2023-03-09 13:00:23] [INFO ] Implicit Places using invariants in 263 ms returned []
[2023-03-09 13:00:23] [INFO ] Invariant cache hit.
[2023-03-09 13:00:23] [INFO ] State equation strengthened by 780 read => feed constraints.
[2023-03-09 13:00:24] [INFO ] Implicit Places using invariants and state equation in 1514 ms returned []
Implicit Place search using SMT with State Equation took 1781 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 464/656 places, 842/1044 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2149 ms. Remains : 464/656 places, 842/1044 transitions.
Stuttering acceptance computed with spot in 333 ms :[true, true, (NOT p0)]
Running random walk in product with property : CANConstruction-PT-020-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s40 1) (GEQ s63 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 139 steps with 0 reset in 2 ms.
FORMULA CANConstruction-PT-020-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-020-LTLFireability-09 finished in 2513 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 3 out of 656 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 656/656 places, 1044/1044 transitions.
Drop transitions removed 134 transitions
Trivial Post-agglo rules discarded 134 transitions
Performed 134 trivial Post agglomeration. Transition count delta: 134
Iterating post reduction 0 with 134 rules applied. Total rules applied 134 place count 656 transition count 910
Reduce places removed 134 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 135 rules applied. Total rules applied 269 place count 522 transition count 909
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 270 place count 521 transition count 909
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 18 Pre rules applied. Total rules applied 270 place count 521 transition count 891
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 306 place count 503 transition count 891
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 317 place count 492 transition count 869
Iterating global reduction 3 with 11 rules applied. Total rules applied 328 place count 492 transition count 869
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 3 with 6 rules applied. Total rules applied 334 place count 492 transition count 863
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 340 place count 486 transition count 863
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 5 with 36 rules applied. Total rules applied 376 place count 468 transition count 845
Applied a total of 376 rules in 117 ms. Remains 468 /656 variables (removed 188) and now considering 845/1044 (removed 199) transitions.
// Phase 1: matrix 845 rows 468 cols
[2023-03-09 13:00:25] [INFO ] Computed 22 place invariants in 7 ms
[2023-03-09 13:00:25] [INFO ] Implicit Places using invariants in 520 ms returned [12]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 524 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 467/656 places, 845/1044 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 467 transition count 843
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 465 transition count 843
Applied a total of 4 rules in 29 ms. Remains 465 /467 variables (removed 2) and now considering 843/845 (removed 2) transitions.
// Phase 1: matrix 843 rows 465 cols
[2023-03-09 13:00:25] [INFO ] Computed 21 place invariants in 8 ms
[2023-03-09 13:00:26] [INFO ] Implicit Places using invariants in 436 ms returned []
[2023-03-09 13:00:26] [INFO ] Invariant cache hit.
[2023-03-09 13:00:26] [INFO ] State equation strengthened by 780 read => feed constraints.
[2023-03-09 13:00:28] [INFO ] Implicit Places using invariants and state equation in 2220 ms returned []
Implicit Place search using SMT with State Equation took 2678 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 465/656 places, 843/1044 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3348 ms. Remains : 465/656 places, 843/1044 transitions.
Stuttering acceptance computed with spot in 300 ms :[(NOT p0)]
Running random walk in product with property : CANConstruction-PT-020-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (LT s15 1) (OR (LT s4 1) (LT s103 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 714 reset in 612 ms.
Stack based approach found an accepted trace after 263 steps with 1 reset with depth 120 and stack size 120 in 2 ms.
FORMULA CANConstruction-PT-020-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property CANConstruction-PT-020-LTLFireability-10 finished in 4290 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))&&(G(!p1)||(!p1&&F(p2)))))'
Support contains 4 out of 656 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 656/656 places, 1044/1044 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 645 transition count 1023
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 645 transition count 1023
Applied a total of 22 rules in 26 ms. Remains 645 /656 variables (removed 11) and now considering 1023/1044 (removed 21) transitions.
// Phase 1: matrix 1023 rows 645 cols
[2023-03-09 13:00:29] [INFO ] Computed 22 place invariants in 8 ms
[2023-03-09 13:00:29] [INFO ] Implicit Places using invariants in 446 ms returned [36]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 454 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 644/656 places, 1023/1044 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 643 transition count 1022
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 643 transition count 1022
Applied a total of 2 rules in 18 ms. Remains 643 /644 variables (removed 1) and now considering 1022/1023 (removed 1) transitions.
// Phase 1: matrix 1022 rows 643 cols
[2023-03-09 13:00:29] [INFO ] Computed 21 place invariants in 3 ms
[2023-03-09 13:00:30] [INFO ] Implicit Places using invariants in 336 ms returned []
[2023-03-09 13:00:30] [INFO ] Invariant cache hit.
[2023-03-09 13:00:30] [INFO ] State equation strengthened by 780 read => feed constraints.
[2023-03-09 13:00:32] [INFO ] Implicit Places using invariants and state equation in 1971 ms returned []
Implicit Place search using SMT with State Equation took 2336 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 643/656 places, 1022/1044 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2836 ms. Remains : 643/656 places, 1022/1044 transitions.
Stuttering acceptance computed with spot in 253 ms :[true, (OR (NOT p0) (NOT p2)), (OR (NOT p0) p1), (NOT p0), (OR (NOT p0) (AND p1 (NOT p2)))]
Running random walk in product with property : CANConstruction-PT-020-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p2) p0), acceptance={0} source=1 dest: 1}, { cond=(AND p2 p0), acceptance={0} source=1 dest: 3}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=(AND p1 (NOT p2) p0), acceptance={} source=4 dest: 1}, { cond=(AND p2 p0), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=4 dest: 4}]], initial=2, aps=[p0:(OR (LT s30 1) (LT s379 1)), p2:(GEQ s294 1), p1:(OR (GEQ s294 1) (GEQ s100 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2979 steps with 8 reset in 11 ms.
FORMULA CANConstruction-PT-020-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-020-LTLFireability-11 finished in 3139 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||X(X(G((p1 U X(p2)))))))))'
Support contains 5 out of 656 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 656/656 places, 1044/1044 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 645 transition count 1023
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 645 transition count 1023
Applied a total of 22 rules in 26 ms. Remains 645 /656 variables (removed 11) and now considering 1023/1044 (removed 21) transitions.
// Phase 1: matrix 1023 rows 645 cols
[2023-03-09 13:00:32] [INFO ] Computed 22 place invariants in 7 ms
[2023-03-09 13:00:32] [INFO ] Implicit Places using invariants in 351 ms returned [36]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 353 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 644/656 places, 1023/1044 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 643 transition count 1022
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 643 transition count 1022
Applied a total of 2 rules in 24 ms. Remains 643 /644 variables (removed 1) and now considering 1022/1023 (removed 1) transitions.
// Phase 1: matrix 1022 rows 643 cols
[2023-03-09 13:00:32] [INFO ] Computed 21 place invariants in 5 ms
[2023-03-09 13:00:33] [INFO ] Implicit Places using invariants in 405 ms returned []
[2023-03-09 13:00:33] [INFO ] Invariant cache hit.
[2023-03-09 13:00:33] [INFO ] State equation strengthened by 780 read => feed constraints.
[2023-03-09 13:00:34] [INFO ] Implicit Places using invariants and state equation in 1674 ms returned []
Implicit Place search using SMT with State Equation took 2083 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 643/656 places, 1022/1044 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2487 ms. Remains : 643/656 places, 1022/1044 transitions.
Stuttering acceptance computed with spot in 396 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2), (NOT p2), (NOT p2), true]
Running random walk in product with property : CANConstruction-PT-020-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={} source=3 dest: 4}, { cond=p1, acceptance={} source=3 dest: 5}], [{ cond=(NOT p2), acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=5 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={0} source=5 dest: 5}], [{ cond=true, acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(AND (GEQ s102 1) (GEQ s191 1)), p1:(AND (GEQ s119 1) (GEQ s150 1)), p2:(GEQ s414 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA CANConstruction-PT-020-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-020-LTLFireability-12 finished in 2923 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X(p0))))'
Support contains 1 out of 656 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 656/656 places, 1044/1044 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 645 transition count 1023
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 645 transition count 1023
Applied a total of 22 rules in 32 ms. Remains 645 /656 variables (removed 11) and now considering 1023/1044 (removed 21) transitions.
// Phase 1: matrix 1023 rows 645 cols
[2023-03-09 13:00:35] [INFO ] Computed 22 place invariants in 8 ms
[2023-03-09 13:00:35] [INFO ] Implicit Places using invariants in 341 ms returned [36]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 343 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 644/656 places, 1023/1044 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 643 transition count 1022
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 643 transition count 1022
Applied a total of 2 rules in 26 ms. Remains 643 /644 variables (removed 1) and now considering 1022/1023 (removed 1) transitions.
// Phase 1: matrix 1022 rows 643 cols
[2023-03-09 13:00:35] [INFO ] Computed 21 place invariants in 7 ms
[2023-03-09 13:00:35] [INFO ] Implicit Places using invariants in 328 ms returned []
[2023-03-09 13:00:35] [INFO ] Invariant cache hit.
[2023-03-09 13:00:36] [INFO ] State equation strengthened by 780 read => feed constraints.
[2023-03-09 13:00:37] [INFO ] Implicit Places using invariants and state equation in 1862 ms returned []
Implicit Place search using SMT with State Equation took 2211 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 643/656 places, 1022/1044 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2615 ms. Remains : 643/656 places, 1022/1044 transitions.
Stuttering acceptance computed with spot in 150 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-020-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 1}]], initial=1, aps=[p0:(GEQ s543 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA CANConstruction-PT-020-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-020-LTLFireability-13 finished in 2795 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U ((p1||(p2 U X(p3))) U X(p4))))'
Support contains 6 out of 656 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 656/656 places, 1044/1044 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 646 transition count 1025
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 646 transition count 1025
Applied a total of 20 rules in 29 ms. Remains 646 /656 variables (removed 10) and now considering 1025/1044 (removed 19) transitions.
// Phase 1: matrix 1025 rows 646 cols
[2023-03-09 13:00:38] [INFO ] Computed 22 place invariants in 10 ms
[2023-03-09 13:00:38] [INFO ] Implicit Places using invariants in 352 ms returned [36]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 367 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 645/656 places, 1025/1044 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 644 transition count 1024
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 644 transition count 1024
Applied a total of 2 rules in 53 ms. Remains 644 /645 variables (removed 1) and now considering 1024/1025 (removed 1) transitions.
// Phase 1: matrix 1024 rows 644 cols
[2023-03-09 13:00:38] [INFO ] Computed 21 place invariants in 8 ms
[2023-03-09 13:00:38] [INFO ] Implicit Places using invariants in 419 ms returned []
[2023-03-09 13:00:38] [INFO ] Invariant cache hit.
[2023-03-09 13:00:39] [INFO ] State equation strengthened by 780 read => feed constraints.
[2023-03-09 13:00:40] [INFO ] Implicit Places using invariants and state equation in 1812 ms returned []
Implicit Place search using SMT with State Equation took 2233 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 644/656 places, 1024/1044 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2683 ms. Remains : 644/656 places, 1024/1044 transitions.
Stuttering acceptance computed with spot in 551 ms :[(NOT p4), (AND (NOT p3) (NOT p4)), (NOT p4), (NOT p4), (AND (NOT p3) (NOT p4)), true, (NOT p3), (NOT p3)]
Running random walk in product with property : CANConstruction-PT-020-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p3) (NOT p4)), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p4)), acceptance={} source=2 dest: 1}, { cond=(NOT p4), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p2 (NOT p4)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0) (NOT p4)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p4)), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p4)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) p2 (NOT p0) (NOT p4)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p2) (NOT p3) (NOT p4)), acceptance={} source=4 dest: 6}, { cond=(AND p2 (NOT p3) (NOT p4)), acceptance={} source=4 dest: 7}], [{ cond=true, acceptance={} source=5 dest: 5}], [{ cond=(NOT p3), acceptance={} source=6 dest: 5}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=7 dest: 6}, { cond=(AND p2 (NOT p3)), acceptance={} source=7 dest: 7}]], initial=0, aps=[p1:(AND (GEQ s162 1) (GEQ s350 1)), p2:(AND (GEQ s71 1) (GEQ s126 1)), p0:(OR (GEQ s381 1) (AND (GEQ s71 1) (GEQ s126 1))), p3:(GEQ s381 1), p4:(GEQ s372 ...], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA CANConstruction-PT-020-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-020-LTLFireability-14 finished in 3281 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||G(p1))))'
Support contains 3 out of 656 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 656/656 places, 1044/1044 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 645 transition count 1023
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 645 transition count 1023
Applied a total of 22 rules in 42 ms. Remains 645 /656 variables (removed 11) and now considering 1023/1044 (removed 21) transitions.
// Phase 1: matrix 1023 rows 645 cols
[2023-03-09 13:00:41] [INFO ] Computed 22 place invariants in 7 ms
[2023-03-09 13:00:41] [INFO ] Implicit Places using invariants in 347 ms returned [36]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 361 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 644/656 places, 1023/1044 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 643 transition count 1022
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 643 transition count 1022
Applied a total of 2 rules in 26 ms. Remains 643 /644 variables (removed 1) and now considering 1022/1023 (removed 1) transitions.
// Phase 1: matrix 1022 rows 643 cols
[2023-03-09 13:00:41] [INFO ] Computed 21 place invariants in 10 ms
[2023-03-09 13:00:42] [INFO ] Implicit Places using invariants in 395 ms returned []
[2023-03-09 13:00:42] [INFO ] Invariant cache hit.
[2023-03-09 13:00:42] [INFO ] State equation strengthened by 780 read => feed constraints.
[2023-03-09 13:00:44] [INFO ] Implicit Places using invariants and state equation in 1899 ms returned []
Implicit Place search using SMT with State Equation took 2308 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 643/656 places, 1022/1044 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2738 ms. Remains : 643/656 places, 1022/1044 transitions.
Stuttering acceptance computed with spot in 117 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CANConstruction-PT-020-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (GEQ s271 1) (AND (GEQ s78 1) (GEQ s286 1))), p1:(GEQ s271 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 319 steps with 0 reset in 3 ms.
FORMULA CANConstruction-PT-020-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-020-LTLFireability-15 finished in 2937 ms.
All properties solved by simple procedures.
Total runtime 86308 ms.

BK_STOP 1678366844783

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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